diff --git "a/languages/lua/validation.jsonl" "b/languages/lua/validation.jsonl" new file mode 100644--- /dev/null +++ "b/languages/lua/validation.jsonl" @@ -0,0 +1,1000 @@ +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s961668930", "group_id": "codeNet:p02536", "input_text": "local n, m = io.read(\"*n\", \"*n\")\nlocal parent = {}\nfor i = 1, n do\n parent[i] = i\nend\n\nlocal function uf_findroot(idx)\n local idx_update = idx\n while parent[idx] ~= idx do\n idx = parent[idx]\n end\n while parent[idx_update] ~= idx do\n parent[idx_update], idx_update = idx, parent[idx_update]\n end\n return idx\nend\n\nfor i = 1, m do\n local a, b = io.read(\"*n\", \"*n\")\n local ra, rb = uf_findroot(a), uf_findroot(b)\n parent[rb], parent[b] = ra, ra\nend\nlocal g = {}\nfor i = 1, n do\n local r = uf_findroot(i)\n g[r] = true\nend\nlocal ret = -1\nfor k, v in pairs(g) do ret = ret + 1 end\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1601168674, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02536.html", "problem_id": "p02536", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02536/input.txt", "sample_output_relpath": "derived/input_output/data/p02536/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02536/Lua/s961668930.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s961668930", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local n, m = io.read(\"*n\", \"*n\")\nlocal parent = {}\nfor i = 1, n do\n parent[i] = i\nend\n\nlocal function uf_findroot(idx)\n local idx_update = idx\n while parent[idx] ~= idx do\n idx = parent[idx]\n end\n while parent[idx_update] ~= idx do\n parent[idx_update], idx_update = idx, parent[idx_update]\n end\n return idx\nend\n\nfor i = 1, m do\n local a, b = io.read(\"*n\", \"*n\")\n local ra, rb = uf_findroot(a), uf_findroot(b)\n parent[rb], parent[b] = ra, ra\nend\nlocal g = {}\nfor i = 1, n do\n local r = uf_findroot(i)\n g[r] = true\nend\nlocal ret = -1\nfor k, v in pairs(g) do ret = ret + 1 end\nprint(ret)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities numbered 1 through N, and M bidirectional roads numbered 1 through M.\nRoad i connects City A_i and City B_i.\n\nSnuke can perform the following operation zero or more times:\n\nChoose two distinct cities that are not directly connected by a road, and build a new road between the two cities.\n\nAfter he finishes the operations, it must be possible to travel from any city to any other cities by following roads (possibly multiple times).\n\nWhat is the minimum number of roads he must build to achieve the goal?\n\nConstraints\n\n2 \\leq N \\leq 100,000\n\n1 \\leq M \\leq 100,000\n\n1 \\leq A_i < B_i \\leq N\n\nNo two roads connect the same pair of cities.\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 B_1\n:\nA_M B_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 1\n1 2\n\nSample Output 1\n\n1\n\nInitially, there are three cities, and there is a road between City 1 and City 2.\n\nSnuke can achieve the goal by building one new road, for example, between City 1 and City 3.\nAfter that,\n\nWe can travel between 1 and 2 directly.\n\nWe can travel between 1 and 3 directly.\n\nWe can travel between 2 and 3 by following both roads (2 - 1 - 3).", "sample_input": "3 1\n1 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02536", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities numbered 1 through N, and M bidirectional roads numbered 1 through M.\nRoad i connects City A_i and City B_i.\n\nSnuke can perform the following operation zero or more times:\n\nChoose two distinct cities that are not directly connected by a road, and build a new road between the two cities.\n\nAfter he finishes the operations, it must be possible to travel from any city to any other cities by following roads (possibly multiple times).\n\nWhat is the minimum number of roads he must build to achieve the goal?\n\nConstraints\n\n2 \\leq N \\leq 100,000\n\n1 \\leq M \\leq 100,000\n\n1 \\leq A_i < B_i \\leq N\n\nNo two roads connect the same pair of cities.\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 B_1\n:\nA_M B_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 1\n1 2\n\nSample Output 1\n\n1\n\nInitially, there are three cities, and there is a road between City 1 and City 2.\n\nSnuke can achieve the goal by building one new road, for example, between City 1 and City 3.\nAfter that,\n\nWe can travel between 1 and 2 directly.\n\nWe can travel between 1 and 3 directly.\n\nWe can travel between 2 and 3 by following both roads (2 - 1 - 3).", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 603, "cpu_time_ms": 57, "memory_kb": 4428}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s402923866", "group_id": "codeNet:p02546", "input_text": "-- Vicfred\n-- https://atcoder.jp/contests/abc179/tasks/abc179_a\n-- string manipulation\n\ns = io.read()\nif s:sub(#s, #s) == \"s\" then\n print(s .. \"es\")\nelse\n print(s .. \"s\")\nend\n\n", "language": "Lua", "metadata": {"date": 1600676560, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s402923866.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s402923866", "user_id": "u737840172"}, "prompt_components": {"gold_output": "apples\n", "input_to_evaluate": "-- Vicfred\n-- https://atcoder.jp/contests/abc179/tasks/abc179_a\n-- string manipulation\n\ns = io.read()\nif s:sub(#s, #s) == \"s\" then\n print(s .. \"es\")\nelse\n print(s .. \"s\")\nend\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters.\n\nIn Taknese, the plural form of a noun is spelled based on the following rules:\n\nIf a noun's singular form does not end with s, append s to the end of the singular form.\n\nIf a noun's singular form ends with s, append es to the end of the singular form.\n\nYou are given the singular form S of a Taknese noun. Output its plural form.\n\nConstraints\n\nS is a string of length 1 between 1000, inclusive.\n\nS contains only lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the plural form of the given Taknese word.\n\nSample Input 1\n\napple\n\nSample Output 1\n\napples\n\napple ends with e, so its plural form is apples.\n\nSample Input 2\n\nbus\n\nSample Output 2\n\nbuses\n\nbus ends with s, so its plural form is buses.\n\nSample Input 3\n\nbox\n\nSample Output 3\n\nboxs", "sample_input": "apple\n"}, "reference_outputs": ["apples\n"], "source_document_id": "p02546", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters.\n\nIn Taknese, the plural form of a noun is spelled based on the following rules:\n\nIf a noun's singular form does not end with s, append s to the end of the singular form.\n\nIf a noun's singular form ends with s, append es to the end of the singular form.\n\nYou are given the singular form S of a Taknese noun. Output its plural form.\n\nConstraints\n\nS is a string of length 1 between 1000, inclusive.\n\nS contains only lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the plural form of the given Taknese word.\n\nSample Input 1\n\napple\n\nSample Output 1\n\napples\n\napple ends with e, so its plural form is apples.\n\nSample Input 2\n\nbus\n\nSample Output 2\n\nbuses\n\nbus ends with s, so its plural form is buses.\n\nSample Input 3\n\nbox\n\nSample Output 3\n\nboxs", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 2592}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s634228311", "group_id": "codeNet:p02546", "input_text": "a = io.read()\nif a:sub(#a, #a) == \"s\" then\n print(a .. \"es\")\nelse\n print(a .. \"s\")\nend", "language": "Lua", "metadata": {"date": 1600542049, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s634228311.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s634228311", "user_id": "u120582723"}, "prompt_components": {"gold_output": "apples\n", "input_to_evaluate": "a = io.read()\nif a:sub(#a, #a) == \"s\" then\n print(a .. \"es\")\nelse\n print(a .. \"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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 2596}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s686349106", "group_id": "codeNet:p02548", "input_text": "-- Vicfred\n-- https://atcoder.jp/contests/abc179/tasks/abc179_c\n-- math, combinatorics\nn = io.read(\"*n\")\n\nans = 0\n\nfor a = 1, n-1 do\n ans = ans + (n - 1) // a\nend\n\nprint(ans)\n\n", "language": "Lua", "metadata": {"date": 1600681639, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02548.html", "problem_id": "p02548", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02548/input.txt", "sample_output_relpath": "derived/input_output/data/p02548/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02548/Lua/s686349106.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s686349106", "user_id": "u737840172"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "-- Vicfred\n-- https://atcoder.jp/contests/abc179/tasks/abc179_c\n-- math, combinatorics\nn = io.read(\"*n\")\n\nans = 0\n\nfor a = 1, n-1 do\n ans = ans + (n - 1) // a\nend\n\nprint(ans)\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a positive integer N.\nHow many tuples (A,B,C) of positive integers satisfy A \\times B + C = N?\n\nConstraints\n\n2 \\leq N \\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\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n3\n\nThere are 3 tuples of integers that satisfy A \\times B + C = 3: (A, B, C) = (1, 1, 2), (1, 2, 1), (2, 1, 1).\n\nSample Input 2\n\n100\n\nSample Output 2\n\n473\n\nSample Input 3\n\n1000000\n\nSample Output 3\n\n13969985", "sample_input": "3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02548", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a positive integer N.\nHow many tuples (A,B,C) of positive integers satisfy A \\times B + C = N?\n\nConstraints\n\n2 \\leq N \\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\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n3\n\nThere are 3 tuples of integers that satisfy A \\times B + C = 3: (A, B, C) = (1, 1, 2), (1, 2, 1), (2, 1, 1).\n\nSample Input 2\n\n100\n\nSample Output 2\n\n473\n\nSample Input 3\n\n1000000\n\nSample Output 3\n\n13969985", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 59, "memory_kb": 2764}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s180071793", "group_id": "codeNet:p02553", "input_text": "-- Vicfred\n-- https://atcoder.jp/contests/abc178/tasks/abc178_b\n-- math\n\na, b, c, d = io.read(\"*n\", \"*n\", \"*n\", \"*n\")\n\nmaxima = c*b\nmaxima = math.max(maxima, d*b)\nmaxima = math.max(maxima, c*a)\nmaxima = math.max(maxima, a*d)\n\nprint(maxima)\n\n", "language": "Lua", "metadata": {"date": 1600072519, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s180071793.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s180071793", "user_id": "u737840172"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "-- Vicfred\n-- https://atcoder.jp/contests/abc178/tasks/abc178_b\n-- math\n\na, b, c, d = io.read(\"*n\", \"*n\", \"*n\", \"*n\")\n\nmaxima = c*b\nmaxima = math.max(maxima, d*b)\nmaxima = math.max(maxima, c*a)\nmaxima = math.max(maxima, a*d)\n\nprint(maxima)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 241, "cpu_time_ms": 4, "memory_kb": 2756}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s999857327", "group_id": "codeNet:p02559", "input_text": "local band = bit.band\nlocal FenwickTree = {}\nFenwickTree.create = function(self, n)\n self.n = n\n self.v = {}\n for i = 1, n do self.v[i] = 0LL end\nend\nFenwickTree.add = function(self, pos, val)\n while pos <= self.n do\n self.v[pos] = self.v[pos] + val\n pos = pos + band(pos, -pos)\n end\nend\nFenwickTree.sum = function(self, r)\n local ret = 0\n while 0 < r do\n ret = ret + self.v[r]\n r = r - band(r, -r)\n end\n return ret\nend\nFenwickTree.new = function(n)\n local obj = {}\n setmetatable(obj, {__index = FenwickTree})\n obj:create(n)\n return obj\nend\n\nlocal n, q = io.read(\"*n\", \"*n\")\nlocal fw = FenwickTree.new(n)\nfor i = 1, n do\n local a = io.read(\"*n\")\n fw:add(i, a)\nend\nfor iq = 1, q do\n local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n if a == 0 then\n fw:add(b + 1, c)\n else\n local ans = fw:sum(c)\n if 0 < b then ans = ans - fw:sum(b) end\n ans = tostring(ans):gsub(\"LL\", \"\")\n print(ans)\n end\nend\n", "language": "Lua", "metadata": {"date": 1599682950, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02559.html", "problem_id": "p02559", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02559/input.txt", "sample_output_relpath": "derived/input_output/data/p02559/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02559/Lua/s999857327.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s999857327", "user_id": "u120582723"}, "prompt_components": {"gold_output": "15\n7\n25\n6\n", "input_to_evaluate": "local band = bit.band\nlocal FenwickTree = {}\nFenwickTree.create = function(self, n)\n self.n = n\n self.v = {}\n for i = 1, n do self.v[i] = 0LL end\nend\nFenwickTree.add = function(self, pos, val)\n while pos <= self.n do\n self.v[pos] = self.v[pos] + val\n pos = pos + band(pos, -pos)\n end\nend\nFenwickTree.sum = function(self, r)\n local ret = 0\n while 0 < r do\n ret = ret + self.v[r]\n r = r - band(r, -r)\n end\n return ret\nend\nFenwickTree.new = function(n)\n local obj = {}\n setmetatable(obj, {__index = FenwickTree})\n obj:create(n)\n return obj\nend\n\nlocal n, q = io.read(\"*n\", \"*n\")\nlocal fw = FenwickTree.new(n)\nfor i = 1, n do\n local a = io.read(\"*n\")\n fw:add(i, a)\nend\nfor iq = 1, q do\n local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n if a == 0 then\n fw:add(b + 1, c)\n else\n local ans = fw:sum(c)\n if 0 < b then ans = ans - fw:sum(b) end\n ans = tostring(ans):gsub(\"LL\", \"\")\n print(ans)\n end\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given an array a_0, a_1, ..., a_{N-1} of length N. Process Q queries of the following types.\n\n0 p x: a_p \\gets a_p + x\n\n1 l r: Print \\sum_{i = l}^{r - 1}{a_i}.\n\nConstraints\n\n1 \\leq N, Q \\leq 500,000\n\n0 \\leq a_i, x \\leq 10^9\n\n0 \\leq p < N\n\n0 \\leq l_i < r_i \\leq N\n\nAll values in Input are integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_0 a_1 ... a_{N - 1}\n\\textrm{Query}_0\n\\textrm{Query}_1\n:\n\\textrm{Query}_{Q - 1}\n\nOutput\n\nFor each query of the latter type, print the answer.\n\nSample Input 1\n\n5 5\n1 2 3 4 5\n1 0 5\n1 2 4\n0 3 10\n1 0 5\n1 0 3\n\nSample Output 1\n\n15\n7\n25\n6", "sample_input": "5 5\n1 2 3 4 5\n1 0 5\n1 2 4\n0 3 10\n1 0 5\n1 0 3\n"}, "reference_outputs": ["15\n7\n25\n6\n"], "source_document_id": "p02559", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given an array a_0, a_1, ..., a_{N-1} of length N. Process Q queries of the following types.\n\n0 p x: a_p \\gets a_p + x\n\n1 l r: Print \\sum_{i = l}^{r - 1}{a_i}.\n\nConstraints\n\n1 \\leq N, Q \\leq 500,000\n\n0 \\leq a_i, x \\leq 10^9\n\n0 \\leq p < N\n\n0 \\leq l_i < r_i \\leq N\n\nAll values in Input are integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_0 a_1 ... a_{N - 1}\n\\textrm{Query}_0\n\\textrm{Query}_1\n:\n\\textrm{Query}_{Q - 1}\n\nOutput\n\nFor each query of the latter type, print the answer.\n\nSample Input 1\n\n5 5\n1 2 3 4 5\n1 0 5\n1 2 4\n0 3 10\n1 0 5\n1 0 3\n\nSample Output 1\n\n15\n7\n25\n6", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 931, "cpu_time_ms": 1849, "memory_kb": 49892}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s101798556", "group_id": "codeNet:p02560", "input_text": "-- 5.3\n-- Sum_{i=0}^{n-1} floor{(a * i + b) / b}\nlocal function floorSum(n, m, a, b)\n local ans = 0\n while true do\n if m <= a then\n ans = ans + ((n - 1) * n // 2) * (a // m)\n a = a % m\n end\n if m <= b then\n ans = ans + n * (b // m)\n b = b % m\n end\n local ymax = (a * n + b) // m\n local xmax = ymax * m - b\n if ymax == 0 then break end\n ans = ans + (n - (xmax + a - 1) // a) * ymax\n n, m, a, b = ymax, a, m, (a - xmax % a) % a\n end\n return ans\nend\n\nlocal q = io.read(\"*n\")\nfor i = 1, q do\n local n, m, a, b = io.read(\"*n\", \"*n\", \"*n\", \"*n\")\n print(floorSum(n, m, a, b))\nend\n", "language": "Lua", "metadata": {"date": 1600033460, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02560.html", "problem_id": "p02560", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02560/input.txt", "sample_output_relpath": "derived/input_output/data/p02560/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02560/Lua/s101798556.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s101798556", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n13\n0\n314095480\n499999999500000000\n", "input_to_evaluate": "-- 5.3\n-- Sum_{i=0}^{n-1} floor{(a * i + b) / b}\nlocal function floorSum(n, m, a, b)\n local ans = 0\n while true do\n if m <= a then\n ans = ans + ((n - 1) * n // 2) * (a // m)\n a = a % m\n end\n if m <= b then\n ans = ans + n * (b // m)\n b = b % m\n end\n local ymax = (a * n + b) // m\n local xmax = ymax * m - b\n if ymax == 0 then break end\n ans = ans + (n - (xmax + a - 1) // a) * ymax\n n, m, a, b = ymax, a, m, (a - xmax % a) % a\n end\n return ans\nend\n\nlocal q = io.read(\"*n\")\nfor i = 1, q do\n local n, m, a, b = io.read(\"*n\", \"*n\", \"*n\", \"*n\")\n print(floorSum(n, m, a, b))\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn this problem, you should process T testcases.\n\nFor each testcase, you are given four integers N, M, A, B.\n\nCalculate \\sum_{i = 0}^{N - 1} floor((A \\times i + B) / M).\n\nConstraints\n\n1 \\leq T \\leq 100,000\n\n1 \\leq N, M \\leq 10^9\n\n0 \\leq A, B < M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\nN_0 M_0 A_0 B_0\nN_1 M_1 A_1 B_1\n:\nN_{T - 1} M_{T - 1} A_{T - 1} B_{T - 1}\n\nOutput\n\nPrint the answer for each testcase.\n\nSample Input 1\n\n5\n4 10 6 3\n6 5 4 3\n1 1 0 0\n31415 92653 58979 32384\n1000000000 1000000000 999999999 999999999\n\nSample Output 1\n\n3\n13\n0\n314095480\n499999999500000000", "sample_input": "5\n4 10 6 3\n6 5 4 3\n1 1 0 0\n31415 92653 58979 32384\n1000000000 1000000000 999999999 999999999\n"}, "reference_outputs": ["3\n13\n0\n314095480\n499999999500000000\n"], "source_document_id": "p02560", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn this problem, you should process T testcases.\n\nFor each testcase, you are given four integers N, M, A, B.\n\nCalculate \\sum_{i = 0}^{N - 1} floor((A \\times i + B) / M).\n\nConstraints\n\n1 \\leq T \\leq 100,000\n\n1 \\leq N, M \\leq 10^9\n\n0 \\leq A, B < M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\nN_0 M_0 A_0 B_0\nN_1 M_1 A_1 B_1\n:\nN_{T - 1} M_{T - 1} A_{T - 1} B_{T - 1}\n\nOutput\n\nPrint the answer for each testcase.\n\nSample Input 1\n\n5\n4 10 6 3\n6 5 4 3\n1 1 0 0\n31415 92653 58979 32384\n1000000000 1000000000 999999999 999999999\n\nSample Output 1\n\n3\n13\n0\n314095480\n499999999500000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 626, "cpu_time_ms": 380, "memory_kb": 2868}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s739212598", "group_id": "codeNet:p02560", "input_text": "--[[------------------------------------------------------------------------]]--\nlocal function floor_sum(elm_num, div_num, mul_num, add_num)\n\tlocal ans = 0\n\tif mul_num >= div_num then\n\t\tans = ans + (elm_num - 1) * elm_num * (mul_num // div_num) // 2\n\t\tmul_num = mul_num % div_num\n\tend\n\tif add_num >= div_num then\n\t\tans = ans + elm_num * (add_num // div_num)\n\t\tadd_num = add_num % div_num\n\tend\n\n\tlocal y_max = (mul_num * elm_num + add_num) // div_num\n\tlocal x_max = (y_max * div_num - add_num)\n\tif y_max == 0 then\n\t\treturn ans\n\telse\n\t\tans = ans + (elm_num - (x_max + mul_num - 1) // mul_num) * y_max\n\t\tans = ans + floor_sum(\n\t\t\ty_max, mul_num, div_num,\n\t\t\t(mul_num - x_max % mul_num) % mul_num, ans\n\t\t)\n\t\treturn ans\n\tend\nend\n--[[------------------------------------------------------------------------]]--\n\nlocal read = io.read\nlocal t = read(\"n\")\n\nlocal out_t = {}\nfor i = 1, t do\n\tout_t[i] = floor_sum(read(\"n\", \"n\", \"n\", \"n\"))\nend\nprint(table.concat(out_t, \"\\n\"))\n", "language": "Lua", "metadata": {"date": 1599861288, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02560.html", "problem_id": "p02560", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02560/input.txt", "sample_output_relpath": "derived/input_output/data/p02560/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02560/Lua/s739212598.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s739212598", "user_id": "u793881115"}, "prompt_components": {"gold_output": "3\n13\n0\n314095480\n499999999500000000\n", "input_to_evaluate": "--[[------------------------------------------------------------------------]]--\nlocal function floor_sum(elm_num, div_num, mul_num, add_num)\n\tlocal ans = 0\n\tif mul_num >= div_num then\n\t\tans = ans + (elm_num - 1) * elm_num * (mul_num // div_num) // 2\n\t\tmul_num = mul_num % div_num\n\tend\n\tif add_num >= div_num then\n\t\tans = ans + elm_num * (add_num // div_num)\n\t\tadd_num = add_num % div_num\n\tend\n\n\tlocal y_max = (mul_num * elm_num + add_num) // div_num\n\tlocal x_max = (y_max * div_num - add_num)\n\tif y_max == 0 then\n\t\treturn ans\n\telse\n\t\tans = ans + (elm_num - (x_max + mul_num - 1) // mul_num) * y_max\n\t\tans = ans + floor_sum(\n\t\t\ty_max, mul_num, div_num,\n\t\t\t(mul_num - x_max % mul_num) % mul_num, ans\n\t\t)\n\t\treturn ans\n\tend\nend\n--[[------------------------------------------------------------------------]]--\n\nlocal read = io.read\nlocal t = read(\"n\")\n\nlocal out_t = {}\nfor i = 1, t do\n\tout_t[i] = floor_sum(read(\"n\", \"n\", \"n\", \"n\"))\nend\nprint(table.concat(out_t, \"\\n\"))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn this problem, you should process T testcases.\n\nFor each testcase, you are given four integers N, M, A, B.\n\nCalculate \\sum_{i = 0}^{N - 1} floor((A \\times i + B) / M).\n\nConstraints\n\n1 \\leq T \\leq 100,000\n\n1 \\leq N, M \\leq 10^9\n\n0 \\leq A, B < M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\nN_0 M_0 A_0 B_0\nN_1 M_1 A_1 B_1\n:\nN_{T - 1} M_{T - 1} A_{T - 1} B_{T - 1}\n\nOutput\n\nPrint the answer for each testcase.\n\nSample Input 1\n\n5\n4 10 6 3\n6 5 4 3\n1 1 0 0\n31415 92653 58979 32384\n1000000000 1000000000 999999999 999999999\n\nSample Output 1\n\n3\n13\n0\n314095480\n499999999500000000", "sample_input": "5\n4 10 6 3\n6 5 4 3\n1 1 0 0\n31415 92653 58979 32384\n1000000000 1000000000 999999999 999999999\n"}, "reference_outputs": ["3\n13\n0\n314095480\n499999999500000000\n"], "source_document_id": "p02560", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn this problem, you should process T testcases.\n\nFor each testcase, you are given four integers N, M, A, B.\n\nCalculate \\sum_{i = 0}^{N - 1} floor((A \\times i + B) / M).\n\nConstraints\n\n1 \\leq T \\leq 100,000\n\n1 \\leq N, M \\leq 10^9\n\n0 \\leq A, B < M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\nN_0 M_0 A_0 B_0\nN_1 M_1 A_1 B_1\n:\nN_{T - 1} M_{T - 1} A_{T - 1} B_{T - 1}\n\nOutput\n\nPrint the answer for each testcase.\n\nSample Input 1\n\n5\n4 10 6 3\n6 5 4 3\n1 1 0 0\n31415 92653 58979 32384\n1000000000 1000000000 999999999 999999999\n\nSample Output 1\n\n3\n13\n0\n314095480\n499999999500000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 967, "cpu_time_ms": 317, "memory_kb": 11916}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s281453584", "group_id": "codeNet:p02562", "input_text": "local mmi, mma = math.min, math.max\nlocal MinCostFlow = {}\n\nMinCostFlow.initialize = function(self, n, spos, tpos, inf)\n self.n = n\n self.spos, self.tpos = spos, tpos\n self.inf = inf\n -- edge_dst[src][i] := dst\n self.edge_dst = {}\n -- edge_cost[src][i] := cost from src to edge_dst[src][i]\n self.edge_cost = {}\n -- edge_cap[src][i] := capacity from src to edge_dst[src][i]\n self.edge_cap = {}\n -- initial capacity. corresponding to edge_cap\n self.edge_initialcap = {}\n -- edge_dst_invedge_idx[src][i] := \"j\" where edge_dst[dst][j] == src\n -- in this case, edge_dst_invedge_idx[dst][j] should be \"i\".\n self.edge_dst_invedge_idx = {}\n -- len[v] := length from spos. len[spos] := 0\n self.len = {}\n -- sub_graph_flag[v] := whether to contains the vertex v in the sub-graph or not\n self.sub_graph_flag = {}\n -- sub_graph_v[i] := list of vertexes that are contained in the sub-graph. from tpos to spos.\n self.sub_graph_v = {}\n -- sub_graph_edgeidx[i] := edge index from sub_graph_v[i + 1] to sub_graph_v[i]\n self.sub_graph_edgeidx = {}\n -- sub_graph_size := the size of sub_graph_v.\n -- may not equal to #sub_graph_v (because not cleared).\n self.sub_graph_size = 0\n for i = 1, n do\n self.edge_dst[i] = {}\n self.edge_cost[i] = {}\n self.edge_cap[i] = {}\n self.edge_initialcap[i] = {}\n self.edge_dst_invedge_idx[i] = {}\n self.len[i] = 0\n self.sub_graph_flag[i] = false\n end\nend\n\nMinCostFlow.addEdge = function(self, src, dst, cost, cap)\n table.insert(self.edge_dst[src], dst)\n table.insert(self.edge_cost[src], cost)\n table.insert(self.edge_cap[src], cap)\n table.insert(self.edge_initialcap[src], cap)\n table.insert(self.edge_dst_invedge_idx[src], 1 + #self.edge_dst[dst])\n table.insert(self.edge_dst[dst], src)\n table.insert(self.edge_cost[dst], -cost)\n table.insert(self.edge_cap[dst], 0)--invcap\n table.insert(self.edge_initialcap[dst], 0)--invcap\n table.insert(self.edge_dst_invedge_idx[dst], #self.edge_dst[src])\nend\nMinCostFlow.invwalk_recursive = function(self, invsrc)\n if invsrc == self.spos then return true end\n local edge_dst, edge_cap, edge_cost = self.edge_dst, self.edge_cap, self.edge_cost\n local edge_dst_invedge_idx = self.edge_dst_invedge_idx\n local len = self.len\n local sub_graph_flag = self.sub_graph_flag\n local sub_graph_v = self.sub_graph_v\n local sub_graph_edgeidx = self.sub_graph_edgeidx\n for i = 1, #edge_dst[invsrc] do\n local invdst = edge_dst[invsrc][i]\n local j = edge_dst_invedge_idx[invsrc][i]\n if 0 < edge_cap[invdst][j]\n and len[invdst] + edge_cost[invdst][j] == len[invsrc]\n and not sub_graph_flag[invdst] then\n self.sub_graph_size = self.sub_graph_size + 1\n sub_graph_v[self.sub_graph_size] = invdst\n sub_graph_edgeidx[self.sub_graph_size - 1] = j\n sub_graph_flag[invdst] = true\n if self:invwalk_recursive(invdst) then\n return true\n else\n self.sub_graph_flag[invdst] = false\n self.sub_graph_size = self.sub_graph_size - 1\n end\n end\n end\n return false\nend\n\nMinCostFlow.walkDK = function(self)\n -- Dijkstra-like walk\n local edge_dst, edge_cost, edge_cap = self.edge_dst, self.edge_cost, self.edge_cap\n local len = self.len\n local taskstate = {}\n local tasks = {}\n local tasknum, done = 0, 0\n local tasklim = self.n\n for i = 1, tasklim do taskstate[i] = false end\n local function addtask(idx)\n if not taskstate[idx] then\n taskstate[idx] = true\n tasknum = tasknum + 1\n local taskidx = tasknum % tasklim\n if taskidx == 0 then taskidx = tasklim end\n tasks[taskidx] = idx\n end\n end\n local function walk(src, dst, cost)\n if len[src] + cost < len[dst] then\n len[dst] = len[src] + cost\n addtask(dst)\n end\n end\n addtask(self.spos)\n while done < tasknum do\n done = done + 1\n local taskidx = done % tasklim\n if taskidx == 0 then taskidx = tasklim end\n local idx = tasks[taskidx]\n taskstate[idx] = false\n local eddst, edcap, edcost = edge_dst[idx], edge_cap[idx], edge_cost[idx]\n for i = 1, #eddst do\n if 0 < edcap[i] then\n walk(idx, eddst[i], edcost[i])\n end\n end\n end\nend\nMinCostFlow.walkBF = function(self)\n --Bellman-Ford walk\n local edge_dst, edge_cost, edge_cap = self.edge_dst, self.edge_cost, self.edge_cap\n local len = self.len\n local n = self.n\n local updated1, updated2 = {}, {}\n for i = 1, n do\n updated1[i] = true\n end\n len[self.spos] = 0\n for irp = 1, n do\n local updsrc = irp % 2 == 1 and updated1 or updated2\n local upddst = irp % 2 == 1 and updated2 or updated1\n for i = 1, n do\n upddst[i] = false\n end\n for src = 1, n do\n if updsrc[src] then\n local eddst, edcap, edcost = edge_dst[src], edge_cap[src], edge_cost[src]\n for i = 1, #eddst do\n if 0 < edcap[i] then\n local dst = eddst[i]\n local cost = edcost[i]\n if len[src] + cost < len[dst] then\n len[dst] = len[src] + cost\n upddst[dst] = true\n end\n end\n end\n end\n end\n end\nend\n\nMinCostFlow.makeSubGraph = function(self)\n local inf = self.inf\n local len = self.len\n local n = self.n\n local edge_dst, edge_cap = self.edge_dst, self.edge_cap\n local edge_dst_invedge_idx = self.edge_dst_invedge_idx\n local edge_cost = self.edge_cost\n local sub_graph_v = self.sub_graph_v\n local sub_graph_edgeidx = self.sub_graph_edgeidx\n local sub_graph_flag = self.sub_graph_flag\n for i = 1, n do\n len[i] = inf\n sub_graph_flag[i] = false\n end\n len[self.spos] = 0\n\n -- Bellman-Ford is good, but Dijkstra-like is very fast in some case\n self:walkDK()\n -- self:walkBF()\n\n self.sub_graph_size = 0\n if inf <= len[self.tpos] then\n return 0\n end\n -- restore route (from tpos to spos)\n self.sub_graph_size = 1\n sub_graph_v[1] = self.tpos\n self:invwalk_recursive(self.tpos)\n local min_capacity = inf\n for i = self.sub_graph_size, 2, -1 do\n local src = sub_graph_v[i]\n local j = sub_graph_edgeidx[i - 1]\n min_capacity = mmi(min_capacity, edge_cap[src][j])\n end\n return min_capacity\nend\n\nMinCostFlow.flow = function(self, capacity)\n local edge_dst, edge_cap = self.edge_dst, self.edge_cap\n local edge_dst_invedge_idx = self.edge_dst_invedge_idx\n local sub_graph_v = self.sub_graph_v\n local sub_graph_edgeidx = self.sub_graph_edgeidx\n for i = self.sub_graph_size, 2, -1 do\n local src = sub_graph_v[i]\n local dst = sub_graph_v[i - 1]\n local j = sub_graph_edgeidx[i - 1]\n edge_cap[src][j] = edge_cap[src][j] - capacity\n local k = edge_dst_invedge_idx[src][j]\n edge_cap[dst][k] = edge_cap[dst][k] + capacity\n end\nend\n\nMinCostFlow.getMinCostFlow = function(self, amount, invalid)\n local ret = 0\n local cap = self:makeSubGraph()\n while 0 < cap do\n cap = mmi(amount, cap)\n ret = ret + self.len[self.tpos] * cap\n self:flow(cap)\n amount = amount - cap\n if 0 < amount then\n cap = self:makeSubGraph()\n else\n break\n end\n end\n if 0 < amount then return invalid end\n return ret\nend\n\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal sp, tp = 2 * n + 1, 2 * n + 2\nMinCostFlow:initialize(tp, sp, tp, 1000000007 * 1000)\nfor i = 1, n do\n MinCostFlow:addEdge(sp, i, 0, k)\n MinCostFlow:addEdge(n + i, tp, 0, k)\nend\nMinCostFlow:addEdge(n * 2 + 1, n * 2 + 2, 0, n * k)\nfor i = 1, n do\n for j = 1, n do\n local a = io.read(\"*n\")\n MinCostFlow:addEdge(i, n + j, -a, 1)\n end\nend\nlocal amount = -MinCostFlow:getMinCostFlow(n * k)\namount = math.abs(amount) -- \"-0\" to \"0\"\nprint(amount)\nlocal used = {}\nfor i = 1, n * n do used[i] = false end\nfor row = 1, n do\n local edge = MinCostFlow.edge_dst[row]\n local cap = MinCostFlow.edge_cap[row]\n local initcap = MinCostFlow.edge_initialcap[row]\n for j = 1, #edge do\n local col = edge[j] - n\n if cap[j] < initcap[j] then\n used[(row - 1) * n + col] = true\n end\n end\nend\nfor i = 1, n do\n for j = 1, n do\n io.write(used[(i - 1) * n + j] and \"X\" or \".\")\n end\n io.write(\"\\n\")\nend\n", "language": "Lua", "metadata": {"date": 1599979515, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02562.html", "problem_id": "p02562", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02562/input.txt", "sample_output_relpath": "derived/input_output/data/p02562/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02562/Lua/s281453584.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s281453584", "user_id": "u120582723"}, "prompt_components": {"gold_output": "19\nX..\n..X\n.X.\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal MinCostFlow = {}\n\nMinCostFlow.initialize = function(self, n, spos, tpos, inf)\n self.n = n\n self.spos, self.tpos = spos, tpos\n self.inf = inf\n -- edge_dst[src][i] := dst\n self.edge_dst = {}\n -- edge_cost[src][i] := cost from src to edge_dst[src][i]\n self.edge_cost = {}\n -- edge_cap[src][i] := capacity from src to edge_dst[src][i]\n self.edge_cap = {}\n -- initial capacity. corresponding to edge_cap\n self.edge_initialcap = {}\n -- edge_dst_invedge_idx[src][i] := \"j\" where edge_dst[dst][j] == src\n -- in this case, edge_dst_invedge_idx[dst][j] should be \"i\".\n self.edge_dst_invedge_idx = {}\n -- len[v] := length from spos. len[spos] := 0\n self.len = {}\n -- sub_graph_flag[v] := whether to contains the vertex v in the sub-graph or not\n self.sub_graph_flag = {}\n -- sub_graph_v[i] := list of vertexes that are contained in the sub-graph. from tpos to spos.\n self.sub_graph_v = {}\n -- sub_graph_edgeidx[i] := edge index from sub_graph_v[i + 1] to sub_graph_v[i]\n self.sub_graph_edgeidx = {}\n -- sub_graph_size := the size of sub_graph_v.\n -- may not equal to #sub_graph_v (because not cleared).\n self.sub_graph_size = 0\n for i = 1, n do\n self.edge_dst[i] = {}\n self.edge_cost[i] = {}\n self.edge_cap[i] = {}\n self.edge_initialcap[i] = {}\n self.edge_dst_invedge_idx[i] = {}\n self.len[i] = 0\n self.sub_graph_flag[i] = false\n end\nend\n\nMinCostFlow.addEdge = function(self, src, dst, cost, cap)\n table.insert(self.edge_dst[src], dst)\n table.insert(self.edge_cost[src], cost)\n table.insert(self.edge_cap[src], cap)\n table.insert(self.edge_initialcap[src], cap)\n table.insert(self.edge_dst_invedge_idx[src], 1 + #self.edge_dst[dst])\n table.insert(self.edge_dst[dst], src)\n table.insert(self.edge_cost[dst], -cost)\n table.insert(self.edge_cap[dst], 0)--invcap\n table.insert(self.edge_initialcap[dst], 0)--invcap\n table.insert(self.edge_dst_invedge_idx[dst], #self.edge_dst[src])\nend\nMinCostFlow.invwalk_recursive = function(self, invsrc)\n if invsrc == self.spos then return true end\n local edge_dst, edge_cap, edge_cost = self.edge_dst, self.edge_cap, self.edge_cost\n local edge_dst_invedge_idx = self.edge_dst_invedge_idx\n local len = self.len\n local sub_graph_flag = self.sub_graph_flag\n local sub_graph_v = self.sub_graph_v\n local sub_graph_edgeidx = self.sub_graph_edgeidx\n for i = 1, #edge_dst[invsrc] do\n local invdst = edge_dst[invsrc][i]\n local j = edge_dst_invedge_idx[invsrc][i]\n if 0 < edge_cap[invdst][j]\n and len[invdst] + edge_cost[invdst][j] == len[invsrc]\n and not sub_graph_flag[invdst] then\n self.sub_graph_size = self.sub_graph_size + 1\n sub_graph_v[self.sub_graph_size] = invdst\n sub_graph_edgeidx[self.sub_graph_size - 1] = j\n sub_graph_flag[invdst] = true\n if self:invwalk_recursive(invdst) then\n return true\n else\n self.sub_graph_flag[invdst] = false\n self.sub_graph_size = self.sub_graph_size - 1\n end\n end\n end\n return false\nend\n\nMinCostFlow.walkDK = function(self)\n -- Dijkstra-like walk\n local edge_dst, edge_cost, edge_cap = self.edge_dst, self.edge_cost, self.edge_cap\n local len = self.len\n local taskstate = {}\n local tasks = {}\n local tasknum, done = 0, 0\n local tasklim = self.n\n for i = 1, tasklim do taskstate[i] = false end\n local function addtask(idx)\n if not taskstate[idx] then\n taskstate[idx] = true\n tasknum = tasknum + 1\n local taskidx = tasknum % tasklim\n if taskidx == 0 then taskidx = tasklim end\n tasks[taskidx] = idx\n end\n end\n local function walk(src, dst, cost)\n if len[src] + cost < len[dst] then\n len[dst] = len[src] + cost\n addtask(dst)\n end\n end\n addtask(self.spos)\n while done < tasknum do\n done = done + 1\n local taskidx = done % tasklim\n if taskidx == 0 then taskidx = tasklim end\n local idx = tasks[taskidx]\n taskstate[idx] = false\n local eddst, edcap, edcost = edge_dst[idx], edge_cap[idx], edge_cost[idx]\n for i = 1, #eddst do\n if 0 < edcap[i] then\n walk(idx, eddst[i], edcost[i])\n end\n end\n end\nend\nMinCostFlow.walkBF = function(self)\n --Bellman-Ford walk\n local edge_dst, edge_cost, edge_cap = self.edge_dst, self.edge_cost, self.edge_cap\n local len = self.len\n local n = self.n\n local updated1, updated2 = {}, {}\n for i = 1, n do\n updated1[i] = true\n end\n len[self.spos] = 0\n for irp = 1, n do\n local updsrc = irp % 2 == 1 and updated1 or updated2\n local upddst = irp % 2 == 1 and updated2 or updated1\n for i = 1, n do\n upddst[i] = false\n end\n for src = 1, n do\n if updsrc[src] then\n local eddst, edcap, edcost = edge_dst[src], edge_cap[src], edge_cost[src]\n for i = 1, #eddst do\n if 0 < edcap[i] then\n local dst = eddst[i]\n local cost = edcost[i]\n if len[src] + cost < len[dst] then\n len[dst] = len[src] + cost\n upddst[dst] = true\n end\n end\n end\n end\n end\n end\nend\n\nMinCostFlow.makeSubGraph = function(self)\n local inf = self.inf\n local len = self.len\n local n = self.n\n local edge_dst, edge_cap = self.edge_dst, self.edge_cap\n local edge_dst_invedge_idx = self.edge_dst_invedge_idx\n local edge_cost = self.edge_cost\n local sub_graph_v = self.sub_graph_v\n local sub_graph_edgeidx = self.sub_graph_edgeidx\n local sub_graph_flag = self.sub_graph_flag\n for i = 1, n do\n len[i] = inf\n sub_graph_flag[i] = false\n end\n len[self.spos] = 0\n\n -- Bellman-Ford is good, but Dijkstra-like is very fast in some case\n self:walkDK()\n -- self:walkBF()\n\n self.sub_graph_size = 0\n if inf <= len[self.tpos] then\n return 0\n end\n -- restore route (from tpos to spos)\n self.sub_graph_size = 1\n sub_graph_v[1] = self.tpos\n self:invwalk_recursive(self.tpos)\n local min_capacity = inf\n for i = self.sub_graph_size, 2, -1 do\n local src = sub_graph_v[i]\n local j = sub_graph_edgeidx[i - 1]\n min_capacity = mmi(min_capacity, edge_cap[src][j])\n end\n return min_capacity\nend\n\nMinCostFlow.flow = function(self, capacity)\n local edge_dst, edge_cap = self.edge_dst, self.edge_cap\n local edge_dst_invedge_idx = self.edge_dst_invedge_idx\n local sub_graph_v = self.sub_graph_v\n local sub_graph_edgeidx = self.sub_graph_edgeidx\n for i = self.sub_graph_size, 2, -1 do\n local src = sub_graph_v[i]\n local dst = sub_graph_v[i - 1]\n local j = sub_graph_edgeidx[i - 1]\n edge_cap[src][j] = edge_cap[src][j] - capacity\n local k = edge_dst_invedge_idx[src][j]\n edge_cap[dst][k] = edge_cap[dst][k] + capacity\n end\nend\n\nMinCostFlow.getMinCostFlow = function(self, amount, invalid)\n local ret = 0\n local cap = self:makeSubGraph()\n while 0 < cap do\n cap = mmi(amount, cap)\n ret = ret + self.len[self.tpos] * cap\n self:flow(cap)\n amount = amount - cap\n if 0 < amount then\n cap = self:makeSubGraph()\n else\n break\n end\n end\n if 0 < amount then return invalid end\n return ret\nend\n\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal sp, tp = 2 * n + 1, 2 * n + 2\nMinCostFlow:initialize(tp, sp, tp, 1000000007 * 1000)\nfor i = 1, n do\n MinCostFlow:addEdge(sp, i, 0, k)\n MinCostFlow:addEdge(n + i, tp, 0, k)\nend\nMinCostFlow:addEdge(n * 2 + 1, n * 2 + 2, 0, n * k)\nfor i = 1, n do\n for j = 1, n do\n local a = io.read(\"*n\")\n MinCostFlow:addEdge(i, n + j, -a, 1)\n end\nend\nlocal amount = -MinCostFlow:getMinCostFlow(n * k)\namount = math.abs(amount) -- \"-0\" to \"0\"\nprint(amount)\nlocal used = {}\nfor i = 1, n * n do used[i] = false end\nfor row = 1, n do\n local edge = MinCostFlow.edge_dst[row]\n local cap = MinCostFlow.edge_cap[row]\n local initcap = MinCostFlow.edge_initialcap[row]\n for j = 1, #edge do\n local col = edge[j] - n\n if cap[j] < initcap[j] then\n used[(row - 1) * n + col] = true\n end\n end\nend\nfor i = 1, n do\n for j = 1, n do\n io.write(used[(i - 1) * n + j] and \"X\" or \".\")\n end\n io.write(\"\\n\")\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a grid of N rows and M columns. The square at the i-th row and j-th column will be denoted as (i,j).\nA nonnegative integer A_{i,j} is written for each square (i,j).\n\nYou choose some of the squares so that each row and column contains at most K chosen squares.\nUnder this constraint, calculate the maximum value of the sum of the integers written on the chosen squares.\nAdditionally, calculate a way to choose squares that acheives the maximum.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq K \\leq N\n\n0 \\leq A_{i,j} \\leq 10^9\n\nAll values in Input are integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_{1,1} A_{1,2} \\cdots A_{1,N}\nA_{2,1} A_{2,2} \\cdots A_{2,N}\n\\vdots\nA_{N,1} A_{N,2} \\cdots A_{N,N}\n\nOutput\n\nOn the first line, print the maximum value of the sum of the integers written on the chosen squares.\n\nOn the next N lines, print a way that achieves the maximum.\n\nPrecisely, output the strings t_1,t_2,\\cdots,t_N, that satisfies t_{i,j}=X if you choose (i,j) and t_{i,j}=. otherwise.\n\nYou may print any way to choose squares that maximizes the sum.\n\nSample Input 1\n\n3 1\n5 3 2\n1 4 8\n7 6 9\n\nSample Output 1\n\n19\nX..\n..X\n.X.\n\nSample Input 2\n\n3 2\n10 10 1\n10 10 1\n1 1 10\n\nSample Output 2\n\n50\nXX.\nXX.\n..X", "sample_input": "3 1\n5 3 2\n1 4 8\n7 6 9\n"}, "reference_outputs": ["19\nX..\n..X\n.X.\n"], "source_document_id": "p02562", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a grid of N rows and M columns. The square at the i-th row and j-th column will be denoted as (i,j).\nA nonnegative integer A_{i,j} is written for each square (i,j).\n\nYou choose some of the squares so that each row and column contains at most K chosen squares.\nUnder this constraint, calculate the maximum value of the sum of the integers written on the chosen squares.\nAdditionally, calculate a way to choose squares that acheives the maximum.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq K \\leq N\n\n0 \\leq A_{i,j} \\leq 10^9\n\nAll values in Input are integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_{1,1} A_{1,2} \\cdots A_{1,N}\nA_{2,1} A_{2,2} \\cdots A_{2,N}\n\\vdots\nA_{N,1} A_{N,2} \\cdots A_{N,N}\n\nOutput\n\nOn the first line, print the maximum value of the sum of the integers written on the chosen squares.\n\nOn the next N lines, print a way that achieves the maximum.\n\nPrecisely, output the strings t_1,t_2,\\cdots,t_N, that satisfies t_{i,j}=X if you choose (i,j) and t_{i,j}=. otherwise.\n\nYou may print any way to choose squares that maximizes the sum.\n\nSample Input 1\n\n3 1\n5 3 2\n1 4 8\n7 6 9\n\nSample Output 1\n\n19\nX..\n..X\n.X.\n\nSample Input 2\n\n3 2\n10 10 1\n10 10 1\n1 1 10\n\nSample Output 2\n\n50\nXX.\nXX.\n..X", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7969, "cpu_time_ms": 360, "memory_kb": 3544}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s564253829", "group_id": "codeNet:p02565", "input_text": "local mab = math.abs\nlocal n, d = io.read(\"*n\", \"*n\")\nlocal edge = {}\nlocal edge_asked = {}\nlocal invedge = {}\nlocal invedge_asked = {}\nfor i = 1, 2 * n do\n edge[i] = {}\n edge_asked[i] = 0\n invedge[i] = {}\n invedge_asked[i] = 0\nend\nlocal edgeinfo = {}\nlocal xs, ys = {}, {}\nfor i = 1, n do\n xs[i], ys[i] = io.read(\"*n\", \"*n\")\nend\nlocal function addedge(src, dst)\n table.insert(edgeinfo, {src, dst})\n table.insert(edge[src], dst)\n table.insert(invedge[dst], src)\nend\nfor i = 1, n - 1 do\n for j = i + 1, n do\n f1 = mab(xs[i] - xs[j]) < d\n f2 = mab(xs[i] - ys[j]) < d\n f3 = mab(ys[i] - xs[j]) < d\n f4 = mab(ys[i] - ys[j]) < d\n if f1 and not f2 then addedge(i, n + j) end\n if f2 and not f1 then addedge(i, j) end\n if f3 and not f4 then addedge(n + i, n + j) end\n if f4 and not f3 then addedge(n + i, j) end\n if f1 and not f3 then addedge(j, n + i) end\n if f3 and not f1 then addedge(j, i) end\n if f2 and not f4 then addedge(n + j, n + i) end\n if f4 and not f2 then addedge(n + j, i) end\n\n if f1 and f2 then addedge(i, n + i) end\n if f3 and f4 then addedge(n + i, i) end\n if f1 and f3 then addedge(j, n + j) end\n if f2 and f4 then addedge(n + j, j) end\n end\nend\nlocal rawn = n\nn = n * 2\n\nlocal asked = {}\nlocal sccd_root = {}\nfor i = 1, n do\n asked[i] = false\n sccd_root[i] = 0\nend\n\nlocal function SCCD_dfs(spos, dfs_way)\n local tasks = {spos}\n while 0 < #tasks do\n local src = tasks[#tasks]\n asked[src] = true\n table.remove(tasks)\n if edge_asked[src] == #edge[src] then\n table.insert(dfs_way, src)\n else\n table.insert(tasks, src)\n edge_asked[src] = edge_asked[src] + 1\n local dst = edge[src][edge_asked[src]]\n if not asked[dst] then\n table.insert(tasks, dst)\n end\n end\n end\nend\n\nlocal function SCCD_invdfs(spos, rootid)\n local tasks = {spos}\n while 0 < #tasks do\n local src = tasks[#tasks]\n sccd_root[src] = rootid\n table.remove(tasks)\n while invedge_asked[src] < #invedge[src] do\n invedge_asked[src] = invedge_asked[src] + 1\n local dst = invedge[src][invedge_asked[src]]\n if asked[dst] and sccd_root[dst] == 0 then\n table.insert(tasks, src)\n table.insert(tasks, dst)\n break\n end\n end\n end\nend\n\nlocal function SCCD_categorize()\n for src = 1, n do\n if not asked[src] then\n local dfs_way = {}\n SCCD_dfs(src, dfs_way)\n for i = #dfs_way, 1, -1 do\n local src = dfs_way[i]\n if sccd_root[src] == 0 then\n SCCD_invdfs(src, src)\n end\n end\n end\n end\nend\n\nlocal gsize = {}\nlocal gedge, ginvedge = {}, {}\nlocal glen = {}\nlocal gmember = {}\n\nlocal function SCCD_make_group_graph()\n for i = 1, n do\n gsize[i] = 0\n gedge[i], ginvedge[i] = {}, {}\n glen[i] = 0\n gmember[i] = {}\n end\n for i = 1, n do\n local r = sccd_root[i]\n gsize[r] = gsize[r] + 1\n table.insert(gmember[r], i)\n end\n for i = 1, #edgeinfo do\n local a, b = edgeinfo[i][1], edgeinfo[i][2]\n local ra, rb = sccd_root[a], sccd_root[b]\n if ra ~= rb then\n table.insert(gedge[ra], rb)\n table.insert(ginvedge[rb], ra)\n end\n end\nend\n\nlocal function SCCD_toposort()\n local topo_tasks = {}\n local topo_asked_cnt = {}\n for i = 1, n do\n topo_asked_cnt[i] = 0\n if 0 < gsize[i] and #ginvedge[i] == 0 then\n table.insert(topo_tasks, i)\n end\n end\n local topoary = {}\n local topo_done = 0\n while topo_done < #topo_tasks do\n topo_done = topo_done + 1\n local g = topo_tasks[topo_done]\n topoary[topo_done] = g\n for i = 1, #gedge[g] do\n local dst = gedge[g][i]\n topo_asked_cnt[dst] = topo_asked_cnt[dst] + 1\n if topo_asked_cnt[dst] == #ginvedge[dst] then\n table.insert(topo_tasks, dst)\n end\n end\n end\n return topoary\nend\n\nSCCD_categorize()\nSCCD_make_group_graph()\n\nfor i = 1, rawn do\n if sccd_root[i] == sccd_root[i + rawn] then\n print(\"No\") os.exit()\n end\nend\nprint(\"Yes\")\nlocal determined = {}\nlocal retpos = {}\nfor i = 1, rawn do\n determined[i] = false\n retpos[i] = -1\nend\n\nlocal topoary = SCCD_toposort()\nfor i = 1, #topoary do\n local g = topoary[i]\n for j = 1, #gmember[g] do\n local idx = gmember[g][j]\n if idx <= rawn then\n if not determined[idx] then\n retpos[idx] = ys[idx]\n determined[idx] = true\n end\n else\n if not determined[idx - rawn] then\n retpos[idx - rawn] = xs[idx - rawn]\n determined[idx - rawn] = true\n end\n end\n end\nend\nprint(table.concat(retpos, \"\\n\"))\n", "language": "Lua", "metadata": {"date": 1599680561, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02565.html", "problem_id": "p02565", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02565/input.txt", "sample_output_relpath": "derived/input_output/data/p02565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02565/Lua/s564253829.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s564253829", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n4\n2\n0\n", "input_to_evaluate": "local mab = math.abs\nlocal n, d = io.read(\"*n\", \"*n\")\nlocal edge = {}\nlocal edge_asked = {}\nlocal invedge = {}\nlocal invedge_asked = {}\nfor i = 1, 2 * n do\n edge[i] = {}\n edge_asked[i] = 0\n invedge[i] = {}\n invedge_asked[i] = 0\nend\nlocal edgeinfo = {}\nlocal xs, ys = {}, {}\nfor i = 1, n do\n xs[i], ys[i] = io.read(\"*n\", \"*n\")\nend\nlocal function addedge(src, dst)\n table.insert(edgeinfo, {src, dst})\n table.insert(edge[src], dst)\n table.insert(invedge[dst], src)\nend\nfor i = 1, n - 1 do\n for j = i + 1, n do\n f1 = mab(xs[i] - xs[j]) < d\n f2 = mab(xs[i] - ys[j]) < d\n f3 = mab(ys[i] - xs[j]) < d\n f4 = mab(ys[i] - ys[j]) < d\n if f1 and not f2 then addedge(i, n + j) end\n if f2 and not f1 then addedge(i, j) end\n if f3 and not f4 then addedge(n + i, n + j) end\n if f4 and not f3 then addedge(n + i, j) end\n if f1 and not f3 then addedge(j, n + i) end\n if f3 and not f1 then addedge(j, i) end\n if f2 and not f4 then addedge(n + j, n + i) end\n if f4 and not f2 then addedge(n + j, i) end\n\n if f1 and f2 then addedge(i, n + i) end\n if f3 and f4 then addedge(n + i, i) end\n if f1 and f3 then addedge(j, n + j) end\n if f2 and f4 then addedge(n + j, j) end\n end\nend\nlocal rawn = n\nn = n * 2\n\nlocal asked = {}\nlocal sccd_root = {}\nfor i = 1, n do\n asked[i] = false\n sccd_root[i] = 0\nend\n\nlocal function SCCD_dfs(spos, dfs_way)\n local tasks = {spos}\n while 0 < #tasks do\n local src = tasks[#tasks]\n asked[src] = true\n table.remove(tasks)\n if edge_asked[src] == #edge[src] then\n table.insert(dfs_way, src)\n else\n table.insert(tasks, src)\n edge_asked[src] = edge_asked[src] + 1\n local dst = edge[src][edge_asked[src]]\n if not asked[dst] then\n table.insert(tasks, dst)\n end\n end\n end\nend\n\nlocal function SCCD_invdfs(spos, rootid)\n local tasks = {spos}\n while 0 < #tasks do\n local src = tasks[#tasks]\n sccd_root[src] = rootid\n table.remove(tasks)\n while invedge_asked[src] < #invedge[src] do\n invedge_asked[src] = invedge_asked[src] + 1\n local dst = invedge[src][invedge_asked[src]]\n if asked[dst] and sccd_root[dst] == 0 then\n table.insert(tasks, src)\n table.insert(tasks, dst)\n break\n end\n end\n end\nend\n\nlocal function SCCD_categorize()\n for src = 1, n do\n if not asked[src] then\n local dfs_way = {}\n SCCD_dfs(src, dfs_way)\n for i = #dfs_way, 1, -1 do\n local src = dfs_way[i]\n if sccd_root[src] == 0 then\n SCCD_invdfs(src, src)\n end\n end\n end\n end\nend\n\nlocal gsize = {}\nlocal gedge, ginvedge = {}, {}\nlocal glen = {}\nlocal gmember = {}\n\nlocal function SCCD_make_group_graph()\n for i = 1, n do\n gsize[i] = 0\n gedge[i], ginvedge[i] = {}, {}\n glen[i] = 0\n gmember[i] = {}\n end\n for i = 1, n do\n local r = sccd_root[i]\n gsize[r] = gsize[r] + 1\n table.insert(gmember[r], i)\n end\n for i = 1, #edgeinfo do\n local a, b = edgeinfo[i][1], edgeinfo[i][2]\n local ra, rb = sccd_root[a], sccd_root[b]\n if ra ~= rb then\n table.insert(gedge[ra], rb)\n table.insert(ginvedge[rb], ra)\n end\n end\nend\n\nlocal function SCCD_toposort()\n local topo_tasks = {}\n local topo_asked_cnt = {}\n for i = 1, n do\n topo_asked_cnt[i] = 0\n if 0 < gsize[i] and #ginvedge[i] == 0 then\n table.insert(topo_tasks, i)\n end\n end\n local topoary = {}\n local topo_done = 0\n while topo_done < #topo_tasks do\n topo_done = topo_done + 1\n local g = topo_tasks[topo_done]\n topoary[topo_done] = g\n for i = 1, #gedge[g] do\n local dst = gedge[g][i]\n topo_asked_cnt[dst] = topo_asked_cnt[dst] + 1\n if topo_asked_cnt[dst] == #ginvedge[dst] then\n table.insert(topo_tasks, dst)\n end\n end\n end\n return topoary\nend\n\nSCCD_categorize()\nSCCD_make_group_graph()\n\nfor i = 1, rawn do\n if sccd_root[i] == sccd_root[i + rawn] then\n print(\"No\") os.exit()\n end\nend\nprint(\"Yes\")\nlocal determined = {}\nlocal retpos = {}\nfor i = 1, rawn do\n determined[i] = false\n retpos[i] = -1\nend\n\nlocal topoary = SCCD_toposort()\nfor i = 1, #topoary do\n local g = topoary[i]\n for j = 1, #gmember[g] do\n local idx = gmember[g][j]\n if idx <= rawn then\n if not determined[idx] then\n retpos[idx] = ys[idx]\n determined[idx] = true\n end\n else\n if not determined[idx - rawn] then\n retpos[idx - rawn] = xs[idx - rawn]\n determined[idx - rawn] = true\n end\n end\n end\nend\nprint(table.concat(retpos, \"\\n\"))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nConsider placing N flags on a line. Flags are numbered through 1 to N.\n\nFlag i can be placed on the coordinate X_i or Y_i.\nFor any two different flags, the distance between them should be at least D.\n\nDecide whether it is possible to place all N flags. If it is possible, print such a configulation.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\n0 \\leq D \\leq 10^9\n\n0 \\leq X_i < Y_i \\leq 10^9\n\nAll values in Input are integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_1 Y_1\nX_2 Y_2\n\\vdots\nX_N Y_N\n\nOutput\n\nPrint No if it is impossible to place N flags.\n\nIf it is possible, print Yes first.\nAfter that, print N lines. i-th line of them should contain the coodinate of flag i.\n\nSample Input 1\n\n3 2\n1 4\n2 5\n0 6\n\nSample Output 1\n\nYes\n4\n2\n0\n\nSample Input 2\n\n3 3\n1 4\n2 5\n0 6\n\nSample Output 2\n\nNo", "sample_input": "3 2\n1 4\n2 5\n0 6\n"}, "reference_outputs": ["Yes\n4\n2\n0\n"], "source_document_id": "p02565", "source_text": "Score : 100 points\n\nProblem Statement\n\nConsider placing N flags on a line. Flags are numbered through 1 to N.\n\nFlag i can be placed on the coordinate X_i or Y_i.\nFor any two different flags, the distance between them should be at least D.\n\nDecide whether it is possible to place all N flags. If it is possible, print such a configulation.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\n0 \\leq D \\leq 10^9\n\n0 \\leq X_i < Y_i \\leq 10^9\n\nAll values in Input are integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_1 Y_1\nX_2 Y_2\n\\vdots\nX_N Y_N\n\nOutput\n\nPrint No if it is impossible to place N flags.\n\nIf it is possible, print Yes first.\nAfter that, print N lines. i-th line of them should contain the coodinate of flag i.\n\nSample Input 1\n\n3 2\n1 4\n2 5\n0 6\n\nSample Output 1\n\nYes\n4\n2\n0\n\nSample Input 2\n\n3 3\n1 4\n2 5\n0 6\n\nSample Output 2\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4512, "cpu_time_ms": 24, "memory_kb": 4148}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s199368222", "group_id": "codeNet:p02567", "input_text": "--[[------------------------------------------------------------------------]]--\n--- `0 <= num <= 1<<61` return minimum non-negative `x` s.t. `n <= 2**x`\nlocal function ceil_pow2(num)\n\tlocal x = 0\n\twhile (1 << x) < num do\n\t\tx = x + 1\n\tend\n\treturn x\nend\n\n--- index >= 1\nlocal function update(_, index)\n\t_.vec[index] = _.operation_fn(\n\t\t_.vec[2 * index], _.vec[2 * index + 1]\n\t)\nend\n\nlocal SegTree ={}\n\n--- 0 <= #element_count_or_vec <= 10^8\n--- (1): 長さelement_count_or_vecの数列vecを作ります。初期値は全部init_val_fn()です。\n--- (2): 長さ#element_count_or_vecの数列vecを作ります。\n--- element_count_or_vecの内容が初期値となります。\n--- O(n)\nfunction SegTree.new(operation_fn, init_val_fn, element_count_or_vec)\n\tif type(element_count_or_vec) == \"number\" then\n\t\tlocal vec = {}\n\t\tfor i = 1, element_count_or_vec do\n\t\t\tvec[i] = init_val_fn()\n\t\tend\n\t\treturn SegTree.new(operation_fn, init_val_fn, vec)\n\tend\n\tassert(\n\t\ttype(element_count_or_vec) == \"table\",\n\t\t\"arg error! need number or table\"\n\t)\n\tlocal vec_len = #element_count_or_vec\n\tlocal log = ceil_pow2(vec_len)\n\tlocal len = 1 << log\n\tlocal vec = {}\n\tlocal _ = {\n\t\tvec_len = vec_len,\n\t\tlog = log,\n\t\tlen = len,\n\t\tvec = vec,\n\t\toperation_fn = operation_fn,\n\t\tinit_val_fn = init_val_fn,\n\t\tupdate = update\n\t}\n\tfor i = 1, 2 * len do\n\t\tvec[i] = init_val_fn()\n\tend\n\tfor i = 1, vec_len do\n\t\tvec[len + i - 1] = element_count_or_vec[i];\n\tend\n\tfor i = len - 1, 1, -1 do\n\t\tupdate(_, i)\n\tend\n\treturn setmetatable({_ = _}, {__index = SegTree})\nend\n\n--- 1 <= index <= #element_count_or_vec\n--- vec[index]にvalueを代入します。\n--- O(log(n))\nfunction SegTree:set(index, value)\n\tassert(1 <= index and index <= self._.vec_len)\n\tindex = index - 1 + self._.len\n\tself._.vec[index] = value\n\tfor i = 1, self._.log do\n\t\tupdate(self._, index >> i)\n\tend\nend\n\n--- 1 <= index <= #element_count_or_vec\n--- vec[index]を返します。\n--- O(1)\nfunction SegTree:get(index)\n\tassert(1 <= index and index <= self._.vec_len)\n\treturn self._.vec[index - 1 + self._.len]\nend\n\n--- 1 <= left <= right <= #element_count_or_vec\n--- operation_fn(vec[left], ..., vec[right])を、\n--- モノイドの性質を満たしていると仮定して計算します。l = r のときはe()を返します。\n--- O(log(n))\nfunction SegTree:prod(left, right)\n\tassert(1 <= left and left <= right and right <= self._.vec_len)\n\tlocal vec = self._.vec\n\tlocal operation_fn = self._.operation_fn\n\n\tlocal operated_left = self._.init_val_fn()\n\tlocal operated_right = self._.init_val_fn()\n\tleft = left - 1 + self._.len\n\tright = right - 1 + self._.len\n\twhile left < right do\n\t\tif left & 1 == 1 then\n\t\t\toperated_left = operation_fn(operated_left, vec[left])\n\t\t\tleft = left + 1\n\t\tend\n\t\tif right & 1 == 1 then\n\t\t\tright = right - 1\n\t\t\toperated_right = operation_fn(vec[right], operated_right)\n\t\tend\n\t\tleft = left >> 1\n\t\tright = right >> 1\n\tend\n\treturn operation_fn(operated_left, operated_right)\nend\n\n--- op(a[1], ..., a[n])を計算します。n = 0のときはinit_val_fn()を返します。\n--- O(1)\nfunction SegTree:all_prod()\n\treturn self._.vec[1]\nend\n\n--- 1 <= left <= #element_count_or_vec\n--- 関数bool_fn_arg_val(x) -> bool を定義する必要があります。xはvecの値が入ります。\n--- init_val_fn()の値を含む範囲がtrueになるようにする(題意のnotにあたる)\n--- segtreeの上で二分探索をします。leftから大きくなる方向に調べていきます。\n--- O(log(n))\nfunction SegTree:max_right(left, bool_fn_arg_val)\n\tassert(1 <= left and left <= self._.vec_len)\n\tassert(bool_fn_arg_val(self._.init_val_fn()))\n\tlocal operation_fn = self._.operation_fn\n\tlocal vec = self._.vec\n\tlocal len = self._.len\n\n\tleft = left - 1 + len\n\tlocal value = self._.init_val_fn()\n\twhile true do\n\t\twhile left % 2 == 0 do\n\t\t\tleft = left >> 1\n\t\tend\n\t\tif not bool_fn_arg_val(operation_fn(value, vec[left])) then\n\t\t\twhile left < len do\n\t\t\t\tleft = 2 * left\n\t\t\t\tif bool_fn_arg_val(operation_fn(value, vec[left])) then\n\t\t\t\t\tvalue = operation_fn(value, vec[left])\n\t\t\t\t\tleft = left + 1\n\t\t\t\tend\n\t\t\tend\n\t\t\treturn left + 1 - len\n\t\tend\n\t\tvalue = operation_fn(value, vec[left])\n\t\tleft = left + 1\n\n\t\tif (left & -left) == left then\n\t\t\treturn self._.vec_len + 1\n\t\tend\n\tend\nend\n\n--- 1 <= right <= #element_count_or_vec\n--- 関数bool_fn_arg_val(x) -> bool を定義する必要があります。xはvecの値が入ります。\n--- segtreeの上で二分探索をします。\n--- O(log(n))\nfunction SegTree:min_left(right, bool_fn_arg_val)\n\tassert(1 <= right and right <= self._.vec_len)\n\tassert(bool_fn_arg_val(self._.init_val_fn())) --\n\tlocal operation_fn = self._.operation_fn\n\tlocal vec = self._.vec\n\tlocal len = self._.len\n\n\tright = right - 1 + len\n\tlocal value = self._.init_val_fn()\n\twhile true do\n\t\tright = right - 1\n\t\twhile right > 1 and right % 2 == 1 do\n\t\t\tright = right >> 1\n\t\tend\n\t\tif not bool_fn_arg_val(operation_fn(vec[right], value)) then\n\t\t\twhile right < len do\n\t\t\t\tright = 2 * right + 1\n\t\t\t\tif bool_fn_arg_val(operation_fn(vec[right], value)) then\n\t\t\t\t\tvalue = operation_fn(vec[right], value)\n\t\t\t\t\tright = right + 1\n\t\t\t\tend\n\t\t\tend\n\t\t\treturn right - len\n\t\tend\n\t\tvalue = operation_fn(vec[right], value)\n\n\t\tif (right & -right) == right then\n\t\t\treturn 0\n\t\tend\n\tend\nend\n\n--[[------------------------------------------------------------------------]]--\n\nlocal read = io.read\nlocal insert = table.insert\n\nlocal n, q = read(\"n\", \"n\")\nlocal a_t = {}\nfor i = 1, n do\n\ta_t[i] = read(\"n\")\nend\n\nlocal segTree = SegTree.new(\n\tmath.max,\n\tfunction() return -1 end,\n\ta_t\n)\n\nlocal out_t = {}\nfor i = 1, q do\n\tlocal t = read(\"n\")\n\tif t == 1 then\n\t\tlocal x_i, v_i = read(\"n\", \"n\")\n\t\tsegTree:set(x_i, v_i)\n\telseif t == 2 then\n\t\tlocal l_i, r_i = read(\"n\", \"n\")\n\t\tinsert(out_t, segTree:prod(l_i, r_i))\n\telse\n\t\tlocal x_i, v_i = read(\"n\", \"n\")\n\t\tinsert(\n\t\t\tout_t,\n\t\t\tsegTree:max_right(x_i, function(x) return x < v_i end)\n\t\t)\n\tend\nend\n\nprint(table.concat(out_t, \"\\n\"))\n", "language": "Lua", "metadata": {"date": 1599594443, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02567.html", "problem_id": "p02567", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02567/input.txt", "sample_output_relpath": "derived/input_output/data/p02567/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02567/Lua/s199368222.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s199368222", "user_id": "u793881115"}, "prompt_components": {"gold_output": "3\n3\n2\n6\n", "input_to_evaluate": "--[[------------------------------------------------------------------------]]--\n--- `0 <= num <= 1<<61` return minimum non-negative `x` s.t. `n <= 2**x`\nlocal function ceil_pow2(num)\n\tlocal x = 0\n\twhile (1 << x) < num do\n\t\tx = x + 1\n\tend\n\treturn x\nend\n\n--- index >= 1\nlocal function update(_, index)\n\t_.vec[index] = _.operation_fn(\n\t\t_.vec[2 * index], _.vec[2 * index + 1]\n\t)\nend\n\nlocal SegTree ={}\n\n--- 0 <= #element_count_or_vec <= 10^8\n--- (1): 長さelement_count_or_vecの数列vecを作ります。初期値は全部init_val_fn()です。\n--- (2): 長さ#element_count_or_vecの数列vecを作ります。\n--- element_count_or_vecの内容が初期値となります。\n--- O(n)\nfunction SegTree.new(operation_fn, init_val_fn, element_count_or_vec)\n\tif type(element_count_or_vec) == \"number\" then\n\t\tlocal vec = {}\n\t\tfor i = 1, element_count_or_vec do\n\t\t\tvec[i] = init_val_fn()\n\t\tend\n\t\treturn SegTree.new(operation_fn, init_val_fn, vec)\n\tend\n\tassert(\n\t\ttype(element_count_or_vec) == \"table\",\n\t\t\"arg error! need number or table\"\n\t)\n\tlocal vec_len = #element_count_or_vec\n\tlocal log = ceil_pow2(vec_len)\n\tlocal len = 1 << log\n\tlocal vec = {}\n\tlocal _ = {\n\t\tvec_len = vec_len,\n\t\tlog = log,\n\t\tlen = len,\n\t\tvec = vec,\n\t\toperation_fn = operation_fn,\n\t\tinit_val_fn = init_val_fn,\n\t\tupdate = update\n\t}\n\tfor i = 1, 2 * len do\n\t\tvec[i] = init_val_fn()\n\tend\n\tfor i = 1, vec_len do\n\t\tvec[len + i - 1] = element_count_or_vec[i];\n\tend\n\tfor i = len - 1, 1, -1 do\n\t\tupdate(_, i)\n\tend\n\treturn setmetatable({_ = _}, {__index = SegTree})\nend\n\n--- 1 <= index <= #element_count_or_vec\n--- vec[index]にvalueを代入します。\n--- O(log(n))\nfunction SegTree:set(index, value)\n\tassert(1 <= index and index <= self._.vec_len)\n\tindex = index - 1 + self._.len\n\tself._.vec[index] = value\n\tfor i = 1, self._.log do\n\t\tupdate(self._, index >> i)\n\tend\nend\n\n--- 1 <= index <= #element_count_or_vec\n--- vec[index]を返します。\n--- O(1)\nfunction SegTree:get(index)\n\tassert(1 <= index and index <= self._.vec_len)\n\treturn self._.vec[index - 1 + self._.len]\nend\n\n--- 1 <= left <= right <= #element_count_or_vec\n--- operation_fn(vec[left], ..., vec[right])を、\n--- モノイドの性質を満たしていると仮定して計算します。l = r のときはe()を返します。\n--- O(log(n))\nfunction SegTree:prod(left, right)\n\tassert(1 <= left and left <= right and right <= self._.vec_len)\n\tlocal vec = self._.vec\n\tlocal operation_fn = self._.operation_fn\n\n\tlocal operated_left = self._.init_val_fn()\n\tlocal operated_right = self._.init_val_fn()\n\tleft = left - 1 + self._.len\n\tright = right - 1 + self._.len\n\twhile left < right do\n\t\tif left & 1 == 1 then\n\t\t\toperated_left = operation_fn(operated_left, vec[left])\n\t\t\tleft = left + 1\n\t\tend\n\t\tif right & 1 == 1 then\n\t\t\tright = right - 1\n\t\t\toperated_right = operation_fn(vec[right], operated_right)\n\t\tend\n\t\tleft = left >> 1\n\t\tright = right >> 1\n\tend\n\treturn operation_fn(operated_left, operated_right)\nend\n\n--- op(a[1], ..., a[n])を計算します。n = 0のときはinit_val_fn()を返します。\n--- O(1)\nfunction SegTree:all_prod()\n\treturn self._.vec[1]\nend\n\n--- 1 <= left <= #element_count_or_vec\n--- 関数bool_fn_arg_val(x) -> bool を定義する必要があります。xはvecの値が入ります。\n--- init_val_fn()の値を含む範囲がtrueになるようにする(題意のnotにあたる)\n--- segtreeの上で二分探索をします。leftから大きくなる方向に調べていきます。\n--- O(log(n))\nfunction SegTree:max_right(left, bool_fn_arg_val)\n\tassert(1 <= left and left <= self._.vec_len)\n\tassert(bool_fn_arg_val(self._.init_val_fn()))\n\tlocal operation_fn = self._.operation_fn\n\tlocal vec = self._.vec\n\tlocal len = self._.len\n\n\tleft = left - 1 + len\n\tlocal value = self._.init_val_fn()\n\twhile true do\n\t\twhile left % 2 == 0 do\n\t\t\tleft = left >> 1\n\t\tend\n\t\tif not bool_fn_arg_val(operation_fn(value, vec[left])) then\n\t\t\twhile left < len do\n\t\t\t\tleft = 2 * left\n\t\t\t\tif bool_fn_arg_val(operation_fn(value, vec[left])) then\n\t\t\t\t\tvalue = operation_fn(value, vec[left])\n\t\t\t\t\tleft = left + 1\n\t\t\t\tend\n\t\t\tend\n\t\t\treturn left + 1 - len\n\t\tend\n\t\tvalue = operation_fn(value, vec[left])\n\t\tleft = left + 1\n\n\t\tif (left & -left) == left then\n\t\t\treturn self._.vec_len + 1\n\t\tend\n\tend\nend\n\n--- 1 <= right <= #element_count_or_vec\n--- 関数bool_fn_arg_val(x) -> bool を定義する必要があります。xはvecの値が入ります。\n--- segtreeの上で二分探索をします。\n--- O(log(n))\nfunction SegTree:min_left(right, bool_fn_arg_val)\n\tassert(1 <= right and right <= self._.vec_len)\n\tassert(bool_fn_arg_val(self._.init_val_fn())) --\n\tlocal operation_fn = self._.operation_fn\n\tlocal vec = self._.vec\n\tlocal len = self._.len\n\n\tright = right - 1 + len\n\tlocal value = self._.init_val_fn()\n\twhile true do\n\t\tright = right - 1\n\t\twhile right > 1 and right % 2 == 1 do\n\t\t\tright = right >> 1\n\t\tend\n\t\tif not bool_fn_arg_val(operation_fn(vec[right], value)) then\n\t\t\twhile right < len do\n\t\t\t\tright = 2 * right + 1\n\t\t\t\tif bool_fn_arg_val(operation_fn(vec[right], value)) then\n\t\t\t\t\tvalue = operation_fn(vec[right], value)\n\t\t\t\t\tright = right + 1\n\t\t\t\tend\n\t\t\tend\n\t\t\treturn right - len\n\t\tend\n\t\tvalue = operation_fn(vec[right], value)\n\n\t\tif (right & -right) == right then\n\t\t\treturn 0\n\t\tend\n\tend\nend\n\n--[[------------------------------------------------------------------------]]--\n\nlocal read = io.read\nlocal insert = table.insert\n\nlocal n, q = read(\"n\", \"n\")\nlocal a_t = {}\nfor i = 1, n do\n\ta_t[i] = read(\"n\")\nend\n\nlocal segTree = SegTree.new(\n\tmath.max,\n\tfunction() return -1 end,\n\ta_t\n)\n\nlocal out_t = {}\nfor i = 1, q do\n\tlocal t = read(\"n\")\n\tif t == 1 then\n\t\tlocal x_i, v_i = read(\"n\", \"n\")\n\t\tsegTree:set(x_i, v_i)\n\telseif t == 2 then\n\t\tlocal l_i, r_i = read(\"n\", \"n\")\n\t\tinsert(out_t, segTree:prod(l_i, r_i))\n\telse\n\t\tlocal x_i, v_i = read(\"n\", \"n\")\n\t\tinsert(\n\t\t\tout_t,\n\t\t\tsegTree:max_right(x_i, function(x) return x < v_i end)\n\t\t)\n\tend\nend\n\nprint(table.concat(out_t, \"\\n\"))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given an array a_0, a_1, ..., a_{N-1} of length N. Process Q queries of the following types.\n\nThe type of i-th query is represented by T_i.\n\nT_i=1: You are given two integers X_i,V_i. Replace the value of A_{X_i} with V_i.\n\nT_i=2: You are given two integers L_i,R_i. Calculate the maximum value among A_{L_i},A_{L_i+1},\\cdots,A_{R_i}.\n\nT_i=3: You are given two integers X_i,V_i. Calculate the minimum j such that X_i \\leq j \\leq N, V_i \\leq A_j. If there is no such j, answer j=N+1 instead.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq T_i \\leq 3\n\n1 \\leq X_i \\leq N, 0 \\leq V_i \\leq 10^9 (T_i=1,3)\n\n1 \\leq L_i \\leq R_i \\leq N (T_i=2)\n\nAll values in Input are integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nA_1 A_2 \\cdots A_N\nFirst query\nSecond query\n\\vdots\nQ-th query\n\nEach query is given in the following format:\n\nIf T_i=1,3,\n\nT_i X_i V_i\n\nIf T_i=2,\n\nT_i L_i R_i\n\nOutput\n\nFor each query with T_i=2, 3, print the answer.\n\nSample Input 1\n\n5 5\n1 2 3 2 1\n2 1 5\n3 2 3\n1 3 1\n2 2 4\n3 1 3\n\nSample Output 1\n\n3\n3\n2\n6\n\nFirst query: Print 3, which is the maximum of (A_1,A_2,A_3,A_4,A_5)=(1,2,3,2,1).\n\nSecond query: Since 3>A_2, j=2 does not satisfy the condition．Since 3 \\leq A_3, print j=3.\n\nThird query: Replace the value of A_3 with 1. It becomes A=(1,2,1,2,1).\n\nFourth query: Print 2, which is the maximum of (A_2,A_3,A_4)=(2,1,2).\n\nFifth query: Since there is no j that satisfies the condition, print j=N+1=6.", "sample_input": "5 5\n1 2 3 2 1\n2 1 5\n3 2 3\n1 3 1\n2 2 4\n3 1 3\n"}, "reference_outputs": ["3\n3\n2\n6\n"], "source_document_id": "p02567", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given an array a_0, a_1, ..., a_{N-1} of length N. Process Q queries of the following types.\n\nThe type of i-th query is represented by T_i.\n\nT_i=1: You are given two integers X_i,V_i. Replace the value of A_{X_i} with V_i.\n\nT_i=2: You are given two integers L_i,R_i. Calculate the maximum value among A_{L_i},A_{L_i+1},\\cdots,A_{R_i}.\n\nT_i=3: You are given two integers X_i,V_i. Calculate the minimum j such that X_i \\leq j \\leq N, V_i \\leq A_j. If there is no such j, answer j=N+1 instead.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq T_i \\leq 3\n\n1 \\leq X_i \\leq N, 0 \\leq V_i \\leq 10^9 (T_i=1,3)\n\n1 \\leq L_i \\leq R_i \\leq N (T_i=2)\n\nAll values in Input are integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nA_1 A_2 \\cdots A_N\nFirst query\nSecond query\n\\vdots\nQ-th query\n\nEach query is given in the following format:\n\nIf T_i=1,3,\n\nT_i X_i V_i\n\nIf T_i=2,\n\nT_i L_i R_i\n\nOutput\n\nFor each query with T_i=2, 3, print the answer.\n\nSample Input 1\n\n5 5\n1 2 3 2 1\n2 1 5\n3 2 3\n1 3 1\n2 2 4\n3 1 3\n\nSample Output 1\n\n3\n3\n2\n6\n\nFirst query: Print 3, which is the maximum of (A_1,A_2,A_3,A_4,A_5)=(1,2,3,2,1).\n\nSecond query: Since 3>A_2, j=2 does not satisfy the condition．Since 3 \\leq A_3, print j=3.\n\nThird query: Replace the value of A_3 with 1. It becomes A=(1,2,1,2,1).\n\nFourth query: Print 2, which is the maximum of (A_2,A_3,A_4)=(2,1,2).\n\nFifth query: Since there is no j that satisfies the condition, print j=N+1=6.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5912, "cpu_time_ms": 635, "memory_kb": 30012}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s483644280", "group_id": "codeNet:p02570", "input_text": "local d,t,s=io.read(\"n\",\"n\",\"n\")\nprint(s*t>=d and \"Yes\" or \"No\")", "language": "Lua", "metadata": {"date": 1598735174, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s483644280.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s483644280", "user_id": "u045238009"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local d,t,s=io.read(\"n\",\"n\",\"n\")\nprint(s*t>=d and \"Yes\" or \"No\")", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 2676}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s858563351", "group_id": "codeNet:p02571", "input_text": "local s=io.read()\nlocal t=io.read()\nlocal min=math.maxinteger\nfor i=1,#s-#t+1 do\n local ss=s:sub(i,i+#t-1)\n local counter=0\n for j=1,#t do\n if ss:byte(j)~=t:byte(j) then\n counter=counter+1\n end\n end\n min=math.min(counter,min)\nend\nprint(min)", "language": "Lua", "metadata": {"date": 1598735488, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s858563351.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s858563351", "user_id": "u045238009"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local s=io.read()\nlocal t=io.read()\nlocal min=math.maxinteger\nfor i=1,#s-#t+1 do\n local ss=s:sub(i,i+#t-1)\n local counter=0\n for j=1,#t do\n if ss:byte(j)~=t:byte(j) then\n counter=counter+1\n end\n end\n min=math.min(counter,min)\nend\nprint(min)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 49, "memory_kb": 2716}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s842394678", "group_id": "codeNet:p02575", "input_text": "local mmi, mma = math.min, math.max\nlocal h, w = io.read(\"*n\", \"*n\")\nlocal a, b = {}, {}\nfor i = 1, h do\n a[i], b[i] = io.read(\"*n\", \"*n\")\nend\n\nlocal inf = 1000000007\nlocal ret = {}\nfor i = 1, h do\n ret[i] = inf\nend\nlocal task_l, task_r, task_len, task_d = {}, {}, {}, {}\nlocal function addtask(left, right, curlen, deg)\n ret[deg] = mmi(ret[deg], curlen)\n table.insert(task_l, left)\n table.insert(task_r, right)\n table.insert(task_len, curlen)\n table.insert(task_d, deg)\nend\nlocal function addtask_start(left, right, curlen, deg)\n table.insert(task_l, left)\n table.insert(task_r, right)\n table.insert(task_len, curlen)\n table.insert(task_d, deg)\nend\n\nlocal function solve(left, right, curlen, deg)\n deg = deg + 1\n if h < deg then return end\n curlen = curlen + 1\n if a[deg] <= left and right <= b[deg] then\n if b[deg] == w then return end\n curlen = curlen + b[deg] + 1 - right\n addtask(b[deg] + 1, b[deg] + 1, curlen, deg)\n elseif right < a[deg] or b[deg] < left then\n addtask(left, right, curlen, deg)\n else\n if b[deg] < right then\n addtask(b[deg] + 1, right, curlen, deg)\n elseif b[deg] < w then\n curlen = curlen + b[deg] + 1 - right\n addtask(b[deg] + 1, b[deg] + 1, curlen, deg)\n end\n if left < a[deg] then\n addtask(left, a[deg] - 1, curlen, deg)\n end\n end\nend\naddtask_start(1, w, 0, 0)\nwhile 0 < #task_l do\n local left = task_l[#task_l]\n table.remove(task_l)\n local right = task_r[#task_r]\n table.remove(task_r)\n local curlen = task_len[#task_len]\n table.remove(task_len)\n local deg = task_d[#task_d]\n table.remove(task_d)\n solve(left, right, curlen, deg)\nend\nfor i = 1, h do\n if ret[i] == inf then ret[i] = -1 end\nend\nprint(table.concat(ret, \"\\n\"))\n", "language": "Lua", "metadata": {"date": 1598733484, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02575.html", "problem_id": "p02575", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02575/input.txt", "sample_output_relpath": "derived/input_output/data/p02575/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02575/Lua/s842394678.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s842394678", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n3\n6\n-1\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal h, w = io.read(\"*n\", \"*n\")\nlocal a, b = {}, {}\nfor i = 1, h do\n a[i], b[i] = io.read(\"*n\", \"*n\")\nend\n\nlocal inf = 1000000007\nlocal ret = {}\nfor i = 1, h do\n ret[i] = inf\nend\nlocal task_l, task_r, task_len, task_d = {}, {}, {}, {}\nlocal function addtask(left, right, curlen, deg)\n ret[deg] = mmi(ret[deg], curlen)\n table.insert(task_l, left)\n table.insert(task_r, right)\n table.insert(task_len, curlen)\n table.insert(task_d, deg)\nend\nlocal function addtask_start(left, right, curlen, deg)\n table.insert(task_l, left)\n table.insert(task_r, right)\n table.insert(task_len, curlen)\n table.insert(task_d, deg)\nend\n\nlocal function solve(left, right, curlen, deg)\n deg = deg + 1\n if h < deg then return end\n curlen = curlen + 1\n if a[deg] <= left and right <= b[deg] then\n if b[deg] == w then return end\n curlen = curlen + b[deg] + 1 - right\n addtask(b[deg] + 1, b[deg] + 1, curlen, deg)\n elseif right < a[deg] or b[deg] < left then\n addtask(left, right, curlen, deg)\n else\n if b[deg] < right then\n addtask(b[deg] + 1, right, curlen, deg)\n elseif b[deg] < w then\n curlen = curlen + b[deg] + 1 - right\n addtask(b[deg] + 1, b[deg] + 1, curlen, deg)\n end\n if left < a[deg] then\n addtask(left, a[deg] - 1, curlen, deg)\n end\n end\nend\naddtask_start(1, w, 0, 0)\nwhile 0 < #task_l do\n local left = task_l[#task_l]\n table.remove(task_l)\n local right = task_r[#task_r]\n table.remove(task_r)\n local curlen = task_len[#task_len]\n table.remove(task_len)\n local deg = task_d[#task_d]\n table.remove(task_d)\n solve(left, right, curlen, deg)\nend\nfor i = 1, h do\n if ret[i] == inf then ret[i] = -1 end\nend\nprint(table.concat(ret, \"\\n\"))\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere is a grid of squares with H+1 horizontal rows and W vertical columns.\n\nYou will start at one of the squares in the top row and repeat moving one square right or down. However, for each integer i from 1 through H, you cannot move down from the A_i-th, (A_i + 1)-th, \\ldots, B_i-th squares from the left in the i-th row from the top.\n\nFor each integer k from 1 through H, find the minimum number of moves needed to reach one of the squares in the (k+1)-th row from the top. (The starting square can be chosen individually for each case.) If, starting from any square in the top row, none of the squares in the (k+1)-th row can be reached, print -1 instead.\n\nConstraints\n\n1 \\leq H,W \\leq 2\\times 10^5\n\n1 \\leq A_i \\leq B_i \\leq W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_1 B_1\nA_2 B_2\n:\nA_H B_H\n\nOutput\n\nPrint H lines. The i-th line should contain the answer for the case k=i.\n\nSample Input 1\n\n4 4\n2 4\n1 1\n2 3\n2 4\n\nSample Output 1\n\n1\n3\n6\n-1\n\nLet (i,j) denote the square at the i-th row from the top and j-th column from the left.\n\nFor k=1, we need one move such as (1,1) → (2,1).\n\nFor k=2, we need three moves such as (1,1) → (2,1) → (2,2) → (3,2).\n\nFor k=3, we need six moves such as (1,1) → (2,1) → (2,2) → (3,2) → (3,3) → (3,4) → (4,4).\n\nFor k=4, it is impossible to reach any square in the fifth row from the top.", "sample_input": "4 4\n2 4\n1 1\n2 3\n2 4\n"}, "reference_outputs": ["1\n3\n6\n-1\n"], "source_document_id": "p02575", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere is a grid of squares with H+1 horizontal rows and W vertical columns.\n\nYou will start at one of the squares in the top row and repeat moving one square right or down. However, for each integer i from 1 through H, you cannot move down from the A_i-th, (A_i + 1)-th, \\ldots, B_i-th squares from the left in the i-th row from the top.\n\nFor each integer k from 1 through H, find the minimum number of moves needed to reach one of the squares in the (k+1)-th row from the top. (The starting square can be chosen individually for each case.) If, starting from any square in the top row, none of the squares in the (k+1)-th row can be reached, print -1 instead.\n\nConstraints\n\n1 \\leq H,W \\leq 2\\times 10^5\n\n1 \\leq A_i \\leq B_i \\leq W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_1 B_1\nA_2 B_2\n:\nA_H B_H\n\nOutput\n\nPrint H lines. The i-th line should contain the answer for the case k=i.\n\nSample Input 1\n\n4 4\n2 4\n1 1\n2 3\n2 4\n\nSample Output 1\n\n1\n3\n6\n-1\n\nLet (i,j) denote the square at the i-th row from the top and j-th column from the left.\n\nFor k=1, we need one move such as (1,1) → (2,1).\n\nFor k=2, we need three moves such as (1,1) → (2,1) → (2,2) → (3,2).\n\nFor k=3, we need six moves such as (1,1) → (2,1) → (2,2) → (3,2) → (3,3) → (3,4) → (4,4).\n\nFor k=4, it is impossible to reach any square in the fifth row from the top.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1728, "cpu_time_ms": 2206, "memory_kb": 11244}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s797199853", "group_id": "codeNet:p02575", "input_text": "local mmi, mma = math.min, math.max\nlocal h, w = io.read(\"*n\", \"*n\")\nlocal a, b = {}, {}\nfor i = 1, h do\n a[i], b[i] = io.read(\"*n\", \"*n\")\nend\nif a[1] == 1 and b[1] == w then\n for i = 1, h do\n print(-1)\n end\n os.exit()\nend\n\nlocal asked_by_depth = {}\nfor i = 1, h do\n asked_by_depth[i] = {}\nend\nlocal inf = 1000000007\nlocal ret = {}\nfor i = 1, h + 1 do\n ret[i] = inf\nend\nlocal function solve(spos)\n local th = h\n local curpos = spos\n local t = {curpos}\n for i = 1, h do\n if curpos < a[i] or b[i] < curpos then\n else\n if b[i] == w then\n th = i - 1 break\n end\n curpos = b[i] + 1\n end\n t[i + 1] = curpos\n end\n -- print(th, table.concat(t, \" \"))\n for i = th, 1, -1 do\n if curpos < a[i] or b[i] < curpos then\n else\n curpos = a[i] - 1\n end\n end\n spos = curpos\n for i = 1, th do\n if curpos < a[i] or b[i] < curpos then\n else\n curpos = b[i] + 1\n end\n ret[i] = mmi(ret[i], i + curpos - spos)\n end\nend\n\nif 1 < a[1] then\n solve(1)\nend\nif b[1] < w then\n solve(b[1] + 1)\nend\nfor i = 1, h do\n if ret[i] == inf then ret[i] = -1 end\nend\nret[h + 1] = nil\nprint(table.concat(ret, \"\\n\"))\n", "language": "Lua", "metadata": {"date": 1598731143, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02575.html", "problem_id": "p02575", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02575/input.txt", "sample_output_relpath": "derived/input_output/data/p02575/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02575/Lua/s797199853.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s797199853", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n3\n6\n-1\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal h, w = io.read(\"*n\", \"*n\")\nlocal a, b = {}, {}\nfor i = 1, h do\n a[i], b[i] = io.read(\"*n\", \"*n\")\nend\nif a[1] == 1 and b[1] == w then\n for i = 1, h do\n print(-1)\n end\n os.exit()\nend\n\nlocal asked_by_depth = {}\nfor i = 1, h do\n asked_by_depth[i] = {}\nend\nlocal inf = 1000000007\nlocal ret = {}\nfor i = 1, h + 1 do\n ret[i] = inf\nend\nlocal function solve(spos)\n local th = h\n local curpos = spos\n local t = {curpos}\n for i = 1, h do\n if curpos < a[i] or b[i] < curpos then\n else\n if b[i] == w then\n th = i - 1 break\n end\n curpos = b[i] + 1\n end\n t[i + 1] = curpos\n end\n -- print(th, table.concat(t, \" \"))\n for i = th, 1, -1 do\n if curpos < a[i] or b[i] < curpos then\n else\n curpos = a[i] - 1\n end\n end\n spos = curpos\n for i = 1, th do\n if curpos < a[i] or b[i] < curpos then\n else\n curpos = b[i] + 1\n end\n ret[i] = mmi(ret[i], i + curpos - spos)\n end\nend\n\nif 1 < a[1] then\n solve(1)\nend\nif b[1] < w then\n solve(b[1] + 1)\nend\nfor i = 1, h do\n if ret[i] == inf then ret[i] = -1 end\nend\nret[h + 1] = nil\nprint(table.concat(ret, \"\\n\"))\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere is a grid of squares with H+1 horizontal rows and W vertical columns.\n\nYou will start at one of the squares in the top row and repeat moving one square right or down. However, for each integer i from 1 through H, you cannot move down from the A_i-th, (A_i + 1)-th, \\ldots, B_i-th squares from the left in the i-th row from the top.\n\nFor each integer k from 1 through H, find the minimum number of moves needed to reach one of the squares in the (k+1)-th row from the top. (The starting square can be chosen individually for each case.) If, starting from any square in the top row, none of the squares in the (k+1)-th row can be reached, print -1 instead.\n\nConstraints\n\n1 \\leq H,W \\leq 2\\times 10^5\n\n1 \\leq A_i \\leq B_i \\leq W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_1 B_1\nA_2 B_2\n:\nA_H B_H\n\nOutput\n\nPrint H lines. The i-th line should contain the answer for the case k=i.\n\nSample Input 1\n\n4 4\n2 4\n1 1\n2 3\n2 4\n\nSample Output 1\n\n1\n3\n6\n-1\n\nLet (i,j) denote the square at the i-th row from the top and j-th column from the left.\n\nFor k=1, we need one move such as (1,1) → (2,1).\n\nFor k=2, we need three moves such as (1,1) → (2,1) → (2,2) → (3,2).\n\nFor k=3, we need six moves such as (1,1) → (2,1) → (2,2) → (3,2) → (3,3) → (3,4) → (4,4).\n\nFor k=4, it is impossible to reach any square in the fifth row from the top.", "sample_input": "4 4\n2 4\n1 1\n2 3\n2 4\n"}, "reference_outputs": ["1\n3\n6\n-1\n"], "source_document_id": "p02575", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere is a grid of squares with H+1 horizontal rows and W vertical columns.\n\nYou will start at one of the squares in the top row and repeat moving one square right or down. However, for each integer i from 1 through H, you cannot move down from the A_i-th, (A_i + 1)-th, \\ldots, B_i-th squares from the left in the i-th row from the top.\n\nFor each integer k from 1 through H, find the minimum number of moves needed to reach one of the squares in the (k+1)-th row from the top. (The starting square can be chosen individually for each case.) If, starting from any square in the top row, none of the squares in the (k+1)-th row can be reached, print -1 instead.\n\nConstraints\n\n1 \\leq H,W \\leq 2\\times 10^5\n\n1 \\leq A_i \\leq B_i \\leq W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_1 B_1\nA_2 B_2\n:\nA_H B_H\n\nOutput\n\nPrint H lines. The i-th line should contain the answer for the case k=i.\n\nSample Input 1\n\n4 4\n2 4\n1 1\n2 3\n2 4\n\nSample Output 1\n\n1\n3\n6\n-1\n\nLet (i,j) denote the square at the i-th row from the top and j-th column from the left.\n\nFor k=1, we need one move such as (1,1) → (2,1).\n\nFor k=2, we need three moves such as (1,1) → (2,1) → (2,2) → (3,2).\n\nFor k=3, we need six moves such as (1,1) → (2,1) → (2,2) → (3,2) → (3,3) → (3,4) → (4,4).\n\nFor k=4, it is impossible to reach any square in the fifth row from the top.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1156, "cpu_time_ms": 122, "memory_kb": 25140}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s764303606", "group_id": "codeNet:p02576", "input_text": "local n, x, t = io.read(\"n\", \"n\", \"n\")\n\nprint((n % x ==0) and n // x * t or n // x * t + t)\n", "language": "Lua", "metadata": {"date": 1598123037, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s764303606.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s764303606", "user_id": "u793881115"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "local n, x, t = io.read(\"n\", \"n\", \"n\")\n\nprint((n % x ==0) and n // x * t or n // x * t + t)\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 92, "cpu_time_ms": 7, "memory_kb": 2676}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s375388675", "group_id": "codeNet:p02578", "input_text": "local n=io.read(\"n\")\nlocal prev=io.read(\"n\")\nlocal total=0\nfor i=2,n do\n local cur=io.read(\"n\")\n total=total+(prev>cur and prev-cur or 0)\n prev=(prev>cur and prev or cur)\nend\nprint(total)", "language": "Lua", "metadata": {"date": 1598199017, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02578.html", "problem_id": "p02578", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02578/input.txt", "sample_output_relpath": "derived/input_output/data/p02578/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02578/Lua/s375388675.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s375388675", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal prev=io.read(\"n\")\nlocal total=0\nfor i=2,n do\n local cur=io.read(\"n\")\n total=total+(prev>cur and prev-cur or 0)\n prev=(prev>cur and prev or cur)\nend\nprint(total)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nN persons are standing in a row. The height of the i-th person from the front is A_i.\n\nWe want to have each person stand on a stool of some heights - at least zero - so that the following condition is satisfied for every person:\n\nCondition: Nobody in front of the person is taller than the person. Here, the height of a person includes the stool.\n\nFind the minimum total height of the stools needed to meet this goal.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint the minimum total height of the stools needed to meet the goal.\n\nSample Input 1\n\n5\n2 1 5 4 3\n\nSample Output 1\n\n4\n\nIf the persons stand on stools of heights 0, 1, 0, 1, and 2, respectively, their heights will be 2, 2, 5, 5, and 5, satisfying the condition.\n\nWe cannot meet the goal with a smaller total height of the stools.\n\nSample Input 2\n\n5\n3 3 3 3 3\n\nSample Output 2\n\n0\n\nGiving a stool of height 0 to everyone will work.", "sample_input": "5\n2 1 5 4 3\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02578", "source_text": "Score : 300 points\n\nProblem Statement\n\nN persons are standing in a row. The height of the i-th person from the front is A_i.\n\nWe want to have each person stand on a stool of some heights - at least zero - so that the following condition is satisfied for every person:\n\nCondition: Nobody in front of the person is taller than the person. Here, the height of a person includes the stool.\n\nFind the minimum total height of the stools needed to meet this goal.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint the minimum total height of the stools needed to meet the goal.\n\nSample Input 1\n\n5\n2 1 5 4 3\n\nSample Output 1\n\n4\n\nIf the persons stand on stools of heights 0, 1, 0, 1, and 2, respectively, their heights will be 2, 2, 5, 5, and 5, satisfying the condition.\n\nWe cannot meet the goal with a smaller total height of the stools.\n\nSample Input 2\n\n5\n3 3 3 3 3\n\nSample Output 2\n\n0\n\nGiving a stool of height 0 to everyone will work.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 196, "cpu_time_ms": 55, "memory_kb": 2780}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s672097886", "group_id": "codeNet:p02578", "input_text": "local n=io.read(\"n\")\nlocal prev=io.read(\"n\")\nlocal total=0\nfor i=2,n do\n local cur=io.read(\"n\")\n total=total+(prev>cur and prev-cur or 0)\n prev=cur\nend\nprint(total)", "language": "Lua", "metadata": {"date": 1598198960, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02578.html", "problem_id": "p02578", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02578/input.txt", "sample_output_relpath": "derived/input_output/data/p02578/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02578/Lua/s672097886.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s672097886", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal prev=io.read(\"n\")\nlocal total=0\nfor i=2,n do\n local cur=io.read(\"n\")\n total=total+(prev>cur and prev-cur or 0)\n prev=cur\nend\nprint(total)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nN persons are standing in a row. The height of the i-th person from the front is A_i.\n\nWe want to have each person stand on a stool of some heights - at least zero - so that the following condition is satisfied for every person:\n\nCondition: Nobody in front of the person is taller than the person. Here, the height of a person includes the stool.\n\nFind the minimum total height of the stools needed to meet this goal.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint the minimum total height of the stools needed to meet the goal.\n\nSample Input 1\n\n5\n2 1 5 4 3\n\nSample Output 1\n\n4\n\nIf the persons stand on stools of heights 0, 1, 0, 1, and 2, respectively, their heights will be 2, 2, 5, 5, and 5, satisfying the condition.\n\nWe cannot meet the goal with a smaller total height of the stools.\n\nSample Input 2\n\n5\n3 3 3 3 3\n\nSample Output 2\n\n0\n\nGiving a stool of height 0 to everyone will work.", "sample_input": "5\n2 1 5 4 3\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02578", "source_text": "Score : 300 points\n\nProblem Statement\n\nN persons are standing in a row. The height of the i-th person from the front is A_i.\n\nWe want to have each person stand on a stool of some heights - at least zero - so that the following condition is satisfied for every person:\n\nCondition: Nobody in front of the person is taller than the person. Here, the height of a person includes the stool.\n\nFind the minimum total height of the stools needed to meet this goal.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint the minimum total height of the stools needed to meet the goal.\n\nSample Input 1\n\n5\n2 1 5 4 3\n\nSample Output 1\n\n4\n\nIf the persons stand on stools of heights 0, 1, 0, 1, and 2, respectively, their heights will be 2, 2, 5, 5, and 5, satisfying the condition.\n\nWe cannot meet the goal with a smaller total height of the stools.\n\nSample Input 2\n\n5\n3 3 3 3 3\n\nSample Output 2\n\n0\n\nGiving a stool of height 0 to everyone will work.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 173, "cpu_time_ms": 51, "memory_kb": 2728}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s109014752", "group_id": "codeNet:p02578", "input_text": "local n=io.read(\"n\")\nlocal prev=io.read(\"n\")\nlocal total=0\nfor i=2,n do\n local cur=io.read(\"n\")\n total=total+(prev-cur)\n prev=cur\nend\nprint(total)", "language": "Lua", "metadata": {"date": 1598198900, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02578.html", "problem_id": "p02578", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02578/input.txt", "sample_output_relpath": "derived/input_output/data/p02578/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02578/Lua/s109014752.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s109014752", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal prev=io.read(\"n\")\nlocal total=0\nfor i=2,n do\n local cur=io.read(\"n\")\n total=total+(prev-cur)\n prev=cur\nend\nprint(total)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nN persons are standing in a row. The height of the i-th person from the front is A_i.\n\nWe want to have each person stand on a stool of some heights - at least zero - so that the following condition is satisfied for every person:\n\nCondition: Nobody in front of the person is taller than the person. Here, the height of a person includes the stool.\n\nFind the minimum total height of the stools needed to meet this goal.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint the minimum total height of the stools needed to meet the goal.\n\nSample Input 1\n\n5\n2 1 5 4 3\n\nSample Output 1\n\n4\n\nIf the persons stand on stools of heights 0, 1, 0, 1, and 2, respectively, their heights will be 2, 2, 5, 5, and 5, satisfying the condition.\n\nWe cannot meet the goal with a smaller total height of the stools.\n\nSample Input 2\n\n5\n3 3 3 3 3\n\nSample Output 2\n\n0\n\nGiving a stool of height 0 to everyone will work.", "sample_input": "5\n2 1 5 4 3\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02578", "source_text": "Score : 300 points\n\nProblem Statement\n\nN persons are standing in a row. The height of the i-th person from the front is A_i.\n\nWe want to have each person stand on a stool of some heights - at least zero - so that the following condition is satisfied for every person:\n\nCondition: Nobody in front of the person is taller than the person. Here, the height of a person includes the stool.\n\nFind the minimum total height of the stools needed to meet this goal.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint the minimum total height of the stools needed to meet the goal.\n\nSample Input 1\n\n5\n2 1 5 4 3\n\nSample Output 1\n\n4\n\nIf the persons stand on stools of heights 0, 1, 0, 1, and 2, respectively, their heights will be 2, 2, 5, 5, and 5, satisfying the condition.\n\nWe cannot meet the goal with a smaller total height of the stools.\n\nSample Input 2\n\n5\n3 3 3 3 3\n\nSample Output 2\n\n0\n\nGiving a stool of height 0 to everyone will work.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 155, "cpu_time_ms": 51, "memory_kb": 2752}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s962901071", "group_id": "codeNet:p02579", "input_text": "local mfl, mce = math.floor, math.ceil\nlocal mmi, mma = math.min, math.max\nlocal pow2 = {1}\nfor i = 2, 28 do pow2[i] = pow2[i - 1] * 2 end\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n local cnt = pow2[i]\n for j = 0, cnt - 1 do\n self.stage[cnt + j] = self.func(self.stage[(cnt + j) * 2], self.stage[(cnt + j) * 2 + 1])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.stage = {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n end\n self.stagenum = stagenum\n for i = 1, mul * 2 - 1 do self.stage[i] = emptyvalue end\n for i = 1, n do self.stage[mul + i - 1] = i end\n self:updateAll()\nend\nSegTree.update = function(self, idx)\n idx = idx + pow2[self.stagenum] - 1\n for i = self.stagenum - 1, 1, -1 do\n local dst = mfl(idx / 2)\n local rem = dst * 4 + 1 - idx\n self.stage[dst] = self.func(self.stage[idx], self.stage[rem])\n idx = dst\n end\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal h, w = io.read(\"*n\", \"*n\", \"*l\")\nlocal sh, sw = io.read(\"*n\", \"*n\", \"*l\")\nlocal th, tw = io.read(\"*n\", \"*n\", \"*l\")\nlocal dot = string.byte(\".\")\nlocal map = {}\nlocal len = {}\nlocal asked = {}\nlocal inf = 1000000007\nfor i = 1, h do\n local s = io.read()\n for j = 1, w do\n local idx = (i - 1) * w + j\n map[idx] = s:byte(j) == dot\n len[idx] = inf\n asked[idx] = false\n end\nend\nlocal n = h * w\nasked[n + 1] = true\nlen[(sh - 1) * w + sw] = 0\n\nlocal function mergefunc(x, y)\n if asked[x] then return y\n elseif asked[y] then return x\n else\n return len[x] < len[y] and x or y\n end\nend\n\nlocal st = SegTree.new(n, mergefunc, n + 1)\n\nlocal function walk(src, dst, cost)\n if map[dst] then\n if len[src] + cost < len[dst] then\n len[dst] = len[src] + cost\n st:update(dst)\n end\n end\nend\n\nfor i = 1, n do\n local src = st.stage[1]\n if asked[src] then break end\n asked[src] = true\n st:update(src)\n local src_h = mce(src / w)\n local src_w = src - (src_h - 1) * w\n do\n if 2 < src_h then walk(src, src - 2 * w, 1) end\n if 1 < src_h then walk(src, src - w, 0) end\n if src_h < h then walk(src, src + w, 0) end\n if src_h < h - 1 then walk(src, src + 2 * w, 1) end\n end\n if 1 < src_w then\n walk(src, src - 1, 0)\n if 2 < src_h then walk(src, src - 1 - 2 * w, 1) end\n if 1 < src_h then walk(src, src - 1 - w, 1) end\n if src_h < h then walk(src, src - 1 + w, 1) end\n if src_h < h - 1 then walk(src, src - 1 + 2 * w, 1) end\n end\n if src_w < w then\n walk(src, src + 1, 0)\n if 2 < src_h then walk(src, src + 1 - 2 * w, 1) end\n if 1 < src_h then walk(src, src + 1 - w, 1) end\n if src_h < h then walk(src, src + 1 + w, 1) end\n if src_h < h - 1 then walk(src, src + 1 + 2 * w, 1) end\n end\n if 2 < src_w then\n walk(src, src - 2, 1)\n if 2 < src_h then walk(src, src - 2 - 2 * w, 1) end\n if 1 < src_h then walk(src, src - 2 - w, 1) end\n if src_h < h then walk(src, src - 2 + w, 1) end\n if src_h < h - 1 then walk(src, src - 2 + 2 * w, 1) end\n end\n if src_w < w - 1 then\n walk(src, src + 2, 1)\n if 2 < src_h then walk(src, src + 2 - 2 * w, 1) end\n if 1 < src_h then walk(src, src + 2 - w, 1) end\n if src_h < h then walk(src, src + 2 + w, 1) end\n if src_h < h - 1 then walk(src, src + 2 + 2 * w, 1) end\n end\nend\n\nlocal ret = len[(th - 1) * w + tw]\nprint(ret < inf and ret or -1)\n", "language": "Lua", "metadata": {"date": 1598513132, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02579.html", "problem_id": "p02579", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02579/input.txt", "sample_output_relpath": "derived/input_output/data/p02579/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02579/Lua/s962901071.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s962901071", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local mfl, mce = math.floor, math.ceil\nlocal mmi, mma = math.min, math.max\nlocal pow2 = {1}\nfor i = 2, 28 do pow2[i] = pow2[i - 1] * 2 end\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n local cnt = pow2[i]\n for j = 0, cnt - 1 do\n self.stage[cnt + j] = self.func(self.stage[(cnt + j) * 2], self.stage[(cnt + j) * 2 + 1])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.stage = {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n end\n self.stagenum = stagenum\n for i = 1, mul * 2 - 1 do self.stage[i] = emptyvalue end\n for i = 1, n do self.stage[mul + i - 1] = i end\n self:updateAll()\nend\nSegTree.update = function(self, idx)\n idx = idx + pow2[self.stagenum] - 1\n for i = self.stagenum - 1, 1, -1 do\n local dst = mfl(idx / 2)\n local rem = dst * 4 + 1 - idx\n self.stage[dst] = self.func(self.stage[idx], self.stage[rem])\n idx = dst\n end\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal h, w = io.read(\"*n\", \"*n\", \"*l\")\nlocal sh, sw = io.read(\"*n\", \"*n\", \"*l\")\nlocal th, tw = io.read(\"*n\", \"*n\", \"*l\")\nlocal dot = string.byte(\".\")\nlocal map = {}\nlocal len = {}\nlocal asked = {}\nlocal inf = 1000000007\nfor i = 1, h do\n local s = io.read()\n for j = 1, w do\n local idx = (i - 1) * w + j\n map[idx] = s:byte(j) == dot\n len[idx] = inf\n asked[idx] = false\n end\nend\nlocal n = h * w\nasked[n + 1] = true\nlen[(sh - 1) * w + sw] = 0\n\nlocal function mergefunc(x, y)\n if asked[x] then return y\n elseif asked[y] then return x\n else\n return len[x] < len[y] and x or y\n end\nend\n\nlocal st = SegTree.new(n, mergefunc, n + 1)\n\nlocal function walk(src, dst, cost)\n if map[dst] then\n if len[src] + cost < len[dst] then\n len[dst] = len[src] + cost\n st:update(dst)\n end\n end\nend\n\nfor i = 1, n do\n local src = st.stage[1]\n if asked[src] then break end\n asked[src] = true\n st:update(src)\n local src_h = mce(src / w)\n local src_w = src - (src_h - 1) * w\n do\n if 2 < src_h then walk(src, src - 2 * w, 1) end\n if 1 < src_h then walk(src, src - w, 0) end\n if src_h < h then walk(src, src + w, 0) end\n if src_h < h - 1 then walk(src, src + 2 * w, 1) end\n end\n if 1 < src_w then\n walk(src, src - 1, 0)\n if 2 < src_h then walk(src, src - 1 - 2 * w, 1) end\n if 1 < src_h then walk(src, src - 1 - w, 1) end\n if src_h < h then walk(src, src - 1 + w, 1) end\n if src_h < h - 1 then walk(src, src - 1 + 2 * w, 1) end\n end\n if src_w < w then\n walk(src, src + 1, 0)\n if 2 < src_h then walk(src, src + 1 - 2 * w, 1) end\n if 1 < src_h then walk(src, src + 1 - w, 1) end\n if src_h < h then walk(src, src + 1 + w, 1) end\n if src_h < h - 1 then walk(src, src + 1 + 2 * w, 1) end\n end\n if 2 < src_w then\n walk(src, src - 2, 1)\n if 2 < src_h then walk(src, src - 2 - 2 * w, 1) end\n if 1 < src_h then walk(src, src - 2 - w, 1) end\n if src_h < h then walk(src, src - 2 + w, 1) end\n if src_h < h - 1 then walk(src, src - 2 + 2 * w, 1) end\n end\n if src_w < w - 1 then\n walk(src, src + 2, 1)\n if 2 < src_h then walk(src, src + 2 - 2 * w, 1) end\n if 1 < src_h then walk(src, src + 2 - w, 1) end\n if src_h < h then walk(src, src + 2 + w, 1) end\n if src_h < h - 1 then walk(src, src + 2 + 2 * w, 1) end\n end\nend\n\nlocal ret = len[(th - 1) * w + tw]\nprint(ret < inf and ret or -1)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nA maze is composed of a grid of H \\times W squares - H vertical, W horizontal.\n\nThe square at the i-th row from the top and the j-th column from the left - (i,j) - is a wall if S_{ij} is # and a road if S_{ij} is ..\n\nThere is a magician in (C_h,C_w). He can do the following two kinds of moves:\n\nMove A: Walk to a road square that is vertically or horizontally adjacent to the square he is currently in.\n\nMove B: Use magic to warp himself to a road square in the 5\\times 5 area centered at the square he is currently in.\n\nIn either case, he cannot go out of the maze.\n\nAt least how many times does he need to use the magic to reach (D_h, D_w)?\n\nConstraints\n\n1 \\leq H,W \\leq 10^3\n\n1 \\leq C_h,D_h \\leq H\n\n1 \\leq C_w,D_w \\leq W\n\nS_{ij} is # or ..\n\nS_{C_h C_w} and S_{D_h D_w} are ..\n\n(C_h,C_w) \\neq (D_h,D_w)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nC_h C_w\nD_h D_w\nS_{11}\\ldots S_{1W}\n\\vdots\nS_{H1}\\ldots S_{HW}\n\nOutput\n\nPrint the minimum number of times the magician needs to use the magic. If he cannot reach (D_h,D_w), print -1 instead.\n\nSample Input 1\n\n4 4\n1 1\n4 4\n..#.\n..#.\n.#..\n.#..\n\nSample Output 1\n\n1\n\nFor example, by walking to (2,2) and then using the magic to travel to (4,4), just one use of magic is enough.\n\nNote that he cannot walk diagonally.\n\nSample Input 2\n\n4 4\n1 4\n4 1\n.##.\n####\n####\n.##.\n\nSample Output 2\n\n-1\n\nHe cannot move from there.\n\nSample Input 3\n\n4 4\n2 2\n3 3\n....\n....\n....\n....\n\nSample Output 3\n\n0\n\nNo use of magic is needed.\n\nSample Input 4\n\n4 5\n1 2\n2 5\n#.###\n####.\n#..##\n#..##\n\nSample Output 4\n\n2", "sample_input": "4 4\n1 1\n4 4\n..#.\n..#.\n.#..\n.#..\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02579", "source_text": "Score : 400 points\n\nProblem Statement\n\nA maze is composed of a grid of H \\times W squares - H vertical, W horizontal.\n\nThe square at the i-th row from the top and the j-th column from the left - (i,j) - is a wall if S_{ij} is # and a road if S_{ij} is ..\n\nThere is a magician in (C_h,C_w). He can do the following two kinds of moves:\n\nMove A: Walk to a road square that is vertically or horizontally adjacent to the square he is currently in.\n\nMove B: Use magic to warp himself to a road square in the 5\\times 5 area centered at the square he is currently in.\n\nIn either case, he cannot go out of the maze.\n\nAt least how many times does he need to use the magic to reach (D_h, D_w)?\n\nConstraints\n\n1 \\leq H,W \\leq 10^3\n\n1 \\leq C_h,D_h \\leq H\n\n1 \\leq C_w,D_w \\leq W\n\nS_{ij} is # or ..\n\nS_{C_h C_w} and S_{D_h D_w} are ..\n\n(C_h,C_w) \\neq (D_h,D_w)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nC_h C_w\nD_h D_w\nS_{11}\\ldots S_{1W}\n\\vdots\nS_{H1}\\ldots S_{HW}\n\nOutput\n\nPrint the minimum number of times the magician needs to use the magic. If he cannot reach (D_h,D_w), print -1 instead.\n\nSample Input 1\n\n4 4\n1 1\n4 4\n..#.\n..#.\n.#..\n.#..\n\nSample Output 1\n\n1\n\nFor example, by walking to (2,2) and then using the magic to travel to (4,4), just one use of magic is enough.\n\nNote that he cannot walk diagonally.\n\nSample Input 2\n\n4 4\n1 4\n4 1\n.##.\n####\n####\n.##.\n\nSample Output 2\n\n-1\n\nHe cannot move from there.\n\nSample Input 3\n\n4 4\n2 2\n3 3\n....\n....\n....\n....\n\nSample Output 3\n\n0\n\nNo use of magic is needed.\n\nSample Input 4\n\n4 5\n1 2\n2 5\n#.###\n####.\n#..##\n#..##\n\nSample Output 4\n\n2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3559, "cpu_time_ms": 2207, "memory_kb": 62736}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s466103246", "group_id": "codeNet:p02579", "input_text": "local mfl, mce = math.floor, math.ceil\nlocal mmi, mma = math.min, math.max\nlocal pow2 = {1}\nfor i = 2, 28 do pow2[i] = pow2[i - 1] * 2 end\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n local cnt = pow2[i]\n for j = 0, cnt - 1 do\n self.stage[cnt + j] = self.func(self.stage[(cnt + j) * 2], self.stage[(cnt + j) * 2 + 1])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.stage = {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n end\n self.stagenum = stagenum\n for i = 1, mul * 2 - 1 do self.stage[i] = emptyvalue end\n for i = 1, n do self.stage[mul + i - 1] = i end\n self:updateAll()\nend\nSegTree.update = function(self, idx)\n idx = idx + pow2[self.stagenum] - 1\n for i = self.stagenum - 1, 1, -1 do\n local dst = mfl(idx / 2)\n local rem = dst * 4 + 1 - idx\n self.stage[dst] = self.func(self.stage[idx], self.stage[rem])\n idx = dst\n end\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal h, w = io.read(\"*n\", \"*n\", \"*l\")\nlocal sh, sw = io.read(\"*n\", \"*n\", \"*l\")\nlocal th, tw = io.read(\"*n\", \"*n\", \"*l\")\nlocal dot = string.byte(\".\")\nlocal map = {}\nlocal len = {}\nlocal asked = {}\nlocal inf = 1000000007\nfor i = 1, h do\n local s = io.read()\n for j = 1, w do\n local idx = (i - 1) * w + j\n map[idx] = s:byte(j) == dot\n len[idx] = inf\n asked[idx] = false\n end\nend\nlocal n = h * w\nasked[n + 1] = true\nlen[(sh - 1) * w + sw] = 0\n\nlocal function mergefunc(x, y)\n if asked[x] then return y\n elseif asked[y] then return x\n else\n return len[x] < len[y] and x or y\n end\nend\n\nlocal st = SegTree.new(n, mergefunc, n + 1)\n\nlocal function walk(src, dst, cost)\n if map[dst] then\n if len[src] + cost < len[dst] then\n len[dst] = len[src] + cost\n st:update(dst)\n end\n end\nend\n\nfor i = 1, n do\n local src = st.stage[1]\n if asked[src] then break end\n asked[src] = true\n st:update(src)\n local src_h = mce(src / w)\n local src_w = src - (src_h - 1) * w\n do\n if 2 < src_h then walk(src, src - 2 * w, 1) end\n if 1 < src_h then walk(src, src - w, 0) end\n if src_h < h then walk(src, src + w, 0) end\n if src_h < h - 1 then walk(src, src + 2 * w, 1) end\n end\n if 1 < src_w then\n walk(src, src - 1, 0)\n if 2 < src_h then walk(src, src - 1 - 2 * w, 1) end\n if 1 < src_h then walk(src, src - 1 - w, 1) end\n if src_h < h then walk(src, src - 1 + w, 1) end\n if src_h < h - 1 then walk(src, src - 1 + 2 * w, 1) end\n end\n if src_w < w then\n walk(src, src + 1, 0)\n if 2 < src_h then walk(src, src + 1 - 2 * w, 1) end\n if 1 < src_h then walk(src, src + 1 - w, 1) end\n if src_h < h then walk(src, src + 1 + w, 1) end\n if src_h < h - 1 then walk(src, src - 1 + 2 * w, 1) end\n end\n if 2 < src_w then\n walk(src, src - 2, 1)\n if 2 < src_h then walk(src, src - 2 - 2 * w, 1) end\n if 1 < src_h then walk(src, src - 2 - w, 1) end\n if src_h < h then walk(src, src - 2 + w, 1) end\n if src_h < h - 1 then walk(src, src - 2 + 2 * w, 1) end\n end\n if src_w < w - 1 then\n walk(src, src + 2, 1)\n if 2 < src_h then walk(src, src + 2 - 2 * w, 1) end\n if 1 < src_h then walk(src, src + 2 - w, 1) end\n if src_h < h then walk(src, src + 2 + w, 1) end\n if src_h < h - 1 then walk(src, src + 2 + 2 * w, 1) end\n end\nend\n\nlocal ret = len[(th - 1) * w + tw]\nprint(ret < inf and ret or -1)\n", "language": "Lua", "metadata": {"date": 1598512797, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02579.html", "problem_id": "p02579", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02579/input.txt", "sample_output_relpath": "derived/input_output/data/p02579/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02579/Lua/s466103246.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s466103246", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local mfl, mce = math.floor, math.ceil\nlocal mmi, mma = math.min, math.max\nlocal pow2 = {1}\nfor i = 2, 28 do pow2[i] = pow2[i - 1] * 2 end\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n local cnt = pow2[i]\n for j = 0, cnt - 1 do\n self.stage[cnt + j] = self.func(self.stage[(cnt + j) * 2], self.stage[(cnt + j) * 2 + 1])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.stage = {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n end\n self.stagenum = stagenum\n for i = 1, mul * 2 - 1 do self.stage[i] = emptyvalue end\n for i = 1, n do self.stage[mul + i - 1] = i end\n self:updateAll()\nend\nSegTree.update = function(self, idx)\n idx = idx + pow2[self.stagenum] - 1\n for i = self.stagenum - 1, 1, -1 do\n local dst = mfl(idx / 2)\n local rem = dst * 4 + 1 - idx\n self.stage[dst] = self.func(self.stage[idx], self.stage[rem])\n idx = dst\n end\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal h, w = io.read(\"*n\", \"*n\", \"*l\")\nlocal sh, sw = io.read(\"*n\", \"*n\", \"*l\")\nlocal th, tw = io.read(\"*n\", \"*n\", \"*l\")\nlocal dot = string.byte(\".\")\nlocal map = {}\nlocal len = {}\nlocal asked = {}\nlocal inf = 1000000007\nfor i = 1, h do\n local s = io.read()\n for j = 1, w do\n local idx = (i - 1) * w + j\n map[idx] = s:byte(j) == dot\n len[idx] = inf\n asked[idx] = false\n end\nend\nlocal n = h * w\nasked[n + 1] = true\nlen[(sh - 1) * w + sw] = 0\n\nlocal function mergefunc(x, y)\n if asked[x] then return y\n elseif asked[y] then return x\n else\n return len[x] < len[y] and x or y\n end\nend\n\nlocal st = SegTree.new(n, mergefunc, n + 1)\n\nlocal function walk(src, dst, cost)\n if map[dst] then\n if len[src] + cost < len[dst] then\n len[dst] = len[src] + cost\n st:update(dst)\n end\n end\nend\n\nfor i = 1, n do\n local src = st.stage[1]\n if asked[src] then break end\n asked[src] = true\n st:update(src)\n local src_h = mce(src / w)\n local src_w = src - (src_h - 1) * w\n do\n if 2 < src_h then walk(src, src - 2 * w, 1) end\n if 1 < src_h then walk(src, src - w, 0) end\n if src_h < h then walk(src, src + w, 0) end\n if src_h < h - 1 then walk(src, src + 2 * w, 1) end\n end\n if 1 < src_w then\n walk(src, src - 1, 0)\n if 2 < src_h then walk(src, src - 1 - 2 * w, 1) end\n if 1 < src_h then walk(src, src - 1 - w, 1) end\n if src_h < h then walk(src, src - 1 + w, 1) end\n if src_h < h - 1 then walk(src, src - 1 + 2 * w, 1) end\n end\n if src_w < w then\n walk(src, src + 1, 0)\n if 2 < src_h then walk(src, src + 1 - 2 * w, 1) end\n if 1 < src_h then walk(src, src + 1 - w, 1) end\n if src_h < h then walk(src, src + 1 + w, 1) end\n if src_h < h - 1 then walk(src, src - 1 + 2 * w, 1) end\n end\n if 2 < src_w then\n walk(src, src - 2, 1)\n if 2 < src_h then walk(src, src - 2 - 2 * w, 1) end\n if 1 < src_h then walk(src, src - 2 - w, 1) end\n if src_h < h then walk(src, src - 2 + w, 1) end\n if src_h < h - 1 then walk(src, src - 2 + 2 * w, 1) end\n end\n if src_w < w - 1 then\n walk(src, src + 2, 1)\n if 2 < src_h then walk(src, src + 2 - 2 * w, 1) end\n if 1 < src_h then walk(src, src + 2 - w, 1) end\n if src_h < h then walk(src, src + 2 + w, 1) end\n if src_h < h - 1 then walk(src, src + 2 + 2 * w, 1) end\n end\nend\n\nlocal ret = len[(th - 1) * w + tw]\nprint(ret < inf and ret or -1)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nA maze is composed of a grid of H \\times W squares - H vertical, W horizontal.\n\nThe square at the i-th row from the top and the j-th column from the left - (i,j) - is a wall if S_{ij} is # and a road if S_{ij} is ..\n\nThere is a magician in (C_h,C_w). He can do the following two kinds of moves:\n\nMove A: Walk to a road square that is vertically or horizontally adjacent to the square he is currently in.\n\nMove B: Use magic to warp himself to a road square in the 5\\times 5 area centered at the square he is currently in.\n\nIn either case, he cannot go out of the maze.\n\nAt least how many times does he need to use the magic to reach (D_h, D_w)?\n\nConstraints\n\n1 \\leq H,W \\leq 10^3\n\n1 \\leq C_h,D_h \\leq H\n\n1 \\leq C_w,D_w \\leq W\n\nS_{ij} is # or ..\n\nS_{C_h C_w} and S_{D_h D_w} are ..\n\n(C_h,C_w) \\neq (D_h,D_w)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nC_h C_w\nD_h D_w\nS_{11}\\ldots S_{1W}\n\\vdots\nS_{H1}\\ldots S_{HW}\n\nOutput\n\nPrint the minimum number of times the magician needs to use the magic. If he cannot reach (D_h,D_w), print -1 instead.\n\nSample Input 1\n\n4 4\n1 1\n4 4\n..#.\n..#.\n.#..\n.#..\n\nSample Output 1\n\n1\n\nFor example, by walking to (2,2) and then using the magic to travel to (4,4), just one use of magic is enough.\n\nNote that he cannot walk diagonally.\n\nSample Input 2\n\n4 4\n1 4\n4 1\n.##.\n####\n####\n.##.\n\nSample Output 2\n\n-1\n\nHe cannot move from there.\n\nSample Input 3\n\n4 4\n2 2\n3 3\n....\n....\n....\n....\n\nSample Output 3\n\n0\n\nNo use of magic is needed.\n\nSample Input 4\n\n4 5\n1 2\n2 5\n#.###\n####.\n#..##\n#..##\n\nSample Output 4\n\n2", "sample_input": "4 4\n1 1\n4 4\n..#.\n..#.\n.#..\n.#..\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02579", "source_text": "Score : 400 points\n\nProblem Statement\n\nA maze is composed of a grid of H \\times W squares - H vertical, W horizontal.\n\nThe square at the i-th row from the top and the j-th column from the left - (i,j) - is a wall if S_{ij} is # and a road if S_{ij} is ..\n\nThere is a magician in (C_h,C_w). He can do the following two kinds of moves:\n\nMove A: Walk to a road square that is vertically or horizontally adjacent to the square he is currently in.\n\nMove B: Use magic to warp himself to a road square in the 5\\times 5 area centered at the square he is currently in.\n\nIn either case, he cannot go out of the maze.\n\nAt least how many times does he need to use the magic to reach (D_h, D_w)?\n\nConstraints\n\n1 \\leq H,W \\leq 10^3\n\n1 \\leq C_h,D_h \\leq H\n\n1 \\leq C_w,D_w \\leq W\n\nS_{ij} is # or ..\n\nS_{C_h C_w} and S_{D_h D_w} are ..\n\n(C_h,C_w) \\neq (D_h,D_w)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nC_h C_w\nD_h D_w\nS_{11}\\ldots S_{1W}\n\\vdots\nS_{H1}\\ldots S_{HW}\n\nOutput\n\nPrint the minimum number of times the magician needs to use the magic. If he cannot reach (D_h,D_w), print -1 instead.\n\nSample Input 1\n\n4 4\n1 1\n4 4\n..#.\n..#.\n.#..\n.#..\n\nSample Output 1\n\n1\n\nFor example, by walking to (2,2) and then using the magic to travel to (4,4), just one use of magic is enough.\n\nNote that he cannot walk diagonally.\n\nSample Input 2\n\n4 4\n1 4\n4 1\n.##.\n####\n####\n.##.\n\nSample Output 2\n\n-1\n\nHe cannot move from there.\n\nSample Input 3\n\n4 4\n2 2\n3 3\n....\n....\n....\n....\n\nSample Output 3\n\n0\n\nNo use of magic is needed.\n\nSample Input 4\n\n4 5\n1 2\n2 5\n#.###\n####.\n#..##\n#..##\n\nSample Output 4\n\n2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3559, "cpu_time_ms": 2208, "memory_kb": 63508}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s001021335", "group_id": "codeNet:p02579", "input_text": "local List = {}\nfunction List.new ()\n return {first = 0, last = -1}\nend\n\nfunction List.pushleft (list, value)\n local first = list.first - 1\n list.first = first\n list[first] = value\nend\n\nfunction List.pushright (list, value)\n local last = list.last + 1\n list.last = last\n list[last] = value\nend\n\nfunction List.popleft (list)\n local first = list.first\n local value = list[first]\n list[first] = nil\n list.first = first + 1\n return value\nend\n\nfunction List.popright (list)\n local last = list.last\n local value = list[last]\n list[last] = nil\n list.last = last - 1\n return value\nend\n\nfunction List.empty (list)\n return list.first > list.last\nend\n\n----------\n\nlocal h,w=io.read(\"n\",\"n\")\nlocal ch,cw=io.read(\"n\",\"n\")\nlocal dh,dw=io.read(\"n\",\"n\",\"l\")\n\nlocal s={}\nfor i=1,h do\n local input=io.read()\n s[i]={}\n for j=1,w do\n s[i][j]=input:sub(j,j)\n end\nend\n\nlocal checkin=List.new()\nlocal checked=List.new()\nList.pushright(checkin,{ch,cw})\n\nlocal cost={}\nlocal INF=10^13\nfor i=1,h do\n cost[i]={}\n for j=1,w do\n cost[i][j]=INF\n end\nend\ncost[ch][cw]=0\nlocal dx={1,0,-1,0}\nlocal dy={0,1,0,-1}\n\nwhile (not List.empty(checkin)) or (not List.empty(checked)) do\n if not List.empty(checkin) then\n local q=List.popleft(checkin)\n List.pushright(checked,q)\n local x,y=q[1],q[2]\n for i=1,4 do\n local nx,ny=x+dx[i],y+dy[i]\n local checker=(nx<1 or nx>h or ny<1 or ny>w)\n if not checker and s[nx][ny]~=\"#\"then\n if cost[x][y]h or ny<1 or ny>w)\n if not checker and s[nx][ny]~=\"#\"then\n if cost[x][y]+1 list.last\nend\n\n----------\n\nlocal h,w=io.read(\"n\",\"n\")\nlocal ch,cw=io.read(\"n\",\"n\")\nlocal dh,dw=io.read(\"n\",\"n\",\"l\")\n\nlocal s={}\nfor i=1,h do\n local input=io.read()\n s[i]={}\n for j=1,w do\n s[i][j]=input:sub(j,j)\n end\nend\n\nlocal checkin=List.new()\nlocal checked=List.new()\nList.pushright(checkin,{ch,cw})\n\nlocal cost={}\nlocal INF=10^13\nfor i=1,h do\n cost[i]={}\n for j=1,w do\n cost[i][j]=INF\n end\nend\ncost[ch][cw]=0\nlocal dx={1,0,-1,0}\nlocal dy={0,1,0,-1}\n\nwhile (not List.empty(checkin)) or (not List.empty(checked)) do\n if not List.empty(checkin) then\n local q=List.popleft(checkin)\n List.pushright(checked,q)\n local x,y=q[1],q[2]\n for i=1,4 do\n local nx,ny=x+dx[i],y+dy[i]\n local checker=(nx<1 or nx>h or ny<1 or ny>w)\n if not checker and s[nx][ny]~=\"#\"then\n if cost[x][y]h or ny<1 or ny>w)\n if not checker and s[nx][ny]~=\"#\"then\n if cost[x][y]+1 10 then return \"\" end if o == _G then return \"<_G>\" end local indent0 = (\" \"):rep((depth) * 2) local indent1 = (\" \"):rep((depth+1) * 2) local indent2= (\" \"):rep((depth+2) * 2) if type(o) == 'table' then local keys = {} local types = {} for k in pairs(o) do types[type(k)] = true table.insert(keys, k) end local types_count = 0 local lasttype for k in pairs(types) do types_count = types_count + 1 lasttype = k end if types_count == 1 and (lasttype == 'string' or lasttype == 'number') then table.sort(keys) end local inside = {} for i=1,#keys do local k = keys[i] local v = o[k] if type(k) == 'string' then k = string.format('%q', k) end table.insert(inside, indent1 .. '['..tostring(k)..'] = ' .. tostringxx(v, depth + 1)) end return '{\\n' .. table.concat(inside, ',\\n') .. '\\n' .. indent0 .. '}' else if type(o) == 'string' then o = string.format('%q', o) end return tostring(o) end end\nlocal function richtraceback() local x = 2 while true do local info = debug.getinfo(x) if not info then break end local fname = '<' .. info.short_src .. \":\" .. info.linedefined .. \">\" if info.name then fname = info.name end print(info.short_src .. \":\" .. info.currentline .. \": in \" .. (\"%q\"):format(fname)) print(\" LOCALS:\") local p = 1 while true do local name, val = debug.getlocal(x,p) if not name then break end print(\" \" .. name .. \": \" .. tostringxx(val, 3)) p = p + 1 end print(\" UPVALUES:\") for p=1,info.nups do local name, val = debug.getupvalue(info.func,p) if not name then break end print(\" \" .. name .. \": \" .. tostringxx(val, 3)) end x = x + 1 end end\nlocal function myassert(b) if not b then richtraceback() error(\"assertion failed\") end end \n--\nlocal H, W, M = read.nnn()\nlocal RT = {}\nfor i=1,H do RT[i] = {0,i} end\nlocal CT = {}\nfor i=1,W do CT[i] = {0,i} end\nlocal T = array(2)\nfor i=1,M do\n local h, w = read.nn()\n T[h][w] = 1\n RT[h][1] = RT[h][1] + 1\n CT[w][1] = CT[w][1] + 1\nend\ntable.sort(RT, function(x, y)\n return x[1] > y[1]\nend)\ntable.sort(CT, function(x, y)\n return x[1] > y[1]\nend)\n\nlocal function count(ri, ci)\n local c = RT[ri][1] + CT[ci][1]\n local bh, bw = RT[ri][2], CT[ci][2]\n if T[bh][bw] then\n return c - 1, true\n else\n return c, false\n end\nend\nlocal ans = -1\nlocal hmax = -1\nlocal wmax = -1\nfor ri=1,H do\n local rt = RT[ri][1]\n if rt > hmax then\n hmax = rt\n elseif rt < hmax then\n break\n end\n for ci=1,W do\n local ct = CT[ci][1]\n if ct > wmax then\n wmax = ct\n elseif ct < wmax then\n break\n end\n local a, dup = count(ri, ci)\n if not dup then\n print(a)\n os.exit()\n end\n ans = math.max(a, ans)\n end\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1598178218, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02579.html", "problem_id": "p02579", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02579/input.txt", "sample_output_relpath": "derived/input_output/data/p02579/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02579/Lua/s908264722.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s908264722", "user_id": "u162773977"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\nlocal function array(dimensi0n, default_val) assert(type(default_val) ~= 'table') local n=dimensi0n local m={}if default_val~=nil then m[1]={__index=function()return default_val end}end for i=2,n do m[i]={__index=function(p, k)local c=setmetatable({},m[i-1])rawset(p,k,c)return c end}end return setmetatable({},m[n])end\nlocal function tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"\" end if o == _G then return \"<_G>\" end local indent0 = (\" \"):rep((depth) * 2) local indent1 = (\" \"):rep((depth+1) * 2) local indent2= (\" \"):rep((depth+2) * 2) if type(o) == 'table' then local keys = {} local types = {} for k in pairs(o) do types[type(k)] = true table.insert(keys, k) end local types_count = 0 local lasttype for k in pairs(types) do types_count = types_count + 1 lasttype = k end if types_count == 1 and (lasttype == 'string' or lasttype == 'number') then table.sort(keys) end local inside = {} for i=1,#keys do local k = keys[i] local v = o[k] if type(k) == 'string' then k = string.format('%q', k) end table.insert(inside, indent1 .. '['..tostring(k)..'] = ' .. tostringxx(v, depth + 1)) end return '{\\n' .. table.concat(inside, ',\\n') .. '\\n' .. indent0 .. '}' else if type(o) == 'string' then o = string.format('%q', o) end return tostring(o) end end\nlocal function richtraceback() local x = 2 while true do local info = debug.getinfo(x) if not info then break end local fname = '<' .. info.short_src .. \":\" .. info.linedefined .. \">\" if info.name then fname = info.name end print(info.short_src .. \":\" .. info.currentline .. \": in \" .. (\"%q\"):format(fname)) print(\" LOCALS:\") local p = 1 while true do local name, val = debug.getlocal(x,p) if not name then break end print(\" \" .. name .. \": \" .. tostringxx(val, 3)) p = p + 1 end print(\" UPVALUES:\") for p=1,info.nups do local name, val = debug.getupvalue(info.func,p) if not name then break end print(\" \" .. name .. \": \" .. tostringxx(val, 3)) end x = x + 1 end end\nlocal function myassert(b) if not b then richtraceback() error(\"assertion failed\") end end \n--\nlocal H, W, M = read.nnn()\nlocal RT = {}\nfor i=1,H do RT[i] = {0,i} end\nlocal CT = {}\nfor i=1,W do CT[i] = {0,i} end\nlocal T = array(2)\nfor i=1,M do\n local h, w = read.nn()\n T[h][w] = 1\n RT[h][1] = RT[h][1] + 1\n CT[w][1] = CT[w][1] + 1\nend\ntable.sort(RT, function(x, y)\n return x[1] > y[1]\nend)\ntable.sort(CT, function(x, y)\n return x[1] > y[1]\nend)\n\nlocal function count(ri, ci)\n local c = RT[ri][1] + CT[ci][1]\n local bh, bw = RT[ri][2], CT[ci][2]\n if T[bh][bw] then\n return c - 1, true\n else\n return c, false\n end\nend\nlocal ans = -1\nlocal hmax = -1\nlocal wmax = -1\nfor ri=1,H do\n local rt = RT[ri][1]\n if rt > hmax then\n hmax = rt\n elseif rt < hmax then\n break\n end\n for ci=1,W do\n local ct = CT[ci][1]\n if ct > wmax then\n wmax = ct\n elseif ct < wmax then\n break\n end\n local a, dup = count(ri, ci)\n if not dup then\n print(a)\n os.exit()\n end\n ans = math.max(a, ans)\n end\nend\nprint(ans)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nA maze is composed of a grid of H \\times W squares - H vertical, W horizontal.\n\nThe square at the i-th row from the top and the j-th column from the left - (i,j) - is a wall if S_{ij} is # and a road if S_{ij} is ..\n\nThere is a magician in (C_h,C_w). He can do the following two kinds of moves:\n\nMove A: Walk to a road square that is vertically or horizontally adjacent to the square he is currently in.\n\nMove B: Use magic to warp himself to a road square in the 5\\times 5 area centered at the square he is currently in.\n\nIn either case, he cannot go out of the maze.\n\nAt least how many times does he need to use the magic to reach (D_h, D_w)?\n\nConstraints\n\n1 \\leq H,W \\leq 10^3\n\n1 \\leq C_h,D_h \\leq H\n\n1 \\leq C_w,D_w \\leq W\n\nS_{ij} is # or ..\n\nS_{C_h C_w} and S_{D_h D_w} are ..\n\n(C_h,C_w) \\neq (D_h,D_w)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nC_h C_w\nD_h D_w\nS_{11}\\ldots S_{1W}\n\\vdots\nS_{H1}\\ldots S_{HW}\n\nOutput\n\nPrint the minimum number of times the magician needs to use the magic. If he cannot reach (D_h,D_w), print -1 instead.\n\nSample Input 1\n\n4 4\n1 1\n4 4\n..#.\n..#.\n.#..\n.#..\n\nSample Output 1\n\n1\n\nFor example, by walking to (2,2) and then using the magic to travel to (4,4), just one use of magic is enough.\n\nNote that he cannot walk diagonally.\n\nSample Input 2\n\n4 4\n1 4\n4 1\n.##.\n####\n####\n.##.\n\nSample Output 2\n\n-1\n\nHe cannot move from there.\n\nSample Input 3\n\n4 4\n2 2\n3 3\n....\n....\n....\n....\n\nSample Output 3\n\n0\n\nNo use of magic is needed.\n\nSample Input 4\n\n4 5\n1 2\n2 5\n#.###\n####.\n#..##\n#..##\n\nSample Output 4\n\n2", "sample_input": "4 4\n1 1\n4 4\n..#.\n..#.\n.#..\n.#..\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02579", "source_text": "Score : 400 points\n\nProblem Statement\n\nA maze is composed of a grid of H \\times W squares - H vertical, W horizontal.\n\nThe square at the i-th row from the top and the j-th column from the left - (i,j) - is a wall if S_{ij} is # and a road if S_{ij} is ..\n\nThere is a magician in (C_h,C_w). He can do the following two kinds of moves:\n\nMove A: Walk to a road square that is vertically or horizontally adjacent to the square he is currently in.\n\nMove B: Use magic to warp himself to a road square in the 5\\times 5 area centered at the square he is currently in.\n\nIn either case, he cannot go out of the maze.\n\nAt least how many times does he need to use the magic to reach (D_h, D_w)?\n\nConstraints\n\n1 \\leq H,W \\leq 10^3\n\n1 \\leq C_h,D_h \\leq H\n\n1 \\leq C_w,D_w \\leq W\n\nS_{ij} is # or ..\n\nS_{C_h C_w} and S_{D_h D_w} are ..\n\n(C_h,C_w) \\neq (D_h,D_w)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nC_h C_w\nD_h D_w\nS_{11}\\ldots S_{1W}\n\\vdots\nS_{H1}\\ldots S_{HW}\n\nOutput\n\nPrint the minimum number of times the magician needs to use the magic. If he cannot reach (D_h,D_w), print -1 instead.\n\nSample Input 1\n\n4 4\n1 1\n4 4\n..#.\n..#.\n.#..\n.#..\n\nSample Output 1\n\n1\n\nFor example, by walking to (2,2) and then using the magic to travel to (4,4), just one use of magic is enough.\n\nNote that he cannot walk diagonally.\n\nSample Input 2\n\n4 4\n1 4\n4 1\n.##.\n####\n####\n.##.\n\nSample Output 2\n\n-1\n\nHe cannot move from there.\n\nSample Input 3\n\n4 4\n2 2\n3 3\n....\n....\n....\n....\n\nSample Output 3\n\n0\n\nNo use of magic is needed.\n\nSample Input 4\n\n4 5\n1 2\n2 5\n#.###\n####.\n#..##\n#..##\n\nSample Output 4\n\n2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3660, "cpu_time_ms": 9, "memory_kb": 3004}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s006035153", "group_id": "codeNet:p02582", "input_text": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\nlocal function array(dimensi0n, default_val) assert(type(default_val) ~= 'table') local n=dimensi0n local m={}if default_val~=nil then m[1]={__index=function()return default_val end}end for i=2,n do m[i]={__index=function(p, k)local c=setmetatable({},m[i-1])rawset(p,k,c)return c end}end return setmetatable({},m[n])end\n--\nlocal S = read.l()\nif S == 'SSS' then\n print(0)\nelseif S == 'RSS' or S == 'SRS' or S == 'SSR' or S == 'RSR' then\n print(1)\nelse\n print(2)\nend", "language": "Lua", "metadata": {"date": 1597518244, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s006035153.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s006035153", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\nlocal function array(dimensi0n, default_val) assert(type(default_val) ~= 'table') local n=dimensi0n local m={}if default_val~=nil then m[1]={__index=function()return default_val end}end for i=2,n do m[i]={__index=function(p, k)local c=setmetatable({},m[i-1])rawset(p,k,c)return c end}end return setmetatable({},m[n])end\n--\nlocal S = read.l()\nif S == 'SSS' then\n print(0)\nelseif S == 'RSS' or S == 'SRS' or S == 'SSR' or S == 'RSR' then\n print(1)\nelse\n print(2)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1019, "cpu_time_ms": 7, "memory_kb": 2700}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s580806742", "group_id": "codeNet:p02584", "input_text": "x, k, d = io.read(\"*n\",\"*n\",\"*n\")\n\nif math.abs(x) >= k*d then\n print(math.abs(x) - k*d)\nelseif (k - x // d) % 2 == 0 then\n print(math.abs(x - x // d * d))\nelse\n print(math.min(math.abs(x - x // d * d - d), math.abs(x - x // d * d + d)))\nend\n", "language": "Lua", "metadata": {"date": 1599961538, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s580806742.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s580806742", "user_id": "u878654696"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "x, k, d = io.read(\"*n\",\"*n\",\"*n\")\n\nif math.abs(x) >= k*d then\n print(math.abs(x) - k*d)\nelseif (k - x // d) % 2 == 0 then\n print(math.abs(x - x // d * d))\nelse\n print(math.min(math.abs(x - x // d * d - d), math.abs(x - x // d * d + d)))\nend\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi, who lives on the number line, is now at coordinate X. He will make exactly K moves of distance D in the positive or negative direction.\n\nMore specifically, in one move, he can go from coordinate x to x + D or x - D.\n\nHe wants to make K moves so that the absolute value of the coordinate of the destination will be the smallest possible.\n\nFind the minimum possible absolute value of the coordinate of the destination.\n\nConstraints\n\n-10^{15} \\leq X \\leq 10^{15}\n\n1 \\leq K \\leq 10^{15}\n\n1 \\leq D \\leq 10^{15}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX K D\n\nOutput\n\nPrint the minimum possible absolute value of the coordinate of the destination.\n\nSample Input 1\n\n6 2 4\n\nSample Output 1\n\n2\n\nTakahashi is now at coordinate 6. It is optimal to make the following moves:\n\nMove from coordinate 6 to (6 - 4 =) 2.\n\nMove from coordinate 2 to (2 - 4 =) -2.\n\nHere, the absolute value of the coordinate of the destination is 2, and we cannot make it smaller.\n\nSample Input 2\n\n7 4 3\n\nSample Output 2\n\n1\n\nTakahashi is now at coordinate 7. It is optimal to make, for example, the following moves:\n\nMove from coordinate 7 to 4.\n\nMove from coordinate 4 to 7.\n\nMove from coordinate 7 to 4.\n\nMove from coordinate 4 to 1.\n\nHere, the absolute value of the coordinate of the destination is 1, and we cannot make it smaller.\n\nSample Input 3\n\n10 1 2\n\nSample Output 3\n\n8\n\nSample Input 4\n\n1000000000000000 1000000000000000 1000000000000000\n\nSample Output 4\n\n1000000000000000\n\nThe answer can be enormous.", "sample_input": "6 2 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02584", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi, who lives on the number line, is now at coordinate X. He will make exactly K moves of distance D in the positive or negative direction.\n\nMore specifically, in one move, he can go from coordinate x to x + D or x - D.\n\nHe wants to make K moves so that the absolute value of the coordinate of the destination will be the smallest possible.\n\nFind the minimum possible absolute value of the coordinate of the destination.\n\nConstraints\n\n-10^{15} \\leq X \\leq 10^{15}\n\n1 \\leq K \\leq 10^{15}\n\n1 \\leq D \\leq 10^{15}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX K D\n\nOutput\n\nPrint the minimum possible absolute value of the coordinate of the destination.\n\nSample Input 1\n\n6 2 4\n\nSample Output 1\n\n2\n\nTakahashi is now at coordinate 6. It is optimal to make the following moves:\n\nMove from coordinate 6 to (6 - 4 =) 2.\n\nMove from coordinate 2 to (2 - 4 =) -2.\n\nHere, the absolute value of the coordinate of the destination is 2, and we cannot make it smaller.\n\nSample Input 2\n\n7 4 3\n\nSample Output 2\n\n1\n\nTakahashi is now at coordinate 7. It is optimal to make, for example, the following moves:\n\nMove from coordinate 7 to 4.\n\nMove from coordinate 4 to 7.\n\nMove from coordinate 7 to 4.\n\nMove from coordinate 4 to 1.\n\nHere, the absolute value of the coordinate of the destination is 1, and we cannot make it smaller.\n\nSample Input 3\n\n10 1 2\n\nSample Output 3\n\n8\n\nSample Input 4\n\n1000000000000000 1000000000000000 1000000000000000\n\nSample Output 4\n\n1000000000000000\n\nThe answer can be enormous.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 11, "memory_kb": 2744}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s275898883", "group_id": "codeNet:p02585", "input_text": "local mfl, mce = math.floor, math.ceil\nlocal n, k = io.read(\"*n\", \"*n\")\nassert(-1000000000 <= k and k <= 1000000000)\nlocal p, c = {}, {}\nfor i = 1, n do\n p[i] = io.read(\"*n\")\nend\nfor i = 1, n do\n c[i] = io.read(\"*n\")\n assert(-1000000000 <= c[i] and c[i] <= 1000000000)\nend\nlocal asked = {}\nfor i = 1, n do\n asked[i] = false\nend\nlocal zpos = 1\nlocal function findstart()\n for i = zpos, n do\n if not asked[i] then zpos = i + 1 return i end\n end\n return false\nend\nlocal ret = -1000000007LL\nlocal function mma_l(a, b) return a < b and b or a end\nwhile true do\n local spos = findstart()\n if not spos then break end\n local route = {spos}\n local sum = 0LL + c[spos]\n local src = spos\n asked[spos] = true\n while true do\n local dst = p[src]\n if asked[dst] then break end\n asked[dst] = true\n table.insert(route, dst)\n sum = sum + c[dst]\n src = dst\n end\n local len = #route\n if 0LL < sum then\n local lp = mfl(k / len)\n local rem = k\n if 1 <= lp then\n lp = lp - 1\n rem = k - lp * len\n end\n sum = sum * lp\n ret = mma_l(ret, sum)\n for i = 1, len do\n local v = 0LL\n local src = route[i]\n for j = 1, rem do\n local dst = p[src]\n v = v + c[dst]\n ret = mma_l(ret, sum + v)\n src = dst\n end\n end\n else\n for i = 1, len do\n local v = 0LL\n local src = route[i]\n local lim = math.min(len, k)\n for j = 1, lim do\n local dst = p[src]\n v = v + c[dst]\n ret = mma_l(ret, v)\n src = dst\n end\n end\n end\nend\nret = tostring(ret):gsub(\"LL\", \"\")\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1597542463, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02585.html", "problem_id": "p02585", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02585/input.txt", "sample_output_relpath": "derived/input_output/data/p02585/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02585/Lua/s275898883.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s275898883", "user_id": "u120582723"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "local mfl, mce = math.floor, math.ceil\nlocal n, k = io.read(\"*n\", \"*n\")\nassert(-1000000000 <= k and k <= 1000000000)\nlocal p, c = {}, {}\nfor i = 1, n do\n p[i] = io.read(\"*n\")\nend\nfor i = 1, n do\n c[i] = io.read(\"*n\")\n assert(-1000000000 <= c[i] and c[i] <= 1000000000)\nend\nlocal asked = {}\nfor i = 1, n do\n asked[i] = false\nend\nlocal zpos = 1\nlocal function findstart()\n for i = zpos, n do\n if not asked[i] then zpos = i + 1 return i end\n end\n return false\nend\nlocal ret = -1000000007LL\nlocal function mma_l(a, b) return a < b and b or a end\nwhile true do\n local spos = findstart()\n if not spos then break end\n local route = {spos}\n local sum = 0LL + c[spos]\n local src = spos\n asked[spos] = true\n while true do\n local dst = p[src]\n if asked[dst] then break end\n asked[dst] = true\n table.insert(route, dst)\n sum = sum + c[dst]\n src = dst\n end\n local len = #route\n if 0LL < sum then\n local lp = mfl(k / len)\n local rem = k\n if 1 <= lp then\n lp = lp - 1\n rem = k - lp * len\n end\n sum = sum * lp\n ret = mma_l(ret, sum)\n for i = 1, len do\n local v = 0LL\n local src = route[i]\n for j = 1, rem do\n local dst = p[src]\n v = v + c[dst]\n ret = mma_l(ret, sum + v)\n src = dst\n end\n end\n else\n for i = 1, len do\n local v = 0LL\n local src = route[i]\n local lim = math.min(len, k)\n for j = 1, lim do\n local dst = p[src]\n v = v + c[dst]\n ret = mma_l(ret, v)\n src = dst\n end\n end\n end\nend\nret = tostring(ret):gsub(\"LL\", \"\")\nprint(ret)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi will play a game using a piece on an array of squares numbered 1, 2, \\cdots, N. Square i has an integer C_i written on it. Also, he is given a permutation of 1, 2, \\cdots, N: P_1, P_2, \\cdots, P_N.\n\nNow, he will choose one square and place the piece on that square. Then, he will make the following move some number of times between 1 and K (inclusive):\n\nIn one move, if the piece is now on Square i (1 \\leq i \\leq N), move it to Square P_i. Here, his score increases by C_{P_i}.\n\nHelp him by finding the maximum possible score at the end of the game. (The score is 0 at the beginning of the game.)\n\nConstraints\n\n2 \\leq N \\leq 5000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq P_i \\leq N\n\nP_i \\neq i\n\nP_1, P_2, \\cdots, P_N are all different.\n\n-10^9 \\leq C_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nP_1 P_2 \\cdots P_N\nC_1 C_2 \\cdots C_N\n\nOutput\n\nPrint the maximum possible score at the end of the game.\n\nSample Input 1\n\n5 2\n2 4 5 1 3\n3 4 -10 -8 8\n\nSample Output 1\n\n8\n\nWhen we start at some square of our choice and make at most two moves, we have the following options:\n\nIf we start at Square 1, making one move sends the piece to Square 2, after which the score is 4. Making another move sends the piece to Square 4, after which the score is 4 + (-8) = -4.\n\nIf we start at Square 2, making one move sends the piece to Square 4, after which the score is -8. Making another move sends the piece to Square 1, after which the score is -8 + 3 = -5.\n\nIf we start at Square 3, making one move sends the piece to Square 5, after which the score is 8. Making another move sends the piece to Square 3, after which the score is 8 + (-10) = -2.\n\nIf we start at Square 4, making one move sends the piece to Square 1, after which the score is 3. Making another move sends the piece to Square 2, after which the score is 3 + 4 = 7.\n\nIf we start at Square 5, making one move sends the piece to Square 3, after which the score is -10. Making another move sends the piece to Square 5, after which the score is -10 + 8 = -2.\n\nThe maximum score achieved is 8.\n\nSample Input 2\n\n2 3\n2 1\n10 -7\n\nSample Output 2\n\n13\n\nSample Input 3\n\n3 3\n3 1 2\n-1000 -2000 -3000\n\nSample Output 3\n\n-1000\n\nWe have to make at least one move.\n\nSample Input 4\n\n10 58\n9 1 6 7 8 4 3 2 10 5\n695279662 988782657 -119067776 382975538 -151885171 -177220596 -169777795 37619092 389386780 980092719\n\nSample Output 4\n\n29507023469\n\nThe absolute value of the answer may be enormous.", "sample_input": "5 2\n2 4 5 1 3\n3 4 -10 -8 8\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02585", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi will play a game using a piece on an array of squares numbered 1, 2, \\cdots, N. Square i has an integer C_i written on it. Also, he is given a permutation of 1, 2, \\cdots, N: P_1, P_2, \\cdots, P_N.\n\nNow, he will choose one square and place the piece on that square. Then, he will make the following move some number of times between 1 and K (inclusive):\n\nIn one move, if the piece is now on Square i (1 \\leq i \\leq N), move it to Square P_i. Here, his score increases by C_{P_i}.\n\nHelp him by finding the maximum possible score at the end of the game. (The score is 0 at the beginning of the game.)\n\nConstraints\n\n2 \\leq N \\leq 5000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq P_i \\leq N\n\nP_i \\neq i\n\nP_1, P_2, \\cdots, P_N are all different.\n\n-10^9 \\leq C_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nP_1 P_2 \\cdots P_N\nC_1 C_2 \\cdots C_N\n\nOutput\n\nPrint the maximum possible score at the end of the game.\n\nSample Input 1\n\n5 2\n2 4 5 1 3\n3 4 -10 -8 8\n\nSample Output 1\n\n8\n\nWhen we start at some square of our choice and make at most two moves, we have the following options:\n\nIf we start at Square 1, making one move sends the piece to Square 2, after which the score is 4. Making another move sends the piece to Square 4, after which the score is 4 + (-8) = -4.\n\nIf we start at Square 2, making one move sends the piece to Square 4, after which the score is -8. Making another move sends the piece to Square 1, after which the score is -8 + 3 = -5.\n\nIf we start at Square 3, making one move sends the piece to Square 5, after which the score is 8. Making another move sends the piece to Square 3, after which the score is 8 + (-10) = -2.\n\nIf we start at Square 4, making one move sends the piece to Square 1, after which the score is 3. Making another move sends the piece to Square 2, after which the score is 3 + 4 = 7.\n\nIf we start at Square 5, making one move sends the piece to Square 3, after which the score is -10. Making another move sends the piece to Square 5, after which the score is -10 + 8 = -2.\n\nThe maximum score achieved is 8.\n\nSample Input 2\n\n2 3\n2 1\n10 -7\n\nSample Output 2\n\n13\n\nSample Input 3\n\n3 3\n3 1 2\n-1000 -2000 -3000\n\nSample Output 3\n\n-1000\n\nWe have to make at least one move.\n\nSample Input 4\n\n10 58\n9 1 6 7 8 4 3 2 10 5\n695279662 988782657 -119067776 382975538 -151885171 -177220596 -169777795 37619092 389386780 980092719\n\nSample Output 4\n\n29507023469\n\nThe absolute value of the answer may be enormous.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1600, "cpu_time_ms": 1624, "memory_kb": 3420}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s029097386", "group_id": "codeNet:p02585", "input_text": "local mfl, mce = math.floor, math.ceil\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal p, c = {}, {}\nfor i = 1, n do\n p[i] = io.read(\"*n\")\nend\nfor i = 1, n do\n c[i] = io.read(\"*n\")\nend\nlocal asked = {}\nfor i = 1, n do\n asked[i] = false\nend\nlocal function findstart()\n for i = 1, n do\n if not asked[i] then return i end\n end\n return false\nend\nlocal ret = -1000000007LL\nlocal function mma_l(a, b) return a < b and b or a end\nwhile true do\n local spos = findstart()\n if not spos then break end\n local route = {spos}\n local sum = 0LL + c[spos]\n local src = spos\n asked[spos] = true\n while true do\n local dst = p[src]\n if asked[dst] then break end\n asked[dst] = true\n table.insert(route, dst)\n sum = sum + c[dst]\n src = dst\n end\n local len = #route\n if 0LL < sum then\n local ofst = mfl(k / len)\n local rem = k - ofst * len\n ofst = sum * ofst\n ret = mma_l(ret, ofst)\n for i = 1, len do\n local v = 0LL\n local src = route[i]\n for j = 1, rem do\n local dst = p[src]\n v = v + c[dst]\n ret = mma_l(ret, ofst + v)\n src = dst\n end\n end\n else\n for i = 1, len do\n local v = 0LL\n local src = route[i]\n local lim = math.min(len, k)\n for j = 1, lim do\n local dst = p[src]\n v = v + c[dst]\n ret = mma_l(ret, v)\n src = dst\n end\n end\n end\nend\nret = tostring(ret):gsub(\"LL\", \"\")\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1597541461, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02585.html", "problem_id": "p02585", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02585/input.txt", "sample_output_relpath": "derived/input_output/data/p02585/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02585/Lua/s029097386.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s029097386", "user_id": "u120582723"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "local mfl, mce = math.floor, math.ceil\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal p, c = {}, {}\nfor i = 1, n do\n p[i] = io.read(\"*n\")\nend\nfor i = 1, n do\n c[i] = io.read(\"*n\")\nend\nlocal asked = {}\nfor i = 1, n do\n asked[i] = false\nend\nlocal function findstart()\n for i = 1, n do\n if not asked[i] then return i end\n end\n return false\nend\nlocal ret = -1000000007LL\nlocal function mma_l(a, b) return a < b and b or a end\nwhile true do\n local spos = findstart()\n if not spos then break end\n local route = {spos}\n local sum = 0LL + c[spos]\n local src = spos\n asked[spos] = true\n while true do\n local dst = p[src]\n if asked[dst] then break end\n asked[dst] = true\n table.insert(route, dst)\n sum = sum + c[dst]\n src = dst\n end\n local len = #route\n if 0LL < sum then\n local ofst = mfl(k / len)\n local rem = k - ofst * len\n ofst = sum * ofst\n ret = mma_l(ret, ofst)\n for i = 1, len do\n local v = 0LL\n local src = route[i]\n for j = 1, rem do\n local dst = p[src]\n v = v + c[dst]\n ret = mma_l(ret, ofst + v)\n src = dst\n end\n end\n else\n for i = 1, len do\n local v = 0LL\n local src = route[i]\n local lim = math.min(len, k)\n for j = 1, lim do\n local dst = p[src]\n v = v + c[dst]\n ret = mma_l(ret, v)\n src = dst\n end\n end\n end\nend\nret = tostring(ret):gsub(\"LL\", \"\")\nprint(ret)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi will play a game using a piece on an array of squares numbered 1, 2, \\cdots, N. Square i has an integer C_i written on it. Also, he is given a permutation of 1, 2, \\cdots, N: P_1, P_2, \\cdots, P_N.\n\nNow, he will choose one square and place the piece on that square. Then, he will make the following move some number of times between 1 and K (inclusive):\n\nIn one move, if the piece is now on Square i (1 \\leq i \\leq N), move it to Square P_i. Here, his score increases by C_{P_i}.\n\nHelp him by finding the maximum possible score at the end of the game. (The score is 0 at the beginning of the game.)\n\nConstraints\n\n2 \\leq N \\leq 5000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq P_i \\leq N\n\nP_i \\neq i\n\nP_1, P_2, \\cdots, P_N are all different.\n\n-10^9 \\leq C_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nP_1 P_2 \\cdots P_N\nC_1 C_2 \\cdots C_N\n\nOutput\n\nPrint the maximum possible score at the end of the game.\n\nSample Input 1\n\n5 2\n2 4 5 1 3\n3 4 -10 -8 8\n\nSample Output 1\n\n8\n\nWhen we start at some square of our choice and make at most two moves, we have the following options:\n\nIf we start at Square 1, making one move sends the piece to Square 2, after which the score is 4. Making another move sends the piece to Square 4, after which the score is 4 + (-8) = -4.\n\nIf we start at Square 2, making one move sends the piece to Square 4, after which the score is -8. Making another move sends the piece to Square 1, after which the score is -8 + 3 = -5.\n\nIf we start at Square 3, making one move sends the piece to Square 5, after which the score is 8. Making another move sends the piece to Square 3, after which the score is 8 + (-10) = -2.\n\nIf we start at Square 4, making one move sends the piece to Square 1, after which the score is 3. Making another move sends the piece to Square 2, after which the score is 3 + 4 = 7.\n\nIf we start at Square 5, making one move sends the piece to Square 3, after which the score is -10. Making another move sends the piece to Square 5, after which the score is -10 + 8 = -2.\n\nThe maximum score achieved is 8.\n\nSample Input 2\n\n2 3\n2 1\n10 -7\n\nSample Output 2\n\n13\n\nSample Input 3\n\n3 3\n3 1 2\n-1000 -2000 -3000\n\nSample Output 3\n\n-1000\n\nWe have to make at least one move.\n\nSample Input 4\n\n10 58\n9 1 6 7 8 4 3 2 10 5\n695279662 988782657 -119067776 382975538 -151885171 -177220596 -169777795 37619092 389386780 980092719\n\nSample Output 4\n\n29507023469\n\nThe absolute value of the answer may be enormous.", "sample_input": "5 2\n2 4 5 1 3\n3 4 -10 -8 8\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02585", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi will play a game using a piece on an array of squares numbered 1, 2, \\cdots, N. Square i has an integer C_i written on it. Also, he is given a permutation of 1, 2, \\cdots, N: P_1, P_2, \\cdots, P_N.\n\nNow, he will choose one square and place the piece on that square. Then, he will make the following move some number of times between 1 and K (inclusive):\n\nIn one move, if the piece is now on Square i (1 \\leq i \\leq N), move it to Square P_i. Here, his score increases by C_{P_i}.\n\nHelp him by finding the maximum possible score at the end of the game. (The score is 0 at the beginning of the game.)\n\nConstraints\n\n2 \\leq N \\leq 5000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq P_i \\leq N\n\nP_i \\neq i\n\nP_1, P_2, \\cdots, P_N are all different.\n\n-10^9 \\leq C_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nP_1 P_2 \\cdots P_N\nC_1 C_2 \\cdots C_N\n\nOutput\n\nPrint the maximum possible score at the end of the game.\n\nSample Input 1\n\n5 2\n2 4 5 1 3\n3 4 -10 -8 8\n\nSample Output 1\n\n8\n\nWhen we start at some square of our choice and make at most two moves, we have the following options:\n\nIf we start at Square 1, making one move sends the piece to Square 2, after which the score is 4. Making another move sends the piece to Square 4, after which the score is 4 + (-8) = -4.\n\nIf we start at Square 2, making one move sends the piece to Square 4, after which the score is -8. Making another move sends the piece to Square 1, after which the score is -8 + 3 = -5.\n\nIf we start at Square 3, making one move sends the piece to Square 5, after which the score is 8. Making another move sends the piece to Square 3, after which the score is 8 + (-10) = -2.\n\nIf we start at Square 4, making one move sends the piece to Square 1, after which the score is 3. Making another move sends the piece to Square 2, after which the score is 3 + 4 = 7.\n\nIf we start at Square 5, making one move sends the piece to Square 3, after which the score is -10. Making another move sends the piece to Square 5, after which the score is -10 + 8 = -2.\n\nThe maximum score achieved is 8.\n\nSample Input 2\n\n2 3\n2 1\n10 -7\n\nSample Output 2\n\n13\n\nSample Input 3\n\n3 3\n3 1 2\n-1000 -2000 -3000\n\nSample Output 3\n\n-1000\n\nWe have to make at least one move.\n\nSample Input 4\n\n10 58\n9 1 6 7 8 4 3 2 10 5\n695279662 988782657 -119067776 382975538 -151885171 -177220596 -169777795 37619092 389386780 980092719\n\nSample Output 4\n\n29507023469\n\nThe absolute value of the answer may be enormous.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1420, "cpu_time_ms": 836, "memory_kb": 3496}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s959607409", "group_id": "codeNet:p02586", "input_text": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\nlocal function array(dimensi0n, default_val) assert(type(default_val) ~= 'table') local n=dimensi0n local m={}if default_val~=nil then m[1]={__index=function()return default_val end}end for i=2,n do m[i]={__index=function(p, k)local c=setmetatable({},m[i-1])rawset(p,k,c)return c end}end return setmetatable({},m[n])end\nlocal function tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"\" end if o == _G then return \"<_G>\" end local indent0 = (\" \"):rep((depth) * 2) local indent1 = (\" \"):rep((depth+1) * 2) local indent2= (\" \"):rep((depth+2) * 2) if type(o) == 'table' then local keys = {} local types = {} for k in pairs(o) do types[type(k)] = true table.insert(keys, k) end local types_count = 0 local lasttype for k in pairs(types) do types_count = types_count + 1 lasttype = k end if types_count == 1 and (lasttype == 'string' or lasttype == 'number') then table.sort(keys) end local inside = {} for i=1,#keys do local k = keys[i] local v = o[k] if type(k) == 'string' then k = string.format('%q', k) end table.insert(inside, indent1 .. '['..tostring(k)..'] = ' .. tostringxx(v, depth + 1)) end return '{\\n' .. table.concat(inside, ',\\n') .. '\\n' .. indent0 .. '}' else if type(o) == 'string' then o = string.format('%q', o) end return tostring(o) end end\nlocal function richtraceback() local x = 2 while true do local info = debug.getinfo(x) if not info then break end local fname = '<' .. info.short_src .. \":\" .. info.linedefined .. \">\" if info.name then fname = info.name end print(info.short_src .. \":\" .. info.currentline .. \": in \" .. (\"%q\"):format(fname)) print(\" LOCALS:\") local p = 1 while true do local name, val = debug.getlocal(x,p) if not name then break end print(\" \" .. name .. \": \" .. tostringxx(val, 3)) p = p + 1 end print(\" UPVALUES:\") for p=1,info.nups do local name, val = debug.getupvalue(info.func,p) if not name then break end print(\" \" .. name .. \": \" .. tostringxx(val, 3)) end x = x + 1 end end\nlocal function myassert(b) if not b then richtraceback() error(\"assertion failed\") end end \n--\nlocal max = math.max\n\nlocal R, C, K = read.nnn()\nlocal item = array(2,0)\nfor i=1,K do\n local r,c,v = read.nnn()\n item[r][c] = v\nend\n\nlocal dp,dp_next = array(2,0),array(2,0)\nlocal function chmax1(c,g,val)\n dp[c][g] = max(dp[c][g], val)\nend\nlocal function chmax2(c,g,val)\n dp_next[c][g] = max(dp_next[c][g], val)\nend\n\ndp[1][0] = 0\ndp[1][1] = item[1][1]\nfor r=1,R do\n for c=1,C do\n for g=0,3 do\n dp_next[c][g] = 0\n end\n local rval = item[r][c+1]\n local dval = item[r+1][c]\n for g=0,3 do\n local curval = dp[c][g]\n chmax1(c+1,g+1,curval+rval)\n chmax1(c+1,g,curval)\n chmax2(c,1,curval+dval)\n chmax2(c,0,curval)\n end\n end\n dp, dp_next = dp_next, dp\nend\nprint(max(dp[C][0],dp[C][1],dp[C][2],dp[C][3]))", "language": "Lua", "metadata": {"date": 1597583963, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02586.html", "problem_id": "p02586", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02586/input.txt", "sample_output_relpath": "derived/input_output/data/p02586/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02586/Lua/s959607409.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s959607409", "user_id": "u162773977"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\nlocal function array(dimensi0n, default_val) assert(type(default_val) ~= 'table') local n=dimensi0n local m={}if default_val~=nil then m[1]={__index=function()return default_val end}end for i=2,n do m[i]={__index=function(p, k)local c=setmetatable({},m[i-1])rawset(p,k,c)return c end}end return setmetatable({},m[n])end\nlocal function tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"\" end if o == _G then return \"<_G>\" end local indent0 = (\" \"):rep((depth) * 2) local indent1 = (\" \"):rep((depth+1) * 2) local indent2= (\" \"):rep((depth+2) * 2) if type(o) == 'table' then local keys = {} local types = {} for k in pairs(o) do types[type(k)] = true table.insert(keys, k) end local types_count = 0 local lasttype for k in pairs(types) do types_count = types_count + 1 lasttype = k end if types_count == 1 and (lasttype == 'string' or lasttype == 'number') then table.sort(keys) end local inside = {} for i=1,#keys do local k = keys[i] local v = o[k] if type(k) == 'string' then k = string.format('%q', k) end table.insert(inside, indent1 .. '['..tostring(k)..'] = ' .. tostringxx(v, depth + 1)) end return '{\\n' .. table.concat(inside, ',\\n') .. '\\n' .. indent0 .. '}' else if type(o) == 'string' then o = string.format('%q', o) end return tostring(o) end end\nlocal function richtraceback() local x = 2 while true do local info = debug.getinfo(x) if not info then break end local fname = '<' .. info.short_src .. \":\" .. info.linedefined .. \">\" if info.name then fname = info.name end print(info.short_src .. \":\" .. info.currentline .. \": in \" .. (\"%q\"):format(fname)) print(\" LOCALS:\") local p = 1 while true do local name, val = debug.getlocal(x,p) if not name then break end print(\" \" .. name .. \": \" .. tostringxx(val, 3)) p = p + 1 end print(\" UPVALUES:\") for p=1,info.nups do local name, val = debug.getupvalue(info.func,p) if not name then break end print(\" \" .. name .. \": \" .. tostringxx(val, 3)) end x = x + 1 end end\nlocal function myassert(b) if not b then richtraceback() error(\"assertion failed\") end end \n--\nlocal max = math.max\n\nlocal R, C, K = read.nnn()\nlocal item = array(2,0)\nfor i=1,K do\n local r,c,v = read.nnn()\n item[r][c] = v\nend\n\nlocal dp,dp_next = array(2,0),array(2,0)\nlocal function chmax1(c,g,val)\n dp[c][g] = max(dp[c][g], val)\nend\nlocal function chmax2(c,g,val)\n dp_next[c][g] = max(dp_next[c][g], val)\nend\n\ndp[1][0] = 0\ndp[1][1] = item[1][1]\nfor r=1,R do\n for c=1,C do\n for g=0,3 do\n dp_next[c][g] = 0\n end\n local rval = item[r][c+1]\n local dval = item[r+1][c]\n for g=0,3 do\n local curval = dp[c][g]\n chmax1(c+1,g+1,curval+rval)\n chmax1(c+1,g,curval)\n chmax2(c,1,curval+dval)\n chmax2(c,0,curval)\n end\n end\n dp, dp_next = dp_next, dp\nend\nprint(max(dp[C][0],dp[C][1],dp[C][2],dp[C][3]))", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are K items placed on a grid of squares with R rows and C columns. Let (i, j) denote the square at the i-th row (1 \\leq i \\leq R) and the j-th column (1 \\leq j \\leq C). The i-th item is at (r_i, c_i) and has the value v_i.\n\nTakahashi will begin at (1, 1), the start, and get to (R, C), the goal. When he is at (i, j), he can move to (i + 1, j) or (i, j + 1) (but cannot move to a non-existent square).\n\nHe can pick up items on the squares he visits, including the start and the goal, but at most three for each row. It is allowed to ignore the item on a square he visits.\n\nFind the maximum possible sum of the values of items he picks up.\n\nConstraints\n\n1 \\leq R, C \\leq 3000\n\n1 \\leq K \\leq \\min(2 \\times 10^5, R \\times C)\n\n1 \\leq r_i \\leq R\n\n1 \\leq c_i \\leq C\n\n(r_i, c_i) \\neq (r_j, c_j) (i \\neq j)\n\n1 \\leq v_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\nR C K\nr_1 c_1 v_1\nr_2 c_2 v_2\n:\nr_K c_K v_K\n\nOutput\n\nPrint the maximum possible sum of the values of items Takahashi picks up.\n\nSample Input 1\n\n2 2 3\n1 1 3\n2 1 4\n1 2 5\n\nSample Output 1\n\n8\n\nHe has two ways to get to the goal:\n\nVisit (1, 1), (1, 2), and (2, 2), in this order. In this case, the total value of the items he can pick up is 3 + 5 = 8.\n\nVisit (1, 1), (2, 1), and (2, 2), in this order. In this case, the total value of the items he can pick up is 3 + 4 = 7.\n\nThus, the maximum possible sum of the values of items he picks up is 8.\n\nSample Input 2\n\n2 5 5\n1 1 3\n2 4 20\n1 2 1\n1 3 4\n1 4 2\n\nSample Output 2\n\n29\n\nWe have four items in the 1-st row. The optimal choices are as follows:\n\nVisit (1, 1) (1, 2), (1, 3), (1, 4), (2, 4), and (2, 5), in this order, and pick up all items except the one on (1, 2). Then, the total value of the items he picks up will be 3 + 4 + 2 + 20 = 29.\n\nSample Input 3\n\n4 5 10\n2 5 12\n1 5 12\n2 3 15\n1 2 20\n1 1 28\n2 4 26\n3 2 27\n4 5 21\n3 5 10\n1 3 10\n\nSample Output 3\n\n142", "sample_input": "2 2 3\n1 1 3\n2 1 4\n1 2 5\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02586", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are K items placed on a grid of squares with R rows and C columns. Let (i, j) denote the square at the i-th row (1 \\leq i \\leq R) and the j-th column (1 \\leq j \\leq C). The i-th item is at (r_i, c_i) and has the value v_i.\n\nTakahashi will begin at (1, 1), the start, and get to (R, C), the goal. When he is at (i, j), he can move to (i + 1, j) or (i, j + 1) (but cannot move to a non-existent square).\n\nHe can pick up items on the squares he visits, including the start and the goal, but at most three for each row. It is allowed to ignore the item on a square he visits.\n\nFind the maximum possible sum of the values of items he picks up.\n\nConstraints\n\n1 \\leq R, C \\leq 3000\n\n1 \\leq K \\leq \\min(2 \\times 10^5, R \\times C)\n\n1 \\leq r_i \\leq R\n\n1 \\leq c_i \\leq C\n\n(r_i, c_i) \\neq (r_j, c_j) (i \\neq j)\n\n1 \\leq v_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\nR C K\nr_1 c_1 v_1\nr_2 c_2 v_2\n:\nr_K c_K v_K\n\nOutput\n\nPrint the maximum possible sum of the values of items Takahashi picks up.\n\nSample Input 1\n\n2 2 3\n1 1 3\n2 1 4\n1 2 5\n\nSample Output 1\n\n8\n\nHe has two ways to get to the goal:\n\nVisit (1, 1), (1, 2), and (2, 2), in this order. In this case, the total value of the items he can pick up is 3 + 5 = 8.\n\nVisit (1, 1), (2, 1), and (2, 2), in this order. In this case, the total value of the items he can pick up is 3 + 4 = 7.\n\nThus, the maximum possible sum of the values of items he picks up is 8.\n\nSample Input 2\n\n2 5 5\n1 1 3\n2 4 20\n1 2 1\n1 3 4\n1 4 2\n\nSample Output 2\n\n29\n\nWe have four items in the 1-st row. The optimal choices are as follows:\n\nVisit (1, 1) (1, 2), (1, 3), (1, 4), (2, 4), and (2, 5), in this order, and pick up all items except the one on (1, 2). Then, the total value of the items he picks up will be 3 + 4 + 2 + 20 = 29.\n\nSample Input 3\n\n4 5 10\n2 5 12\n1 5 12\n2 3 15\n1 2 20\n1 1 28\n2 4 26\n3 2 27\n4 5 21\n3 5 10\n1 3 10\n\nSample Output 3\n\n142", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3417, "cpu_time_ms": 1009, "memory_kb": 16840}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s694130063", "group_id": "codeNet:p02586", "input_text": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\nlocal function array(dimensi0n, default_val) assert(type(default_val) ~= 'table') local n=dimensi0n local m={}if default_val~=nil then m[1]={__index=function()return default_val end}end for i=2,n do m[i]={__index=function(p, k)local c=setmetatable({},m[i-1])rawset(p,k,c)return c end}end return setmetatable({},m[n])end\nlocal function tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"\" end if o == _G then return \"<_G>\" end local indent0 = (\" \"):rep((depth) * 2) local indent1 = (\" \"):rep((depth+1) * 2) local indent2= (\" \"):rep((depth+2) * 2) if type(o) == 'table' then local keys = {} local types = {} for k in pairs(o) do types[type(k)] = true table.insert(keys, k) end local types_count = 0 local lasttype for k in pairs(types) do types_count = types_count + 1 lasttype = k end if types_count == 1 and (lasttype == 'string' or lasttype == 'number') then table.sort(keys) end local inside = {} for i=1,#keys do local k = keys[i] local v = o[k] if type(k) == 'string' then k = string.format('%q', k) end table.insert(inside, indent1 .. '['..tostring(k)..'] = ' .. tostringxx(v, depth + 1)) end return '{\\n' .. table.concat(inside, ',\\n') .. '\\n' .. indent0 .. '}' else if type(o) == 'string' then o = string.format('%q', o) end return tostring(o) end end\nlocal function richtraceback() local x = 2 while true do local info = debug.getinfo(x) if not info then break end local fname = '<' .. info.short_src .. \":\" .. info.linedefined .. \">\" if info.name then fname = info.name end print(info.short_src .. \":\" .. info.currentline .. \": in \" .. (\"%q\"):format(fname)) print(\" LOCALS:\") local p = 1 while true do local name, val = debug.getlocal(x,p) if not name then break end print(\" \" .. name .. \": \" .. tostringxx(val, 3)) p = p + 1 end print(\" UPVALUES:\") for p=1,info.nups do local name, val = debug.getupvalue(info.func,p) if not name then break end print(\" \" .. name .. \": \" .. tostringxx(val, 3)) end x = x + 1 end end\nlocal function myassert(b) if not b then richtraceback() error(\"assertion failed\") end end \n--\nlocal max = math.max\n\nlocal R, C, K = read.nnn()\nlocal item = {}\nfor i=1,K do\n local r,c,v = read.nnn()\n item[r*C + c] = v\nend\n\nlocal dp,dp_next = array(2,0),array(2,0)\nlocal function chmax1(c,g,val)\n dp[c][g] = max(dp[c][g], val)\nend\nlocal function chmax2(c,g,val)\n dp_next[c][g] = max(dp_next[c][g], val)\nend\n\ndp[1][0] = 0\ndp[1][1] = item[1*C+1]\nfor r=1,R do\n for c=1,C do\n for g=0,3 do\n dp_next[c][g] = 0\n end\n for g=0,3 do\n local curval = dp[c][g]\n chmax1(c+1,g+1,curval+(item[r*C+c+1] or 0))\n chmax1(c+1,g,curval)\n chmax2(c,1,curval+(item[(r+1)*C+c] or 0))\n chmax2(c,0,curval)\n end\n end\n dp, dp_next = dp_next, dp\nend\nprint(max(dp[C][0],dp[C][1],dp[C][2],dp[C][3]))", "language": "Lua", "metadata": {"date": 1597583425, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02586.html", "problem_id": "p02586", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02586/input.txt", "sample_output_relpath": "derived/input_output/data/p02586/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02586/Lua/s694130063.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s694130063", "user_id": "u162773977"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\nlocal function array(dimensi0n, default_val) assert(type(default_val) ~= 'table') local n=dimensi0n local m={}if default_val~=nil then m[1]={__index=function()return default_val end}end for i=2,n do m[i]={__index=function(p, k)local c=setmetatable({},m[i-1])rawset(p,k,c)return c end}end return setmetatable({},m[n])end\nlocal function tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"\" end if o == _G then return \"<_G>\" end local indent0 = (\" \"):rep((depth) * 2) local indent1 = (\" \"):rep((depth+1) * 2) local indent2= (\" \"):rep((depth+2) * 2) if type(o) == 'table' then local keys = {} local types = {} for k in pairs(o) do types[type(k)] = true table.insert(keys, k) end local types_count = 0 local lasttype for k in pairs(types) do types_count = types_count + 1 lasttype = k end if types_count == 1 and (lasttype == 'string' or lasttype == 'number') then table.sort(keys) end local inside = {} for i=1,#keys do local k = keys[i] local v = o[k] if type(k) == 'string' then k = string.format('%q', k) end table.insert(inside, indent1 .. '['..tostring(k)..'] = ' .. tostringxx(v, depth + 1)) end return '{\\n' .. table.concat(inside, ',\\n') .. '\\n' .. indent0 .. '}' else if type(o) == 'string' then o = string.format('%q', o) end return tostring(o) end end\nlocal function richtraceback() local x = 2 while true do local info = debug.getinfo(x) if not info then break end local fname = '<' .. info.short_src .. \":\" .. info.linedefined .. \">\" if info.name then fname = info.name end print(info.short_src .. \":\" .. info.currentline .. \": in \" .. (\"%q\"):format(fname)) print(\" LOCALS:\") local p = 1 while true do local name, val = debug.getlocal(x,p) if not name then break end print(\" \" .. name .. \": \" .. tostringxx(val, 3)) p = p + 1 end print(\" UPVALUES:\") for p=1,info.nups do local name, val = debug.getupvalue(info.func,p) if not name then break end print(\" \" .. name .. \": \" .. tostringxx(val, 3)) end x = x + 1 end end\nlocal function myassert(b) if not b then richtraceback() error(\"assertion failed\") end end \n--\nlocal max = math.max\n\nlocal R, C, K = read.nnn()\nlocal item = {}\nfor i=1,K do\n local r,c,v = read.nnn()\n item[r*C + c] = v\nend\n\nlocal dp,dp_next = array(2,0),array(2,0)\nlocal function chmax1(c,g,val)\n dp[c][g] = max(dp[c][g], val)\nend\nlocal function chmax2(c,g,val)\n dp_next[c][g] = max(dp_next[c][g], val)\nend\n\ndp[1][0] = 0\ndp[1][1] = item[1*C+1]\nfor r=1,R do\n for c=1,C do\n for g=0,3 do\n dp_next[c][g] = 0\n end\n for g=0,3 do\n local curval = dp[c][g]\n chmax1(c+1,g+1,curval+(item[r*C+c+1] or 0))\n chmax1(c+1,g,curval)\n chmax2(c,1,curval+(item[(r+1)*C+c] or 0))\n chmax2(c,0,curval)\n end\n end\n dp, dp_next = dp_next, dp\nend\nprint(max(dp[C][0],dp[C][1],dp[C][2],dp[C][3]))", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are K items placed on a grid of squares with R rows and C columns. Let (i, j) denote the square at the i-th row (1 \\leq i \\leq R) and the j-th column (1 \\leq j \\leq C). The i-th item is at (r_i, c_i) and has the value v_i.\n\nTakahashi will begin at (1, 1), the start, and get to (R, C), the goal. When he is at (i, j), he can move to (i + 1, j) or (i, j + 1) (but cannot move to a non-existent square).\n\nHe can pick up items on the squares he visits, including the start and the goal, but at most three for each row. It is allowed to ignore the item on a square he visits.\n\nFind the maximum possible sum of the values of items he picks up.\n\nConstraints\n\n1 \\leq R, C \\leq 3000\n\n1 \\leq K \\leq \\min(2 \\times 10^5, R \\times C)\n\n1 \\leq r_i \\leq R\n\n1 \\leq c_i \\leq C\n\n(r_i, c_i) \\neq (r_j, c_j) (i \\neq j)\n\n1 \\leq v_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\nR C K\nr_1 c_1 v_1\nr_2 c_2 v_2\n:\nr_K c_K v_K\n\nOutput\n\nPrint the maximum possible sum of the values of items Takahashi picks up.\n\nSample Input 1\n\n2 2 3\n1 1 3\n2 1 4\n1 2 5\n\nSample Output 1\n\n8\n\nHe has two ways to get to the goal:\n\nVisit (1, 1), (1, 2), and (2, 2), in this order. In this case, the total value of the items he can pick up is 3 + 5 = 8.\n\nVisit (1, 1), (2, 1), and (2, 2), in this order. In this case, the total value of the items he can pick up is 3 + 4 = 7.\n\nThus, the maximum possible sum of the values of items he picks up is 8.\n\nSample Input 2\n\n2 5 5\n1 1 3\n2 4 20\n1 2 1\n1 3 4\n1 4 2\n\nSample Output 2\n\n29\n\nWe have four items in the 1-st row. The optimal choices are as follows:\n\nVisit (1, 1) (1, 2), (1, 3), (1, 4), (2, 4), and (2, 5), in this order, and pick up all items except the one on (1, 2). Then, the total value of the items he picks up will be 3 + 4 + 2 + 20 = 29.\n\nSample Input 3\n\n4 5 10\n2 5 12\n1 5 12\n2 3 15\n1 2 20\n1 1 28\n2 4 26\n3 2 27\n4 5 21\n3 5 10\n1 3 10\n\nSample Output 3\n\n142", "sample_input": "2 2 3\n1 1 3\n2 1 4\n1 2 5\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02586", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are K items placed on a grid of squares with R rows and C columns. Let (i, j) denote the square at the i-th row (1 \\leq i \\leq R) and the j-th column (1 \\leq j \\leq C). The i-th item is at (r_i, c_i) and has the value v_i.\n\nTakahashi will begin at (1, 1), the start, and get to (R, C), the goal. When he is at (i, j), he can move to (i + 1, j) or (i, j + 1) (but cannot move to a non-existent square).\n\nHe can pick up items on the squares he visits, including the start and the goal, but at most three for each row. It is allowed to ignore the item on a square he visits.\n\nFind the maximum possible sum of the values of items he picks up.\n\nConstraints\n\n1 \\leq R, C \\leq 3000\n\n1 \\leq K \\leq \\min(2 \\times 10^5, R \\times C)\n\n1 \\leq r_i \\leq R\n\n1 \\leq c_i \\leq C\n\n(r_i, c_i) \\neq (r_j, c_j) (i \\neq j)\n\n1 \\leq v_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\nR C K\nr_1 c_1 v_1\nr_2 c_2 v_2\n:\nr_K c_K v_K\n\nOutput\n\nPrint the maximum possible sum of the values of items Takahashi picks up.\n\nSample Input 1\n\n2 2 3\n1 1 3\n2 1 4\n1 2 5\n\nSample Output 1\n\n8\n\nHe has two ways to get to the goal:\n\nVisit (1, 1), (1, 2), and (2, 2), in this order. In this case, the total value of the items he can pick up is 3 + 5 = 8.\n\nVisit (1, 1), (2, 1), and (2, 2), in this order. In this case, the total value of the items he can pick up is 3 + 4 = 7.\n\nThus, the maximum possible sum of the values of items he picks up is 8.\n\nSample Input 2\n\n2 5 5\n1 1 3\n2 4 20\n1 2 1\n1 3 4\n1 4 2\n\nSample Output 2\n\n29\n\nWe have four items in the 1-st row. The optimal choices are as follows:\n\nVisit (1, 1) (1, 2), (1, 3), (1, 4), (2, 4), and (2, 5), in this order, and pick up all items except the one on (1, 2). Then, the total value of the items he picks up will be 3 + 4 + 2 + 20 = 29.\n\nSample Input 3\n\n4 5 10\n2 5 12\n1 5 12\n2 3 15\n1 2 20\n1 1 28\n2 4 26\n3 2 27\n4 5 21\n3 5 10\n1 3 10\n\nSample Output 3\n\n142", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3379, "cpu_time_ms": 1967, "memory_kb": 16568}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s603908368", "group_id": "codeNet:p02594", "input_text": "io.read(x)\nif(x>=30)then\n print(\"Yes\")\nelse\n print(\"No\")\nend", "language": "Lua", "metadata": {"date": 1597183755, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s603908368.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s603908368", "user_id": "u982874025"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "io.read(x)\nif(x>=30)then\n print(\"Yes\")\nelse\n print(\"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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 2636}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s994953900", "group_id": "codeNet:p02595", "input_text": "N=io.read\"*n\"\nD=io.read\"*n\"\nX,Y={},{}\nfor i=1,N do\nX[i]=io.read\"*n\"\nY[i]=io.read\"*n\"\nend\nc=0\n\nfor i=1,N do\n\tif(X[i]*X[i]+Y[i]*Y[i]<=D*D)then c=c+1 end\nend\n\nprint(c)", "language": "Lua", "metadata": {"date": 1597538989, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s994953900.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s994953900", "user_id": "u726173718"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "N=io.read\"*n\"\nD=io.read\"*n\"\nX,Y={},{}\nfor i=1,N do\nX[i]=io.read\"*n\"\nY[i]=io.read\"*n\"\nend\nc=0\n\nfor i=1,N do\n\tif(X[i]*X[i]+Y[i]*Y[i]<=D*D)then c=c+1 end\nend\n\nprint(c)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 89, "memory_kb": 6804}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s849822954", "group_id": "codeNet:p02596", "input_text": "k = io.read(\"*n\")\n\nif k % 2 == 0 then\n print(-1)\n return\nend\n\nsevens = 7\nstep = 1\n\nwhile sevens % k ~= 0 do\n if step > 10 ^ 6 then\n step = -1\n break\n end\n\n sevens = sevens * 10 + 7\n sevens = sevens % k\n step = step + 1\nend\n\nprint(step)\n", "language": "Lua", "metadata": {"date": 1599996709, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02596.html", "problem_id": "p02596", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02596/input.txt", "sample_output_relpath": "derived/input_output/data/p02596/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02596/Lua/s849822954.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s849822954", "user_id": "u878654696"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "k = io.read(\"*n\")\n\nif k % 2 == 0 then\n print(-1)\n return\nend\n\nsevens = 7\nstep = 1\n\nwhile sevens % k ~= 0 do\n if step > 10 ^ 6 then\n step = -1\n break\n end\n\n sevens = sevens * 10 + 7\n sevens = sevens % k\n step = step + 1\nend\n\nprint(step)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi loves the number 7 and multiples of K.\n\nWhere is the first occurrence of a multiple of K in the sequence 7,77,777,\\ldots? (Also see Output and Sample Input/Output below.)\n\nIf the sequence contains no multiples of K, print -1 instead.\n\nConstraints\n\n1 \\leq K \\leq 10^6\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint an integer representing the position of the first occurrence of a multiple of K. (For example, if the first occurrence is the fourth element of the sequence, print 4.)\n\nSample Input 1\n\n101\n\nSample Output 1\n\n4\n\nNone of 7, 77, and 777 is a multiple of 101, but 7777 is.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n-1\n\nAll elements in the sequence are odd numbers; there are no multiples of 2.\n\nSample Input 3\n\n999983\n\nSample Output 3\n\n999982", "sample_input": "101\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02596", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi loves the number 7 and multiples of K.\n\nWhere is the first occurrence of a multiple of K in the sequence 7,77,777,\\ldots? (Also see Output and Sample Input/Output below.)\n\nIf the sequence contains no multiples of K, print -1 instead.\n\nConstraints\n\n1 \\leq K \\leq 10^6\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint an integer representing the position of the first occurrence of a multiple of K. (For example, if the first occurrence is the fourth element of the sequence, print 4.)\n\nSample Input 1\n\n101\n\nSample Output 1\n\n4\n\nNone of 7, 77, and 777 is a multiple of 101, but 7777 is.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n-1\n\nAll elements in the sequence are odd numbers; there are no multiples of 2.\n\nSample Input 3\n\n999983\n\nSample Output 3\n\n999982", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 148, "memory_kb": 2756}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s136654489", "group_id": "codeNet:p02597", "input_text": "local n=io.read(\"n\",\"l\")\nlocal s=io.read()\n\nlocal _,red=s:gsub(\"R\",\"\")\nfor i=1,red do\n if s:sub(i,i)==\"R\" then\n red=red-1\n end\nend\nprint(red)", "language": "Lua", "metadata": {"date": 1596694908, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s136654489.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s136654489", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n=io.read(\"n\",\"l\")\nlocal s=io.read()\n\nlocal _,red=s:gsub(\"R\",\"\")\nfor i=1,red do\n if s:sub(i,i)==\"R\" then\n red=red-1\n end\nend\nprint(red)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 13, "memory_kb": 3160}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s927707296", "group_id": "codeNet:p02598", "input_text": "local mmi, mma = math.min, math.max\nlocal mfl, mce = math.floor, math.ceil\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = io.read(\"*n\")\nend\nlocal function solve(x)\n local c = 0\n for i = 1, n do\n c = c + mma(0, mce(t[i] / x) - 1)\n end\n return c <= k\nend\nlocal min, max = 0, 1000000000\nwhile 1 < max - min do\n local mid = mfl((min + max) / 2)\n if solve(mid) then\n max = mid\n else\n min = mid\n end\nend\nprint(max)\n", "language": "Lua", "metadata": {"date": 1596512745, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02598.html", "problem_id": "p02598", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02598/input.txt", "sample_output_relpath": "derived/input_output/data/p02598/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02598/Lua/s927707296.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s927707296", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal mfl, mce = math.floor, math.ceil\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = io.read(\"*n\")\nend\nlocal function solve(x)\n local c = 0\n for i = 1, n do\n c = c + mma(0, mce(t[i] / x) - 1)\n end\n return c <= k\nend\nlocal min, max = 0, 1000000000\nwhile 1 < max - min do\n local mid = mfl((min + max) / 2)\n if solve(mid) then\n max = mid\n else\n min = mid\n end\nend\nprint(max)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N logs of lengths A_1,A_2,\\cdots A_N.\n\nWe can cut these logs at most K times in total. When a log of length L is cut at a point whose distance from an end of the log is t (0 10 then return \"\" end if o == _G then return \"<_G>\" end local indent0 = (\" \"):rep((depth) * 2) local indent1 = (\" \"):rep((depth+1) * 2) local indent2= (\" \"):rep((depth+2) * 2) if type(o) == 'table' then local keys = {} local types = {} for k in pairs(o) do types[type(k)] = true table.insert(keys, k) end local types_count = 0 local lasttype for k in pairs(types) do types_count = types_count + 1 lasttype = k end if types_count == 1 and (lasttype == 'string' or lasttype == 'number') then table.sort(keys) end local inside = {} for i=1,#keys do local k = keys[i] local v = o[k] if type(k) == 'string' then k = string.format('%q', k) end table.insert(inside, indent1 .. '['..tostring(k)..'] = ' .. tostringxx(v, depth + 1)) end return '{\\n' .. table.concat(inside, ',\\n') .. '\\n' .. indent0 .. '}' else if type(o) == 'string' then o = string.format('%q', o) end return tostring(o) end end\nlocal function richtraceback() local x = 2 while true do local info = debug.getinfo(x) if not info then break end local fname = '<' .. info.short_src .. \":\" .. info.linedefined .. \">\" if info.name then fname = info.name end print(info.short_src .. \":\" .. info.currentline .. \": in \" .. (\"%q\"):format(fname)) print(\" LOCALS:\") local p = 1 while true do local name, val = debug.getlocal(x,p) if not name then break end print(\" \" .. name .. \": \" .. tostringxx(val, 3)) p = p + 1 end print(\" UPVALUES:\") for p=1,info.nups do local name, val = debug.getupvalue(info.func,p) if not name then break end print(\" \" .. name .. \": \" .. tostringxx(val, 3)) end x = x + 1 end end\nlocal function myassert(b) if not b then richtraceback() error(\"assertion failed\") end end \n--\nlocal N, K = read.nn()\nlocal A = read.N(N)\nfor i=K+1,N do\n local n, o = A[i], A[i-K]\n if n > o then\n print(\"Yes\")\n else\n print(\"No\")\n end\nend", "language": "Lua", "metadata": {"date": 1595726322, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s959467841.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s959467841", "user_id": "u162773977"}, "prompt_components": {"gold_output": "Yes\nNo\n", "input_to_evaluate": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\nlocal function array(dimensi0n, default_val) assert(type(default_val) ~= 'table') local n=dimensi0n local m={}if default_val~=nil then m[1]={__index=function()return default_val end}end for i=2,n do m[i]={__index=function(p, k)local c=setmetatable({},m[i-1])rawset(p,k,c)return c end}end return setmetatable({},m[n])end\nlocal function tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"\" end if o == _G then return \"<_G>\" end local indent0 = (\" \"):rep((depth) * 2) local indent1 = (\" \"):rep((depth+1) * 2) local indent2= (\" \"):rep((depth+2) * 2) if type(o) == 'table' then local keys = {} local types = {} for k in pairs(o) do types[type(k)] = true table.insert(keys, k) end local types_count = 0 local lasttype for k in pairs(types) do types_count = types_count + 1 lasttype = k end if types_count == 1 and (lasttype == 'string' or lasttype == 'number') then table.sort(keys) end local inside = {} for i=1,#keys do local k = keys[i] local v = o[k] if type(k) == 'string' then k = string.format('%q', k) end table.insert(inside, indent1 .. '['..tostring(k)..'] = ' .. tostringxx(v, depth + 1)) end return '{\\n' .. table.concat(inside, ',\\n') .. '\\n' .. indent0 .. '}' else if type(o) == 'string' then o = string.format('%q', o) end return tostring(o) end end\nlocal function richtraceback() local x = 2 while true do local info = debug.getinfo(x) if not info then break end local fname = '<' .. info.short_src .. \":\" .. info.linedefined .. \">\" if info.name then fname = info.name end print(info.short_src .. \":\" .. info.currentline .. \": in \" .. (\"%q\"):format(fname)) print(\" LOCALS:\") local p = 1 while true do local name, val = debug.getlocal(x,p) if not name then break end print(\" \" .. name .. \": \" .. tostringxx(val, 3)) p = p + 1 end print(\" UPVALUES:\") for p=1,info.nups do local name, val = debug.getupvalue(info.func,p) if not name then break end print(\" \" .. name .. \": \" .. tostringxx(val, 3)) end x = x + 1 end end\nlocal function myassert(b) if not b then richtraceback() error(\"assertion failed\") end end \n--\nlocal N, K = read.nn()\nlocal A = read.N(N)\nfor i=K+1,N do\n local n, o = A[i], A[i-K]\n if n > o then\n print(\"Yes\")\n else\n print(\"No\")\n end\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2761, "cpu_time_ms": 494, "memory_kb": 21992}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s836341455", "group_id": "codeNet:p02602", "input_text": "local n, k = io.read(\"*n\", \"*n\")\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\nend\nfor i = k + 1, n do\n if a[i - k] < a[i] then\n print(\"Yes\")\n else\n print(\"No\")\n end\nend\n", "language": "Lua", "metadata": {"date": 1595725467, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s836341455.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s836341455", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\nNo\n", "input_to_evaluate": "local n, k = io.read(\"*n\", \"*n\")\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\nend\nfor i = k + 1, n do\n if a[i - k] < a[i] then\n print(\"Yes\")\n else\n print(\"No\")\n end\nend\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nM-kun is a student in Aoki High School, where a year is divided into N terms.\n\nThere is an exam at the end of each term. According to the scores in those exams, a student is given a grade for each term, as follows:\n\nFor the first through (K-1)-th terms: not given.\n\nFor each of the K-th through N-th terms: the multiplication of the scores in the last K exams, including the exam in the graded term.\n\nM-kun scored A_i in the exam at the end of the i-th term.\n\nFor each i such that K+1 \\leq i \\leq N, determine whether his grade for the i-th term is strictly greater than the grade for the (i-1)-th term.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq K \\leq N-1\n\n1 \\leq A_i \\leq 10^{9}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 A_3 \\ldots A_N\n\nOutput\n\nPrint the answer in N-K lines.\n\nThe i-th line should contain Yes if the grade for the (K+i)-th term is greater than the grade for the (K+i-1)-th term, and No otherwise.\n\nSample Input 1\n\n5 3\n96 98 95 100 20\n\nSample Output 1\n\nYes\nNo\n\nHis grade for each term is computed as follows:\n\n3-rd term: (96 \\times 98 \\times 95) = 893760\n\n4-th term: (98 \\times 95 \\times 100) = 931000\n\n5-th term: (95 \\times 100 \\times 20) = 190000\n\nSample Input 2\n\n3 2\n1001 869120 1001\n\nSample Output 2\n\nNo\n\nNote that the output should be No if the grade for the 3-rd term is equal to the grade for the 2-nd term.\n\nSample Input 3\n\n15 7\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9\n\nSample Output 3\n\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nYes", "sample_input": "5 3\n96 98 95 100 20\n"}, "reference_outputs": ["Yes\nNo\n"], "source_document_id": "p02602", "source_text": "Score: 300 points\n\nProblem Statement\n\nM-kun is a student in Aoki High School, where a year is divided into N terms.\n\nThere is an exam at the end of each term. According to the scores in those exams, a student is given a grade for each term, as follows:\n\nFor the first through (K-1)-th terms: not given.\n\nFor each of the K-th through N-th terms: the multiplication of the scores in the last K exams, including the exam in the graded term.\n\nM-kun scored A_i in the exam at the end of the i-th term.\n\nFor each i such that K+1 \\leq i \\leq N, determine whether his grade for the i-th term is strictly greater than the grade for the (i-1)-th term.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq K \\leq N-1\n\n1 \\leq A_i \\leq 10^{9}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 A_3 \\ldots A_N\n\nOutput\n\nPrint the answer in N-K lines.\n\nThe i-th line should contain Yes if the grade for the (K+i)-th term is greater than the grade for the (K+i-1)-th term, and No otherwise.\n\nSample Input 1\n\n5 3\n96 98 95 100 20\n\nSample Output 1\n\nYes\nNo\n\nHis grade for each term is computed as follows:\n\n3-rd term: (96 \\times 98 \\times 95) = 893760\n\n4-th term: (98 \\times 95 \\times 100) = 931000\n\n5-th term: (95 \\times 100 \\times 20) = 190000\n\nSample Input 2\n\n3 2\n1001 869120 1001\n\nSample Output 2\n\nNo\n\nNote that the output should be No if the grade for the 3-rd term is equal to the grade for the 2-nd term.\n\nSample Input 3\n\n15 7\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9\n\nSample Output 3\n\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 349, "memory_kb": 6368}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s814790031", "group_id": "codeNet:p02603", "input_text": "local n=io.read(\"n\")\nlocal a={}\nfor i=1,n do\n a[i]=io.read(\"n\")\nend\nlocal motode=1000\nfor i=1,n-1 do\n if a[i] xval[b] end)\n\n local ypos, yval, yidx_pos, yidx_val = {}, {}, {}, {}\n for k, v in pairs(ys) do\n table.insert(ypos, k)\n table.insert(yval, v)\n end\n for i = 1, #ypos do yidx_pos[i], yidx_val[i] = i, i end\n table.sort(yidx_pos, function(a, b) return ypos[a] < ypos[b] end)\n table.sort(yidx_val, function(a, b) return yval[a] > yval[b] end)\n\n local xcosts = getmincosts(n - 1, xpos, xval, xidx_pos, xidx_val)\n local ycosts = getmincosts(n - 1, ypos, yval, yidx_pos, yidx_val)\n for ik = 0, n - 1 do\n cand = xcosts[0 + 1] + ycosts[ik + 1]\n for i = 1, ik do\n cand = mmi(cand, xcosts[i + 1] + ycosts[ik - i + 1])\n end\n if not retik[ik + 1] then\n retik[ik + 1] = cand\n elseif cand < retik[ik + 1] then\n retik[ik + 1] = cand\n end\n end\nend\n\nlocal function grayWalk(size, add_func, rm_func, work_func)\n local prv = 0\n local total = bls(1, size) - 1\n local bpos = {}\n for i = 1, size do\n bpos[bls(1, i - 1)] = i\n end\n work_func()\n for i = 1, total do\n local v = grayCode(i)\n if prv < v then\n prv, v = v, v - prv\n add_func(bpos[v])\n else\n prv, v = v, prv - v\n rm_func(bpos[v])\n end\n work_func()\n end\nend\n\nfor j = 1, n do\n local xj = x[j]\n if not xs[xj] then\n xs[xj] = p[j]\n else\n xs[xj] = xs[xj] + p[j]\n end\nend\nfor ik = 0, n do\n retik[ik + 1] = false\nend\n\ngrayWalk(n, add_func, rm_func, work_func)\nretik[n + 1] = 0\nprint(table.concat(retik, \"\\n\"))\n-- print(os.clock())\n", "language": "Lua", "metadata": {"date": 1595737829, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02604.html", "problem_id": "p02604", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02604/input.txt", "sample_output_relpath": "derived/input_output/data/p02604/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02604/Lua/s256806222.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s256806222", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2900\n900\n0\n0\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal mab = math.abs\nlocal mfl, mce = math.floor, math.ceil\nlocal bls, brs = bit.lshift, bit.rshift\nlocal bxor = bit.bxor\n\nlocal n = io.read(\"*n\")\nlocal x, y, p = {}, {}, {}\nlocal flag = {}\nfor i = 1, n do\n x[i], y[i], p[i] = io.read(\"*n\", \"*n\", \"*n\")\nend\n\nlocal function grayCode(x)\n return bxor(x, brs(x, 1))\nend\n\nlocal function getmincosts(ik, pos, val, idx_pos, idx_val)\n local retary = {}\n for i = 1, ik + 1 do retary[i] = 0 end\n for i = 1, #pos do flag[i] = false end\n local targetpos = {}\n for linecnt = 0, ik do\n if #pos <= linecnt then\n break\n end\n if 0 < linecnt then\n flag[idx_val[linecnt]] = true\n table.insert(targetpos, pos[idx_val[linecnt]])\n end\n local retval = 0\n for i = 1, #idx_pos do\n local idx_i = idx_pos[i]\n if not flag[idx_i] then\n local p = pos[idx_i]\n local cand = mab(p)\n for j = 1, #targetpos do\n cand = mmi(cand, mab(targetpos[j] - p))\n end\n retval = retval + cand * val[idx_i]\n end\n end\n retary[linecnt + 1] = retval\n end\n return retary\nend\n\nlocal retik = {}\n\nlocal xs, ys = {}, {}\nlocal function add_func(idx)\n local xv = x[idx]\n local yv = y[idx]\n xs[xv] = xs[xv] - p[idx]\n if xs[xv] == 0 then xs[xv] = nil end\n if not ys[yv] then\n ys[yv] = p[idx]\n else\n ys[yv] = ys[yv] + p[idx]\n end\nend\nlocal function rm_func(idx)\n local xv = x[idx]\n local yv = y[idx]\n ys[yv] = ys[yv] - p[idx]\n if ys[yv] == 0 then ys[yv] = nil end\n if not xs[xv] then\n xs[xv] = p[idx]\n else\n xs[xv] = xs[xv] + p[idx]\n end\nend\nlocal function work_func()\n local cand = 0\n local xpos, xval, xidx_pos, xidx_val = {}, {}, {}, {}\n for k, v in pairs(xs) do\n table.insert(xpos, k)\n table.insert(xval, v)\n end\n for i = 1, #xpos do xidx_pos[i], xidx_val[i] = i, i end\n table.sort(xidx_pos, function(a, b) return xpos[a] < xpos[b] end)\n table.sort(xidx_val, function(a, b) return xval[a] > xval[b] end)\n\n local ypos, yval, yidx_pos, yidx_val = {}, {}, {}, {}\n for k, v in pairs(ys) do\n table.insert(ypos, k)\n table.insert(yval, v)\n end\n for i = 1, #ypos do yidx_pos[i], yidx_val[i] = i, i end\n table.sort(yidx_pos, function(a, b) return ypos[a] < ypos[b] end)\n table.sort(yidx_val, function(a, b) return yval[a] > yval[b] end)\n\n local xcosts = getmincosts(n - 1, xpos, xval, xidx_pos, xidx_val)\n local ycosts = getmincosts(n - 1, ypos, yval, yidx_pos, yidx_val)\n for ik = 0, n - 1 do\n cand = xcosts[0 + 1] + ycosts[ik + 1]\n for i = 1, ik do\n cand = mmi(cand, xcosts[i + 1] + ycosts[ik - i + 1])\n end\n if not retik[ik + 1] then\n retik[ik + 1] = cand\n elseif cand < retik[ik + 1] then\n retik[ik + 1] = cand\n end\n end\nend\n\nlocal function grayWalk(size, add_func, rm_func, work_func)\n local prv = 0\n local total = bls(1, size) - 1\n local bpos = {}\n for i = 1, size do\n bpos[bls(1, i - 1)] = i\n end\n work_func()\n for i = 1, total do\n local v = grayCode(i)\n if prv < v then\n prv, v = v, v - prv\n add_func(bpos[v])\n else\n prv, v = v, prv - v\n rm_func(bpos[v])\n end\n work_func()\n end\nend\n\nfor j = 1, n do\n local xj = x[j]\n if not xs[xj] then\n xs[xj] = p[j]\n else\n xs[xj] = xs[xj] + p[j]\n end\nend\nfor ik = 0, n do\n retik[ik + 1] = false\nend\n\ngrayWalk(n, add_func, rm_func, work_func)\nretik[n + 1] = 0\nprint(table.concat(retik, \"\\n\"))\n-- print(os.clock())\n", "problem_context": "Score: 500 points\n\nProblem Statement\n\nNew AtCoder City has an infinite grid of streets, as follows:\n\nAt the center of the city stands a clock tower. Let (0, 0) be the coordinates of this point.\n\nA straight street, which we will call East-West Main Street, runs east-west and passes the clock tower. It corresponds to the x-axis in the two-dimensional coordinate plane.\n\nThere are also other infinitely many streets parallel to East-West Main Street, with a distance of 1 between them. They correspond to the lines \\ldots, y = -2, y = -1, y = 1, y = 2, \\ldots in the two-dimensional coordinate plane.\n\nA straight street, which we will call North-South Main Street, runs north-south and passes the clock tower. It corresponds to the y-axis in the two-dimensional coordinate plane.\n\nThere are also other infinitely many streets parallel to North-South Main Street, with a distance of 1 between them. They correspond to the lines \\ldots, x = -2, x = -1, x = 1, x = 2, \\ldots in the two-dimensional coordinate plane.\n\nThere are N residential areas in New AtCoder City. The i-th area is located at the intersection with the coordinates (X_i, Y_i) and has a population of P_i. Each citizen in the city lives in one of these areas.\n\nThe city currently has only two railroads, stretching infinitely, one along East-West Main Street and the other along North-South Main Street.\n\nM-kun, the mayor, thinks that they are not enough for the commuters, so he decides to choose K streets and build a railroad stretching infinitely along each of those streets.\n\nLet the walking distance of each citizen be the distance from his/her residential area to the nearest railroad.\n\nM-kun wants to build railroads so that the sum of the walking distances of all citizens, S, is minimized.\n\nFor each K = 0, 1, 2, \\dots, N, what is the minimum possible value of S after building railroads?\n\nConstraints\n\n1 \\leq N \\leq 15\n\n-10 \\ 000 \\leq X_i \\leq 10 \\ 000\n\n-10 \\ 000 \\leq Y_i \\leq 10 \\ 000\n\n1 \\leq P_i \\leq 1 \\ 000 \\ 000\n\nThe locations of the N residential areas, (X_i, Y_i), are all distinct.\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 P_1\nX_2 Y_2 P_2\n: : :\nX_N Y_N P_N\n\nOutput\n\nPrint the answer in N+1 lines.\n\nThe i-th line (i = 1, \\ldots, N+1) should contain the minimum possible value of S after building railroads for the case K = i-1.\n\nSample Input 1\n\n3\n1 2 300\n3 3 600\n1 4 800\n\nSample Output 1\n\n2900\n900\n0\n0\n\nWhen K = 0, the residents of Area 1, 2, and 3 have to walk the distances of 1, 3, and 1, respectively, to reach a railroad.\n\nThus, the sum of the walking distances of all citizens, S, is 1 \\times 300 + 3 \\times 600 + 1 \\times 800 = 2900.\n\nWhen K = 1, if we build a railroad along the street corresponding to the line y = 4 in the coordinate plane, the walking distances of the citizens of Area 1, 2, and 3 become 1, 1, and 0, respectively.\n\nThen, S = 1 \\times 300 + 1 \\times 600 + 0 \\times 800 = 900.\n\nWe have many other options for where we build the railroad, but none of them makes S less than 900.\n\nWhen K = 2, if we build a railroad along the street corresponding to the lines x = 1 and x = 3 in the coordinate plane, all citizens can reach a railroad with the walking distance of 0, so S = 0. We can also have S = 0 when K = 3.\n\nThe figure below shows the optimal way to build railroads for the cases K = 0, 1, 2.\n\nThe street painted blue represents the roads along which we build railroads.\n\nSample Input 2\n\n5\n3 5 400\n5 3 700\n5 5 1000\n5 7 700\n7 5 400\n\nSample Output 2\n\n13800\n1600\n0\n0\n0\n0\n\nThe figure below shows the optimal way to build railroads for the cases K = 1, 2.\n\nSample Input 3\n\n6\n2 5 1000\n5 2 1100\n5 5 1700\n-2 -5 900\n-5 -2 600\n-5 -5 2200\n\nSample Output 3\n\n26700\n13900\n3200\n1200\n0\n0\n0\n\nThe figure below shows the optimal way to build railroads for the case K = 3.\n\nSample Input 4\n\n8\n2 2 286017\n3 1 262355\n2 -2 213815\n1 -3 224435\n-2 -2 136860\n-3 -1 239338\n-2 2 217647\n-1 3 141903\n\nSample Output 4\n\n2576709\n1569381\n868031\n605676\n366338\n141903\n0\n0\n0\n\nThe figure below shows the optimal way to build railroads for the case K = 4.", "sample_input": "3\n1 2 300\n3 3 600\n1 4 800\n"}, "reference_outputs": ["2900\n900\n0\n0\n"], "source_document_id": "p02604", "source_text": "Score: 500 points\n\nProblem Statement\n\nNew AtCoder City has an infinite grid of streets, as follows:\n\nAt the center of the city stands a clock tower. Let (0, 0) be the coordinates of this point.\n\nA straight street, which we will call East-West Main Street, runs east-west and passes the clock tower. It corresponds to the x-axis in the two-dimensional coordinate plane.\n\nThere are also other infinitely many streets parallel to East-West Main Street, with a distance of 1 between them. They correspond to the lines \\ldots, y = -2, y = -1, y = 1, y = 2, \\ldots in the two-dimensional coordinate plane.\n\nA straight street, which we will call North-South Main Street, runs north-south and passes the clock tower. It corresponds to the y-axis in the two-dimensional coordinate plane.\n\nThere are also other infinitely many streets parallel to North-South Main Street, with a distance of 1 between them. They correspond to the lines \\ldots, x = -2, x = -1, x = 1, x = 2, \\ldots in the two-dimensional coordinate plane.\n\nThere are N residential areas in New AtCoder City. The i-th area is located at the intersection with the coordinates (X_i, Y_i) and has a population of P_i. Each citizen in the city lives in one of these areas.\n\nThe city currently has only two railroads, stretching infinitely, one along East-West Main Street and the other along North-South Main Street.\n\nM-kun, the mayor, thinks that they are not enough for the commuters, so he decides to choose K streets and build a railroad stretching infinitely along each of those streets.\n\nLet the walking distance of each citizen be the distance from his/her residential area to the nearest railroad.\n\nM-kun wants to build railroads so that the sum of the walking distances of all citizens, S, is minimized.\n\nFor each K = 0, 1, 2, \\dots, N, what is the minimum possible value of S after building railroads?\n\nConstraints\n\n1 \\leq N \\leq 15\n\n-10 \\ 000 \\leq X_i \\leq 10 \\ 000\n\n-10 \\ 000 \\leq Y_i \\leq 10 \\ 000\n\n1 \\leq P_i \\leq 1 \\ 000 \\ 000\n\nThe locations of the N residential areas, (X_i, Y_i), are all distinct.\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 P_1\nX_2 Y_2 P_2\n: : :\nX_N Y_N P_N\n\nOutput\n\nPrint the answer in N+1 lines.\n\nThe i-th line (i = 1, \\ldots, N+1) should contain the minimum possible value of S after building railroads for the case K = i-1.\n\nSample Input 1\n\n3\n1 2 300\n3 3 600\n1 4 800\n\nSample Output 1\n\n2900\n900\n0\n0\n\nWhen K = 0, the residents of Area 1, 2, and 3 have to walk the distances of 1, 3, and 1, respectively, to reach a railroad.\n\nThus, the sum of the walking distances of all citizens, S, is 1 \\times 300 + 3 \\times 600 + 1 \\times 800 = 2900.\n\nWhen K = 1, if we build a railroad along the street corresponding to the line y = 4 in the coordinate plane, the walking distances of the citizens of Area 1, 2, and 3 become 1, 1, and 0, respectively.\n\nThen, S = 1 \\times 300 + 1 \\times 600 + 0 \\times 800 = 900.\n\nWe have many other options for where we build the railroad, but none of them makes S less than 900.\n\nWhen K = 2, if we build a railroad along the street corresponding to the lines x = 1 and x = 3 in the coordinate plane, all citizens can reach a railroad with the walking distance of 0, so S = 0. We can also have S = 0 when K = 3.\n\nThe figure below shows the optimal way to build railroads for the cases K = 0, 1, 2.\n\nThe street painted blue represents the roads along which we build railroads.\n\nSample Input 2\n\n5\n3 5 400\n5 3 700\n5 5 1000\n5 7 700\n7 5 400\n\nSample Output 2\n\n13800\n1600\n0\n0\n0\n0\n\nThe figure below shows the optimal way to build railroads for the cases K = 1, 2.\n\nSample Input 3\n\n6\n2 5 1000\n5 2 1100\n5 5 1700\n-2 -5 900\n-5 -2 600\n-5 -5 2200\n\nSample Output 3\n\n26700\n13900\n3200\n1200\n0\n0\n0\n\nThe figure below shows the optimal way to build railroads for the case K = 3.\n\nSample Input 4\n\n8\n2 2 286017\n3 1 262355\n2 -2 213815\n1 -3 224435\n-2 -2 136860\n-3 -1 239338\n-2 2 217647\n-1 3 141903\n\nSample Output 4\n\n2576709\n1569381\n868031\n605676\n366338\n141903\n0\n0\n0\n\nThe figure below shows the optimal way to build railroads for the case K = 4.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3426, "cpu_time_ms": 458, "memory_kb": 2732}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s712266707", "group_id": "codeNet:p02604", "input_text": "local mmi, mma = math.min, math.max\nlocal mab = math.abs\nlocal mfl, mce = math.floor, math.ceil\nlocal bls, brs = bit.lshift, bit.rshift\nlocal bxor = bit.bxor\n\nlocal n = io.read(\"*n\")\nlocal x, y, p = {}, {}, {}\nlocal flag = {}\nfor i = 1, n do\n x[i], y[i], p[i] = io.read(\"*n\", \"*n\", \"*n\")\n flag[i] = false\nend\n\nlocal function grayCode(x)\n return bxor(x, brs(x, 1))\nend\n\nlocal function grayWalk(size, add_func, rm_func, work_func)\n local prv = 0\n local total = bls(1, size) - 1\n local bpos = {}\n for i = 1, size do\n bpos[bls(1, i - 1)] = i\n end\n work_func()\n for i = 1, total do\n local v = grayCode(i)\n if prv < v then\n prv, v = v, v - prv\n add_func(bpos[v])\n else\n prv, v = v, prv - v\n rm_func(bpos[v])\n end\n work_func()\n end\nend\n\nlocal function findright(idxes, ofst)\n for i = ofst, #idxes do\n if flag[idxes[i]] then\n return i\n end\n end\n return false\nend\n\nlocal function getmincost(t, linecnt)\n local pos, val, idx = {}, {}, {}\n for k, v in pairs(t) do\n table.insert(pos, k)\n table.insert(val, v)\n end\n if #pos <= linecnt then\n return 0\n end\n for i = 1, #pos do idx[i] = i end\n table.sort(idx, function(a, b) return val[a] > val[b] end)\n for i = 1, linecnt do\n flag[idx[i]] = true\n end\n for i = linecnt + 1, #pos do\n flag[idx[i]] = false\n end\n local retval = 0\n table.sort(idx, function(a, b) return pos[a] < pos[b] end)\n local leftpos = false\n local rightpos = findright(idx, 1)\n for i = 1, #idx do\n local idx_i = idx[i]\n if flag[idx_i] then\n leftpos = rightpos\n if rightpos then\n rightpos = findright(idx, rightpos + 1)\n end\n else\n local cand = mab(pos[idx_i])\n if leftpos then\n cand = mmi(cand, mab(pos[idx_i] - pos[idx[leftpos]]))\n end\n if rightpos then\n cand = mmi(cand, mab(pos[idx_i] - pos[idx[rightpos]]))\n end\n retval = retval + cand * val[idx_i]\n end\n end\n return retval\nend\n\nlocal ret = false\nlocal g_ik = 0\nlocal xs, ys = {}, {}\nlocal function add_func(idx)\n local xv = x[idx]\n local yv = y[idx]\n xs[xv] = xs[xv] - p[idx]\n if xs[xv] == 0 then xs[xv] = nil end\n if not ys[yv] then\n ys[yv] = p[idx]\n else\n ys[yv] = ys[yv] + p[idx]\n end\nend\nlocal function rm_func(idx)\n local xv = x[idx]\n local yv = y[idx]\n ys[yv] = ys[yv] - p[idx]\n if ys[yv] == 0 then ys[yv] = nil end\n if not xs[xv] then\n xs[xv] = p[idx]\n else\n xs[xv] = xs[xv] + p[idx]\n end\nend\nlocal function work_func()\n local cand = 0\n for xline = 0, g_ik do\n local yline = g_ik - xline\n local xcost = getmincost(xs, xline)\n local ycost = getmincost(ys, yline)\n local z = xcost + ycost\n if xline == 0 then\n cand = z\n elseif z < cand then\n cand = z\n end\n end\n if not ret then\n ret = cand\n elseif cand < ret then\n ret = cand\n end\nend\n\nfor ik = 0, n do\n g_ik = ik\n ret = false\n xs, ys = {}, {}\n for j = 1, n do\n local xj = x[j]\n if not xs[xj] then\n xs[xj] = p[j]\n else\n xs[xj] = xs[xj] + p[j]\n end\n end\n grayWalk(n, add_func, rm_func, work_func)\n print(ret)\nend\n", "language": "Lua", "metadata": {"date": 1595733742, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02604.html", "problem_id": "p02604", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02604/input.txt", "sample_output_relpath": "derived/input_output/data/p02604/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02604/Lua/s712266707.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s712266707", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2900\n900\n0\n0\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal mab = math.abs\nlocal mfl, mce = math.floor, math.ceil\nlocal bls, brs = bit.lshift, bit.rshift\nlocal bxor = bit.bxor\n\nlocal n = io.read(\"*n\")\nlocal x, y, p = {}, {}, {}\nlocal flag = {}\nfor i = 1, n do\n x[i], y[i], p[i] = io.read(\"*n\", \"*n\", \"*n\")\n flag[i] = false\nend\n\nlocal function grayCode(x)\n return bxor(x, brs(x, 1))\nend\n\nlocal function grayWalk(size, add_func, rm_func, work_func)\n local prv = 0\n local total = bls(1, size) - 1\n local bpos = {}\n for i = 1, size do\n bpos[bls(1, i - 1)] = i\n end\n work_func()\n for i = 1, total do\n local v = grayCode(i)\n if prv < v then\n prv, v = v, v - prv\n add_func(bpos[v])\n else\n prv, v = v, prv - v\n rm_func(bpos[v])\n end\n work_func()\n end\nend\n\nlocal function findright(idxes, ofst)\n for i = ofst, #idxes do\n if flag[idxes[i]] then\n return i\n end\n end\n return false\nend\n\nlocal function getmincost(t, linecnt)\n local pos, val, idx = {}, {}, {}\n for k, v in pairs(t) do\n table.insert(pos, k)\n table.insert(val, v)\n end\n if #pos <= linecnt then\n return 0\n end\n for i = 1, #pos do idx[i] = i end\n table.sort(idx, function(a, b) return val[a] > val[b] end)\n for i = 1, linecnt do\n flag[idx[i]] = true\n end\n for i = linecnt + 1, #pos do\n flag[idx[i]] = false\n end\n local retval = 0\n table.sort(idx, function(a, b) return pos[a] < pos[b] end)\n local leftpos = false\n local rightpos = findright(idx, 1)\n for i = 1, #idx do\n local idx_i = idx[i]\n if flag[idx_i] then\n leftpos = rightpos\n if rightpos then\n rightpos = findright(idx, rightpos + 1)\n end\n else\n local cand = mab(pos[idx_i])\n if leftpos then\n cand = mmi(cand, mab(pos[idx_i] - pos[idx[leftpos]]))\n end\n if rightpos then\n cand = mmi(cand, mab(pos[idx_i] - pos[idx[rightpos]]))\n end\n retval = retval + cand * val[idx_i]\n end\n end\n return retval\nend\n\nlocal ret = false\nlocal g_ik = 0\nlocal xs, ys = {}, {}\nlocal function add_func(idx)\n local xv = x[idx]\n local yv = y[idx]\n xs[xv] = xs[xv] - p[idx]\n if xs[xv] == 0 then xs[xv] = nil end\n if not ys[yv] then\n ys[yv] = p[idx]\n else\n ys[yv] = ys[yv] + p[idx]\n end\nend\nlocal function rm_func(idx)\n local xv = x[idx]\n local yv = y[idx]\n ys[yv] = ys[yv] - p[idx]\n if ys[yv] == 0 then ys[yv] = nil end\n if not xs[xv] then\n xs[xv] = p[idx]\n else\n xs[xv] = xs[xv] + p[idx]\n end\nend\nlocal function work_func()\n local cand = 0\n for xline = 0, g_ik do\n local yline = g_ik - xline\n local xcost = getmincost(xs, xline)\n local ycost = getmincost(ys, yline)\n local z = xcost + ycost\n if xline == 0 then\n cand = z\n elseif z < cand then\n cand = z\n end\n end\n if not ret then\n ret = cand\n elseif cand < ret then\n ret = cand\n end\nend\n\nfor ik = 0, n do\n g_ik = ik\n ret = false\n xs, ys = {}, {}\n for j = 1, n do\n local xj = x[j]\n if not xs[xj] then\n xs[xj] = p[j]\n else\n xs[xj] = xs[xj] + p[j]\n end\n end\n grayWalk(n, add_func, rm_func, work_func)\n print(ret)\nend\n", "problem_context": "Score: 500 points\n\nProblem Statement\n\nNew AtCoder City has an infinite grid of streets, as follows:\n\nAt the center of the city stands a clock tower. Let (0, 0) be the coordinates of this point.\n\nA straight street, which we will call East-West Main Street, runs east-west and passes the clock tower. It corresponds to the x-axis in the two-dimensional coordinate plane.\n\nThere are also other infinitely many streets parallel to East-West Main Street, with a distance of 1 between them. They correspond to the lines \\ldots, y = -2, y = -1, y = 1, y = 2, \\ldots in the two-dimensional coordinate plane.\n\nA straight street, which we will call North-South Main Street, runs north-south and passes the clock tower. It corresponds to the y-axis in the two-dimensional coordinate plane.\n\nThere are also other infinitely many streets parallel to North-South Main Street, with a distance of 1 between them. They correspond to the lines \\ldots, x = -2, x = -1, x = 1, x = 2, \\ldots in the two-dimensional coordinate plane.\n\nThere are N residential areas in New AtCoder City. The i-th area is located at the intersection with the coordinates (X_i, Y_i) and has a population of P_i. Each citizen in the city lives in one of these areas.\n\nThe city currently has only two railroads, stretching infinitely, one along East-West Main Street and the other along North-South Main Street.\n\nM-kun, the mayor, thinks that they are not enough for the commuters, so he decides to choose K streets and build a railroad stretching infinitely along each of those streets.\n\nLet the walking distance of each citizen be the distance from his/her residential area to the nearest railroad.\n\nM-kun wants to build railroads so that the sum of the walking distances of all citizens, S, is minimized.\n\nFor each K = 0, 1, 2, \\dots, N, what is the minimum possible value of S after building railroads?\n\nConstraints\n\n1 \\leq N \\leq 15\n\n-10 \\ 000 \\leq X_i \\leq 10 \\ 000\n\n-10 \\ 000 \\leq Y_i \\leq 10 \\ 000\n\n1 \\leq P_i \\leq 1 \\ 000 \\ 000\n\nThe locations of the N residential areas, (X_i, Y_i), are all distinct.\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 P_1\nX_2 Y_2 P_2\n: : :\nX_N Y_N P_N\n\nOutput\n\nPrint the answer in N+1 lines.\n\nThe i-th line (i = 1, \\ldots, N+1) should contain the minimum possible value of S after building railroads for the case K = i-1.\n\nSample Input 1\n\n3\n1 2 300\n3 3 600\n1 4 800\n\nSample Output 1\n\n2900\n900\n0\n0\n\nWhen K = 0, the residents of Area 1, 2, and 3 have to walk the distances of 1, 3, and 1, respectively, to reach a railroad.\n\nThus, the sum of the walking distances of all citizens, S, is 1 \\times 300 + 3 \\times 600 + 1 \\times 800 = 2900.\n\nWhen K = 1, if we build a railroad along the street corresponding to the line y = 4 in the coordinate plane, the walking distances of the citizens of Area 1, 2, and 3 become 1, 1, and 0, respectively.\n\nThen, S = 1 \\times 300 + 1 \\times 600 + 0 \\times 800 = 900.\n\nWe have many other options for where we build the railroad, but none of them makes S less than 900.\n\nWhen K = 2, if we build a railroad along the street corresponding to the lines x = 1 and x = 3 in the coordinate plane, all citizens can reach a railroad with the walking distance of 0, so S = 0. We can also have S = 0 when K = 3.\n\nThe figure below shows the optimal way to build railroads for the cases K = 0, 1, 2.\n\nThe street painted blue represents the roads along which we build railroads.\n\nSample Input 2\n\n5\n3 5 400\n5 3 700\n5 5 1000\n5 7 700\n7 5 400\n\nSample Output 2\n\n13800\n1600\n0\n0\n0\n0\n\nThe figure below shows the optimal way to build railroads for the cases K = 1, 2.\n\nSample Input 3\n\n6\n2 5 1000\n5 2 1100\n5 5 1700\n-2 -5 900\n-5 -2 600\n-5 -5 2200\n\nSample Output 3\n\n26700\n13900\n3200\n1200\n0\n0\n0\n\nThe figure below shows the optimal way to build railroads for the case K = 3.\n\nSample Input 4\n\n8\n2 2 286017\n3 1 262355\n2 -2 213815\n1 -3 224435\n-2 -2 136860\n-3 -1 239338\n-2 2 217647\n-1 3 141903\n\nSample Output 4\n\n2576709\n1569381\n868031\n605676\n366338\n141903\n0\n0\n0\n\nThe figure below shows the optimal way to build railroads for the case K = 4.", "sample_input": "3\n1 2 300\n3 3 600\n1 4 800\n"}, "reference_outputs": ["2900\n900\n0\n0\n"], "source_document_id": "p02604", "source_text": "Score: 500 points\n\nProblem Statement\n\nNew AtCoder City has an infinite grid of streets, as follows:\n\nAt the center of the city stands a clock tower. Let (0, 0) be the coordinates of this point.\n\nA straight street, which we will call East-West Main Street, runs east-west and passes the clock tower. It corresponds to the x-axis in the two-dimensional coordinate plane.\n\nThere are also other infinitely many streets parallel to East-West Main Street, with a distance of 1 between them. They correspond to the lines \\ldots, y = -2, y = -1, y = 1, y = 2, \\ldots in the two-dimensional coordinate plane.\n\nA straight street, which we will call North-South Main Street, runs north-south and passes the clock tower. It corresponds to the y-axis in the two-dimensional coordinate plane.\n\nThere are also other infinitely many streets parallel to North-South Main Street, with a distance of 1 between them. They correspond to the lines \\ldots, x = -2, x = -1, x = 1, x = 2, \\ldots in the two-dimensional coordinate plane.\n\nThere are N residential areas in New AtCoder City. The i-th area is located at the intersection with the coordinates (X_i, Y_i) and has a population of P_i. Each citizen in the city lives in one of these areas.\n\nThe city currently has only two railroads, stretching infinitely, one along East-West Main Street and the other along North-South Main Street.\n\nM-kun, the mayor, thinks that they are not enough for the commuters, so he decides to choose K streets and build a railroad stretching infinitely along each of those streets.\n\nLet the walking distance of each citizen be the distance from his/her residential area to the nearest railroad.\n\nM-kun wants to build railroads so that the sum of the walking distances of all citizens, S, is minimized.\n\nFor each K = 0, 1, 2, \\dots, N, what is the minimum possible value of S after building railroads?\n\nConstraints\n\n1 \\leq N \\leq 15\n\n-10 \\ 000 \\leq X_i \\leq 10 \\ 000\n\n-10 \\ 000 \\leq Y_i \\leq 10 \\ 000\n\n1 \\leq P_i \\leq 1 \\ 000 \\ 000\n\nThe locations of the N residential areas, (X_i, Y_i), are all distinct.\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 P_1\nX_2 Y_2 P_2\n: : :\nX_N Y_N P_N\n\nOutput\n\nPrint the answer in N+1 lines.\n\nThe i-th line (i = 1, \\ldots, N+1) should contain the minimum possible value of S after building railroads for the case K = i-1.\n\nSample Input 1\n\n3\n1 2 300\n3 3 600\n1 4 800\n\nSample Output 1\n\n2900\n900\n0\n0\n\nWhen K = 0, the residents of Area 1, 2, and 3 have to walk the distances of 1, 3, and 1, respectively, to reach a railroad.\n\nThus, the sum of the walking distances of all citizens, S, is 1 \\times 300 + 3 \\times 600 + 1 \\times 800 = 2900.\n\nWhen K = 1, if we build a railroad along the street corresponding to the line y = 4 in the coordinate plane, the walking distances of the citizens of Area 1, 2, and 3 become 1, 1, and 0, respectively.\n\nThen, S = 1 \\times 300 + 1 \\times 600 + 0 \\times 800 = 900.\n\nWe have many other options for where we build the railroad, but none of them makes S less than 900.\n\nWhen K = 2, if we build a railroad along the street corresponding to the lines x = 1 and x = 3 in the coordinate plane, all citizens can reach a railroad with the walking distance of 0, so S = 0. We can also have S = 0 when K = 3.\n\nThe figure below shows the optimal way to build railroads for the cases K = 0, 1, 2.\n\nThe street painted blue represents the roads along which we build railroads.\n\nSample Input 2\n\n5\n3 5 400\n5 3 700\n5 5 1000\n5 7 700\n7 5 400\n\nSample Output 2\n\n13800\n1600\n0\n0\n0\n0\n\nThe figure below shows the optimal way to build railroads for the cases K = 1, 2.\n\nSample Input 3\n\n6\n2 5 1000\n5 2 1100\n5 5 1700\n-2 -5 900\n-5 -2 600\n-5 -5 2200\n\nSample Output 3\n\n26700\n13900\n3200\n1200\n0\n0\n0\n\nThe figure below shows the optimal way to build railroads for the case K = 3.\n\nSample Input 4\n\n8\n2 2 286017\n3 1 262355\n2 -2 213815\n1 -3 224435\n-2 -2 136860\n-3 -1 239338\n-2 2 217647\n-1 3 141903\n\nSample Output 4\n\n2576709\n1569381\n868031\n605676\n366338\n141903\n0\n0\n0\n\nThe figure below shows the optimal way to build railroads for the case K = 4.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3097, "cpu_time_ms": 3308, "memory_kb": 2660}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s848282010", "group_id": "codeNet:p02605", "input_text": "local mmi = math.min\nlocal mfl = math.floor\n\nlocal function comp(a, b)\n return a < b\nend\n\nlocal function lower_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if not comp(ary[1], x) then return 1 end\n if comp(ary[num], x) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if comp(ary[mid], x) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal function upper_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if comp(x, ary[1]) then return 1 end\n if not comp(x, ary[num]) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if not comp(x, ary[mid]) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = \"\"\n\n\nlocal function create()\n local struct = {}\n struct.xpy = {}\n struct.xmy = {}\n struct.x = {}\n struct.y = {}\n return struct\nend\nlocal toleft = create()\nlocal toright = create()\nlocal toup = create()\nlocal todown = create()\n\nlocal function ins(tbl, x, y)\n local xpy, xmy = x + y, x - y\n if not tbl.xpy[xpy] then tbl.xpy[xpy] = {} end\n table.insert(tbl.xpy[xpy], x)\n if not tbl.xmy[xmy] then tbl.xmy[xmy] = {} end\n table.insert(tbl.xmy[xmy], x)\n if not tbl.x[x] then tbl.x[x] = {} end\n table.insert(tbl.x[x], y)\n if not tbl.y[y] then tbl.y[y] = {} end\n table.insert(tbl.y[y], x)\nend\nlocal function sortall(tbl)\n local z = {tbl.xpy, tbl.xmy, tbl.x, tbl.y}\n for i = 1, 4 do\n for k, t in pairs(z[i]) do\n table.sort(t)\n end\n end\nend\n\nlocal raw_x, raw_y, raw_d = {}, {}, {}\nfor i = 1, n do\n s = io.read()\n local x, y, d = s:match(\"(%d+) (%d+) (%w)\")\n x, y = tonumber(x), tonumber(y)\n raw_x[i], raw_y[i], raw_d[i] = x, y, d\n if d == \"L\" then\n ins(toleft, x, y)\n elseif d == \"R\" then\n ins(toright, x, y)\n elseif d == \"U\" then\n ins(toup, x, y)\n else\n ins(todown, x, y)\n end\nend\nsortall(toleft)\nsortall(toright)\nsortall(toup)\nsortall(todown)\n\nlocal ans = false\nlocal function solvelb(tbl, z, mul)\n if tbl then\n local p = lower_bound(tbl, z) - 1\n if 0 < p then\n local v = (z - tbl[p]) * mul\n if not ans or v < ans then\n ans = v\n end\n end\n end\nend\n\nfor i = 1, n do\n local x, y, d = raw_x[i], raw_y[i], raw_d[i]\n local xpy, xmy = x + y, x - y\n if d == \"L\" then\n --toLeft vs toRight\n solvelb(toright.y[y], x, 5)\n --toLeft vs toUp\n solvelb(toup.xmy[xmy], x, 10)\n --toLeft vs toDown\n solvelb(todown.xpy[xpy], x, 10)\n elseif d == \"R\" then\n elseif d == \"U\" then\n -- toUp vs toRight\n solvelb(toright.xpy[xpy], x, 10)\n else\n -- toDown vs toRight\n solvelb(toright.xmy[xmy], x, 10)\n -- toDown vs toUp\n solvelb(toup.x[x], y, 5)\n end\nend\nprint(ans and ans or \"SAFE\")\n", "language": "Lua", "metadata": {"date": 1595893124, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02605.html", "problem_id": "p02605", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02605/input.txt", "sample_output_relpath": "derived/input_output/data/p02605/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02605/Lua/s848282010.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s848282010", "user_id": "u120582723"}, "prompt_components": {"gold_output": "230\n", "input_to_evaluate": "local mmi = math.min\nlocal mfl = math.floor\n\nlocal function comp(a, b)\n return a < b\nend\n\nlocal function lower_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if not comp(ary[1], x) then return 1 end\n if comp(ary[num], x) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if comp(ary[mid], x) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal function upper_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if comp(x, ary[1]) then return 1 end\n if not comp(x, ary[num]) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if not comp(x, ary[mid]) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = \"\"\n\n\nlocal function create()\n local struct = {}\n struct.xpy = {}\n struct.xmy = {}\n struct.x = {}\n struct.y = {}\n return struct\nend\nlocal toleft = create()\nlocal toright = create()\nlocal toup = create()\nlocal todown = create()\n\nlocal function ins(tbl, x, y)\n local xpy, xmy = x + y, x - y\n if not tbl.xpy[xpy] then tbl.xpy[xpy] = {} end\n table.insert(tbl.xpy[xpy], x)\n if not tbl.xmy[xmy] then tbl.xmy[xmy] = {} end\n table.insert(tbl.xmy[xmy], x)\n if not tbl.x[x] then tbl.x[x] = {} end\n table.insert(tbl.x[x], y)\n if not tbl.y[y] then tbl.y[y] = {} end\n table.insert(tbl.y[y], x)\nend\nlocal function sortall(tbl)\n local z = {tbl.xpy, tbl.xmy, tbl.x, tbl.y}\n for i = 1, 4 do\n for k, t in pairs(z[i]) do\n table.sort(t)\n end\n end\nend\n\nlocal raw_x, raw_y, raw_d = {}, {}, {}\nfor i = 1, n do\n s = io.read()\n local x, y, d = s:match(\"(%d+) (%d+) (%w)\")\n x, y = tonumber(x), tonumber(y)\n raw_x[i], raw_y[i], raw_d[i] = x, y, d\n if d == \"L\" then\n ins(toleft, x, y)\n elseif d == \"R\" then\n ins(toright, x, y)\n elseif d == \"U\" then\n ins(toup, x, y)\n else\n ins(todown, x, y)\n end\nend\nsortall(toleft)\nsortall(toright)\nsortall(toup)\nsortall(todown)\n\nlocal ans = false\nlocal function solvelb(tbl, z, mul)\n if tbl then\n local p = lower_bound(tbl, z) - 1\n if 0 < p then\n local v = (z - tbl[p]) * mul\n if not ans or v < ans then\n ans = v\n end\n end\n end\nend\n\nfor i = 1, n do\n local x, y, d = raw_x[i], raw_y[i], raw_d[i]\n local xpy, xmy = x + y, x - y\n if d == \"L\" then\n --toLeft vs toRight\n solvelb(toright.y[y], x, 5)\n --toLeft vs toUp\n solvelb(toup.xmy[xmy], x, 10)\n --toLeft vs toDown\n solvelb(todown.xpy[xpy], x, 10)\n elseif d == \"R\" then\n elseif d == \"U\" then\n -- toUp vs toRight\n solvelb(toright.xpy[xpy], x, 10)\n else\n -- toDown vs toRight\n solvelb(toright.xmy[xmy], x, 10)\n -- toDown vs toUp\n solvelb(toup.x[x], y, 5)\n end\nend\nprint(ans and ans or \"SAFE\")\n", "problem_context": "Score: 600 points\n\nProblem Statement\n\nM-kun is a brilliant air traffic controller.\n\nOn the display of his radar, there are N airplanes numbered 1, 2, ..., N, all flying at the same altitude.\n\nEach of the airplanes flies at a constant speed of 0.1 per second in a constant direction. The current coordinates of the airplane numbered i are (X_i, Y_i), and the direction of the airplane is as follows:\n\nif U_i is U, it flies in the positive y direction;\n\nif U_i is R, it flies in the positive x direction;\n\nif U_i is D, it flies in the negative y direction;\n\nif U_i is L, it flies in the negative x direction.\n\nTo help M-kun in his work, determine whether there is a pair of airplanes that will collide with each other if they keep flying as they are now.\n\nIf there is such a pair, find the number of seconds after which the first collision will happen.\n\nWe assume that the airplanes are negligibly small so that two airplanes only collide when they reach the same coordinates simultaneously.\n\nConstraints\n\n1 \\leq N \\leq 200000\n\n0 \\leq X_i, Y_i \\leq 200000\n\nU_i is U, R, D, or L.\n\nThe current positions of the N airplanes, (X_i, Y_i), are all distinct.\n\nN, X_i, and Y_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 Y_1 U_1\nX_2 Y_2 U_2\nX_3 Y_3 U_3\n:\nX_N Y_N U_N\n\nOutput\n\nIf there is a pair of airplanes that will collide with each other if they keep flying as they are now, print an integer representing the number of seconds after which the first collision will happen.\n\nIf there is no such pair, print SAFE.\n\nSample Input 1\n\n2\n11 1 U\n11 47 D\n\nSample Output 1\n\n230\n\nIf the airplanes keep flying as they are now, two airplanes numbered 1 and 2 will reach the coordinates (11, 24) simultaneously and collide.\n\nSample Input 2\n\n4\n20 30 U\n30 20 R\n20 10 D\n10 20 L\n\nSample Output 2\n\nSAFE\n\nNo pair of airplanes will collide.\n\nSample Input 3\n\n8\n168 224 U\n130 175 R\n111 198 D\n121 188 L\n201 116 U\n112 121 R\n145 239 D\n185 107 L\n\nSample Output 3\n\n100", "sample_input": "2\n11 1 U\n11 47 D\n"}, "reference_outputs": ["230\n"], "source_document_id": "p02605", "source_text": "Score: 600 points\n\nProblem Statement\n\nM-kun is a brilliant air traffic controller.\n\nOn the display of his radar, there are N airplanes numbered 1, 2, ..., N, all flying at the same altitude.\n\nEach of the airplanes flies at a constant speed of 0.1 per second in a constant direction. The current coordinates of the airplane numbered i are (X_i, Y_i), and the direction of the airplane is as follows:\n\nif U_i is U, it flies in the positive y direction;\n\nif U_i is R, it flies in the positive x direction;\n\nif U_i is D, it flies in the negative y direction;\n\nif U_i is L, it flies in the negative x direction.\n\nTo help M-kun in his work, determine whether there is a pair of airplanes that will collide with each other if they keep flying as they are now.\n\nIf there is such a pair, find the number of seconds after which the first collision will happen.\n\nWe assume that the airplanes are negligibly small so that two airplanes only collide when they reach the same coordinates simultaneously.\n\nConstraints\n\n1 \\leq N \\leq 200000\n\n0 \\leq X_i, Y_i \\leq 200000\n\nU_i is U, R, D, or L.\n\nThe current positions of the N airplanes, (X_i, Y_i), are all distinct.\n\nN, X_i, and Y_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 Y_1 U_1\nX_2 Y_2 U_2\nX_3 Y_3 U_3\n:\nX_N Y_N U_N\n\nOutput\n\nIf there is a pair of airplanes that will collide with each other if they keep flying as they are now, print an integer representing the number of seconds after which the first collision will happen.\n\nIf there is no such pair, print SAFE.\n\nSample Input 1\n\n2\n11 1 U\n11 47 D\n\nSample Output 1\n\n230\n\nIf the airplanes keep flying as they are now, two airplanes numbered 1 and 2 will reach the coordinates (11, 24) simultaneously and collide.\n\nSample Input 2\n\n4\n20 30 U\n30 20 R\n20 10 D\n10 20 L\n\nSample Output 2\n\nSAFE\n\nNo pair of airplanes will collide.\n\nSample Input 3\n\n8\n168 224 U\n130 175 R\n111 198 D\n121 188 L\n201 116 U\n112 121 R\n145 239 D\n185 107 L\n\nSample Output 3\n\n100", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2840, "cpu_time_ms": 869, "memory_kb": 91256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s731484519", "group_id": "codeNet:p02605", "input_text": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\nlocal function array(dimensi0n, default_val) assert(type(default_val) ~= 'table') local n=dimensi0n local m={}if default_val~=nil then m[1]={__index=function()return default_val end}end for i=2,n do m[i]={__index=function(p, k)local c=setmetatable({},m[i-1])rawset(p,k,c)return c end}end return setmetatable({},m[n])end\nlocal function tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"\" end if o == _G then return \"<_G>\" end local indent0 = (\" \"):rep((depth) * 2) local indent1 = (\" \"):rep((depth+1) * 2) local indent2= (\" \"):rep((depth+2) * 2) if type(o) == 'table' then local keys = {} local types = {} for k in pairs(o) do types[type(k)] = true table.insert(keys, k) end local types_count = 0 local lasttype for k in pairs(types) do types_count = types_count + 1 lasttype = k end if types_count == 1 and (lasttype == 'string' or lasttype == 'number') then table.sort(keys) end local inside = {} for i=1,#keys do local k = keys[i] local v = o[k] if type(k) == 'string' then k = string.format('%q', k) end table.insert(inside, indent1 .. '['..tostring(k)..'] = ' .. tostringxx(v, depth + 1)) end return '{\\n' .. table.concat(inside, ',\\n') .. '\\n' .. indent0 .. '}' else if type(o) == 'string' then o = string.format('%q', o) end return tostring(o) end end\nlocal function richtraceback() local x = 2 while true do local info = debug.getinfo(x) if not info then break end local fname = '<' .. info.short_src .. \":\" .. info.linedefined .. \">\" if info.name then fname = info.name end print(info.short_src .. \":\" .. info.currentline .. \": in \" .. (\"%q\"):format(fname)) print(\" LOCALS:\") local p = 1 while true do local name, val = debug.getlocal(x,p) if not name then break end print(\" \" .. name .. \": \" .. tostringxx(val, 3)) p = p + 1 end print(\" UPVALUES:\") for p=1,info.nups do local name, val = debug.getupvalue(info.func,p) if not name then break end print(\" \" .. name .. \": \" .. tostringxx(val, 3)) end x = x + 1 end end\nlocal function myassert(b) if not b then richtraceback() error(\"assertion failed\") end end \n--\nlocal DBG = false\nlocal insert = table.insert\nlocal min = math.min\nlocal sort = table.sort\nlocal function getkeys(t)\n local keys = {}\n for k,v in pairs(t) do\n insert(keys, k)\n end\n sort(keys)\n return keys\nend\n\nlocal function dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n--\nlocal N = read.nl()\nlocal X, Y, U = {},{},{}\nlocal yy = {}\nlocal xx = {}\nlocal rr = {} -- right down\nlocal ll = {} -- left down\nlocal function push(tt, p, e)\n if not tt[p] then\n tt[p] = {}\n end\n insert(tt[p], e)\nend\nfor i=1,N do\n X[i], Y[i], U[i] = read.nnl()\n U[i] = U[i]:sub(2,2)\n local e = i\n push(yy, Y[i], e)\n push(xx, X[i], e)\n local rrp = X[i] + Y[i]\n push(rr, rrp, e)\n local llp = X[i] - Y[i]\n push(ll, llp, e)\nend\n--richtraceback()\nlocal INF = 10^18\nlocal nearest_crash = INF\nlocal function f1(name, tt, ttk, inv, fw, bk, sp)\n for _,w in ipairs(ttk) do\n local t = tt[w]\n dbgpr(\"on same \" .. name , w)\n local inttk = {}\n for _,i in ipairs(t) do\n if U[i] == fw or U[i] == bk then\n insert(inttk, {inv[i], i, U[i]})\n end\n end\n sort(inttk, function (a1, a2)\n return a1[1] < a2[1]\n end)\n local state = 0\n local recentfwinv = -200000\n for _,ee in ipairs(inttk) do\n local i = ee[2]\n if U[i] == fw or U[i] == bk then\n dbgpr(\"plane #\" .. i, \"inv=\"..inv[i], \"X=\"..X[i], \"Y=\"..Y[i], U[i])\n if state == 0 then\n if U[i] == fw then\n state = 1\n recentfwinv = inv[i]\n end\n elseif state == 1 then\n if U[i] == fw then\n recentfwinv = inv[i]\n elseif U[i] == bk then\n local d = inv[i] - recentfwinv\n nearest_crash = min(nearest_crash, d * sp)\n dbgpr(\"crash!\", i, nearest_crash)\n end\n end\n end\n end\n end\n \nend\nf1('Y', yy, getkeys(yy), X, 'R', 'L', 5)\nf1('X', xx, getkeys(xx), Y, 'U', 'D', 5)\nlocal rrk = getkeys(rr)\nf1('rr', rr, rrk, X, 'R', 'U', 10)\nf1('rr', rr, rrk, X, 'D', 'L', 10)\nlocal llk = getkeys(ll)\nf1('ll', ll, llk, X, 'U', 'L', 10)\nf1('ll', ll, llk, X, 'R', 'D', 10)\n\nif nearest_crash == INF then\n print(\"SAFE\")\nelse\n print(nearest_crash)\nend\n", "language": "Lua", "metadata": {"date": 1595797967, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02605.html", "problem_id": "p02605", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02605/input.txt", "sample_output_relpath": "derived/input_output/data/p02605/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02605/Lua/s731484519.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s731484519", "user_id": "u162773977"}, "prompt_components": {"gold_output": "230\n", "input_to_evaluate": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\nlocal function array(dimensi0n, default_val) assert(type(default_val) ~= 'table') local n=dimensi0n local m={}if default_val~=nil then m[1]={__index=function()return default_val end}end for i=2,n do m[i]={__index=function(p, k)local c=setmetatable({},m[i-1])rawset(p,k,c)return c end}end return setmetatable({},m[n])end\nlocal function tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"\" end if o == _G then return \"<_G>\" end local indent0 = (\" \"):rep((depth) * 2) local indent1 = (\" \"):rep((depth+1) * 2) local indent2= (\" \"):rep((depth+2) * 2) if type(o) == 'table' then local keys = {} local types = {} for k in pairs(o) do types[type(k)] = true table.insert(keys, k) end local types_count = 0 local lasttype for k in pairs(types) do types_count = types_count + 1 lasttype = k end if types_count == 1 and (lasttype == 'string' or lasttype == 'number') then table.sort(keys) end local inside = {} for i=1,#keys do local k = keys[i] local v = o[k] if type(k) == 'string' then k = string.format('%q', k) end table.insert(inside, indent1 .. '['..tostring(k)..'] = ' .. tostringxx(v, depth + 1)) end return '{\\n' .. table.concat(inside, ',\\n') .. '\\n' .. indent0 .. '}' else if type(o) == 'string' then o = string.format('%q', o) end return tostring(o) end end\nlocal function richtraceback() local x = 2 while true do local info = debug.getinfo(x) if not info then break end local fname = '<' .. info.short_src .. \":\" .. info.linedefined .. \">\" if info.name then fname = info.name end print(info.short_src .. \":\" .. info.currentline .. \": in \" .. (\"%q\"):format(fname)) print(\" LOCALS:\") local p = 1 while true do local name, val = debug.getlocal(x,p) if not name then break end print(\" \" .. name .. \": \" .. tostringxx(val, 3)) p = p + 1 end print(\" UPVALUES:\") for p=1,info.nups do local name, val = debug.getupvalue(info.func,p) if not name then break end print(\" \" .. name .. \": \" .. tostringxx(val, 3)) end x = x + 1 end end\nlocal function myassert(b) if not b then richtraceback() error(\"assertion failed\") end end \n--\nlocal DBG = false\nlocal insert = table.insert\nlocal min = math.min\nlocal sort = table.sort\nlocal function getkeys(t)\n local keys = {}\n for k,v in pairs(t) do\n insert(keys, k)\n end\n sort(keys)\n return keys\nend\n\nlocal function dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n--\nlocal N = read.nl()\nlocal X, Y, U = {},{},{}\nlocal yy = {}\nlocal xx = {}\nlocal rr = {} -- right down\nlocal ll = {} -- left down\nlocal function push(tt, p, e)\n if not tt[p] then\n tt[p] = {}\n end\n insert(tt[p], e)\nend\nfor i=1,N do\n X[i], Y[i], U[i] = read.nnl()\n U[i] = U[i]:sub(2,2)\n local e = i\n push(yy, Y[i], e)\n push(xx, X[i], e)\n local rrp = X[i] + Y[i]\n push(rr, rrp, e)\n local llp = X[i] - Y[i]\n push(ll, llp, e)\nend\n--richtraceback()\nlocal INF = 10^18\nlocal nearest_crash = INF\nlocal function f1(name, tt, ttk, inv, fw, bk, sp)\n for _,w in ipairs(ttk) do\n local t = tt[w]\n dbgpr(\"on same \" .. name , w)\n local inttk = {}\n for _,i in ipairs(t) do\n if U[i] == fw or U[i] == bk then\n insert(inttk, {inv[i], i, U[i]})\n end\n end\n sort(inttk, function (a1, a2)\n return a1[1] < a2[1]\n end)\n local state = 0\n local recentfwinv = -200000\n for _,ee in ipairs(inttk) do\n local i = ee[2]\n if U[i] == fw or U[i] == bk then\n dbgpr(\"plane #\" .. i, \"inv=\"..inv[i], \"X=\"..X[i], \"Y=\"..Y[i], U[i])\n if state == 0 then\n if U[i] == fw then\n state = 1\n recentfwinv = inv[i]\n end\n elseif state == 1 then\n if U[i] == fw then\n recentfwinv = inv[i]\n elseif U[i] == bk then\n local d = inv[i] - recentfwinv\n nearest_crash = min(nearest_crash, d * sp)\n dbgpr(\"crash!\", i, nearest_crash)\n end\n end\n end\n end\n end\n \nend\nf1('Y', yy, getkeys(yy), X, 'R', 'L', 5)\nf1('X', xx, getkeys(xx), Y, 'U', 'D', 5)\nlocal rrk = getkeys(rr)\nf1('rr', rr, rrk, X, 'R', 'U', 10)\nf1('rr', rr, rrk, X, 'D', 'L', 10)\nlocal llk = getkeys(ll)\nf1('ll', ll, llk, X, 'U', 'L', 10)\nf1('ll', ll, llk, X, 'R', 'D', 10)\n\nif nearest_crash == INF then\n print(\"SAFE\")\nelse\n print(nearest_crash)\nend\n", "problem_context": "Score: 600 points\n\nProblem Statement\n\nM-kun is a brilliant air traffic controller.\n\nOn the display of his radar, there are N airplanes numbered 1, 2, ..., N, all flying at the same altitude.\n\nEach of the airplanes flies at a constant speed of 0.1 per second in a constant direction. The current coordinates of the airplane numbered i are (X_i, Y_i), and the direction of the airplane is as follows:\n\nif U_i is U, it flies in the positive y direction;\n\nif U_i is R, it flies in the positive x direction;\n\nif U_i is D, it flies in the negative y direction;\n\nif U_i is L, it flies in the negative x direction.\n\nTo help M-kun in his work, determine whether there is a pair of airplanes that will collide with each other if they keep flying as they are now.\n\nIf there is such a pair, find the number of seconds after which the first collision will happen.\n\nWe assume that the airplanes are negligibly small so that two airplanes only collide when they reach the same coordinates simultaneously.\n\nConstraints\n\n1 \\leq N \\leq 200000\n\n0 \\leq X_i, Y_i \\leq 200000\n\nU_i is U, R, D, or L.\n\nThe current positions of the N airplanes, (X_i, Y_i), are all distinct.\n\nN, X_i, and Y_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 Y_1 U_1\nX_2 Y_2 U_2\nX_3 Y_3 U_3\n:\nX_N Y_N U_N\n\nOutput\n\nIf there is a pair of airplanes that will collide with each other if they keep flying as they are now, print an integer representing the number of seconds after which the first collision will happen.\n\nIf there is no such pair, print SAFE.\n\nSample Input 1\n\n2\n11 1 U\n11 47 D\n\nSample Output 1\n\n230\n\nIf the airplanes keep flying as they are now, two airplanes numbered 1 and 2 will reach the coordinates (11, 24) simultaneously and collide.\n\nSample Input 2\n\n4\n20 30 U\n30 20 R\n20 10 D\n10 20 L\n\nSample Output 2\n\nSAFE\n\nNo pair of airplanes will collide.\n\nSample Input 3\n\n8\n168 224 U\n130 175 R\n111 198 D\n121 188 L\n201 116 U\n112 121 R\n145 239 D\n185 107 L\n\nSample Output 3\n\n100", "sample_input": "2\n11 1 U\n11 47 D\n"}, "reference_outputs": ["230\n"], "source_document_id": "p02605", "source_text": "Score: 600 points\n\nProblem Statement\n\nM-kun is a brilliant air traffic controller.\n\nOn the display of his radar, there are N airplanes numbered 1, 2, ..., N, all flying at the same altitude.\n\nEach of the airplanes flies at a constant speed of 0.1 per second in a constant direction. The current coordinates of the airplane numbered i are (X_i, Y_i), and the direction of the airplane is as follows:\n\nif U_i is U, it flies in the positive y direction;\n\nif U_i is R, it flies in the positive x direction;\n\nif U_i is D, it flies in the negative y direction;\n\nif U_i is L, it flies in the negative x direction.\n\nTo help M-kun in his work, determine whether there is a pair of airplanes that will collide with each other if they keep flying as they are now.\n\nIf there is such a pair, find the number of seconds after which the first collision will happen.\n\nWe assume that the airplanes are negligibly small so that two airplanes only collide when they reach the same coordinates simultaneously.\n\nConstraints\n\n1 \\leq N \\leq 200000\n\n0 \\leq X_i, Y_i \\leq 200000\n\nU_i is U, R, D, or L.\n\nThe current positions of the N airplanes, (X_i, Y_i), are all distinct.\n\nN, X_i, and Y_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 Y_1 U_1\nX_2 Y_2 U_2\nX_3 Y_3 U_3\n:\nX_N Y_N U_N\n\nOutput\n\nIf there is a pair of airplanes that will collide with each other if they keep flying as they are now, print an integer representing the number of seconds after which the first collision will happen.\n\nIf there is no such pair, print SAFE.\n\nSample Input 1\n\n2\n11 1 U\n11 47 D\n\nSample Output 1\n\n230\n\nIf the airplanes keep flying as they are now, two airplanes numbered 1 and 2 will reach the coordinates (11, 24) simultaneously and collide.\n\nSample Input 2\n\n4\n20 30 U\n30 20 R\n20 10 D\n10 20 L\n\nSample Output 2\n\nSAFE\n\nNo pair of airplanes will collide.\n\nSample Input 3\n\n8\n168 224 U\n130 175 R\n111 198 D\n121 188 L\n201 116 U\n112 121 R\n145 239 D\n185 107 L\n\nSample Output 3\n\n100", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5079, "cpu_time_ms": 3232, "memory_kb": 172292}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s178534121", "group_id": "codeNet:p02605", "input_text": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\nlocal function array(dimensi0n, default_val) assert(type(default_val) ~= 'table') local n=dimensi0n local m={}if default_val~=nil then m[1]={__index=function()return default_val end}end for i=2,n do m[i]={__index=function(p, k)local c=setmetatable({},m[i-1])rawset(p,k,c)return c end}end return setmetatable({},m[n])end\nlocal function tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"\" end if o == _G then return \"<_G>\" end local indent0 = (\" \"):rep((depth) * 2) local indent1 = (\" \"):rep((depth+1) * 2) local indent2= (\" \"):rep((depth+2) * 2) if type(o) == 'table' then local keys = {} local types = {} for k in pairs(o) do types[type(k)] = true table.insert(keys, k) end local types_count = 0 local lasttype for k in pairs(types) do types_count = types_count + 1 lasttype = k end if types_count == 1 and (lasttype == 'string' or lasttype == 'number') then table.sort(keys) end local inside = {} for i=1,#keys do local k = keys[i] local v = o[k] if type(k) == 'string' then k = string.format('%q', k) end table.insert(inside, indent1 .. '['..tostring(k)..'] = ' .. tostringxx(v, depth + 1)) end return '{\\n' .. table.concat(inside, ',\\n') .. '\\n' .. indent0 .. '}' else if type(o) == 'string' then o = string.format('%q', o) end return tostring(o) end end\nlocal function richtraceback() local x = 2 while true do local info = debug.getinfo(x) if not info then break end local fname = '<' .. info.short_src .. \":\" .. info.linedefined .. \">\" if info.name then fname = info.name end print(info.short_src .. \":\" .. info.currentline .. \": in \" .. (\"%q\"):format(fname)) print(\" LOCALS:\") local p = 1 while true do local name, val = debug.getlocal(x,p) if not name then break end print(\" \" .. name .. \": \" .. tostringxx(val, 3)) p = p + 1 end print(\" UPVALUES:\") for p=1,info.nups do local name, val = debug.getupvalue(info.func,p) if not name then break end print(\" \" .. name .. \": \" .. tostringxx(val, 3)) end x = x + 1 end end\nlocal function myassert(b) if not b then richtraceback() error(\"assertion failed\") end end \n--\nlocal DBG = false\nlocal insert = table.insert\nlocal function getkeys(t)\n local keys = {}\n for k,v in pairs(t) do\n insert(keys, k)\n end\n table.sort(keys)\n return keys\nend\n\nlocal function dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n--\nlocal N = read.nl()\nlocal X, Y, U = {},{},{}\nlocal yy = {}\nlocal xx = {}\nlocal rr = {} -- right down\nlocal ll = {} -- left down\nlocal function push(tt, p, e)\n if not tt[p] then\n tt[p] = {}\n end\n insert(tt[p], e)\nend\nfor i=1,N do\n X[i], Y[i], U[i] = read.nnl()\n U[i] = U[i]:sub(2,2)\n local e = i\n push(yy, Y[i], e)\n push(xx, X[i], e)\n local rrp = X[i] + Y[i]\n push(rr, rrp, e)\n local llp = X[i] - Y[i]\n push(ll, llp, e)\nend\n--richtraceback()\nlocal INF = 10^18\nlocal nearest_crash = INF\nlocal function f1(name, tt, inv, fw, bk, sp)\n local ttk = getkeys(tt)\n for _,w in ipairs(ttk) do\n local t = tt[w]\n dbgpr(\"on same \" .. name , w)\n local inttk = {}\n for _,i in ipairs(t) do\n if U[i] == fw or U[i] == bk then\n insert(inttk, {inv[i], i, U[i]})\n end\n end\n table.sort(inttk, function (a1, a2)\n return a1[1] < a2[1]\n end)\n local state = 0\n local recentfwinv = -200000\n for _,ee in ipairs(inttk) do\n local i = ee[2]\n if U[i] == fw or U[i] == bk then\n dbgpr(\"plane #\" .. i, \"inv=\"..inv[i], \"X=\"..X[i], \"Y=\"..Y[i], U[i])\n if state == 0 then\n if U[i] == fw then\n state = 1\n recentfwinv = inv[i]\n end\n elseif state == 1 then\n if U[i] == fw then\n recentfwinv = inv[i]\n elseif U[i] == bk then\n local d = inv[i] - recentfwinv\n nearest_crash = math.min(nearest_crash, d * sp)\n dbgpr(\"crash!\", i, nearest_crash)\n end\n end\n end\n end\n end\n \nend\nf1('Y', yy, X, 'R', 'L', 5)\nf1('X', xx, Y, 'U', 'D', 5)\nf1('rr', rr, X, 'R', 'U', 10)\nf1('rr', rr, X, 'D', 'L', 10)\nf1('ll', ll, X, 'U', 'L', 10)\nf1('ll', ll, X, 'R', 'D', 10)\n\nif nearest_crash == INF then\n print(\"SAFE\")\nelse\n print(nearest_crash)\nend", "language": "Lua", "metadata": {"date": 1595797570, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02605.html", "problem_id": "p02605", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02605/input.txt", "sample_output_relpath": "derived/input_output/data/p02605/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02605/Lua/s178534121.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s178534121", "user_id": "u162773977"}, "prompt_components": {"gold_output": "230\n", "input_to_evaluate": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\nlocal function array(dimensi0n, default_val) assert(type(default_val) ~= 'table') local n=dimensi0n local m={}if default_val~=nil then m[1]={__index=function()return default_val end}end for i=2,n do m[i]={__index=function(p, k)local c=setmetatable({},m[i-1])rawset(p,k,c)return c end}end return setmetatable({},m[n])end\nlocal function tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"\" end if o == _G then return \"<_G>\" end local indent0 = (\" \"):rep((depth) * 2) local indent1 = (\" \"):rep((depth+1) * 2) local indent2= (\" \"):rep((depth+2) * 2) if type(o) == 'table' then local keys = {} local types = {} for k in pairs(o) do types[type(k)] = true table.insert(keys, k) end local types_count = 0 local lasttype for k in pairs(types) do types_count = types_count + 1 lasttype = k end if types_count == 1 and (lasttype == 'string' or lasttype == 'number') then table.sort(keys) end local inside = {} for i=1,#keys do local k = keys[i] local v = o[k] if type(k) == 'string' then k = string.format('%q', k) end table.insert(inside, indent1 .. '['..tostring(k)..'] = ' .. tostringxx(v, depth + 1)) end return '{\\n' .. table.concat(inside, ',\\n') .. '\\n' .. indent0 .. '}' else if type(o) == 'string' then o = string.format('%q', o) end return tostring(o) end end\nlocal function richtraceback() local x = 2 while true do local info = debug.getinfo(x) if not info then break end local fname = '<' .. info.short_src .. \":\" .. info.linedefined .. \">\" if info.name then fname = info.name end print(info.short_src .. \":\" .. info.currentline .. \": in \" .. (\"%q\"):format(fname)) print(\" LOCALS:\") local p = 1 while true do local name, val = debug.getlocal(x,p) if not name then break end print(\" \" .. name .. \": \" .. tostringxx(val, 3)) p = p + 1 end print(\" UPVALUES:\") for p=1,info.nups do local name, val = debug.getupvalue(info.func,p) if not name then break end print(\" \" .. name .. \": \" .. tostringxx(val, 3)) end x = x + 1 end end\nlocal function myassert(b) if not b then richtraceback() error(\"assertion failed\") end end \n--\nlocal DBG = false\nlocal insert = table.insert\nlocal function getkeys(t)\n local keys = {}\n for k,v in pairs(t) do\n insert(keys, k)\n end\n table.sort(keys)\n return keys\nend\n\nlocal function dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n--\nlocal N = read.nl()\nlocal X, Y, U = {},{},{}\nlocal yy = {}\nlocal xx = {}\nlocal rr = {} -- right down\nlocal ll = {} -- left down\nlocal function push(tt, p, e)\n if not tt[p] then\n tt[p] = {}\n end\n insert(tt[p], e)\nend\nfor i=1,N do\n X[i], Y[i], U[i] = read.nnl()\n U[i] = U[i]:sub(2,2)\n local e = i\n push(yy, Y[i], e)\n push(xx, X[i], e)\n local rrp = X[i] + Y[i]\n push(rr, rrp, e)\n local llp = X[i] - Y[i]\n push(ll, llp, e)\nend\n--richtraceback()\nlocal INF = 10^18\nlocal nearest_crash = INF\nlocal function f1(name, tt, inv, fw, bk, sp)\n local ttk = getkeys(tt)\n for _,w in ipairs(ttk) do\n local t = tt[w]\n dbgpr(\"on same \" .. name , w)\n local inttk = {}\n for _,i in ipairs(t) do\n if U[i] == fw or U[i] == bk then\n insert(inttk, {inv[i], i, U[i]})\n end\n end\n table.sort(inttk, function (a1, a2)\n return a1[1] < a2[1]\n end)\n local state = 0\n local recentfwinv = -200000\n for _,ee in ipairs(inttk) do\n local i = ee[2]\n if U[i] == fw or U[i] == bk then\n dbgpr(\"plane #\" .. i, \"inv=\"..inv[i], \"X=\"..X[i], \"Y=\"..Y[i], U[i])\n if state == 0 then\n if U[i] == fw then\n state = 1\n recentfwinv = inv[i]\n end\n elseif state == 1 then\n if U[i] == fw then\n recentfwinv = inv[i]\n elseif U[i] == bk then\n local d = inv[i] - recentfwinv\n nearest_crash = math.min(nearest_crash, d * sp)\n dbgpr(\"crash!\", i, nearest_crash)\n end\n end\n end\n end\n end\n \nend\nf1('Y', yy, X, 'R', 'L', 5)\nf1('X', xx, Y, 'U', 'D', 5)\nf1('rr', rr, X, 'R', 'U', 10)\nf1('rr', rr, X, 'D', 'L', 10)\nf1('ll', ll, X, 'U', 'L', 10)\nf1('ll', ll, X, 'R', 'D', 10)\n\nif nearest_crash == INF then\n print(\"SAFE\")\nelse\n print(nearest_crash)\nend", "problem_context": "Score: 600 points\n\nProblem Statement\n\nM-kun is a brilliant air traffic controller.\n\nOn the display of his radar, there are N airplanes numbered 1, 2, ..., N, all flying at the same altitude.\n\nEach of the airplanes flies at a constant speed of 0.1 per second in a constant direction. The current coordinates of the airplane numbered i are (X_i, Y_i), and the direction of the airplane is as follows:\n\nif U_i is U, it flies in the positive y direction;\n\nif U_i is R, it flies in the positive x direction;\n\nif U_i is D, it flies in the negative y direction;\n\nif U_i is L, it flies in the negative x direction.\n\nTo help M-kun in his work, determine whether there is a pair of airplanes that will collide with each other if they keep flying as they are now.\n\nIf there is such a pair, find the number of seconds after which the first collision will happen.\n\nWe assume that the airplanes are negligibly small so that two airplanes only collide when they reach the same coordinates simultaneously.\n\nConstraints\n\n1 \\leq N \\leq 200000\n\n0 \\leq X_i, Y_i \\leq 200000\n\nU_i is U, R, D, or L.\n\nThe current positions of the N airplanes, (X_i, Y_i), are all distinct.\n\nN, X_i, and Y_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 Y_1 U_1\nX_2 Y_2 U_2\nX_3 Y_3 U_3\n:\nX_N Y_N U_N\n\nOutput\n\nIf there is a pair of airplanes that will collide with each other if they keep flying as they are now, print an integer representing the number of seconds after which the first collision will happen.\n\nIf there is no such pair, print SAFE.\n\nSample Input 1\n\n2\n11 1 U\n11 47 D\n\nSample Output 1\n\n230\n\nIf the airplanes keep flying as they are now, two airplanes numbered 1 and 2 will reach the coordinates (11, 24) simultaneously and collide.\n\nSample Input 2\n\n4\n20 30 U\n30 20 R\n20 10 D\n10 20 L\n\nSample Output 2\n\nSAFE\n\nNo pair of airplanes will collide.\n\nSample Input 3\n\n8\n168 224 U\n130 175 R\n111 198 D\n121 188 L\n201 116 U\n112 121 R\n145 239 D\n185 107 L\n\nSample Output 3\n\n100", "sample_input": "2\n11 1 U\n11 47 D\n"}, "reference_outputs": ["230\n"], "source_document_id": "p02605", "source_text": "Score: 600 points\n\nProblem Statement\n\nM-kun is a brilliant air traffic controller.\n\nOn the display of his radar, there are N airplanes numbered 1, 2, ..., N, all flying at the same altitude.\n\nEach of the airplanes flies at a constant speed of 0.1 per second in a constant direction. The current coordinates of the airplane numbered i are (X_i, Y_i), and the direction of the airplane is as follows:\n\nif U_i is U, it flies in the positive y direction;\n\nif U_i is R, it flies in the positive x direction;\n\nif U_i is D, it flies in the negative y direction;\n\nif U_i is L, it flies in the negative x direction.\n\nTo help M-kun in his work, determine whether there is a pair of airplanes that will collide with each other if they keep flying as they are now.\n\nIf there is such a pair, find the number of seconds after which the first collision will happen.\n\nWe assume that the airplanes are negligibly small so that two airplanes only collide when they reach the same coordinates simultaneously.\n\nConstraints\n\n1 \\leq N \\leq 200000\n\n0 \\leq X_i, Y_i \\leq 200000\n\nU_i is U, R, D, or L.\n\nThe current positions of the N airplanes, (X_i, Y_i), are all distinct.\n\nN, X_i, and Y_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 Y_1 U_1\nX_2 Y_2 U_2\nX_3 Y_3 U_3\n:\nX_N Y_N U_N\n\nOutput\n\nIf there is a pair of airplanes that will collide with each other if they keep flying as they are now, print an integer representing the number of seconds after which the first collision will happen.\n\nIf there is no such pair, print SAFE.\n\nSample Input 1\n\n2\n11 1 U\n11 47 D\n\nSample Output 1\n\n230\n\nIf the airplanes keep flying as they are now, two airplanes numbered 1 and 2 will reach the coordinates (11, 24) simultaneously and collide.\n\nSample Input 2\n\n4\n20 30 U\n30 20 R\n20 10 D\n10 20 L\n\nSample Output 2\n\nSAFE\n\nNo pair of airplanes will collide.\n\nSample Input 3\n\n8\n168 224 U\n130 175 R\n111 198 D\n121 188 L\n201 116 U\n112 121 R\n145 239 D\n185 107 L\n\nSample Output 3\n\n100", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4979, "cpu_time_ms": 3319, "memory_kb": 338612}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s119846190", "group_id": "codeNet:p02606", "input_text": "local L, R, d = io.read(\"*n\", \"*n\", \"*n\")\nlocal floor = math.floor\n\nprint(floor(R / d) - floor((L - 1) / d))\n", "language": "Lua", "metadata": {"date": 1594612223, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02606.html", "problem_id": "p02606", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02606/input.txt", "sample_output_relpath": "derived/input_output/data/p02606/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02606/Lua/s119846190.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s119846190", "user_id": "u793881115"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local L, R, d = io.read(\"*n\", \"*n\", \"*n\")\nlocal floor = math.floor\n\nprint(floor(R / d) - floor((L - 1) / d))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHow many multiples of d are there among the integers between L and R (inclusive)?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq L \\leq R \\leq 100\n\n1 \\leq d \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R d\n\nOutput\n\nPrint the number of multiples of d among the integers between L and R (inclusive).\n\nSample Input 1\n\n5 10 2\n\nSample Output 1\n\n3\n\nAmong the integers between 5 and 10, there are three multiples of 2: 6, 8, and 10.\n\nSample Input 2\n\n6 20 7\n\nSample Output 2\n\n2\n\nAmong the integers between 6 and 20, there are two multiples of 7: 7 and 14.\n\nSample Input 3\n\n1 100 1\n\nSample Output 3\n\n100", "sample_input": "5 10 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02606", "source_text": "Score : 100 points\n\nProblem Statement\n\nHow many multiples of d are there among the integers between L and R (inclusive)?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq L \\leq R \\leq 100\n\n1 \\leq d \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R d\n\nOutput\n\nPrint the number of multiples of d among the integers between L and R (inclusive).\n\nSample Input 1\n\n5 10 2\n\nSample Output 1\n\n3\n\nAmong the integers between 5 and 10, there are three multiples of 2: 6, 8, and 10.\n\nSample Input 2\n\n6 20 7\n\nSample Output 2\n\n2\n\nAmong the integers between 6 and 20, there are two multiples of 7: 7 and 14.\n\nSample Input 3\n\n1 100 1\n\nSample Output 3\n\n100", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 109, "cpu_time_ms": 2, "memory_kb": 2720}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s969262995", "group_id": "codeNet:p02607", "input_text": "local read = io.read\n\nlocal N = read(\"*n\")\n\nlocal out = 0\nfor i = 1, N do\n\tlocal a_element = read(\"*n\")\n\tif i % 2 == 1 and a_element % 2 == 1 then\n\t\tout = out +1\n\tend\nend\n\nprint(out)\n", "language": "Lua", "metadata": {"date": 1594612852, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02607.html", "problem_id": "p02607", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02607/input.txt", "sample_output_relpath": "derived/input_output/data/p02607/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02607/Lua/s969262995.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s969262995", "user_id": "u793881115"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local read = io.read\n\nlocal N = read(\"*n\")\n\nlocal out = 0\nfor i = 1, N do\n\tlocal a_element = read(\"*n\")\n\tif i % 2 == 1 and a_element % 2 == 1 then\n\t\tout = out +1\n\tend\nend\n\nprint(out)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have N squares assigned the numbers 1,2,3,\\ldots,N. Each square has an integer written on it, and the integer written on Square i is a_i.\n\nHow many squares i satisfy both of the following conditions?\n\nThe assigned number, i, is odd.\n\nThe written integer is odd.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, a_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\cdots a_N\n\nOutput\n\nPrint the number of squares that satisfy both of the conditions.\n\nSample Input 1\n\n5\n1 3 4 5 7\n\nSample Output 1\n\n2\n\nTwo squares, Square 1 and 5, satisfy both of the conditions.\n\nFor Square 2 and 4, the assigned numbers are not odd.\n\nFor Square 3, the written integer is not odd.\n\nSample Input 2\n\n15\n13 76 46 15 50 98 93 77 31 43 84 90 6 24 14\n\nSample Output 2\n\n3", "sample_input": "5\n1 3 4 5 7\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02607", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have N squares assigned the numbers 1,2,3,\\ldots,N. Each square has an integer written on it, and the integer written on Square i is a_i.\n\nHow many squares i satisfy both of the following conditions?\n\nThe assigned number, i, is odd.\n\nThe written integer is odd.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, a_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\cdots a_N\n\nOutput\n\nPrint the number of squares that satisfy both of the conditions.\n\nSample Input 1\n\n5\n1 3 4 5 7\n\nSample Output 1\n\n2\n\nTwo squares, Square 1 and 5, satisfy both of the conditions.\n\nFor Square 2 and 4, the assigned numbers are not odd.\n\nFor Square 3, the written integer is not odd.\n\nSample Input 2\n\n15\n13 76 46 15 50 98 93 77 31 43 84 90 6 24 14\n\nSample Output 2\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 2760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s345107714", "group_id": "codeNet:p02608", "input_text": "n = io.read(\"*n\")\nfor k = 1, n do\n cnt = 0\n for x = 1, math.floor(math.sqrt(k / 6)) do\n for y = 1, x do\n for z = 1, y do\n if (x * x + y * y + z * z + x * y + x * z + y * z) == k then\n if x == y and y == z then\n cnt = cnt + 1\n elseif (x == y and y ~= z) or (x == z and x ~=y) or(y == z and y ~= x) then\n cnt = cnt + 3\n elseif (x ~= y and x ~= z and y ~= z) then\n cnt = cnt + 3\n end\n end\n end\n end\n end\n print(cnt)\nend", "language": "Lua", "metadata": {"date": 1595617214, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02608.html", "problem_id": "p02608", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02608/input.txt", "sample_output_relpath": "derived/input_output/data/p02608/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02608/Lua/s345107714.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s345107714", "user_id": "u803033472"}, "prompt_components": {"gold_output": "0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n", "input_to_evaluate": "n = io.read(\"*n\")\nfor k = 1, n do\n cnt = 0\n for x = 1, math.floor(math.sqrt(k / 6)) do\n for y = 1, x do\n for z = 1, y do\n if (x * x + y * y + z * z + x * y + x * z + y * z) == k then\n if x == y and y == z then\n cnt = cnt + 1\n elseif (x == y and y ~= z) or (x == z and x ~=y) or(y == z and y ~= x) then\n cnt = cnt + 3\n elseif (x ~= y and x ~= z and y ~= z) then\n cnt = cnt + 3\n end\n end\n end\n end\n end\n print(cnt)\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nLet f(n) be the number of triples of integers (x,y,z) that satisfy both of the following conditions:\n\n1 \\leq x,y,z\n\nx^2 + y^2 + z^2 + xy + yz + zx = n\n\nGiven an integer N, find each of f(1),f(2),f(3),\\ldots,f(N).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(i).\n\nSample Input 1\n\n20\n\nSample Output 1\n\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n\nFor n=6, only (1,1,1) satisfies both of the conditions. Thus, f(6) = 1.\n\nFor n=11, three triples, (1,1,2), (1,2,1), and (2,1,1), satisfy both of the conditions. Thus, f(6) = 3.\n\nFor n=17, three triples, (1,2,2), (2,1,2), and (2,2,1), satisfy both of the conditions. Thus, f(17) = 3.\n\nFor n=18, three triples, (1,1,3), (1,3,1), and (3,1,1), satisfy both of the conditions. Thus, f(18) = 3.", "sample_input": "20\n"}, "reference_outputs": ["0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n"], "source_document_id": "p02608", "source_text": "Score : 300 points\n\nProblem Statement\n\nLet f(n) be the number of triples of integers (x,y,z) that satisfy both of the following conditions:\n\n1 \\leq x,y,z\n\nx^2 + y^2 + z^2 + xy + yz + zx = n\n\nGiven an integer N, find each of f(1),f(2),f(3),\\ldots,f(N).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(i).\n\nSample Input 1\n\n20\n\nSample Output 1\n\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n\nFor n=6, only (1,1,1) satisfies both of the conditions. Thus, f(6) = 1.\n\nFor n=11, three triples, (1,1,2), (1,2,1), and (2,1,1), satisfy both of the conditions. Thus, f(6) = 3.\n\nFor n=17, three triples, (1,2,2), (2,1,2), and (2,2,1), satisfy both of the conditions. Thus, f(17) = 3.\n\nFor n=18, three triples, (1,1,3), (1,3,1), and (3,1,1), satisfy both of the conditions. Thus, f(18) = 3.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 519, "cpu_time_ms": 2205, "memory_kb": 2480}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s090294478", "group_id": "codeNet:p02608", "input_text": "-- 答え参照\nlocal function xyz(x, y, z)\n\treturn x*x + y*y + z*z + x*y + y*z + z*x\nend\n\nlocal N = io.read(\"*n\")\n\nlocal loop_num = math.ceil(math.sqrt(N))\n\nlocal out_s = {}\nfor i = 1, N do\n\tout_s[i] = 0\nend\n\nfor x = 1, loop_num do\n\tfor y = 1, loop_num do\n\t\tfor z = 1, loop_num do\n\t\t\tlocal result = xyz(x, y, z)\n\t\t\tif result <= N then\n\t\t\t\tout_s[result] = out_s[result] + 1\n\t\t\tend\n\t\tend\n\tend\nend\n\nprint(table.concat(out_s, \"\\n\"))", "language": "Lua", "metadata": {"date": 1594665345, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02608.html", "problem_id": "p02608", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02608/input.txt", "sample_output_relpath": "derived/input_output/data/p02608/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02608/Lua/s090294478.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s090294478", "user_id": "u793881115"}, "prompt_components": {"gold_output": "0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n", "input_to_evaluate": "-- 答え参照\nlocal function xyz(x, y, z)\n\treturn x*x + y*y + z*z + x*y + y*z + z*x\nend\n\nlocal N = io.read(\"*n\")\n\nlocal loop_num = math.ceil(math.sqrt(N))\n\nlocal out_s = {}\nfor i = 1, N do\n\tout_s[i] = 0\nend\n\nfor x = 1, loop_num do\n\tfor y = 1, loop_num do\n\t\tfor z = 1, loop_num do\n\t\t\tlocal result = xyz(x, y, z)\n\t\t\tif result <= N then\n\t\t\t\tout_s[result] = out_s[result] + 1\n\t\t\tend\n\t\tend\n\tend\nend\n\nprint(table.concat(out_s, \"\\n\"))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nLet f(n) be the number of triples of integers (x,y,z) that satisfy both of the following conditions:\n\n1 \\leq x,y,z\n\nx^2 + y^2 + z^2 + xy + yz + zx = n\n\nGiven an integer N, find each of f(1),f(2),f(3),\\ldots,f(N).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(i).\n\nSample Input 1\n\n20\n\nSample Output 1\n\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n\nFor n=6, only (1,1,1) satisfies both of the conditions. Thus, f(6) = 1.\n\nFor n=11, three triples, (1,1,2), (1,2,1), and (2,1,1), satisfy both of the conditions. Thus, f(6) = 3.\n\nFor n=17, three triples, (1,2,2), (2,1,2), and (2,2,1), satisfy both of the conditions. Thus, f(17) = 3.\n\nFor n=18, three triples, (1,1,3), (1,3,1), and (3,1,1), satisfy both of the conditions. Thus, f(18) = 3.", "sample_input": "20\n"}, "reference_outputs": ["0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n"], "source_document_id": "p02608", "source_text": "Score : 300 points\n\nProblem Statement\n\nLet f(n) be the number of triples of integers (x,y,z) that satisfy both of the following conditions:\n\n1 \\leq x,y,z\n\nx^2 + y^2 + z^2 + xy + yz + zx = n\n\nGiven an integer N, find each of f(1),f(2),f(3),\\ldots,f(N).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(i).\n\nSample Input 1\n\n20\n\nSample Output 1\n\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n\nFor n=6, only (1,1,1) satisfies both of the conditions. Thus, f(6) = 1.\n\nFor n=11, three triples, (1,1,2), (1,2,1), and (2,1,1), satisfy both of the conditions. Thus, f(6) = 3.\n\nFor n=17, three triples, (1,2,2), (2,1,2), and (2,2,1), satisfy both of the conditions. Thus, f(17) = 3.\n\nFor n=18, three triples, (1,1,3), (1,3,1), and (3,1,1), satisfy both of the conditions. Thus, f(18) = 3.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 15, "memory_kb": 2692}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s066067842", "group_id": "codeNet:p02609", "input_text": "local r_shift = bit.rshift\nlocal b_and = bit.band\n\nlocal N = io.read(\"*n\", \"*l\")\nlocal X = io.read(\"*l\")\nlocal b_0 = string.byte(\"0\")\nlocal X_s = {}\nlocal popcountX = 0\nfor i = 1, N do\n\tlocal byte = X:byte(i)\n\tif byte == b_0 then\n\t\tX_s[i] = 0\n\telse\n\t\tpopcountX = popcountX + 1\n\t\tX_s[i] = 1\n\tend\nend\n\nlocal popcountXPlus1, popcountXMinus1 = popcountX + 1, popcountX - 1\n--- 2^i%(Xの1の数+1)の配列(i=1,2,3,...,N)\nlocal pow2ModPopcountXPlus1 = {}\npow2ModPopcountXPlus1[1] = 1\nfor i = 2, N do\n\tpow2ModPopcountXPlus1[i] = (pow2ModPopcountXPlus1[i-1] * 2) % popcountXPlus1\nend\n--- 2^i%(Xの1の数-1)の配列(i=1,2,3,...,N)\nlocal pow2ModPopcountXMinus1 = {}\npow2ModPopcountXMinus1[1] = 1\nif popcountXMinus1 > 0 then\n\tfor i = 2, N do\n\t\tpow2ModPopcountXMinus1[i] = (pow2ModPopcountXMinus1[i-1] * 2) % popcountXMinus1\n\tend\nend\n\n--- X%(Xの1の数+1)\nlocal xModPopcountXPlus1 = 0\nfor digit = 1, N do\n\tlocal pos = N + 1 - digit\n\t-- あらかじめ計算しておいた桁ごとの余りを利用してX%(Xの1の数+1)を求めていく\n\tif X_s[pos] == 1 then\n\t\txModPopcountXPlus1 = xModPopcountXPlus1 + pow2ModPopcountXPlus1[digit]\n\t\txModPopcountXPlus1 = xModPopcountXPlus1 % popcountXPlus1\n\tend\nend\n--- X%(Xの1の数-1)\nlocal xModPopcountXMinus1 = 0\n-- (Xの1の数-1)は0,-1の可能性があるからその排除\nif popcountXMinus1 > 0 then\n\tfor digit = 1, N do\n\t\tlocal pos = N + 1 - digit\n\t\tif X_s[pos] == 1 then\n\t\t\txModPopcountXMinus1 = xModPopcountXMinus1 + pow2ModPopcountXMinus1[digit]\n\t\t\txModPopcountXMinus1 = xModPopcountXMinus1 + popcountXMinus1\n\t\tend\n\tend\nend\n\nlocal function popcount(num)\n\tlocal count = 0\n\twhile num > 0 do\n\t\tif b_and(num, 1) == 1 then\n\t\t\tcount = count + 1\n\t\tend\n\t\tnum = r_shift(num, 1)\n\tend\n\treturn count\nend\n\n--- メモ化の配列\nlocal f = {}\nlocal function getF(num)\n\tif num == 0 then\n\t\treturn 0\n\tend\n\tif f[num] and f[num] > 0 then\n\t\treturn f[num]\n\tend\n\tlocal ans = 1 + getF(num % popcount(num))\n\tf[num] = ans\n\treturn ans\nend\n\nfor pos = 1, N do\n\tlocal digit = N + 1 - pos\n\n\t--- (Xの左からi桁目の01を反転した値)%(Xの1の数+-1)\n\tlocal modXi = 0\n\tif X_s[pos] == 0 then\n\t\tmodXi = xModPopcountXPlus1 + pow2ModPopcountXPlus1[digit]\n\t\tmodXi = modXi % popcountXPlus1\n\t\tlocal ans = 1 + getF(modXi)\n\t\tprint(ans)\n\telseif popcountXMinus1 > 0 then\n\t\t-- +popcountXMinus1はあまりをだすときにmodXiが負にならないようにする\n\t\tmodXi = xModPopcountXMinus1 + (popcountXMinus1 - pow2ModPopcountXMinus1[digit])\n\t\tmodXi = modXi % popcountXMinus1\n\t\tlocal ans = 1 + getF(modXi)\n\t\tprint(ans)\n\telse\n\t\tprint(0)\n\tend\nend\n", "language": "Lua", "metadata": {"date": 1594749388, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02609.html", "problem_id": "p02609", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02609/input.txt", "sample_output_relpath": "derived/input_output/data/p02609/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02609/Lua/s066067842.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s066067842", "user_id": "u793881115"}, "prompt_components": {"gold_output": "2\n1\n1\n", "input_to_evaluate": "local r_shift = bit.rshift\nlocal b_and = bit.band\n\nlocal N = io.read(\"*n\", \"*l\")\nlocal X = io.read(\"*l\")\nlocal b_0 = string.byte(\"0\")\nlocal X_s = {}\nlocal popcountX = 0\nfor i = 1, N do\n\tlocal byte = X:byte(i)\n\tif byte == b_0 then\n\t\tX_s[i] = 0\n\telse\n\t\tpopcountX = popcountX + 1\n\t\tX_s[i] = 1\n\tend\nend\n\nlocal popcountXPlus1, popcountXMinus1 = popcountX + 1, popcountX - 1\n--- 2^i%(Xの1の数+1)の配列(i=1,2,3,...,N)\nlocal pow2ModPopcountXPlus1 = {}\npow2ModPopcountXPlus1[1] = 1\nfor i = 2, N do\n\tpow2ModPopcountXPlus1[i] = (pow2ModPopcountXPlus1[i-1] * 2) % popcountXPlus1\nend\n--- 2^i%(Xの1の数-1)の配列(i=1,2,3,...,N)\nlocal pow2ModPopcountXMinus1 = {}\npow2ModPopcountXMinus1[1] = 1\nif popcountXMinus1 > 0 then\n\tfor i = 2, N do\n\t\tpow2ModPopcountXMinus1[i] = (pow2ModPopcountXMinus1[i-1] * 2) % popcountXMinus1\n\tend\nend\n\n--- X%(Xの1の数+1)\nlocal xModPopcountXPlus1 = 0\nfor digit = 1, N do\n\tlocal pos = N + 1 - digit\n\t-- あらかじめ計算しておいた桁ごとの余りを利用してX%(Xの1の数+1)を求めていく\n\tif X_s[pos] == 1 then\n\t\txModPopcountXPlus1 = xModPopcountXPlus1 + pow2ModPopcountXPlus1[digit]\n\t\txModPopcountXPlus1 = xModPopcountXPlus1 % popcountXPlus1\n\tend\nend\n--- X%(Xの1の数-1)\nlocal xModPopcountXMinus1 = 0\n-- (Xの1の数-1)は0,-1の可能性があるからその排除\nif popcountXMinus1 > 0 then\n\tfor digit = 1, N do\n\t\tlocal pos = N + 1 - digit\n\t\tif X_s[pos] == 1 then\n\t\t\txModPopcountXMinus1 = xModPopcountXMinus1 + pow2ModPopcountXMinus1[digit]\n\t\t\txModPopcountXMinus1 = xModPopcountXMinus1 + popcountXMinus1\n\t\tend\n\tend\nend\n\nlocal function popcount(num)\n\tlocal count = 0\n\twhile num > 0 do\n\t\tif b_and(num, 1) == 1 then\n\t\t\tcount = count + 1\n\t\tend\n\t\tnum = r_shift(num, 1)\n\tend\n\treturn count\nend\n\n--- メモ化の配列\nlocal f = {}\nlocal function getF(num)\n\tif num == 0 then\n\t\treturn 0\n\tend\n\tif f[num] and f[num] > 0 then\n\t\treturn f[num]\n\tend\n\tlocal ans = 1 + getF(num % popcount(num))\n\tf[num] = ans\n\treturn ans\nend\n\nfor pos = 1, N do\n\tlocal digit = N + 1 - pos\n\n\t--- (Xの左からi桁目の01を反転した値)%(Xの1の数+-1)\n\tlocal modXi = 0\n\tif X_s[pos] == 0 then\n\t\tmodXi = xModPopcountXPlus1 + pow2ModPopcountXPlus1[digit]\n\t\tmodXi = modXi % popcountXPlus1\n\t\tlocal ans = 1 + getF(modXi)\n\t\tprint(ans)\n\telseif popcountXMinus1 > 0 then\n\t\t-- +popcountXMinus1はあまりをだすときにmodXiが負にならないようにする\n\t\tmodXi = xModPopcountXMinus1 + (popcountXMinus1 - pow2ModPopcountXMinus1[digit])\n\t\tmodXi = modXi % popcountXMinus1\n\t\tlocal ans = 1 + getF(modXi)\n\t\tprint(ans)\n\telse\n\t\tprint(0)\n\tend\nend\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nLet \\mathrm{popcount}(n) be the number of 1s in the binary representation of n.\nFor example, \\mathrm{popcount}(3) = 2, \\mathrm{popcount}(7) = 3, and \\mathrm{popcount}(0) = 0.\n\nLet f(n) be the number of times the following operation will be done when we repeat it until n becomes 0: \"replace n with the remainder when n is divided by \\mathrm{popcount}(n).\" (It can be proved that, under the constraints of this problem, n always becomes 0 after a finite number of operations.)\n\nFor example, when n=7, it becomes 0 after two operations, as follows:\n\n\\mathrm{popcount}(7)=3, so we divide 7 by 3 and replace it with the remainder, 1.\n\n\\mathrm{popcount}(1)=1, so we divide 1 by 1 and replace it with the remainder, 0.\n\nYou are given an integer X with N digits in binary.\nFor each integer i such that 1 \\leq i \\leq N, let X_i be what X becomes when the i-th bit from the top is inverted.\nFind f(X_1), f(X_2), \\ldots, f(X_N).\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nX is an integer with N digits in binary, possibly with leading zeros.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(X_i).\n\nSample Input 1\n\n3\n011\n\nSample Output 1\n\n2\n1\n1\n\nX_1 = 7, which will change as follows: 7 \\rightarrow 1 \\rightarrow 0. Thus, f(7) = 2.\n\nX_2 = 1, which will change as follows: 1 \\rightarrow 0. Thus, f(1) = 1.\n\nX_3 = 2, which will change as follows: 2 \\rightarrow 0. Thus, f(2) = 1.\n\nSample Input 2\n\n23\n00110111001011011001110\n\nSample Output 2\n\n2\n1\n2\n2\n1\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n1\n3", "sample_input": "3\n011\n"}, "reference_outputs": ["2\n1\n1\n"], "source_document_id": "p02609", "source_text": "Score : 400 points\n\nProblem Statement\n\nLet \\mathrm{popcount}(n) be the number of 1s in the binary representation of n.\nFor example, \\mathrm{popcount}(3) = 2, \\mathrm{popcount}(7) = 3, and \\mathrm{popcount}(0) = 0.\n\nLet f(n) be the number of times the following operation will be done when we repeat it until n becomes 0: \"replace n with the remainder when n is divided by \\mathrm{popcount}(n).\" (It can be proved that, under the constraints of this problem, n always becomes 0 after a finite number of operations.)\n\nFor example, when n=7, it becomes 0 after two operations, as follows:\n\n\\mathrm{popcount}(7)=3, so we divide 7 by 3 and replace it with the remainder, 1.\n\n\\mathrm{popcount}(1)=1, so we divide 1 by 1 and replace it with the remainder, 0.\n\nYou are given an integer X with N digits in binary.\nFor each integer i such that 1 \\leq i \\leq N, let X_i be what X becomes when the i-th bit from the top is inverted.\nFind f(X_1), f(X_2), \\ldots, f(X_N).\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nX is an integer with N digits in binary, possibly with leading zeros.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(X_i).\n\nSample Input 1\n\n3\n011\n\nSample Output 1\n\n2\n1\n1\n\nX_1 = 7, which will change as follows: 7 \\rightarrow 1 \\rightarrow 0. Thus, f(7) = 2.\n\nX_2 = 1, which will change as follows: 1 \\rightarrow 0. Thus, f(1) = 1.\n\nX_3 = 2, which will change as follows: 2 \\rightarrow 0. Thus, f(2) = 1.\n\nSample Input 2\n\n23\n00110111001011011001110\n\nSample Output 2\n\n2\n1\n2\n2\n1\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n1\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2561, "cpu_time_ms": 63, "memory_kb": 10320}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s059137969", "group_id": "codeNet:p02609", "input_text": "local r_shift = bit.rshift\nlocal b_and = bit.band\n\nlocal N = io.read(\"*n\", \"*l\")\nlocal X = io.read(\"*l\")\nlocal b_0 = string.byte(\"0\")\nlocal X_s = {}\nlocal popcountX = 0\nfor i = 1, N do\n\tlocal byte = X:byte(i)\n\tif byte == b_0 then\n\t\tX_s[i] = 0\n\telse\n\t\tpopcountX = popcountX + 1\n\t\tX_s[i] = 1\n\tend\nend\n\nlocal popcountXPlus1, popcountXMinus1 = popcountX + 1, popcountX - 1\n\nlocal pow2ModPopcountXPlus1 = {}\npow2ModPopcountXPlus1[1] = 1\nfor i = 2, N do --ここ謎\n\tpow2ModPopcountXPlus1[i] = (pow2ModPopcountXPlus1[i-1] * 2) % popcountXPlus1\nend\nlocal pow2ModPopcountXMinus1 = {}\npow2ModPopcountXMinus1[1] = 1\nif popcountXMinus1 > 0 then\n\tfor i = 2, N do\n\t\tpow2ModPopcountXMinus1[i] = (pow2ModPopcountXMinus1[i-1] * 2) % popcountXMinus1\n\tend\nend\n\nlocal xModPopcountXPlus1 = 0\nfor digit = 1, N do\n\tlocal pos = N + 1 - digit\n\tif X_s[pos] == 1 then\n\t\txModPopcountXPlus1 = xModPopcountXPlus1 + pow2ModPopcountXPlus1[digit]\n\t\txModPopcountXPlus1 = xModPopcountXPlus1 % popcountXPlus1\n\tend\nend\nlocal xModPopcountXMinus1 = 0\nif popcountXMinus1 > 0 then\n\tfor digit = 1, N do\n\t\tlocal pos = N + 1 - digit\n\t\tif X_s[pos] == 1 then\n\t\t\txModPopcountXMinus1 = xModPopcountXMinus1 + pow2ModPopcountXMinus1[digit]\n\t\t\txModPopcountXMinus1 = xModPopcountXMinus1 + popcountXMinus1\n\t\tend\n\tend\nend\n\nlocal function popcount(num)\n\tlocal count = 0\n\twhile num > 0 do\n\t\tif b_and(num, 1) == 1 then\n\t\t\tcount = count + 1\n\t\tend\n\t\tnum = r_shift(num, 1)\n\tend\n\treturn count\nend\n\nlocal f = {}\nlocal function getF(num)\n\tif num == 0 then\n\t\treturn 0\n\tend\n\tif f[num] and f[num] > 0 then\n\t\treturn f[num]\n\tend\n\tlocal ans = 1 + getF(num % popcount(num))\n\tf[num] = ans\n\treturn ans\nend\n\nfor pos = 1, N do\n\tlocal digit = N + 1 - pos\n\n\tlocal modXi = 0\n\tif X_s[pos] == 0 then\n\t\tmodXi = xModPopcountXPlus1 + pow2ModPopcountXPlus1[digit]\n\t\tmodXi = modXi % popcountXPlus1\n\t\tlocal ans = 1 + getF(modXi)\n\t\tprint(ans)\n\telseif popcountXMinus1 > 0 then\n\t\tmodXi = xModPopcountXMinus1 + (popcountXMinus1 - pow2ModPopcountXMinus1[digit])\n\t\tmodXi = modXi % popcountXMinus1\n\t\tlocal ans = 1 + getF(modXi)\n\t\tprint(ans)\n\telse\n\t\tprint(0)\n\tend\nend\n", "language": "Lua", "metadata": {"date": 1594740127, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02609.html", "problem_id": "p02609", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02609/input.txt", "sample_output_relpath": "derived/input_output/data/p02609/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02609/Lua/s059137969.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s059137969", "user_id": "u793881115"}, "prompt_components": {"gold_output": "2\n1\n1\n", "input_to_evaluate": "local r_shift = bit.rshift\nlocal b_and = bit.band\n\nlocal N = io.read(\"*n\", \"*l\")\nlocal X = io.read(\"*l\")\nlocal b_0 = string.byte(\"0\")\nlocal X_s = {}\nlocal popcountX = 0\nfor i = 1, N do\n\tlocal byte = X:byte(i)\n\tif byte == b_0 then\n\t\tX_s[i] = 0\n\telse\n\t\tpopcountX = popcountX + 1\n\t\tX_s[i] = 1\n\tend\nend\n\nlocal popcountXPlus1, popcountXMinus1 = popcountX + 1, popcountX - 1\n\nlocal pow2ModPopcountXPlus1 = {}\npow2ModPopcountXPlus1[1] = 1\nfor i = 2, N do --ここ謎\n\tpow2ModPopcountXPlus1[i] = (pow2ModPopcountXPlus1[i-1] * 2) % popcountXPlus1\nend\nlocal pow2ModPopcountXMinus1 = {}\npow2ModPopcountXMinus1[1] = 1\nif popcountXMinus1 > 0 then\n\tfor i = 2, N do\n\t\tpow2ModPopcountXMinus1[i] = (pow2ModPopcountXMinus1[i-1] * 2) % popcountXMinus1\n\tend\nend\n\nlocal xModPopcountXPlus1 = 0\nfor digit = 1, N do\n\tlocal pos = N + 1 - digit\n\tif X_s[pos] == 1 then\n\t\txModPopcountXPlus1 = xModPopcountXPlus1 + pow2ModPopcountXPlus1[digit]\n\t\txModPopcountXPlus1 = xModPopcountXPlus1 % popcountXPlus1\n\tend\nend\nlocal xModPopcountXMinus1 = 0\nif popcountXMinus1 > 0 then\n\tfor digit = 1, N do\n\t\tlocal pos = N + 1 - digit\n\t\tif X_s[pos] == 1 then\n\t\t\txModPopcountXMinus1 = xModPopcountXMinus1 + pow2ModPopcountXMinus1[digit]\n\t\t\txModPopcountXMinus1 = xModPopcountXMinus1 + popcountXMinus1\n\t\tend\n\tend\nend\n\nlocal function popcount(num)\n\tlocal count = 0\n\twhile num > 0 do\n\t\tif b_and(num, 1) == 1 then\n\t\t\tcount = count + 1\n\t\tend\n\t\tnum = r_shift(num, 1)\n\tend\n\treturn count\nend\n\nlocal f = {}\nlocal function getF(num)\n\tif num == 0 then\n\t\treturn 0\n\tend\n\tif f[num] and f[num] > 0 then\n\t\treturn f[num]\n\tend\n\tlocal ans = 1 + getF(num % popcount(num))\n\tf[num] = ans\n\treturn ans\nend\n\nfor pos = 1, N do\n\tlocal digit = N + 1 - pos\n\n\tlocal modXi = 0\n\tif X_s[pos] == 0 then\n\t\tmodXi = xModPopcountXPlus1 + pow2ModPopcountXPlus1[digit]\n\t\tmodXi = modXi % popcountXPlus1\n\t\tlocal ans = 1 + getF(modXi)\n\t\tprint(ans)\n\telseif popcountXMinus1 > 0 then\n\t\tmodXi = xModPopcountXMinus1 + (popcountXMinus1 - pow2ModPopcountXMinus1[digit])\n\t\tmodXi = modXi % popcountXMinus1\n\t\tlocal ans = 1 + getF(modXi)\n\t\tprint(ans)\n\telse\n\t\tprint(0)\n\tend\nend\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nLet \\mathrm{popcount}(n) be the number of 1s in the binary representation of n.\nFor example, \\mathrm{popcount}(3) = 2, \\mathrm{popcount}(7) = 3, and \\mathrm{popcount}(0) = 0.\n\nLet f(n) be the number of times the following operation will be done when we repeat it until n becomes 0: \"replace n with the remainder when n is divided by \\mathrm{popcount}(n).\" (It can be proved that, under the constraints of this problem, n always becomes 0 after a finite number of operations.)\n\nFor example, when n=7, it becomes 0 after two operations, as follows:\n\n\\mathrm{popcount}(7)=3, so we divide 7 by 3 and replace it with the remainder, 1.\n\n\\mathrm{popcount}(1)=1, so we divide 1 by 1 and replace it with the remainder, 0.\n\nYou are given an integer X with N digits in binary.\nFor each integer i such that 1 \\leq i \\leq N, let X_i be what X becomes when the i-th bit from the top is inverted.\nFind f(X_1), f(X_2), \\ldots, f(X_N).\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nX is an integer with N digits in binary, possibly with leading zeros.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(X_i).\n\nSample Input 1\n\n3\n011\n\nSample Output 1\n\n2\n1\n1\n\nX_1 = 7, which will change as follows: 7 \\rightarrow 1 \\rightarrow 0. Thus, f(7) = 2.\n\nX_2 = 1, which will change as follows: 1 \\rightarrow 0. Thus, f(1) = 1.\n\nX_3 = 2, which will change as follows: 2 \\rightarrow 0. Thus, f(2) = 1.\n\nSample Input 2\n\n23\n00110111001011011001110\n\nSample Output 2\n\n2\n1\n2\n2\n1\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n1\n3", "sample_input": "3\n011\n"}, "reference_outputs": ["2\n1\n1\n"], "source_document_id": "p02609", "source_text": "Score : 400 points\n\nProblem Statement\n\nLet \\mathrm{popcount}(n) be the number of 1s in the binary representation of n.\nFor example, \\mathrm{popcount}(3) = 2, \\mathrm{popcount}(7) = 3, and \\mathrm{popcount}(0) = 0.\n\nLet f(n) be the number of times the following operation will be done when we repeat it until n becomes 0: \"replace n with the remainder when n is divided by \\mathrm{popcount}(n).\" (It can be proved that, under the constraints of this problem, n always becomes 0 after a finite number of operations.)\n\nFor example, when n=7, it becomes 0 after two operations, as follows:\n\n\\mathrm{popcount}(7)=3, so we divide 7 by 3 and replace it with the remainder, 1.\n\n\\mathrm{popcount}(1)=1, so we divide 1 by 1 and replace it with the remainder, 0.\n\nYou are given an integer X with N digits in binary.\nFor each integer i such that 1 \\leq i \\leq N, let X_i be what X becomes when the i-th bit from the top is inverted.\nFind f(X_1), f(X_2), \\ldots, f(X_N).\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nX is an integer with N digits in binary, possibly with leading zeros.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(X_i).\n\nSample Input 1\n\n3\n011\n\nSample Output 1\n\n2\n1\n1\n\nX_1 = 7, which will change as follows: 7 \\rightarrow 1 \\rightarrow 0. Thus, f(7) = 2.\n\nX_2 = 1, which will change as follows: 1 \\rightarrow 0. Thus, f(1) = 1.\n\nX_3 = 2, which will change as follows: 2 \\rightarrow 0. Thus, f(2) = 1.\n\nSample Input 2\n\n23\n00110111001011011001110\n\nSample Output 2\n\n2\n1\n2\n2\n1\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n1\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 58, "memory_kb": 10208}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s152583943", "group_id": "codeNet:p02609", "input_text": "local mfl, mce = math.floor, math.ceil\nlocal n = io.read(\"*n\", \"*l\")\nlocal t = {}\nlocal s = io.read()\nlocal cnt1 = 0\nfor i = 1, n do\n t[i] = s:byte(i) == 49\n if t[i] then cnt1 = cnt1 + 1 end\nend\nlocal plusmap, minusmap = {}, {}\nfor i = 1, n do\n plusmap[i], minusmap[i] = 0, 0\nend\ndo\n local dv = cnt1 + 1\n local mul = 1\n for i = n, 1, -1 do\n plusmap[i] = mul\n mul = (mul * 2) % dv\n end\nend\nif 2 < cnt1 then\n local dv = cnt1 - 1\n local mul = 1\n for i = n, 1, -1 do\n minusmap[i] = mul\n mul = (mul * 2) % dv\n end\nend\nlocal plus = 0\ndo\n local dv = cnt1 + 1\n for i = 1, n do\n if t[i] then\n plus = (plus + plusmap[i]) % dv\n end\n end\nend\nlocal minus = 0\nif 1 < cnt1 then\n local dv = cnt1 - 1\n for i = 1, n do\n if t[i] then\n minus = (minus + minusmap[i]) % dv\n end\n end\nend\n\nlocal function firstdevide(p, dv)\n if t[p] then\n local currem = minus\n currem = (currem + dv - minusmap[p]) % dv\n return currem\n else\n local currem = plus\n currem = (currem + plusmap[p]) % dv\n return currem\n end\nend\n\nlocal function getpopcnt(x)\n local c = 0\n while 0 < x do\n if x % 2 == 1 then c = c + 1 end\n x = mfl(x / 2)\n end\n return c\nend\n\nfor iq = 1, n do\n local dv = t[iq] and cnt1 - 1 or cnt1 + 1\n if dv == 0 then\n print(0)\n else\n local rem = firstdevide(iq, dv)\n local cnt = 1\n while 0 < rem do\n dv = getpopcnt(rem)\n rem = rem % dv\n cnt = cnt + 1\n end\n print(cnt)\n end\nend\n", "language": "Lua", "metadata": {"date": 1594517320, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02609.html", "problem_id": "p02609", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02609/input.txt", "sample_output_relpath": "derived/input_output/data/p02609/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02609/Lua/s152583943.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s152583943", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n1\n1\n", "input_to_evaluate": "local mfl, mce = math.floor, math.ceil\nlocal n = io.read(\"*n\", \"*l\")\nlocal t = {}\nlocal s = io.read()\nlocal cnt1 = 0\nfor i = 1, n do\n t[i] = s:byte(i) == 49\n if t[i] then cnt1 = cnt1 + 1 end\nend\nlocal plusmap, minusmap = {}, {}\nfor i = 1, n do\n plusmap[i], minusmap[i] = 0, 0\nend\ndo\n local dv = cnt1 + 1\n local mul = 1\n for i = n, 1, -1 do\n plusmap[i] = mul\n mul = (mul * 2) % dv\n end\nend\nif 2 < cnt1 then\n local dv = cnt1 - 1\n local mul = 1\n for i = n, 1, -1 do\n minusmap[i] = mul\n mul = (mul * 2) % dv\n end\nend\nlocal plus = 0\ndo\n local dv = cnt1 + 1\n for i = 1, n do\n if t[i] then\n plus = (plus + plusmap[i]) % dv\n end\n end\nend\nlocal minus = 0\nif 1 < cnt1 then\n local dv = cnt1 - 1\n for i = 1, n do\n if t[i] then\n minus = (minus + minusmap[i]) % dv\n end\n end\nend\n\nlocal function firstdevide(p, dv)\n if t[p] then\n local currem = minus\n currem = (currem + dv - minusmap[p]) % dv\n return currem\n else\n local currem = plus\n currem = (currem + plusmap[p]) % dv\n return currem\n end\nend\n\nlocal function getpopcnt(x)\n local c = 0\n while 0 < x do\n if x % 2 == 1 then c = c + 1 end\n x = mfl(x / 2)\n end\n return c\nend\n\nfor iq = 1, n do\n local dv = t[iq] and cnt1 - 1 or cnt1 + 1\n if dv == 0 then\n print(0)\n else\n local rem = firstdevide(iq, dv)\n local cnt = 1\n while 0 < rem do\n dv = getpopcnt(rem)\n rem = rem % dv\n cnt = cnt + 1\n end\n print(cnt)\n end\nend\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nLet \\mathrm{popcount}(n) be the number of 1s in the binary representation of n.\nFor example, \\mathrm{popcount}(3) = 2, \\mathrm{popcount}(7) = 3, and \\mathrm{popcount}(0) = 0.\n\nLet f(n) be the number of times the following operation will be done when we repeat it until n becomes 0: \"replace n with the remainder when n is divided by \\mathrm{popcount}(n).\" (It can be proved that, under the constraints of this problem, n always becomes 0 after a finite number of operations.)\n\nFor example, when n=7, it becomes 0 after two operations, as follows:\n\n\\mathrm{popcount}(7)=3, so we divide 7 by 3 and replace it with the remainder, 1.\n\n\\mathrm{popcount}(1)=1, so we divide 1 by 1 and replace it with the remainder, 0.\n\nYou are given an integer X with N digits in binary.\nFor each integer i such that 1 \\leq i \\leq N, let X_i be what X becomes when the i-th bit from the top is inverted.\nFind f(X_1), f(X_2), \\ldots, f(X_N).\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nX is an integer with N digits in binary, possibly with leading zeros.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(X_i).\n\nSample Input 1\n\n3\n011\n\nSample Output 1\n\n2\n1\n1\n\nX_1 = 7, which will change as follows: 7 \\rightarrow 1 \\rightarrow 0. Thus, f(7) = 2.\n\nX_2 = 1, which will change as follows: 1 \\rightarrow 0. Thus, f(1) = 1.\n\nX_3 = 2, which will change as follows: 2 \\rightarrow 0. Thus, f(2) = 1.\n\nSample Input 2\n\n23\n00110111001011011001110\n\nSample Output 2\n\n2\n1\n2\n2\n1\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n1\n3", "sample_input": "3\n011\n"}, "reference_outputs": ["2\n1\n1\n"], "source_document_id": "p02609", "source_text": "Score : 400 points\n\nProblem Statement\n\nLet \\mathrm{popcount}(n) be the number of 1s in the binary representation of n.\nFor example, \\mathrm{popcount}(3) = 2, \\mathrm{popcount}(7) = 3, and \\mathrm{popcount}(0) = 0.\n\nLet f(n) be the number of times the following operation will be done when we repeat it until n becomes 0: \"replace n with the remainder when n is divided by \\mathrm{popcount}(n).\" (It can be proved that, under the constraints of this problem, n always becomes 0 after a finite number of operations.)\n\nFor example, when n=7, it becomes 0 after two operations, as follows:\n\n\\mathrm{popcount}(7)=3, so we divide 7 by 3 and replace it with the remainder, 1.\n\n\\mathrm{popcount}(1)=1, so we divide 1 by 1 and replace it with the remainder, 0.\n\nYou are given an integer X with N digits in binary.\nFor each integer i such that 1 \\leq i \\leq N, let X_i be what X becomes when the i-th bit from the top is inverted.\nFind f(X_1), f(X_2), \\ldots, f(X_N).\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nX is an integer with N digits in binary, possibly with leading zeros.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(X_i).\n\nSample Input 1\n\n3\n011\n\nSample Output 1\n\n2\n1\n1\n\nX_1 = 7, which will change as follows: 7 \\rightarrow 1 \\rightarrow 0. Thus, f(7) = 2.\n\nX_2 = 1, which will change as follows: 1 \\rightarrow 0. Thus, f(1) = 1.\n\nX_3 = 2, which will change as follows: 2 \\rightarrow 0. Thus, f(2) = 1.\n\nSample Input 2\n\n23\n00110111001011011001110\n\nSample Output 2\n\n2\n1\n2\n2\n1\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n1\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1466, "cpu_time_ms": 96, "memory_kb": 9376}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s226725597", "group_id": "codeNet:p02609", "input_text": "local mfl, mce = math.floor, math.ceil\nlocal n = io.read(\"*n\", \"*l\")\nlocal t = {}\nlocal s = io.read()\nlocal cnt1 = 0\nfor i = 1, n do\n t[i] = s:byte(i) == 49\n if t[i] then cnt1 = cnt1 + 1 end\nend\n\nlocal function firstdevide(p, dv)\n local currem = 0\n for i = 1, n do\n currem = currem * 2\n if i == p then\n if not t[i] then\n currem = currem + 1\n end\n else\n if t[i] then\n currem = currem + 1\n end\n end\n currem = currem % dv\n end\n return currem\nend\n\nlocal function getpopcnt(x)\n local c = 0\n while 0 < x do\n if x % 2 == 1 then c = c + 1 end\n x = mfl(x / 2)\n end\n return c\nend\n\nfor iq = 1, n do\n local dv = t[iq] and cnt1 - 1 or cnt1 + 1\n local rem = firstdevide(iq, dv)\n local cnt = 1\n while 0 < rem do\n dv = getpopcnt(rem)\n rem = rem % dv\n cnt = cnt + 1\n end\n print(cnt)\nend\n", "language": "Lua", "metadata": {"date": 1594516755, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02609.html", "problem_id": "p02609", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02609/input.txt", "sample_output_relpath": "derived/input_output/data/p02609/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02609/Lua/s226725597.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s226725597", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n1\n1\n", "input_to_evaluate": "local mfl, mce = math.floor, math.ceil\nlocal n = io.read(\"*n\", \"*l\")\nlocal t = {}\nlocal s = io.read()\nlocal cnt1 = 0\nfor i = 1, n do\n t[i] = s:byte(i) == 49\n if t[i] then cnt1 = cnt1 + 1 end\nend\n\nlocal function firstdevide(p, dv)\n local currem = 0\n for i = 1, n do\n currem = currem * 2\n if i == p then\n if not t[i] then\n currem = currem + 1\n end\n else\n if t[i] then\n currem = currem + 1\n end\n end\n currem = currem % dv\n end\n return currem\nend\n\nlocal function getpopcnt(x)\n local c = 0\n while 0 < x do\n if x % 2 == 1 then c = c + 1 end\n x = mfl(x / 2)\n end\n return c\nend\n\nfor iq = 1, n do\n local dv = t[iq] and cnt1 - 1 or cnt1 + 1\n local rem = firstdevide(iq, dv)\n local cnt = 1\n while 0 < rem do\n dv = getpopcnt(rem)\n rem = rem % dv\n cnt = cnt + 1\n end\n print(cnt)\nend\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nLet \\mathrm{popcount}(n) be the number of 1s in the binary representation of n.\nFor example, \\mathrm{popcount}(3) = 2, \\mathrm{popcount}(7) = 3, and \\mathrm{popcount}(0) = 0.\n\nLet f(n) be the number of times the following operation will be done when we repeat it until n becomes 0: \"replace n with the remainder when n is divided by \\mathrm{popcount}(n).\" (It can be proved that, under the constraints of this problem, n always becomes 0 after a finite number of operations.)\n\nFor example, when n=7, it becomes 0 after two operations, as follows:\n\n\\mathrm{popcount}(7)=3, so we divide 7 by 3 and replace it with the remainder, 1.\n\n\\mathrm{popcount}(1)=1, so we divide 1 by 1 and replace it with the remainder, 0.\n\nYou are given an integer X with N digits in binary.\nFor each integer i such that 1 \\leq i \\leq N, let X_i be what X becomes when the i-th bit from the top is inverted.\nFind f(X_1), f(X_2), \\ldots, f(X_N).\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nX is an integer with N digits in binary, possibly with leading zeros.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(X_i).\n\nSample Input 1\n\n3\n011\n\nSample Output 1\n\n2\n1\n1\n\nX_1 = 7, which will change as follows: 7 \\rightarrow 1 \\rightarrow 0. Thus, f(7) = 2.\n\nX_2 = 1, which will change as follows: 1 \\rightarrow 0. Thus, f(1) = 1.\n\nX_3 = 2, which will change as follows: 2 \\rightarrow 0. Thus, f(2) = 1.\n\nSample Input 2\n\n23\n00110111001011011001110\n\nSample Output 2\n\n2\n1\n2\n2\n1\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n1\n3", "sample_input": "3\n011\n"}, "reference_outputs": ["2\n1\n1\n"], "source_document_id": "p02609", "source_text": "Score : 400 points\n\nProblem Statement\n\nLet \\mathrm{popcount}(n) be the number of 1s in the binary representation of n.\nFor example, \\mathrm{popcount}(3) = 2, \\mathrm{popcount}(7) = 3, and \\mathrm{popcount}(0) = 0.\n\nLet f(n) be the number of times the following operation will be done when we repeat it until n becomes 0: \"replace n with the remainder when n is divided by \\mathrm{popcount}(n).\" (It can be proved that, under the constraints of this problem, n always becomes 0 after a finite number of operations.)\n\nFor example, when n=7, it becomes 0 after two operations, as follows:\n\n\\mathrm{popcount}(7)=3, so we divide 7 by 3 and replace it with the remainder, 1.\n\n\\mathrm{popcount}(1)=1, so we divide 1 by 1 and replace it with the remainder, 0.\n\nYou are given an integer X with N digits in binary.\nFor each integer i such that 1 \\leq i \\leq N, let X_i be what X becomes when the i-th bit from the top is inverted.\nFind f(X_1), f(X_2), \\ldots, f(X_N).\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nX is an integer with N digits in binary, possibly with leading zeros.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(X_i).\n\nSample Input 1\n\n3\n011\n\nSample Output 1\n\n2\n1\n1\n\nX_1 = 7, which will change as follows: 7 \\rightarrow 1 \\rightarrow 0. Thus, f(7) = 2.\n\nX_2 = 1, which will change as follows: 1 \\rightarrow 0. Thus, f(1) = 1.\n\nX_3 = 2, which will change as follows: 2 \\rightarrow 0. Thus, f(2) = 1.\n\nSample Input 2\n\n23\n00110111001011011001110\n\nSample Output 2\n\n2\n1\n2\n2\n1\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n1\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 850, "cpu_time_ms": 2206, "memory_kb": 7044}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s002595585", "group_id": "codeNet:p02613", "input_text": "local length = io.read()\nlocal data = {AC = 0, WA = 0, TLE =0, RE = 0}\n\nfor i = 1, length do \n local key = io.read()\n if data[key] then\n data[key] = data[key] + 1\n end\nend\n\nprint(\"AC X\"..\" \"..data[\"AC\"])\nprint(\"WA X\"..\" \"..data[\"WA\"])\nprint(\"TLE X\"..\" \"..data[\"TLE\"])\nprint(\"RE X\"..\" \"..data[\"RE\"])", "language": "Lua", "metadata": {"date": 1594428253, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02613.html", "problem_id": "p02613", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02613/input.txt", "sample_output_relpath": "derived/input_output/data/p02613/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02613/Lua/s002595585.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s002595585", "user_id": "u089230684"}, "prompt_components": {"gold_output": "AC x 3\nWA x 1\nTLE x 2\nRE x 0\n", "input_to_evaluate": "local length = io.read()\nlocal data = {AC = 0, WA = 0, TLE =0, RE = 0}\n\nfor i = 1, length do \n local key = io.read()\n if data[key] then\n data[key] = data[key] + 1\n end\nend\n\nprint(\"AC X\"..\" \"..data[\"AC\"])\nprint(\"WA X\"..\" \"..data[\"WA\"])\nprint(\"TLE X\"..\" \"..data[\"TLE\"])\nprint(\"RE X\"..\" \"..data[\"RE\"])", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\n\nThe problem has N test cases.\n\nFor each test case i (1\\leq i \\leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSee the Output section for the output format.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i is AC, WA, TLE, or RE.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n\\vdots\nS_N\n\nOutput\n\nLet C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:\n\nAC x C_0\nWA x C_1\nTLE x C_2\nRE x C_3\n\nSample Input 1\n\n6\nAC\nTLE\nAC\nAC\nWA\nTLE\n\nSample Output 1\n\nAC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSample Input 2\n\n10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\n\nSample Output 2\n\nAC x 10\nWA x 0\nTLE x 0\nRE x 0", "sample_input": "6\nAC\nTLE\nAC\nAC\nWA\nTLE\n"}, "reference_outputs": ["AC x 3\nWA x 1\nTLE x 2\nRE x 0\n"], "source_document_id": "p02613", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\n\nThe problem has N test cases.\n\nFor each test case i (1\\leq i \\leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSee the Output section for the output format.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i is AC, WA, TLE, or RE.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n\\vdots\nS_N\n\nOutput\n\nLet C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:\n\nAC x C_0\nWA x C_1\nTLE x C_2\nRE x C_3\n\nSample Input 1\n\n6\nAC\nTLE\nAC\nAC\nWA\nTLE\n\nSample Output 1\n\nAC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSample Input 2\n\n10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\n\nSample Output 2\n\nAC x 10\nWA x 0\nTLE x 0\nRE x 0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 314, "cpu_time_ms": 30, "memory_kb": 2652}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s822857652", "group_id": "codeNet:p02613", "input_text": "local length = io.read()\nlocal data = {AC = 0, WA = 0, TLE =0, RE = 0}\n\nfor i = 1, length do \n local key = io.read()\n if data[key] then\n data[key] = data[key] + 1\n end\nend\n\nfor key, num in pairs(data) do \n print(key..\" \"..\"X\"..\" \"..num)\nend\n\n", "language": "Lua", "metadata": {"date": 1594428074, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02613.html", "problem_id": "p02613", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02613/input.txt", "sample_output_relpath": "derived/input_output/data/p02613/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02613/Lua/s822857652.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s822857652", "user_id": "u089230684"}, "prompt_components": {"gold_output": "AC x 3\nWA x 1\nTLE x 2\nRE x 0\n", "input_to_evaluate": "local length = io.read()\nlocal data = {AC = 0, WA = 0, TLE =0, RE = 0}\n\nfor i = 1, length do \n local key = io.read()\n if data[key] then\n data[key] = data[key] + 1\n end\nend\n\nfor key, num in pairs(data) do \n print(key..\" \"..\"X\"..\" \"..num)\nend\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\n\nThe problem has N test cases.\n\nFor each test case i (1\\leq i \\leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSee the Output section for the output format.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i is AC, WA, TLE, or RE.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n\\vdots\nS_N\n\nOutput\n\nLet C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:\n\nAC x C_0\nWA x C_1\nTLE x C_2\nRE x C_3\n\nSample Input 1\n\n6\nAC\nTLE\nAC\nAC\nWA\nTLE\n\nSample Output 1\n\nAC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSample Input 2\n\n10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\n\nSample Output 2\n\nAC x 10\nWA x 0\nTLE x 0\nRE x 0", "sample_input": "6\nAC\nTLE\nAC\nAC\nWA\nTLE\n"}, "reference_outputs": ["AC x 3\nWA x 1\nTLE x 2\nRE x 0\n"], "source_document_id": "p02613", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\n\nThe problem has N test cases.\n\nFor each test case i (1\\leq i \\leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSee the Output section for the output format.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i is AC, WA, TLE, or RE.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n\\vdots\nS_N\n\nOutput\n\nLet C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:\n\nAC x C_0\nWA x C_1\nTLE x C_2\nRE x C_3\n\nSample Input 1\n\n6\nAC\nTLE\nAC\nAC\nWA\nTLE\n\nSample Output 1\n\nAC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSample Input 2\n\n10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\n\nSample Output 2\n\nAC x 10\nWA x 0\nTLE x 0\nRE x 0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 261, "cpu_time_ms": 29, "memory_kb": 2712}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s931102732", "group_id": "codeNet:p02613", "input_text": "n = io.read(\"*n\", \"*l\")\nt = {}\nt.AC = 0\nt.WA = 0\nt.TLE = 0\nt.RE = 0\nfor i = 1, n do\n s = io.read()\n t[s] = t[s] + 1\nend\nprint(\"AC x \" .. t.AC)\nprint(\"WA x \" .. t.WA)\nprint(\"TLE x \" .. t.TLE)\nprint(\"RE x \" .. t.RE)\n", "language": "Lua", "metadata": {"date": 1593997353, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02613.html", "problem_id": "p02613", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02613/input.txt", "sample_output_relpath": "derived/input_output/data/p02613/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02613/Lua/s931102732.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s931102732", "user_id": "u120582723"}, "prompt_components": {"gold_output": "AC x 3\nWA x 1\nTLE x 2\nRE x 0\n", "input_to_evaluate": "n = io.read(\"*n\", \"*l\")\nt = {}\nt.AC = 0\nt.WA = 0\nt.TLE = 0\nt.RE = 0\nfor i = 1, n do\n s = io.read()\n t[s] = t[s] + 1\nend\nprint(\"AC x \" .. t.AC)\nprint(\"WA x \" .. t.WA)\nprint(\"TLE x \" .. t.TLE)\nprint(\"RE x \" .. t.RE)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\n\nThe problem has N test cases.\n\nFor each test case i (1\\leq i \\leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSee the Output section for the output format.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i is AC, WA, TLE, or RE.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n\\vdots\nS_N\n\nOutput\n\nLet C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:\n\nAC x C_0\nWA x C_1\nTLE x C_2\nRE x C_3\n\nSample Input 1\n\n6\nAC\nTLE\nAC\nAC\nWA\nTLE\n\nSample Output 1\n\nAC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSample Input 2\n\n10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\n\nSample Output 2\n\nAC x 10\nWA x 0\nTLE x 0\nRE x 0", "sample_input": "6\nAC\nTLE\nAC\nAC\nWA\nTLE\n"}, "reference_outputs": ["AC x 3\nWA x 1\nTLE x 2\nRE x 0\n"], "source_document_id": "p02613", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\n\nThe problem has N test cases.\n\nFor each test case i (1\\leq i \\leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSee the Output section for the output format.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i is AC, WA, TLE, or RE.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n\\vdots\nS_N\n\nOutput\n\nLet C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:\n\nAC x C_0\nWA x C_1\nTLE x C_2\nRE x C_3\n\nSample Input 1\n\n6\nAC\nTLE\nAC\nAC\nWA\nTLE\n\nSample Output 1\n\nAC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSample Input 2\n\n10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\n\nSample Output 2\n\nAC x 10\nWA x 0\nTLE x 0\nRE x 0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 31, "memory_kb": 2792}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s740897451", "group_id": "codeNet:p02614", "input_text": "local h, w, k = io.read(\"*n\", \"*n\", \"*n\", \"*l\")\nlocal t = {}\nfor i = 1, h do\n t[i] = {}\n local s = io.read()\n for j = 1, w do\n t[i][j] = s:sub(j, j) == \"#\"\n end\nend\nlocal tot = 1 << (h + w)\nlocal hflag, wflag = {}, {}\nlocal ans = 0\nfor i = 0, tot - 1 do\n local ti = i\n for j = 1, h do\n hflag[j] = ti % 2 == 0\n ti = ti // 2\n end\n for j = 1, w do\n wflag[j] = ti % 2 == 0\n ti = ti // 2\n end\n local c = 0\n for j = 1, h do\n for k = 1, w do\n if t[j][k] and hflag[j] and wflag[k] then\n c = c + 1\n end\n end\n end\n if c == k then ans = ans + 1 end\nend\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1593997663, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02614.html", "problem_id": "p02614", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02614/input.txt", "sample_output_relpath": "derived/input_output/data/p02614/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02614/Lua/s740897451.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s740897451", "user_id": "u120582723"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local h, w, k = io.read(\"*n\", \"*n\", \"*n\", \"*l\")\nlocal t = {}\nfor i = 1, h do\n t[i] = {}\n local s = io.read()\n for j = 1, w do\n t[i][j] = s:sub(j, j) == \"#\"\n end\nend\nlocal tot = 1 << (h + w)\nlocal hflag, wflag = {}, {}\nlocal ans = 0\nfor i = 0, tot - 1 do\n local ti = i\n for j = 1, h do\n hflag[j] = ti % 2 == 0\n ti = ti // 2\n end\n for j = 1, w do\n wflag[j] = ti % 2 == 0\n ti = ti // 2\n end\n local c = 0\n for j = 1, h do\n for k = 1, w do\n if t[j][k] and hflag[j] and wflag[k] then\n c = c + 1\n end\n end\n end\n if c == k then ans = ans + 1 end\nend\nprint(ans)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have a grid of H rows and W columns of squares. The color of the square at the i-th row from the top and the j-th column from the left (1 \\leq i \\leq H, 1 \\leq j \\leq W) is given to you as a character c_{i,j}: the square is white if c_{i,j} is ., and black if c_{i,j} is #.\n\nConsider doing the following operation:\n\nChoose some number of rows (possibly zero), and some number of columns (possibly zero). Then, paint red all squares in the chosen rows and all squares in the chosen columns.\n\nYou are given a positive integer K. How many choices of rows and columns result in exactly K black squares remaining after the operation? Here, we consider two choices different when there is a row or column chosen in only one of those choices.\n\nConstraints\n\n1 \\leq H, W \\leq 6\n\n1 \\leq K \\leq HW\n\nc_{i,j} is . or #.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\nc_{1,1}c_{1,2}...c_{1,W}\nc_{2,1}c_{2,2}...c_{2,W}\n:\nc_{H,1}c_{H,2}...c_{H,W}\n\nOutput\n\nPrint an integer representing the number of choices of rows and columns satisfying the condition.\n\nSample Input 1\n\n2 3 2\n..#\n###\n\nSample Output 1\n\n5\n\nFive choices below satisfy the condition.\n\nThe 1-st row and 1-st column\n\nThe 1-st row and 2-nd column\n\nThe 1-st row and 3-rd column\n\nThe 1-st and 2-nd column\n\nThe 3-rd column\n\nSample Input 2\n\n2 3 4\n..#\n###\n\nSample Output 2\n\n1\n\nOne choice, which is choosing nothing, satisfies the condition.\n\nSample Input 3\n\n2 2 3\n##\n##\n\nSample Output 3\n\n0\n\nSample Input 4\n\n6 6 8\n..##..\n.#..#.\n#....#\n######\n#....#\n#....#\n\nSample Output 4\n\n208", "sample_input": "2 3 2\n..#\n###\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02614", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have a grid of H rows and W columns of squares. The color of the square at the i-th row from the top and the j-th column from the left (1 \\leq i \\leq H, 1 \\leq j \\leq W) is given to you as a character c_{i,j}: the square is white if c_{i,j} is ., and black if c_{i,j} is #.\n\nConsider doing the following operation:\n\nChoose some number of rows (possibly zero), and some number of columns (possibly zero). Then, paint red all squares in the chosen rows and all squares in the chosen columns.\n\nYou are given a positive integer K. How many choices of rows and columns result in exactly K black squares remaining after the operation? Here, we consider two choices different when there is a row or column chosen in only one of those choices.\n\nConstraints\n\n1 \\leq H, W \\leq 6\n\n1 \\leq K \\leq HW\n\nc_{i,j} is . or #.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\nc_{1,1}c_{1,2}...c_{1,W}\nc_{2,1}c_{2,2}...c_{2,W}\n:\nc_{H,1}c_{H,2}...c_{H,W}\n\nOutput\n\nPrint an integer representing the number of choices of rows and columns satisfying the condition.\n\nSample Input 1\n\n2 3 2\n..#\n###\n\nSample Output 1\n\n5\n\nFive choices below satisfy the condition.\n\nThe 1-st row and 1-st column\n\nThe 1-st row and 2-nd column\n\nThe 1-st row and 3-rd column\n\nThe 1-st and 2-nd column\n\nThe 3-rd column\n\nSample Input 2\n\n2 3 4\n..#\n###\n\nSample Output 2\n\n1\n\nOne choice, which is choosing nothing, satisfies the condition.\n\nSample Input 3\n\n2 2 3\n##\n##\n\nSample Output 3\n\n0\n\nSample Input 4\n\n6 6 8\n..##..\n.#..#.\n#....#\n######\n#....#\n#....#\n\nSample Output 4\n\n208", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 21, "memory_kb": 2764}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s958607001", "group_id": "codeNet:p02615", "input_text": "local n = io.read(\"*n\")\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\nend\ntable.sort(a, function(x, y) return x > y end)\nlocal ans = a[1]\nfor i = 2, n - 1 do\n local p = 1 + (i // 2)\n ans = ans + a[p]\nend\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1593998121, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02615.html", "problem_id": "p02615", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02615/input.txt", "sample_output_relpath": "derived/input_output/data/p02615/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02615/Lua/s958607001.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s958607001", "user_id": "u120582723"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\nend\ntable.sort(a, function(x, y) return x > y end)\nlocal ans = a[1]\nfor i = 2, n - 1 do\n local p = 1 + (i // 2)\n ans = ans + a[p]\nend\nprint(ans)\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nQuickly after finishing the tutorial of the online game ATChat, you have decided to visit a particular place with N-1 players who happen to be there. These N players, including you, are numbered 1 through N, and the friendliness of Player i is A_i.\n\nThe N players will arrive at the place one by one in some order. To make sure nobody gets lost, you have set the following rule: players who have already arrived there should form a circle, and a player who has just arrived there should cut into the circle somewhere.\n\nWhen each player, except the first one to arrive, arrives at the place, the player gets comfort equal to the smaller of the friendliness of the clockwise adjacent player and that of the counter-clockwise adjacent player. The first player to arrive there gets the comfort of 0.\n\nWhat is the maximum total comfort the N players can get by optimally choosing the order of arrivals and the positions in the circle to cut into?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the maximum total comfort the N players can get.\n\nSample Input 1\n\n4\n2 2 1 3\n\nSample Output 1\n\n7\n\nBy arriving at the place in the order Player 4, 2, 1, 3, and cutting into the circle as shown in the figure, they can get the total comfort of 7.\n\nThey cannot get the total comfort greater than 7, so the answer is 7.\n\nSample Input 2\n\n7\n1 1 1 1 1 1 1\n\nSample Output 2\n\n6", "sample_input": "4\n2 2 1 3\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02615", "source_text": "Score: 400 points\n\nProblem Statement\n\nQuickly after finishing the tutorial of the online game ATChat, you have decided to visit a particular place with N-1 players who happen to be there. These N players, including you, are numbered 1 through N, and the friendliness of Player i is A_i.\n\nThe N players will arrive at the place one by one in some order. To make sure nobody gets lost, you have set the following rule: players who have already arrived there should form a circle, and a player who has just arrived there should cut into the circle somewhere.\n\nWhen each player, except the first one to arrive, arrives at the place, the player gets comfort equal to the smaller of the friendliness of the clockwise adjacent player and that of the counter-clockwise adjacent player. The first player to arrive there gets the comfort of 0.\n\nWhat is the maximum total comfort the N players can get by optimally choosing the order of arrivals and the positions in the circle to cut into?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the maximum total comfort the N players can get.\n\nSample Input 1\n\n4\n2 2 1 3\n\nSample Output 1\n\n7\n\nBy arriving at the place in the order Player 4, 2, 1, 3, and cutting into the circle as shown in the figure, they can get the total comfort of 7.\n\nThey cannot get the total comfort greater than 7, so the answer is 7.\n\nSample Input 2\n\n7\n1 1 1 1 1 1 1\n\nSample Output 2\n\n6", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 223, "cpu_time_ms": 352, "memory_kb": 6360}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s345321178", "group_id": "codeNet:p02616", "input_text": "local n,k=io.read(\"n\",\"n\")\nlocal a={}\nfor i=1,n do\n a[i]=io.read(\"n\")\nend\ntable.sort(a)\nlocal mod=1000000007\nlocal mul1=1\nfor i=1,k do\n mul1=mul1*(a[i]<0 and -a[i] or a[i])%mod\nend\nlocal mul2=1\nfor i=n,n-k+1,-1 do\n mul2=mul2*(a[i]<0 and -a[i] or a[i])%mod\nend\nprint(math.max(mul1,mul2))", "language": "Lua", "metadata": {"date": 1593987161, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02616.html", "problem_id": "p02616", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02616/input.txt", "sample_output_relpath": "derived/input_output/data/p02616/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02616/Lua/s345321178.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s345321178", "user_id": "u045238009"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "local n,k=io.read(\"n\",\"n\")\nlocal a={}\nfor i=1,n do\n a[i]=io.read(\"n\")\nend\ntable.sort(a)\nlocal mod=1000000007\nlocal mul1=1\nfor i=1,k do\n mul1=mul1*(a[i]<0 and -a[i] or a[i])%mod\nend\nlocal mul2=1\nfor i=n,n-k+1,-1 do\n mul2=mul2*(a[i]<0 and -a[i] or a[i])%mod\nend\nprint(math.max(mul1,mul2))", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nWe will choose exactly K of these elements. Find the maximum possible product of the chosen elements.\n\nThen, print the maximum product modulo (10^9+7), using an integer between 0 and 10^9+6 (inclusive).\n\nConstraints\n\n1 \\leq K \\leq N \\leq 2\\times 10^5\n\n|A_i| \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 \\ldots A_N\n\nOutput\n\nPrint the maximum product modulo (10^9+7), using an integer between 0 and 10^9+6 (inclusive).\n\nSample Input 1\n\n4 2\n1 2 -3 -4\n\nSample Output 1\n\n12\n\nThe possible products of the two chosen elements are 2, -3, -4, -6, -8, and 12, so the maximum product is 12.\n\nSample Input 2\n\n4 3\n-1 -2 -3 -4\n\nSample Output 2\n\n1000000001\n\nThe possible products of the three chosen elements are -24, -12, -8, and -6, so the maximum product is -6.\n\nWe print this value modulo (10^9+7), that is, 1000000001.\n\nSample Input 3\n\n2 1\n-1 1000000000\n\nSample Output 3\n\n1000000000\n\nThe possible products of the one chosen element are -1 and 1000000000, so the maximum product is 1000000000.\n\nSample Input 4\n\n10 10\n1000000000 100000000 10000000 1000000 100000 10000 1000 100 10 1\n\nSample Output 4\n\n999983200\n\nBe sure to print the product modulo (10^9+7).", "sample_input": "4 2\n1 2 -3 -4\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02616", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nWe will choose exactly K of these elements. Find the maximum possible product of the chosen elements.\n\nThen, print the maximum product modulo (10^9+7), using an integer between 0 and 10^9+6 (inclusive).\n\nConstraints\n\n1 \\leq K \\leq N \\leq 2\\times 10^5\n\n|A_i| \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 \\ldots A_N\n\nOutput\n\nPrint the maximum product modulo (10^9+7), using an integer between 0 and 10^9+6 (inclusive).\n\nSample Input 1\n\n4 2\n1 2 -3 -4\n\nSample Output 1\n\n12\n\nThe possible products of the two chosen elements are 2, -3, -4, -6, -8, and 12, so the maximum product is 12.\n\nSample Input 2\n\n4 3\n-1 -2 -3 -4\n\nSample Output 2\n\n1000000001\n\nThe possible products of the three chosen elements are -24, -12, -8, and -6, so the maximum product is -6.\n\nWe print this value modulo (10^9+7), that is, 1000000001.\n\nSample Input 3\n\n2 1\n-1 1000000000\n\nSample Output 3\n\n1000000000\n\nThe possible products of the one chosen element are -1 and 1000000000, so the maximum product is 1000000000.\n\nSample Input 4\n\n10 10\n1000000000 100000000 10000000 1000000 100000 10000 1000 100 10 1\n\nSample Output 4\n\n999983200\n\nBe sure to print the product modulo (10^9+7).", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 166, "memory_kb": 6372}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s625675048", "group_id": "codeNet:p02617", "input_text": "local n = io.read(\"*n\")\nlocal edge = {}\nlocal z = 0\nfor i = 1, n do\n edge[i] = {}\n local v = (i * (i + 1)) // 2\n z = z + v\nend\nfor i = 1, n - 1 do\n local a, b = io.read(\"*n\", \"*n\")\n if b < a then a, b = b, a end\n z = z - a * (n + 1 - b)\nend\nprint(z)\n", "language": "Lua", "metadata": {"date": 1593979696, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02617.html", "problem_id": "p02617", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02617/input.txt", "sample_output_relpath": "derived/input_output/data/p02617/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02617/Lua/s625675048.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s625675048", "user_id": "u120582723"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal edge = {}\nlocal z = 0\nfor i = 1, n do\n edge[i] = {}\n local v = (i * (i + 1)) // 2\n z = z + v\nend\nfor i = 1, n - 1 do\n local a, b = io.read(\"*n\", \"*n\")\n if b < a then a, b = b, a end\n z = z - a * (n + 1 - b)\nend\nprint(z)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have a tree with N vertices and N-1 edges, respectively numbered 1, 2,\\cdots, N and 1, 2, \\cdots, N-1. Edge i connects Vertex u_i and v_i.\n\nFor integers L, R (1 \\leq L \\leq R \\leq N), let us define a function f(L, R) as follows:\n\nLet S be the set of the vertices numbered L through R. f(L, R) represents the number of connected components in the subgraph formed only from the vertex set S and the edges whose endpoints both belong to S.\n\nCompute \\sum_{L=1}^{N} \\sum_{R=L}^{N} f(L, R).\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq u_i, v_i \\leq N\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nu_1 v_1\nu_2 v_2\n:\nu_{N-1} v_{N-1}\n\nOutput\n\nPrint \\sum_{L=1}^{N} \\sum_{R=L}^{N} f(L, R).\n\nSample Input 1\n\n3\n1 3\n2 3\n\nSample Output 1\n\n7\n\nWe have six possible pairs (L, R) as follows:\n\nFor L = 1, R = 1, S = \\{1\\} and we have 1 connected component.\n\nFor L = 1, R = 2, S = \\{1, 2\\} and we have 2 connected components.\n\nFor L = 1, R = 3, S = \\{1, 2, 3\\} and we have 1 connected component, since S contains both endpoints of each of the edges 1, 2.\n\nFor L = 2, R = 2, S = \\{2\\} and we have 1 connected component.\n\nFor L = 2, R = 3, S = \\{2, 3\\} and we have 1 connected component, since S contains both endpoints of Edge 2.\n\nFor L = 3, R = 3, S = \\{3\\} and we have 1 connected component.\n\nThe sum of these is 7.\n\nSample Input 2\n\n2\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n10\n5 3\n5 7\n8 9\n1 9\n9 10\n8 4\n7 4\n6 10\n7 2\n\nSample Output 3\n\n113", "sample_input": "3\n1 3\n2 3\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02617", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have a tree with N vertices and N-1 edges, respectively numbered 1, 2,\\cdots, N and 1, 2, \\cdots, N-1. Edge i connects Vertex u_i and v_i.\n\nFor integers L, R (1 \\leq L \\leq R \\leq N), let us define a function f(L, R) as follows:\n\nLet S be the set of the vertices numbered L through R. f(L, R) represents the number of connected components in the subgraph formed only from the vertex set S and the edges whose endpoints both belong to S.\n\nCompute \\sum_{L=1}^{N} \\sum_{R=L}^{N} f(L, R).\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq u_i, v_i \\leq N\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nu_1 v_1\nu_2 v_2\n:\nu_{N-1} v_{N-1}\n\nOutput\n\nPrint \\sum_{L=1}^{N} \\sum_{R=L}^{N} f(L, R).\n\nSample Input 1\n\n3\n1 3\n2 3\n\nSample Output 1\n\n7\n\nWe have six possible pairs (L, R) as follows:\n\nFor L = 1, R = 1, S = \\{1\\} and we have 1 connected component.\n\nFor L = 1, R = 2, S = \\{1, 2\\} and we have 2 connected components.\n\nFor L = 1, R = 3, S = \\{1, 2, 3\\} and we have 1 connected component, since S contains both endpoints of each of the edges 1, 2.\n\nFor L = 2, R = 2, S = \\{2\\} and we have 1 connected component.\n\nFor L = 2, R = 3, S = \\{2, 3\\} and we have 1 connected component, since S contains both endpoints of Edge 2.\n\nFor L = 3, R = 3, S = \\{3\\} and we have 1 connected component.\n\nThe sum of these is 7.\n\nSample Input 2\n\n2\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n10\n5 3\n5 7\n8 9\n1 9\n9 10\n8 4\n7 4\n6 10\n7 2\n\nSample Output 3\n\n113", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 256, "cpu_time_ms": 105, "memory_kb": 18996}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s959995005", "group_id": "codeNet:p02621", "input_text": "local a = io.read()\nprint(math.floor(a + a*a + a*a*a))\n", "language": "Lua", "metadata": {"date": 1594732888, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02621.html", "problem_id": "p02621", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02621/input.txt", "sample_output_relpath": "derived/input_output/data/p02621/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02621/Lua/s959995005.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s959995005", "user_id": "u914562870"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "local a = io.read()\nprint(math.floor(a + a*a + a*a*a))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "sample_input": "2\n"}, "reference_outputs": ["14\n"], "source_document_id": "p02621", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 2628}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s008806416", "group_id": "codeNet:p02621", "input_text": "local str = io.read()\nstr = str + str*str + str*str*str\nstr = math.floor(str)\nprint(str)", "language": "Lua", "metadata": {"date": 1594084824, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02621.html", "problem_id": "p02621", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02621/input.txt", "sample_output_relpath": "derived/input_output/data/p02621/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02621/Lua/s008806416.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s008806416", "user_id": "u089230684"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "local str = io.read()\nstr = str + str*str + str*str*str\nstr = math.floor(str)\nprint(str)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "sample_input": "2\n"}, "reference_outputs": ["14\n"], "source_document_id": "p02621", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 2600}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s661271324", "group_id": "codeNet:p02621", "input_text": "function rl()\n r = {}\n for word in io.read():gmatch(\"%S+\") do\n table.insert(r, tonumber(word))\n end\n return r\nend\n\na = rl()[1]\n\nprint(a + a*a + a*a*a)\n", "language": "Lua", "metadata": {"date": 1593966896, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02621.html", "problem_id": "p02621", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02621/input.txt", "sample_output_relpath": "derived/input_output/data/p02621/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02621/Lua/s661271324.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s661271324", "user_id": "u677997743"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "function rl()\n r = {}\n for word in io.read():gmatch(\"%S+\") do\n table.insert(r, tonumber(word))\n end\n return r\nend\n\na = rl()[1]\n\nprint(a + a*a + a*a*a)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "sample_input": "2\n"}, "reference_outputs": ["14\n"], "source_document_id": "p02621", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 2552}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s535355626", "group_id": "codeNet:p02621", "input_text": "local a = io.read(\"*n\")\n\nprint(a + a*a + a*a*a)\n", "language": "Lua", "metadata": {"date": 1593313785, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02621.html", "problem_id": "p02621", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02621/input.txt", "sample_output_relpath": "derived/input_output/data/p02621/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02621/Lua/s535355626.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s535355626", "user_id": "u793881115"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "local a = io.read(\"*n\")\n\nprint(a + a*a + a*a*a)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "sample_input": "2\n"}, "reference_outputs": ["14\n"], "source_document_id": "p02621", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2668}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s424719121", "group_id": "codeNet:p02622", "input_text": "local S, T = io.read(\"*l\", \"*l\")\n\nlocal count = 0\n--[[ パターン1\nfor i = 1, S:len() do\n\tif S:sub(i, i) ~= T:sub(i, i) then\n\t\tcount = count + 1\n\tend\nend\n--]]\n---[[ パターン2\nlocal S_byte_s, T_byte_s = {}, {T:byte(1, -1)}\nfor i = 1, S:len() do\n\tS_byte_s[i] = S:byte(i)\n\tT_byte_s[i] = T:byte(i)\nend\n\nfor i = 1, S:len() do\n\tif S_byte_s[i] ~= T_byte_s[i] then\n\t\tcount = count + 1\n\tend\nend\n--]]\nprint(count)\n", "language": "Lua", "metadata": {"date": 1593314783, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s424719121.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s424719121", "user_id": "u793881115"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local S, T = io.read(\"*l\", \"*l\")\n\nlocal count = 0\n--[[ パターン1\nfor i = 1, S:len() do\n\tif S:sub(i, i) ~= T:sub(i, i) then\n\t\tcount = count + 1\n\tend\nend\n--]]\n---[[ パターン2\nlocal S_byte_s, T_byte_s = {}, {T:byte(1, -1)}\nfor i = 1, S:len() do\n\tS_byte_s[i] = S:byte(i)\n\tT_byte_s[i] = T:byte(i)\nend\n\nfor i = 1, S:len() do\n\tif S_byte_s[i] ~= T_byte_s[i] then\n\t\tcount = count + 1\n\tend\nend\n--]]\nprint(count)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.\n\nOperation: Choose one character of S and replace it with a different character.\n\nConstraints\n\nS and T have lengths between 1 and 2\\times 10^5 (inclusive).\n\nS and T consists of lowercase English letters.\n\nS and T have equal lengths.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\ncupofcoffee\ncupofhottea\n\nSample Output 1\n\n4\n\nWe can achieve the objective in four operations, such as the following:\n\nFirst, replace the sixth character c with h.\n\nSecond, replace the eighth character f with t.\n\nThird, replace the ninth character f with t.\n\nFourth, replace the eleventh character e with a.\n\nSample Input 2\n\nabcde\nbcdea\n\nSample Output 2\n\n5\n\nSample Input 3\n\napple\napple\n\nSample Output 3\n\n0\n\nNo operations may be needed to achieve the objective.", "sample_input": "cupofcoffee\ncupofhottea\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02622", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.\n\nOperation: Choose one character of S and replace it with a different character.\n\nConstraints\n\nS and T have lengths between 1 and 2\\times 10^5 (inclusive).\n\nS and T consists of lowercase English letters.\n\nS and T have equal lengths.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\ncupofcoffee\ncupofhottea\n\nSample Output 1\n\n4\n\nWe can achieve the objective in four operations, such as the following:\n\nFirst, replace the sixth character c with h.\n\nSecond, replace the eighth character f with t.\n\nThird, replace the ninth character f with t.\n\nFourth, replace the eleventh character e with a.\n\nSample Input 2\n\nabcde\nbcdea\n\nSample Output 2\n\n5\n\nSample Input 3\n\napple\napple\n\nSample Output 3\n\n0\n\nNo operations may be needed to achieve the objective.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 410, "cpu_time_ms": 5, "memory_kb": 2960}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s639745423", "group_id": "codeNet:p02622", "input_text": "local S, T = io.read(\"*l\", \"*l\")\n\nlocal count = 0\n--[[ パターン1\nfor i = 1, S:len() do\n\tif S:sub(i, i) ~= T:sub(i, i) then\n\t\tcount = count + 1\n\tend\nend\n--]]\n---[[ パターン2\nlocal S_byte_s, T_byte_s = {S:byte(1, -1)}, {T:byte(1, -1)}\nfor i = 1, S:len() do\n\tif S_byte_s[i] ~= T_byte_s[i] then\n\t\tcount = count + 1\n\tend\nend\n--]]\nprint(count)\n", "language": "Lua", "metadata": {"date": 1593314507, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s639745423.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s639745423", "user_id": "u793881115"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local S, T = io.read(\"*l\", \"*l\")\n\nlocal count = 0\n--[[ パターン1\nfor i = 1, S:len() do\n\tif S:sub(i, i) ~= T:sub(i, i) then\n\t\tcount = count + 1\n\tend\nend\n--]]\n---[[ パターン2\nlocal S_byte_s, T_byte_s = {S:byte(1, -1)}, {T:byte(1, -1)}\nfor i = 1, S:len() do\n\tif S_byte_s[i] ~= T_byte_s[i] then\n\t\tcount = count + 1\n\tend\nend\n--]]\nprint(count)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.\n\nOperation: Choose one character of S and replace it with a different character.\n\nConstraints\n\nS and T have lengths between 1 and 2\\times 10^5 (inclusive).\n\nS and T consists of lowercase English letters.\n\nS and T have equal lengths.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\ncupofcoffee\ncupofhottea\n\nSample Output 1\n\n4\n\nWe can achieve the objective in four operations, such as the following:\n\nFirst, replace the sixth character c with h.\n\nSecond, replace the eighth character f with t.\n\nThird, replace the ninth character f with t.\n\nFourth, replace the eleventh character e with a.\n\nSample Input 2\n\nabcde\nbcdea\n\nSample Output 2\n\n5\n\nSample Input 3\n\napple\napple\n\nSample Output 3\n\n0\n\nNo operations may be needed to achieve the objective.", "sample_input": "cupofcoffee\ncupofhottea\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02622", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.\n\nOperation: Choose one character of S and replace it with a different character.\n\nConstraints\n\nS and T have lengths between 1 and 2\\times 10^5 (inclusive).\n\nS and T consists of lowercase English letters.\n\nS and T have equal lengths.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\ncupofcoffee\ncupofhottea\n\nSample Output 1\n\n4\n\nWe can achieve the objective in four operations, such as the following:\n\nFirst, replace the sixth character c with h.\n\nSecond, replace the eighth character f with t.\n\nThird, replace the ninth character f with t.\n\nFourth, replace the eleventh character e with a.\n\nSample Input 2\n\nabcde\nbcdea\n\nSample Output 2\n\n5\n\nSample Input 3\n\napple\napple\n\nSample Output 3\n\n0\n\nNo operations may be needed to achieve the objective.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 2856}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s856219909", "group_id": "codeNet:p02628", "input_text": "local n,k=io.read(\"n\",\"n\")\nlocal p={}\nfor i=1,n do\n p[i]=io.read(\"n\")\nend\ntable.sort(p)\n\nlocal total=0\nfor i=1,k do\n total=total+p[i]\nend\nprint(total)", "language": "Lua", "metadata": {"date": 1592884177, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s856219909.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s856219909", "user_id": "u045238009"}, "prompt_components": {"gold_output": "210\n", "input_to_evaluate": "local n,k=io.read(\"n\",\"n\")\nlocal p={}\nfor i=1,n do\n p[i]=io.read(\"n\")\nend\ntable.sort(p)\n\nlocal total=0\nfor i=1,k do\n total=total+p[i]\nend\nprint(total)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2728}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s374662281", "group_id": "codeNet:p02628", "input_text": "local read = io.read\nlocal N, K = read(\"*n\", \"*n\")\nlocal p = {}\nfor i = 1, N do\n\tp[i] = read(\"*n\")\nend\n\ntable.sort(p)\n\nlocal out = 0\nfor i = 1, K do\n\tout = out + p[i]\nend\n\nprint(out)\n", "language": "Lua", "metadata": {"date": 1592788926, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s374662281.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s374662281", "user_id": "u793881115"}, "prompt_components": {"gold_output": "210\n", "input_to_evaluate": "local read = io.read\nlocal N, K = read(\"*n\", \"*n\")\nlocal p = {}\nfor i = 1, N do\n\tp[i] = read(\"*n\")\nend\n\ntable.sort(p)\n\nlocal out = 0\nfor i = 1, K do\n\tout = out + p[i]\nend\n\nprint(out)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA shop sells N kinds of fruits, Fruit 1, \\ldots, N, at prices of p_1, \\ldots, p_N yen per item, respectively. (Yen is the currency of Japan.)\n\nHere, we will choose K kinds of fruits and buy one of each chosen kind. Find the minimum possible total price of those fruits.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 1000\n\n1 \\leq p_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\np_1 p_2 \\ldots p_N\n\nOutput\n\nPrint an integer representing the minimum possible total price of fruits.\n\nSample Input 1\n\n5 3\n50 100 80 120 80\n\nSample Output 1\n\n210\n\nThis shop sells Fruit 1, 2, 3, 4, and 5 for 50 yen, 100 yen, 80 yen, 120 yen, and 80 yen, respectively.\n\nThe minimum total price for three kinds of fruits is 50 + 80 + 80 = 210 yen when choosing Fruit 1, 3, and 5.\n\nSample Input 2\n\n1 1\n1000\n\nSample Output 2\n\n1000", "sample_input": "5 3\n50 100 80 120 80\n"}, "reference_outputs": ["210\n"], "source_document_id": "p02628", "source_text": "Score : 200 points\n\nProblem Statement\n\nA shop sells N kinds of fruits, Fruit 1, \\ldots, N, at prices of p_1, \\ldots, p_N yen per item, respectively. (Yen is the currency of Japan.)\n\nHere, we will choose K kinds of fruits and buy one of each chosen kind. Find the minimum possible total price of those fruits.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 1000\n\n1 \\leq p_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\np_1 p_2 \\ldots p_N\n\nOutput\n\nPrint an integer representing the minimum possible total price of fruits.\n\nSample Input 1\n\n5 3\n50 100 80 120 80\n\nSample Output 1\n\n210\n\nThis shop sells Fruit 1, 2, 3, 4, and 5 for 50 yen, 100 yen, 80 yen, 120 yen, and 80 yen, respectively.\n\nThe minimum total price for three kinds of fruits is 50 + 80 + 80 = 210 yen when choosing Fruit 1, 3, and 5.\n\nSample Input 2\n\n1 1\n1000\n\nSample Output 2\n\n1000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 2672}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s613776415", "group_id": "codeNet:p02628", "input_text": "local function reada(n,m)m=m or 1 r={}for i=1,m do r[i]={}end for i=1,n do for j=1,m do r[j][i]=io.read\"*n\"end end return unpack(r)end \nN=io.read\"*n\"\nK=io.read\"*n\"\np=reada(N)\ntable.sort(p)\ns=0\nfor i=1,K do\ns=s+p[i]\nend\nprint(s)", "language": "Lua", "metadata": {"date": 1592787715, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s613776415.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s613776415", "user_id": "u726173718"}, "prompt_components": {"gold_output": "210\n", "input_to_evaluate": "local function reada(n,m)m=m or 1 r={}for i=1,m do r[i]={}end for i=1,n do for j=1,m do r[j][i]=io.read\"*n\"end end return unpack(r)end \nN=io.read\"*n\"\nK=io.read\"*n\"\np=reada(N)\ntable.sort(p)\ns=0\nfor i=1,K do\ns=s+p[i]\nend\nprint(s)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 227, "cpu_time_ms": 3, "memory_kb": 2760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s630233821", "group_id": "codeNet:p02629", "input_text": "local t = {\"a\", \"b\", \"c\", \"d\", \"e\",\"f\", \"g\", \"h\", \"i\",\"j\", \"k\", \"l\", \"m\", \"n\",\"o\", \"p\", \"q\", \"r\",\"s\", \"t \", \"u\", \"v\", \"w\",\"x\", \"y\", \"z\"}\n-- print(#t)\nlocal N = io.read()\n-- local N = 123456789\nlocal x = string.byte(\"a\") - 1\nlocal aa = \"\"\nlocal function a(N)\n local n = math.floor(N / 26)\n local m = N % 26\n if n == 0 and m == 0 then\n aa = aa..t[26]\n return\n end\n if n > 0 then\n a(n)\n else\n if m ~= 0 and n ~= 0 then\n aa = aa..t[n]\n return\n end\n end\n if m == 0 then\n aa = aa..t[26]\n else\n aa = aa..t[m]\n end\nend\na(N)\nprint(aa)", "language": "Lua", "metadata": {"date": 1594436356, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s630233821.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s630233821", "user_id": "u353919145"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "local t = {\"a\", \"b\", \"c\", \"d\", \"e\",\"f\", \"g\", \"h\", \"i\",\"j\", \"k\", \"l\", \"m\", \"n\",\"o\", \"p\", \"q\", \"r\",\"s\", \"t \", \"u\", \"v\", \"w\",\"x\", \"y\", \"z\"}\n-- print(#t)\nlocal N = io.read()\n-- local N = 123456789\nlocal x = string.byte(\"a\") - 1\nlocal aa = \"\"\nlocal function a(N)\n local n = math.floor(N / 26)\n local m = N % 26\n if n == 0 and m == 0 then\n aa = aa..t[26]\n return\n end\n if n > 0 then\n a(n)\n else\n if m ~= 0 and n ~= 0 then\n aa = aa..t[n]\n return\n end\n end\n if m == 0 then\n aa = aa..t[26]\n else\n aa = aa..t[m]\n end\nend\na(N)\nprint(aa)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 12, "memory_kb": 2652}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s783925310", "group_id": "codeNet:p02629", "input_text": "local t = {\"a\", \"b\", \"c\", \"d\", \"e\",\"f\", \"g\", \"h\", \"i\",\"j\", \"k\", \"l\", \"m\", \"n\",\"o\", \"p\", \"q\", \"r\",\"s\", \"t \", \"u\", \"v\", \"w\",\"x\", \"y\", \"z\"}\nlocal N = io.read()\nlocal x = string.byte(\"a\") - 1\nlocal aa = \"\"\nlocal function a(N)\n local n = math.floor(N / 26)\n local m = N % 26\n if n > 26 then\n a(n)\n else\n if m ~= 0 then\n aa = aa..t[n]\n end\n end\n if m == 0 then\n aa = aa..t[26]\n else\n aa = aa..t[m]\n end\nend\na(N)\nprint(aa)\n\n", "language": "Lua", "metadata": {"date": 1594433231, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s783925310.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s783925310", "user_id": "u816631826"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "local t = {\"a\", \"b\", \"c\", \"d\", \"e\",\"f\", \"g\", \"h\", \"i\",\"j\", \"k\", \"l\", \"m\", \"n\",\"o\", \"p\", \"q\", \"r\",\"s\", \"t \", \"u\", \"v\", \"w\",\"x\", \"y\", \"z\"}\nlocal N = io.read()\nlocal x = string.byte(\"a\") - 1\nlocal aa = \"\"\nlocal function a(N)\n local n = math.floor(N / 26)\n local m = N % 26\n if n > 26 then\n a(n)\n else\n if m ~= 0 then\n aa = aa..t[n]\n end\n end\n if m == 0 then\n aa = aa..t[26]\n else\n aa = aa..t[m]\n end\nend\na(N)\nprint(aa)\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\n1000000000000001 dogs suddenly appeared under the roof of Roger's house, all of which he decided to keep. The dogs had been numbered 1 through 1000000000000001, but he gave them new names, as follows:\n\nthe dogs numbered 1,2,\\cdots,26 were respectively given the names a, b, ..., z;\n\nthe dogs numbered 27,28,29,\\cdots,701,702 were respectively given the names aa, ab, ac, ..., zy, zz;\n\nthe dogs numbered 703,704,705,\\cdots,18277,18278 were respectively given the names aaa, aab, aac, ..., zzy, zzz;\n\nthe dogs numbered 18279,18280,18281,\\cdots,475253,475254 were respectively given the names aaaa, aaab, aaac, ..., zzzy, zzzz;\n\nthe dogs numbered 475255,475256,\\cdots were respectively given the names aaaaa, aaaab, ...;\n\nand so on.\n\nTo sum it up, the dogs numbered 1, 2, \\cdots were respectively given the following names:\n\na, b, ..., z, aa, ab, ..., az, ba, bb, ..., bz, ..., za, zb, ..., zz, aaa, aab, ..., aaz, aba, abb, ..., abz, ..., zzz, aaaa, ...\n\nNow, Roger asks you:\n\n\"What is the name for the dog numbered N?\"\n\nConstraints\n\nN is an integer.\n\n1 \\leq N \\leq 1000000000000001\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer to Roger's question as a string consisting of lowercase English letters.\n\nSample Input 1\n\n2\n\nSample Output 1\n\nb\n\nSample Input 2\n\n27\n\nSample Output 2\n\naa\n\nSample Input 3\n\n123456789\n\nSample Output 3\n\njjddja", "sample_input": "2\n"}, "reference_outputs": ["b\n"], "source_document_id": "p02629", "source_text": "Score : 300 points\n\nProblem Statement\n\n1000000000000001 dogs suddenly appeared under the roof of Roger's house, all of which he decided to keep. The dogs had been numbered 1 through 1000000000000001, but he gave them new names, as follows:\n\nthe dogs numbered 1,2,\\cdots,26 were respectively given the names a, b, ..., z;\n\nthe dogs numbered 27,28,29,\\cdots,701,702 were respectively given the names aa, ab, ac, ..., zy, zz;\n\nthe dogs numbered 703,704,705,\\cdots,18277,18278 were respectively given the names aaa, aab, aac, ..., zzy, zzz;\n\nthe dogs numbered 18279,18280,18281,\\cdots,475253,475254 were respectively given the names aaaa, aaab, aaac, ..., zzzy, zzzz;\n\nthe dogs numbered 475255,475256,\\cdots were respectively given the names aaaaa, aaaab, ...;\n\nand so on.\n\nTo sum it up, the dogs numbered 1, 2, \\cdots were respectively given the following names:\n\na, b, ..., z, aa, ab, ..., az, ba, bb, ..., bz, ..., za, zb, ..., zz, aaa, aab, ..., aaz, aba, abb, ..., abz, ..., zzz, aaaa, ...\n\nNow, Roger asks you:\n\n\"What is the name for the dog numbered N?\"\n\nConstraints\n\nN is an integer.\n\n1 \\leq N \\leq 1000000000000001\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer to Roger's question as a string consisting of lowercase English letters.\n\nSample Input 1\n\n2\n\nSample Output 1\n\nb\n\nSample Input 2\n\n27\n\nSample Output 2\n\naa\n\nSample Input 3\n\n123456789\n\nSample Output 3\n\njjddja", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 486, "cpu_time_ms": 10, "memory_kb": 2680}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s186574988", "group_id": "codeNet:p02629", "input_text": "local t = {\"a\", \"b\", \"c\", \"d\", \"e\",\"f\", \"g\", \"h\", \"i\",\"j\", \"k\", \"l\", \"m\", \"n\",\"o\", \"p\", \"q\", \"r\",\"s\", \"t\", \"u\", \"v\", \"w\",\"x\", \"y\", \"z\"}\n\nlocal N = io.read()\nlocal x = string.byte(\"a\") - 1\nlocal aa = \"\"\nlocal function a(N)\n local n = math.floor(N/26)\n local m = N % 26\n if n > 26 then\n a(n)\n else\n aa = aa..t[n]\n end\n aa = aa..t[m]\nend\na(N)\nprint(aa)", "language": "Lua", "metadata": {"date": 1594432390, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s186574988.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s186574988", "user_id": "u816631826"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "local t = {\"a\", \"b\", \"c\", \"d\", \"e\",\"f\", \"g\", \"h\", \"i\",\"j\", \"k\", \"l\", \"m\", \"n\",\"o\", \"p\", \"q\", \"r\",\"s\", \"t\", \"u\", \"v\", \"w\",\"x\", \"y\", \"z\"}\n\nlocal N = io.read()\nlocal x = string.byte(\"a\") - 1\nlocal aa = \"\"\nlocal function a(N)\n local n = math.floor(N/26)\n local m = N % 26\n if n > 26 then\n a(n)\n else\n aa = aa..t[n]\n end\n aa = aa..t[m]\nend\na(N)\nprint(aa)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 380, "cpu_time_ms": 6, "memory_kb": 2792}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s731044660", "group_id": "codeNet:p02629", "input_text": "--https://www.lua.org/pil/11.4.html\nlocal List = {}\nfunction List.new ()\n return {first = 0, last = -1}\nend\n\nfunction List.pushleft (list, value)\n local first = list.first - 1\n list.first = first\n list[first] = value\nend\n\nfunction List.pushright (list, value)\n local last = list.last + 1\n list.last = last\n list[last] = value\nend\n\nfunction List.popleft (list)\n local first = list.first\n if first > list.last then return false end\n local value = list[first]\n list[first] = nil\n list.first = first + 1\n return value\nend\n\nfunction List.popright (list)\n local last = list.last\n if list.first > last then return false end\n local value = list[last]\n list[last] = nil\n list.last = last - 1\n return value\nend\n\n----------\n\nlocal n=io.read(\"n\")\nlocal que=List.new()\n\nlocal ts=26\nwhile n>0 do\n List.pushleft(que,n%ts)\n n=n//26\nend\n\nlocal answer={}\nwhile true do\n local pop=List.popleft(que)\n if not pop then\n break\n end\n table.insert(answer,string.char(pop+96))\nend\nprint(table.concat(answer,\"\"))", "language": "Lua", "metadata": {"date": 1592886076, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s731044660.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s731044660", "user_id": "u045238009"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "--https://www.lua.org/pil/11.4.html\nlocal List = {}\nfunction List.new ()\n return {first = 0, last = -1}\nend\n\nfunction List.pushleft (list, value)\n local first = list.first - 1\n list.first = first\n list[first] = value\nend\n\nfunction List.pushright (list, value)\n local last = list.last + 1\n list.last = last\n list[last] = value\nend\n\nfunction List.popleft (list)\n local first = list.first\n if first > list.last then return false end\n local value = list[first]\n list[first] = nil\n list.first = first + 1\n return value\nend\n\nfunction List.popright (list)\n local last = list.last\n if list.first > last then return false end\n local value = list[last]\n list[last] = nil\n list.last = last - 1\n return value\nend\n\n----------\n\nlocal n=io.read(\"n\")\nlocal que=List.new()\n\nlocal ts=26\nwhile n>0 do\n List.pushleft(que,n%ts)\n n=n//26\nend\n\nlocal answer={}\nwhile true do\n local pop=List.popleft(que)\n if not pop then\n break\n end\n table.insert(answer,string.char(pop+96))\nend\nprint(table.concat(answer,\"\"))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1029, "cpu_time_ms": 4, "memory_kb": 2696}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s012662747", "group_id": "codeNet:p02629", "input_text": "N=io.read\"*n\"\ni=1\ns=0\nwhile true do\n\ts=s+math.floor(26^i+.5)\n\tif(N=b+w*t then\n print(\"YES\")\n else\n print(\"NO\")\n end\nelse\n if a-v*t<=b-w*t then\n print(\"YES\")\n else\n print(\"NO\")\n end\nend", "language": "Lua", "metadata": {"date": 1592105284, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s706515181.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s706515181", "user_id": "u045238009"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "local a,v=io.read(\"n\",\"n\")\nlocal b,w=io.read(\"n\",\"n\")\nlocal t=io.read(\"n\")\n\nif a=b+w*t then\n print(\"YES\")\n else\n print(\"NO\")\n end\nelse\n if a-v*t<=b-w*t then\n print(\"YES\")\n else\n print(\"NO\")\n end\nend", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 262, "cpu_time_ms": 5, "memory_kb": 2680}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s666618467", "group_id": "codeNet:p02646", "input_text": "local a,v=io.read(\"n\",\"n\")\nlocal b,w=io.read(\"n\",\"n\")\nlocal t=io.read(\"n\")\n\nif a=b+w*t then\n print(\"YES\")\n else\n print(\"NO\")\n end\nelse\n if a-v*t>=b-w*t then\n print(\"YES\")\n else\n print(\"NO\")\n end\nend", "language": "Lua", "metadata": {"date": 1592105109, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s666618467.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s666618467", "user_id": "u045238009"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "local a,v=io.read(\"n\",\"n\")\nlocal b,w=io.read(\"n\",\"n\")\nlocal t=io.read(\"n\")\n\nif a=b+w*t then\n print(\"YES\")\n else\n print(\"NO\")\n end\nelse\n if a-v*t>=b-w*t then\n print(\"YES\")\n else\n print(\"NO\")\n end\nend", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 262, "cpu_time_ms": 4, "memory_kb": 2672}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s518487758", "group_id": "codeNet:p02648", "input_text": "local bls, brs = bit.lshift, bit.rshift\nlocal mmi, mma = math.min, math.max\nlocal bxor = bit.bxor\n\nlocal function grayCode(x)\n return bxor(x, brs(x, 1))\nend\n\n-- add_func(idx), rm_func(idx), work_func()\nlocal function grayWalk(size, add_func, rm_func, work_func)\n local prv = 0\n local total = bls(1, size) - 1\n local bpos = {}\n for i = 1, size do\n bpos[bls(1, i - 1)] = i\n end\n for i = 1, total do\n local v = grayCode(i)\n if prv < v then\n prv, v = v, v - prv\n add_func(bpos[v])\n else\n prv, v = v, prv - v\n rm_func(bpos[v])\n end\n work_func()\n end\nend\n\nlocal n = io.read(\"*n\")\nlocal v, w = {}, {}\nfor i = 1, n do\n v[i], w[i] = io.read(\"*n\", \"*n\")\nend\nlocal head_tbl = {}\nlocal box = {}\nlocal ten5 = 100000\n\nlocal tgt = 0\nlocal weight, val = 0, 0\nlocal tbl = nil\nlocal function add_func(idx)\n weight = weight + w[brs(tgt, idx - 1)]\n val = val + v[brs(tgt, idx - 1)]\nend\nlocal function rm_func(idx)\n weight = weight - w[brs(tgt, idx - 1)]\n val = val - v[brs(tgt, idx - 1)]\nend\nlocal function work_func()\n if weight <= ten5 then\n tbl[weight] = mma(tbl[weight], val)\n end\nend\n\nfor i = 512, mmi(n, 1023) do\n tgt = i\n head_tbl[i - 511] = {}\n tbl = head_tbl[i - 511]\n for j = 1, ten5 do\n tbl[j] = 0\n end\n weight, val = 0, 0\n grayWalk(10, add_func, rm_func, work_func)\n for i = 2, ten5 do\n tbl[i] = mma(tbl[i], tbl[i - 1])\n end\nend\n\nlocal q = io.read(\"*n\")\nlocal ans, wlim = 0, 0\nlocal function work_func2()\n if weight <= wlim then\n ans = mma(ans, val)\n end\nend\nlocal function work_func3()\n if weight <= wlim then\n ans = mma(ans, val)\n end\n if weight < wlim then\n ans = mma(ans, val + tbl[wlim - weight])\n end\nend\nfor iq = 1, q do\n local pos, wlim_tmp = io.read(\"*n\", \"*n\")\n wlim = wlim_tmp\n local deg = 0\n do\n local tmp = pos\n while 0 < tmp do\n deg, tmp = deg + 1, brs(tmp, 1)\n end\n end\n if pos < 512 then\n ans = 0\n weight, val = 0, 0\n tgt = pos\n grayWalk(deg, add_func, rm_func, work_func2)\n print(ans)\n elseif pos < 1024 then\n print(head_tbl[pos - 511][wlim])\n else\n deg = deg - 10\n tbl = head_tbl[brs(pos, deg) - 511]\n ans = tbl[wlim]\n weight, val = 0, 0\n tgt = pos\n grayWalk(deg, add_func, rm_func, work_func3)\n print(ans)\n end\nend\n", "language": "Lua", "metadata": {"date": 1594783477, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02648.html", "problem_id": "p02648", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02648/input.txt", "sample_output_relpath": "derived/input_output/data/p02648/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02648/Lua/s518487758.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s518487758", "user_id": "u120582723"}, "prompt_components": {"gold_output": "0\n3\n3\n", "input_to_evaluate": "local bls, brs = bit.lshift, bit.rshift\nlocal mmi, mma = math.min, math.max\nlocal bxor = bit.bxor\n\nlocal function grayCode(x)\n return bxor(x, brs(x, 1))\nend\n\n-- add_func(idx), rm_func(idx), work_func()\nlocal function grayWalk(size, add_func, rm_func, work_func)\n local prv = 0\n local total = bls(1, size) - 1\n local bpos = {}\n for i = 1, size do\n bpos[bls(1, i - 1)] = i\n end\n for i = 1, total do\n local v = grayCode(i)\n if prv < v then\n prv, v = v, v - prv\n add_func(bpos[v])\n else\n prv, v = v, prv - v\n rm_func(bpos[v])\n end\n work_func()\n end\nend\n\nlocal n = io.read(\"*n\")\nlocal v, w = {}, {}\nfor i = 1, n do\n v[i], w[i] = io.read(\"*n\", \"*n\")\nend\nlocal head_tbl = {}\nlocal box = {}\nlocal ten5 = 100000\n\nlocal tgt = 0\nlocal weight, val = 0, 0\nlocal tbl = nil\nlocal function add_func(idx)\n weight = weight + w[brs(tgt, idx - 1)]\n val = val + v[brs(tgt, idx - 1)]\nend\nlocal function rm_func(idx)\n weight = weight - w[brs(tgt, idx - 1)]\n val = val - v[brs(tgt, idx - 1)]\nend\nlocal function work_func()\n if weight <= ten5 then\n tbl[weight] = mma(tbl[weight], val)\n end\nend\n\nfor i = 512, mmi(n, 1023) do\n tgt = i\n head_tbl[i - 511] = {}\n tbl = head_tbl[i - 511]\n for j = 1, ten5 do\n tbl[j] = 0\n end\n weight, val = 0, 0\n grayWalk(10, add_func, rm_func, work_func)\n for i = 2, ten5 do\n tbl[i] = mma(tbl[i], tbl[i - 1])\n end\nend\n\nlocal q = io.read(\"*n\")\nlocal ans, wlim = 0, 0\nlocal function work_func2()\n if weight <= wlim then\n ans = mma(ans, val)\n end\nend\nlocal function work_func3()\n if weight <= wlim then\n ans = mma(ans, val)\n end\n if weight < wlim then\n ans = mma(ans, val + tbl[wlim - weight])\n end\nend\nfor iq = 1, q do\n local pos, wlim_tmp = io.read(\"*n\", \"*n\")\n wlim = wlim_tmp\n local deg = 0\n do\n local tmp = pos\n while 0 < tmp do\n deg, tmp = deg + 1, brs(tmp, 1)\n end\n end\n if pos < 512 then\n ans = 0\n weight, val = 0, 0\n tgt = pos\n grayWalk(deg, add_func, rm_func, work_func2)\n print(ans)\n elseif pos < 1024 then\n print(head_tbl[pos - 511][wlim])\n else\n deg = deg - 10\n tbl = head_tbl[brs(pos, deg) - 511]\n ans = tbl[wlim]\n weight, val = 0, 0\n tgt = pos\n grayWalk(deg, add_func, rm_func, work_func3)\n print(ans)\n end\nend\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nWe have a rooted binary tree with N vertices, where the vertices are numbered 1 to N.\nVertex 1 is the root, and the parent of Vertex i (i \\geq 2) is Vertex \\left[ \\frac{i}{2} \\right].\n\nEach vertex has one item in it. The item in Vertex i has a value of V_i and a weight of W_i.\nNow, process the following query Q times:\n\nGiven are a vertex v of the tree and a positive integer L.\nLet us choose some (possibly none) of the items in v and the ancestors of v so that their total weight is at most L.\nFind the maximum possible total value of the chosen items.\n\nHere, Vertex u is said to be an ancestor of Vertex v when u is an indirect parent of v, that is, there exists a sequence of vertices w_1,w_2,\\ldots,w_k (k\\geq 2) where w_1=v, w_k=u, and w_{i+1} is the parent of w_i for each i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N < 2^{18}\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq V_i \\leq 10^5\n\n1 \\leq W_i \\leq 10^5\n\nFor the values v and L given in each query, 1 \\leq v \\leq N and 1 \\leq L \\leq 10^5.\n\nInput\n\nLet v_i and L_i be the values v and L given in the i-th query.\nThen, Input is given from Standard Input in the following format:\n\nN\nV_1 W_1\n:\nV_N W_N\nQ\nv_1 L_1\n:\nv_Q L_Q\n\nOutput\n\nFor each integer i from 1 through Q,\nthe i-th line should contain the response to the i-th query.\n\nSample Input 1\n\n3\n1 2\n2 3\n3 4\n3\n1 1\n2 5\n3 5\n\nSample Output 1\n\n0\n3\n3\n\nIn the first query, we are given only one choice: the item with (V, W)=(1,2). Since L = 1, we cannot actually choose it, so our response should be 0.\n\nIn the second query, we are given two choices: the items with (V, W)=(1,2) and (V, W)=(2,3). Since L = 5, we can choose both of them, so our response should be 3.\n\nSample Input 2\n\n15\n123 119\n129 120\n132 112\n126 109\n118 103\n115 109\n102 100\n130 120\n105 105\n132 115\n104 102\n107 107\n127 116\n121 104\n121 115\n8\n8 234\n9 244\n10 226\n11 227\n12 240\n13 237\n14 206\n15 227\n\nSample Output 2\n\n256\n255\n250\n247\n255\n259\n223\n253", "sample_input": "3\n1 2\n2 3\n3 4\n3\n1 1\n2 5\n3 5\n"}, "reference_outputs": ["0\n3\n3\n"], "source_document_id": "p02648", "source_text": "Score : 700 points\n\nProblem Statement\n\nWe have a rooted binary tree with N vertices, where the vertices are numbered 1 to N.\nVertex 1 is the root, and the parent of Vertex i (i \\geq 2) is Vertex \\left[ \\frac{i}{2} \\right].\n\nEach vertex has one item in it. The item in Vertex i has a value of V_i and a weight of W_i.\nNow, process the following query Q times:\n\nGiven are a vertex v of the tree and a positive integer L.\nLet us choose some (possibly none) of the items in v and the ancestors of v so that their total weight is at most L.\nFind the maximum possible total value of the chosen items.\n\nHere, Vertex u is said to be an ancestor of Vertex v when u is an indirect parent of v, that is, there exists a sequence of vertices w_1,w_2,\\ldots,w_k (k\\geq 2) where w_1=v, w_k=u, and w_{i+1} is the parent of w_i for each i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N < 2^{18}\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq V_i \\leq 10^5\n\n1 \\leq W_i \\leq 10^5\n\nFor the values v and L given in each query, 1 \\leq v \\leq N and 1 \\leq L \\leq 10^5.\n\nInput\n\nLet v_i and L_i be the values v and L given in the i-th query.\nThen, Input is given from Standard Input in the following format:\n\nN\nV_1 W_1\n:\nV_N W_N\nQ\nv_1 L_1\n:\nv_Q L_Q\n\nOutput\n\nFor each integer i from 1 through Q,\nthe i-th line should contain the response to the i-th query.\n\nSample Input 1\n\n3\n1 2\n2 3\n3 4\n3\n1 1\n2 5\n3 5\n\nSample Output 1\n\n0\n3\n3\n\nIn the first query, we are given only one choice: the item with (V, W)=(1,2). Since L = 1, we cannot actually choose it, so our response should be 0.\n\nIn the second query, we are given two choices: the items with (V, W)=(1,2) and (V, W)=(2,3). Since L = 5, we can choose both of them, so our response should be 3.\n\nSample Input 2\n\n15\n123 119\n129 120\n132 112\n126 109\n118 103\n115 109\n102 100\n130 120\n105 105\n132 115\n104 102\n107 107\n127 116\n121 104\n121 115\n8\n8 234\n9 244\n10 226\n11 227\n12 240\n13 237\n14 206\n15 227\n\nSample Output 2\n\n256\n255\n250\n247\n255\n259\n223\n253", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2274, "cpu_time_ms": 2817, "memory_kb": 562776}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s325205250", "group_id": "codeNet:p02648", "input_text": "local bls, brs = bit.lshift, bit.rshift\nlocal mmi, mma = math.min, math.max\nlocal n = io.read(\"*n\")\nlocal v, w = {}, {}\nfor i = 1, n do\n v[i], w[i] = io.read(\"*n\", \"*n\")\nend\nlocal head_tbl = {}\nlocal box = {}\nlocal ten5 = 100000\nfor i = 256, mmi(n, 1023) do\n head_tbl[i - 255] = {}\n local tbl = head_tbl[i - 255]\n for j = 1, ten5 do\n tbl[j] = 0\n end\n local jlim = i < 512 and 511 or 1023\n -- local klim = i < 512 and 9 or 10\n local klim, mul = 1, 2\n for j = 1, jlim do\n if j == mul then\n klim, mul = klim + 1, mul * 2\n end\n local tmpi, tmpj = i, j\n local weight, val = 0, 0\n for k = 1, klim do\n if tmpj % 2 == 1 then\n val = val + v[tmpi]\n weight = weight + w[tmpi]\n end\n tmpi = brs(tmpi, 1)\n tmpj = brs(tmpj, 1)\n end\n if weight <= ten5 then\n tbl[weight] = mma(tbl[weight], val)\n end\n end\n for i = 2, ten5 do\n tbl[i] = mma(tbl[i], tbl[i - 1])\n end\nend\nlocal function debug(...)\n -- print(...)\nend\nlocal function output(z)\n print(z)\nend\n\ndebug(os.clock(), collectgarbage(\"count\"))\nlocal q = io.read(\"*n\")\nfor iq = 1, q do\n if iq % 1000 == 0 then\n debug(iq, os.clock())\n end\n local pos, wlim = io.read(\"*n\", \"*n\")\n local deg = 0\n do\n local tmp = pos\n while 0 < tmp do\n deg, tmp = deg + 1, brs(tmp, 1)\n end\n end\n if pos < 256 then\n local ans = 0\n local tot = bls(1, deg)\n for j = 0, tot - 1 do\n local tmpi, tmpj = pos, j\n local val, weight = 0, 0\n for k = 1, deg do\n if tmpj % 2 == 1 then\n val, weight = val + v[tmpi], weight + w[tmpi]\n end\n tmpi, tmpj = brs(tmpi, 1), brs(tmpj, 1)\n end\n if weight <= wlim then\n ans = mma(ans, val)\n end\n end\n output(ans)\n elseif pos < 1024 then\n output(head_tbl[pos - 255][wlim])\n else\n deg = deg - 10\n local basepos = pos\n for i = 1, deg do\n basepos = brs(basepos, 1)\n end\n local tbl = head_tbl[basepos - 255]\n local ans = tbl[wlim]\n local tot = bls(1, deg)\n local deglim, mul = 1, 2\n for j = 1, tot - 1 do\n local tmpi, tmpj = pos, j\n local val, weight = 0, 0\n if j == mul then\n deglim, mul = deglim + 1, mul * 2\n end\n for k = 1, deglim do\n if tmpj % 2 == 1 then\n val, weight = val + v[tmpi], weight + w[tmpi]\n end\n tmpi, tmpj = brs(tmpi, 1), brs(tmpj, 1)\n end\n if weight == wlim then\n ans = mma(ans, val)\n elseif weight < wlim then\n ans = mma(ans, val + tbl[wlim - weight])\n end\n end\n output(ans)\n end\nend\ndebug(os.clock())\n", "language": "Lua", "metadata": {"date": 1593746042, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02648.html", "problem_id": "p02648", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02648/input.txt", "sample_output_relpath": "derived/input_output/data/p02648/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02648/Lua/s325205250.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s325205250", "user_id": "u120582723"}, "prompt_components": {"gold_output": "0\n3\n3\n", "input_to_evaluate": "local bls, brs = bit.lshift, bit.rshift\nlocal mmi, mma = math.min, math.max\nlocal n = io.read(\"*n\")\nlocal v, w = {}, {}\nfor i = 1, n do\n v[i], w[i] = io.read(\"*n\", \"*n\")\nend\nlocal head_tbl = {}\nlocal box = {}\nlocal ten5 = 100000\nfor i = 256, mmi(n, 1023) do\n head_tbl[i - 255] = {}\n local tbl = head_tbl[i - 255]\n for j = 1, ten5 do\n tbl[j] = 0\n end\n local jlim = i < 512 and 511 or 1023\n -- local klim = i < 512 and 9 or 10\n local klim, mul = 1, 2\n for j = 1, jlim do\n if j == mul then\n klim, mul = klim + 1, mul * 2\n end\n local tmpi, tmpj = i, j\n local weight, val = 0, 0\n for k = 1, klim do\n if tmpj % 2 == 1 then\n val = val + v[tmpi]\n weight = weight + w[tmpi]\n end\n tmpi = brs(tmpi, 1)\n tmpj = brs(tmpj, 1)\n end\n if weight <= ten5 then\n tbl[weight] = mma(tbl[weight], val)\n end\n end\n for i = 2, ten5 do\n tbl[i] = mma(tbl[i], tbl[i - 1])\n end\nend\nlocal function debug(...)\n -- print(...)\nend\nlocal function output(z)\n print(z)\nend\n\ndebug(os.clock(), collectgarbage(\"count\"))\nlocal q = io.read(\"*n\")\nfor iq = 1, q do\n if iq % 1000 == 0 then\n debug(iq, os.clock())\n end\n local pos, wlim = io.read(\"*n\", \"*n\")\n local deg = 0\n do\n local tmp = pos\n while 0 < tmp do\n deg, tmp = deg + 1, brs(tmp, 1)\n end\n end\n if pos < 256 then\n local ans = 0\n local tot = bls(1, deg)\n for j = 0, tot - 1 do\n local tmpi, tmpj = pos, j\n local val, weight = 0, 0\n for k = 1, deg do\n if tmpj % 2 == 1 then\n val, weight = val + v[tmpi], weight + w[tmpi]\n end\n tmpi, tmpj = brs(tmpi, 1), brs(tmpj, 1)\n end\n if weight <= wlim then\n ans = mma(ans, val)\n end\n end\n output(ans)\n elseif pos < 1024 then\n output(head_tbl[pos - 255][wlim])\n else\n deg = deg - 10\n local basepos = pos\n for i = 1, deg do\n basepos = brs(basepos, 1)\n end\n local tbl = head_tbl[basepos - 255]\n local ans = tbl[wlim]\n local tot = bls(1, deg)\n local deglim, mul = 1, 2\n for j = 1, tot - 1 do\n local tmpi, tmpj = pos, j\n local val, weight = 0, 0\n if j == mul then\n deglim, mul = deglim + 1, mul * 2\n end\n for k = 1, deglim do\n if tmpj % 2 == 1 then\n val, weight = val + v[tmpi], weight + w[tmpi]\n end\n tmpi, tmpj = brs(tmpi, 1), brs(tmpj, 1)\n end\n if weight == wlim then\n ans = mma(ans, val)\n elseif weight < wlim then\n ans = mma(ans, val + tbl[wlim - weight])\n end\n end\n output(ans)\n end\nend\ndebug(os.clock())\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nWe have a rooted binary tree with N vertices, where the vertices are numbered 1 to N.\nVertex 1 is the root, and the parent of Vertex i (i \\geq 2) is Vertex \\left[ \\frac{i}{2} \\right].\n\nEach vertex has one item in it. The item in Vertex i has a value of V_i and a weight of W_i.\nNow, process the following query Q times:\n\nGiven are a vertex v of the tree and a positive integer L.\nLet us choose some (possibly none) of the items in v and the ancestors of v so that their total weight is at most L.\nFind the maximum possible total value of the chosen items.\n\nHere, Vertex u is said to be an ancestor of Vertex v when u is an indirect parent of v, that is, there exists a sequence of vertices w_1,w_2,\\ldots,w_k (k\\geq 2) where w_1=v, w_k=u, and w_{i+1} is the parent of w_i for each i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N < 2^{18}\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq V_i \\leq 10^5\n\n1 \\leq W_i \\leq 10^5\n\nFor the values v and L given in each query, 1 \\leq v \\leq N and 1 \\leq L \\leq 10^5.\n\nInput\n\nLet v_i and L_i be the values v and L given in the i-th query.\nThen, Input is given from Standard Input in the following format:\n\nN\nV_1 W_1\n:\nV_N W_N\nQ\nv_1 L_1\n:\nv_Q L_Q\n\nOutput\n\nFor each integer i from 1 through Q,\nthe i-th line should contain the response to the i-th query.\n\nSample Input 1\n\n3\n1 2\n2 3\n3 4\n3\n1 1\n2 5\n3 5\n\nSample Output 1\n\n0\n3\n3\n\nIn the first query, we are given only one choice: the item with (V, W)=(1,2). Since L = 1, we cannot actually choose it, so our response should be 0.\n\nIn the second query, we are given two choices: the items with (V, W)=(1,2) and (V, W)=(2,3). Since L = 5, we can choose both of them, so our response should be 3.\n\nSample Input 2\n\n15\n123 119\n129 120\n132 112\n126 109\n118 103\n115 109\n102 100\n130 120\n105 105\n132 115\n104 102\n107 107\n127 116\n121 104\n121 115\n8\n8 234\n9 244\n10 226\n11 227\n12 240\n13 237\n14 206\n15 227\n\nSample Output 2\n\n256\n255\n250\n247\n255\n259\n223\n253", "sample_input": "3\n1 2\n2 3\n3 4\n3\n1 1\n2 5\n3 5\n"}, "reference_outputs": ["0\n3\n3\n"], "source_document_id": "p02648", "source_text": "Score : 700 points\n\nProblem Statement\n\nWe have a rooted binary tree with N vertices, where the vertices are numbered 1 to N.\nVertex 1 is the root, and the parent of Vertex i (i \\geq 2) is Vertex \\left[ \\frac{i}{2} \\right].\n\nEach vertex has one item in it. The item in Vertex i has a value of V_i and a weight of W_i.\nNow, process the following query Q times:\n\nGiven are a vertex v of the tree and a positive integer L.\nLet us choose some (possibly none) of the items in v and the ancestors of v so that their total weight is at most L.\nFind the maximum possible total value of the chosen items.\n\nHere, Vertex u is said to be an ancestor of Vertex v when u is an indirect parent of v, that is, there exists a sequence of vertices w_1,w_2,\\ldots,w_k (k\\geq 2) where w_1=v, w_k=u, and w_{i+1} is the parent of w_i for each i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N < 2^{18}\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq V_i \\leq 10^5\n\n1 \\leq W_i \\leq 10^5\n\nFor the values v and L given in each query, 1 \\leq v \\leq N and 1 \\leq L \\leq 10^5.\n\nInput\n\nLet v_i and L_i be the values v and L given in the i-th query.\nThen, Input is given from Standard Input in the following format:\n\nN\nV_1 W_1\n:\nV_N W_N\nQ\nv_1 L_1\n:\nv_Q L_Q\n\nOutput\n\nFor each integer i from 1 through Q,\nthe i-th line should contain the response to the i-th query.\n\nSample Input 1\n\n3\n1 2\n2 3\n3 4\n3\n1 1\n2 5\n3 5\n\nSample Output 1\n\n0\n3\n3\n\nIn the first query, we are given only one choice: the item with (V, W)=(1,2). Since L = 1, we cannot actually choose it, so our response should be 0.\n\nIn the second query, we are given two choices: the items with (V, W)=(1,2) and (V, W)=(2,3). Since L = 5, we can choose both of them, so our response should be 3.\n\nSample Input 2\n\n15\n123 119\n129 120\n132 112\n126 109\n118 103\n115 109\n102 100\n130 120\n105 105\n132 115\n104 102\n107 107\n127 116\n121 104\n121 115\n8\n8 234\n9 244\n10 226\n11 227\n12 240\n13 237\n14 206\n15 227\n\nSample Output 2\n\n256\n255\n250\n247\n255\n259\n223\n253", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2590, "cpu_time_ms": 3337, "memory_kb": 796520}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s397857837", "group_id": "codeNet:p02648", "input_text": "local bls, brs = bit.lshift, bit.rshift\nlocal mmi, mma = math.min, math.max\nlocal n = io.read(\"*n\")\nlocal v, w = {}, {}\nfor i = 1, n do\n v[i], w[i] = io.read(\"*n\", \"*n\")\nend\nlocal head_tbl = {}\nlocal box = {}\nlocal ten5 = 100000\nfor i = 256, mmi(n, 1023) do\n head_tbl[i - 255] = {}\n local tbl = head_tbl[i - 255]\n for j = 1, ten5 do\n tbl[j] = 0\n end\n local jlim = i < 512 and 511 or 1023\n local klim = i < 512 and 9 or 10\n for j = 1, jlim do\n local tmpi, tmpj = i, j\n local weight, val = 0, 0\n for k = 1, klim do\n if tmpj % 2 == 1 then\n val = val + v[tmpi]\n weight = weight + w[tmpi]\n end\n tmpi = brs(tmpi, 1)\n tmpj = brs(tmpj, 1)\n end\n if weight <= ten5 then\n tbl[weight] = mma(tbl[weight], val)\n end\n end\n for i = 2, ten5 do\n tbl[i] = mma(tbl[i], tbl[i - 1])\n end\nend\nlocal function debug(...)\n -- print(...)\nend\nlocal function output(z)\n print(z)\nend\n\ndebug(os.clock(), collectgarbage(\"count\"))\nlocal q = io.read(\"*n\")\nfor iq = 1, q do\n if iq % 1000 == 0 then\n debug(iq, os.clock())\n end\n local pos, wlim = io.read(\"*n\", \"*n\")\n local deg = 0\n do\n local tmp = pos\n while 0 < tmp do\n deg, tmp = deg + 1, brs(tmp, 1)\n end\n end\n if pos < 256 then\n local ans = 0\n local tot = bls(1, deg)\n for j = 0, tot - 1 do\n local tmpi, tmpj = pos, j\n local val, weight = 0, 0\n for k = 1, deg do\n if tmpj % 2 == 1 then\n val, weight = val + v[tmpi], weight + w[tmpi]\n end\n tmpi, tmpj = brs(tmpi, 1), brs(tmpj, 1)\n end\n if weight <= wlim then\n ans = mma(ans, val)\n end\n end\n output(ans)\n elseif pos < 1024 then\n output(head_tbl[pos - 255][wlim])\n else\n deg = deg - 10\n local basepos = pos\n for i = 1, deg do\n basepos = brs(basepos, 1)\n end\n local tbl = head_tbl[basepos - 255]\n local ans = tbl[wlim]\n local tot = bls(1, deg)\n for j = 1, tot - 1 do\n local tmpi, tmpj = pos, j\n local val, weight = 0, 0\n for k = 1, deg do\n if tmpj % 2 == 1 then\n val, weight = val + v[tmpi], weight + w[tmpi]\n end\n tmpi, tmpj = brs(tmpi, 1), brs(tmpj, 1)\n end\n if weight <= wlim then\n ans = mma(ans, val)\n end\n if weight < wlim then\n ans = mma(ans, val + tbl[wlim - weight])\n end\n end\n output(ans)\n end\nend\ndebug(os.clock())\n", "language": "Lua", "metadata": {"date": 1593703457, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02648.html", "problem_id": "p02648", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02648/input.txt", "sample_output_relpath": "derived/input_output/data/p02648/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02648/Lua/s397857837.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s397857837", "user_id": "u120582723"}, "prompt_components": {"gold_output": "0\n3\n3\n", "input_to_evaluate": "local bls, brs = bit.lshift, bit.rshift\nlocal mmi, mma = math.min, math.max\nlocal n = io.read(\"*n\")\nlocal v, w = {}, {}\nfor i = 1, n do\n v[i], w[i] = io.read(\"*n\", \"*n\")\nend\nlocal head_tbl = {}\nlocal box = {}\nlocal ten5 = 100000\nfor i = 256, mmi(n, 1023) do\n head_tbl[i - 255] = {}\n local tbl = head_tbl[i - 255]\n for j = 1, ten5 do\n tbl[j] = 0\n end\n local jlim = i < 512 and 511 or 1023\n local klim = i < 512 and 9 or 10\n for j = 1, jlim do\n local tmpi, tmpj = i, j\n local weight, val = 0, 0\n for k = 1, klim do\n if tmpj % 2 == 1 then\n val = val + v[tmpi]\n weight = weight + w[tmpi]\n end\n tmpi = brs(tmpi, 1)\n tmpj = brs(tmpj, 1)\n end\n if weight <= ten5 then\n tbl[weight] = mma(tbl[weight], val)\n end\n end\n for i = 2, ten5 do\n tbl[i] = mma(tbl[i], tbl[i - 1])\n end\nend\nlocal function debug(...)\n -- print(...)\nend\nlocal function output(z)\n print(z)\nend\n\ndebug(os.clock(), collectgarbage(\"count\"))\nlocal q = io.read(\"*n\")\nfor iq = 1, q do\n if iq % 1000 == 0 then\n debug(iq, os.clock())\n end\n local pos, wlim = io.read(\"*n\", \"*n\")\n local deg = 0\n do\n local tmp = pos\n while 0 < tmp do\n deg, tmp = deg + 1, brs(tmp, 1)\n end\n end\n if pos < 256 then\n local ans = 0\n local tot = bls(1, deg)\n for j = 0, tot - 1 do\n local tmpi, tmpj = pos, j\n local val, weight = 0, 0\n for k = 1, deg do\n if tmpj % 2 == 1 then\n val, weight = val + v[tmpi], weight + w[tmpi]\n end\n tmpi, tmpj = brs(tmpi, 1), brs(tmpj, 1)\n end\n if weight <= wlim then\n ans = mma(ans, val)\n end\n end\n output(ans)\n elseif pos < 1024 then\n output(head_tbl[pos - 255][wlim])\n else\n deg = deg - 10\n local basepos = pos\n for i = 1, deg do\n basepos = brs(basepos, 1)\n end\n local tbl = head_tbl[basepos - 255]\n local ans = tbl[wlim]\n local tot = bls(1, deg)\n for j = 1, tot - 1 do\n local tmpi, tmpj = pos, j\n local val, weight = 0, 0\n for k = 1, deg do\n if tmpj % 2 == 1 then\n val, weight = val + v[tmpi], weight + w[tmpi]\n end\n tmpi, tmpj = brs(tmpi, 1), brs(tmpj, 1)\n end\n if weight <= wlim then\n ans = mma(ans, val)\n end\n if weight < wlim then\n ans = mma(ans, val + tbl[wlim - weight])\n end\n end\n output(ans)\n end\nend\ndebug(os.clock())\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nWe have a rooted binary tree with N vertices, where the vertices are numbered 1 to N.\nVertex 1 is the root, and the parent of Vertex i (i \\geq 2) is Vertex \\left[ \\frac{i}{2} \\right].\n\nEach vertex has one item in it. The item in Vertex i has a value of V_i and a weight of W_i.\nNow, process the following query Q times:\n\nGiven are a vertex v of the tree and a positive integer L.\nLet us choose some (possibly none) of the items in v and the ancestors of v so that their total weight is at most L.\nFind the maximum possible total value of the chosen items.\n\nHere, Vertex u is said to be an ancestor of Vertex v when u is an indirect parent of v, that is, there exists a sequence of vertices w_1,w_2,\\ldots,w_k (k\\geq 2) where w_1=v, w_k=u, and w_{i+1} is the parent of w_i for each i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N < 2^{18}\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq V_i \\leq 10^5\n\n1 \\leq W_i \\leq 10^5\n\nFor the values v and L given in each query, 1 \\leq v \\leq N and 1 \\leq L \\leq 10^5.\n\nInput\n\nLet v_i and L_i be the values v and L given in the i-th query.\nThen, Input is given from Standard Input in the following format:\n\nN\nV_1 W_1\n:\nV_N W_N\nQ\nv_1 L_1\n:\nv_Q L_Q\n\nOutput\n\nFor each integer i from 1 through Q,\nthe i-th line should contain the response to the i-th query.\n\nSample Input 1\n\n3\n1 2\n2 3\n3 4\n3\n1 1\n2 5\n3 5\n\nSample Output 1\n\n0\n3\n3\n\nIn the first query, we are given only one choice: the item with (V, W)=(1,2). Since L = 1, we cannot actually choose it, so our response should be 0.\n\nIn the second query, we are given two choices: the items with (V, W)=(1,2) and (V, W)=(2,3). Since L = 5, we can choose both of them, so our response should be 3.\n\nSample Input 2\n\n15\n123 119\n129 120\n132 112\n126 109\n118 103\n115 109\n102 100\n130 120\n105 105\n132 115\n104 102\n107 107\n127 116\n121 104\n121 115\n8\n8 234\n9 244\n10 226\n11 227\n12 240\n13 237\n14 206\n15 227\n\nSample Output 2\n\n256\n255\n250\n247\n255\n259\n223\n253", "sample_input": "3\n1 2\n2 3\n3 4\n3\n1 1\n2 5\n3 5\n"}, "reference_outputs": ["0\n3\n3\n"], "source_document_id": "p02648", "source_text": "Score : 700 points\n\nProblem Statement\n\nWe have a rooted binary tree with N vertices, where the vertices are numbered 1 to N.\nVertex 1 is the root, and the parent of Vertex i (i \\geq 2) is Vertex \\left[ \\frac{i}{2} \\right].\n\nEach vertex has one item in it. The item in Vertex i has a value of V_i and a weight of W_i.\nNow, process the following query Q times:\n\nGiven are a vertex v of the tree and a positive integer L.\nLet us choose some (possibly none) of the items in v and the ancestors of v so that their total weight is at most L.\nFind the maximum possible total value of the chosen items.\n\nHere, Vertex u is said to be an ancestor of Vertex v when u is an indirect parent of v, that is, there exists a sequence of vertices w_1,w_2,\\ldots,w_k (k\\geq 2) where w_1=v, w_k=u, and w_{i+1} is the parent of w_i for each i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N < 2^{18}\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq V_i \\leq 10^5\n\n1 \\leq W_i \\leq 10^5\n\nFor the values v and L given in each query, 1 \\leq v \\leq N and 1 \\leq L \\leq 10^5.\n\nInput\n\nLet v_i and L_i be the values v and L given in the i-th query.\nThen, Input is given from Standard Input in the following format:\n\nN\nV_1 W_1\n:\nV_N W_N\nQ\nv_1 L_1\n:\nv_Q L_Q\n\nOutput\n\nFor each integer i from 1 through Q,\nthe i-th line should contain the response to the i-th query.\n\nSample Input 1\n\n3\n1 2\n2 3\n3 4\n3\n1 1\n2 5\n3 5\n\nSample Output 1\n\n0\n3\n3\n\nIn the first query, we are given only one choice: the item with (V, W)=(1,2). Since L = 1, we cannot actually choose it, so our response should be 0.\n\nIn the second query, we are given two choices: the items with (V, W)=(1,2) and (V, W)=(2,3). Since L = 5, we can choose both of them, so our response should be 3.\n\nSample Input 2\n\n15\n123 119\n129 120\n132 112\n126 109\n118 103\n115 109\n102 100\n130 120\n105 105\n132 115\n104 102\n107 107\n127 116\n121 104\n121 115\n8\n8 234\n9 244\n10 226\n11 227\n12 240\n13 237\n14 206\n15 227\n\nSample Output 2\n\n256\n255\n250\n247\n255\n259\n223\n253", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2396, "cpu_time_ms": 3334, "memory_kb": 796900}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s194688491", "group_id": "codeNet:p02657", "input_text": "a, b = io.read(\"*n\", \"*n\")\nprint(a * b)", "language": "Lua", "metadata": {"date": 1590973223, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s194688491.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s194688491", "user_id": "u120582723"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "a, b = io.read(\"*n\", \"*n\")\nprint(a * b)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 39, "cpu_time_ms": 3, "memory_kb": 2788}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s185078688", "group_id": "codeNet:p02660", "input_text": "local mce, mfl, msq, mmi, mma, mab = math.ceil, math.floor, math.sqrt, math.min, math.max, math.abs\n\nlocal function getprimes(x)\n local primes = {}\n local allnums = {}\n for i = 1, x do allnums[i] = true end\n for i = 2, x do\n if allnums[i] then\n table.insert(primes, i)\n local lim = x // i\n for j = 2, lim do\n allnums[j * i] = false\n end\n end\n end\n return primes\nend\n\nlocal function getdivisorparts(x, primes)\n local prime_num = #primes\n local tmp = {}\n local lim = mce(msq(x))\n local primepos = 1\n local dv = primes[primepos]\n while primepos <= prime_num and dv <= lim do\n if x % dv == 0 then\n local t = {}\n t.p = dv\n t.cnt = 1\n x = x // dv\n while x % dv == 0 do\n x = x // dv\n t.cnt = t.cnt + 1\n end\n table.insert(tmp, t)\n lim = mce(msq(x))\n end\n if primepos == prime_num then break end\n primepos = primepos + 1\n dv = primes[primepos]\n end\n if x ~= 1 then\n local t = {}\n t.p, t.cnt = x, 1\n table.insert(tmp, t)\n end\n return tmp\nend\nlocal n = io.read(\"*n\")\nlocal primes = getprimes(mce(msq(n)))\nlocal dvp = getdivisorparts(n, primes)\nlocal ret = 0\nfor i = 1, #dvp do\n local cnt = dvp[i].cnt\n local cur = 1\n while cur <= cnt do\n ret = ret + 1\n cnt = cnt - cur\n cur = cur + 1\n end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1590973849, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s185078688.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s185078688", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local mce, mfl, msq, mmi, mma, mab = math.ceil, math.floor, math.sqrt, math.min, math.max, math.abs\n\nlocal function getprimes(x)\n local primes = {}\n local allnums = {}\n for i = 1, x do allnums[i] = true end\n for i = 2, x do\n if allnums[i] then\n table.insert(primes, i)\n local lim = x // i\n for j = 2, lim do\n allnums[j * i] = false\n end\n end\n end\n return primes\nend\n\nlocal function getdivisorparts(x, primes)\n local prime_num = #primes\n local tmp = {}\n local lim = mce(msq(x))\n local primepos = 1\n local dv = primes[primepos]\n while primepos <= prime_num and dv <= lim do\n if x % dv == 0 then\n local t = {}\n t.p = dv\n t.cnt = 1\n x = x // dv\n while x % dv == 0 do\n x = x // dv\n t.cnt = t.cnt + 1\n end\n table.insert(tmp, t)\n lim = mce(msq(x))\n end\n if primepos == prime_num then break end\n primepos = primepos + 1\n dv = primes[primepos]\n end\n if x ~= 1 then\n local t = {}\n t.p, t.cnt = x, 1\n table.insert(tmp, t)\n end\n return tmp\nend\nlocal n = io.read(\"*n\")\nlocal primes = getprimes(mce(msq(n)))\nlocal dvp = getdivisorparts(n, primes)\nlocal ret = 0\nfor i = 1, #dvp do\n local cnt = dvp[i].cnt\n local cur = 1\n while cur <= cnt do\n ret = ret + 1\n cnt = cnt - cur\n cur = cur + 1\n end\nend\nprint(ret)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1333, "cpu_time_ms": 151, "memory_kb": 20708}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s148465273", "group_id": "codeNet:p02661", "input_text": "local mfl, mce = math.floor, math.ceil\nlocal n = io.read(\"*n\")\nlocal a, b = {}, {}\nfor i = 1, n do\n a[i], b[i] = io.read(\"*n\", \"*n\")\nend\n\nlocal function solvelow(x)\n local c = 0\n for i = 1, n do\n if a[i] <= x then\n c = c + 1\n end\n end\n return n + 1 <= c * 2\nend\n\nlocal function solvehigh(x)\n local c = 0\n for i = 1, n do\n if x <= b[i] then\n c = c + 1\n end\n end\n return n + 1 <= c * 2\nend\n\nlocal function solvelow_even(x)\n local c = 0\n local lowmax, highmin = -1, 1000000007\n for i = 1, n do\n if a[i] <= x then\n c = c + 1\n if lowmax < a[i] then\n lowmax = a[i]\n end\n else\n if a[i] < highmin then\n highmin = a[i]\n end\n end\n end\n if n < c * 2 then return true\n elseif n == c * 2 then\n local diff = x - lowmax\n return highmin - x <= diff\n else\n return false\n end\nend\n\nlocal function solvehigh_even(x)\n local c = 0\n local lowmax, highmin = -1, 1000000007\n for i = 1, n do\n if x <= b[i] then\n c = c + 1\n if b[i] < highmin then\n highmin = b[i]\n end\n else\n if lowmax < b[i] then\n lowmax = b[i]\n end\n end\n end\n if n < c * 2 then return true\n elseif n == c * 2 then\n local diff = highmin - x\n return x - lowmax <= diff\n else\n return false\n end\nend\nlocal function solvehigh(x)\n local c = 0\n for i = 1, n do\n if x <= b[i] then\n c = c + 1\n end\n end\n return n + 1 <= c * 2\nend\n\nif n % 2 == 1 then\n local min, max = 0, 1000000000\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if solvelow(mid) then\n max = mid\n else\n min = mid\n end\n end\n local lowlim = max\n min, max = 1, 1000000001\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if solvehigh(mid) then\n min = mid\n else\n max = mid\n end\n end\n local highlim = min\n print(highlim - lowlim + 1)\nelse\n for i = 1, n do\n a[i], b[i] = a[i] * 2, b[i] * 2\n end\n local min, max = 0, 2000000000\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if solvelow_even(mid) then\n max = mid\n else\n min = mid\n end\n end\n local lowlim = max\n min, max = 1, 2000000001\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if solvehigh_even(mid) then\n min = mid\n else\n max = mid\n end\n end\n local highlim = min\n print(highlim - lowlim + 1)\nend\n", "language": "Lua", "metadata": {"date": 1590975604, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02661.html", "problem_id": "p02661", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02661/input.txt", "sample_output_relpath": "derived/input_output/data/p02661/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02661/Lua/s148465273.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s148465273", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local mfl, mce = math.floor, math.ceil\nlocal n = io.read(\"*n\")\nlocal a, b = {}, {}\nfor i = 1, n do\n a[i], b[i] = io.read(\"*n\", \"*n\")\nend\n\nlocal function solvelow(x)\n local c = 0\n for i = 1, n do\n if a[i] <= x then\n c = c + 1\n end\n end\n return n + 1 <= c * 2\nend\n\nlocal function solvehigh(x)\n local c = 0\n for i = 1, n do\n if x <= b[i] then\n c = c + 1\n end\n end\n return n + 1 <= c * 2\nend\n\nlocal function solvelow_even(x)\n local c = 0\n local lowmax, highmin = -1, 1000000007\n for i = 1, n do\n if a[i] <= x then\n c = c + 1\n if lowmax < a[i] then\n lowmax = a[i]\n end\n else\n if a[i] < highmin then\n highmin = a[i]\n end\n end\n end\n if n < c * 2 then return true\n elseif n == c * 2 then\n local diff = x - lowmax\n return highmin - x <= diff\n else\n return false\n end\nend\n\nlocal function solvehigh_even(x)\n local c = 0\n local lowmax, highmin = -1, 1000000007\n for i = 1, n do\n if x <= b[i] then\n c = c + 1\n if b[i] < highmin then\n highmin = b[i]\n end\n else\n if lowmax < b[i] then\n lowmax = b[i]\n end\n end\n end\n if n < c * 2 then return true\n elseif n == c * 2 then\n local diff = highmin - x\n return x - lowmax <= diff\n else\n return false\n end\nend\nlocal function solvehigh(x)\n local c = 0\n for i = 1, n do\n if x <= b[i] then\n c = c + 1\n end\n end\n return n + 1 <= c * 2\nend\n\nif n % 2 == 1 then\n local min, max = 0, 1000000000\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if solvelow(mid) then\n max = mid\n else\n min = mid\n end\n end\n local lowlim = max\n min, max = 1, 1000000001\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if solvehigh(mid) then\n min = mid\n else\n max = mid\n end\n end\n local highlim = min\n print(highlim - lowlim + 1)\nelse\n for i = 1, n do\n a[i], b[i] = a[i] * 2, b[i] * 2\n end\n local min, max = 0, 2000000000\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if solvelow_even(mid) then\n max = mid\n else\n min = mid\n end\n end\n local lowlim = max\n min, max = 1, 2000000001\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if solvehigh_even(mid) then\n min = mid\n else\n max = mid\n end\n end\n local highlim = min\n print(highlim - lowlim + 1)\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N integers X_1, X_2, \\cdots, X_N, and we know that A_i \\leq X_i \\leq B_i.\nFind the number of different values that the median of X_1, X_2, \\cdots, X_N can take.\n\nNotes\n\nThe median of X_1, X_2, \\cdots, X_N is defined as follows. Let x_1, x_2, \\cdots, x_N be the result of sorting X_1, X_2, \\cdots, X_N in ascending order.\n\nIf N is odd, the median is x_{(N+1)/2};\n\nif N is even, the median is (x_{N/2} + x_{N/2+1}) / 2.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\nA_2 B_2\n:\nA_N B_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2\n1 2\n2 3\n\nSample Output 1\n\n3\n\nIf X_1 = 1 and X_2 = 2, the median is \\frac{3}{2};\n\nif X_1 = 1 and X_2 = 3, the median is 2;\n\nif X_1 = 2 and X_2 = 2, the median is 2;\n\nif X_1 = 2 and X_2 = 3, the median is \\frac{5}{2}.\n\nThus, the median can take three values: \\frac{3}{2}, 2, and \\frac{5}{2}.\n\nSample Input 2\n\n3\n100 100\n10 10000\n1 1000000000\n\nSample Output 2\n\n9991", "sample_input": "2\n1 2\n2 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02661", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N integers X_1, X_2, \\cdots, X_N, and we know that A_i \\leq X_i \\leq B_i.\nFind the number of different values that the median of X_1, X_2, \\cdots, X_N can take.\n\nNotes\n\nThe median of X_1, X_2, \\cdots, X_N is defined as follows. Let x_1, x_2, \\cdots, x_N be the result of sorting X_1, X_2, \\cdots, X_N in ascending order.\n\nIf N is odd, the median is x_{(N+1)/2};\n\nif N is even, the median is (x_{N/2} + x_{N/2+1}) / 2.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\nA_2 B_2\n:\nA_N B_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2\n1 2\n2 3\n\nSample Output 1\n\n3\n\nIf X_1 = 1 and X_2 = 2, the median is \\frac{3}{2};\n\nif X_1 = 1 and X_2 = 3, the median is 2;\n\nif X_1 = 2 and X_2 = 2, the median is 2;\n\nif X_1 = 2 and X_2 = 3, the median is \\frac{5}{2}.\n\nThus, the median can take three values: \\frac{3}{2}, 2, and \\frac{5}{2}.\n\nSample Input 2\n\n3\n100 100\n10 10000\n1 1000000000\n\nSample Output 2\n\n9991", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2377, "cpu_time_ms": 187, "memory_kb": 6968}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s170147453", "group_id": "codeNet:p02665", "input_text": "local n = io.read(\"*n\")\nlocal t = {}\nlocal imos = {}\nfor i = 1, n + 1 do\n t[i] = io.read(\"*n\")\n imos[i] = 0\nend\nimos[n + 2] = 0\nlocal rem = 1\nlocal score = 0\nlocal stage = 0\nfor i = 1, n + 1 do\n local v = t[i]\n while rem < v and stage < i do\n score = score + rem * (i - stage)\n imos[stage + 1] = imos[stage + 1] + rem\n imos[i] = imos[i] - rem\n stage = stage + 1\n v = v - rem\n rem = imos[stage]\n imos[stage + 1] = imos[stage + 1] + imos[stage]\n end\n if i <= stage then\n score = -1\n break\n end\n score = score + v * (i - stage)\n rem = rem - v\n imos[stage + 1] = imos[stage + 1] + v\n imos[i] = imos[i] - v\nend\nprint(score)\n", "language": "Lua", "metadata": {"date": 1591244077, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02665.html", "problem_id": "p02665", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02665/input.txt", "sample_output_relpath": "derived/input_output/data/p02665/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02665/Lua/s170147453.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s170147453", "user_id": "u120582723"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal t = {}\nlocal imos = {}\nfor i = 1, n + 1 do\n t[i] = io.read(\"*n\")\n imos[i] = 0\nend\nimos[n + 2] = 0\nlocal rem = 1\nlocal score = 0\nlocal stage = 0\nfor i = 1, n + 1 do\n local v = t[i]\n while rem < v and stage < i do\n score = score + rem * (i - stage)\n imos[stage + 1] = imos[stage + 1] + rem\n imos[i] = imos[i] - rem\n stage = stage + 1\n v = v - rem\n rem = imos[stage]\n imos[stage + 1] = imos[stage + 1] + imos[stage]\n end\n if i <= stage then\n score = -1\n break\n end\n score = score + v * (i - stage)\n rem = rem - v\n imos[stage + 1] = imos[stage + 1] + v\n imos[i] = imos[i] - v\nend\nprint(score)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven is an integer sequence of length N+1: A_0, A_1, A_2, \\ldots, A_N. Is there a binary tree of depth N such that, for each d = 0, 1, \\ldots, N, there are exactly A_d leaves at depth d? If such a tree exists, print the maximum possible number of vertices in such a tree; otherwise, print -1.\n\nNotes\n\nA binary tree is a rooted tree such that each vertex has at most two direct children.\n\nA leaf in a binary tree is a vertex with zero children.\n\nThe depth of a vertex v in a binary tree is the distance from the tree's root to v. (The root has the depth of 0.)\n\nThe depth of a binary tree is the maximum depth of a vertex in the tree.\n\nConstraints\n\n0 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{8} (0 \\leq i \\leq N)\n\nA_N \\geq 1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_0 A_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n3\n0 1 1 2\n\nSample Output 1\n\n7\n\nBelow is the tree with the maximum possible number of vertices. It has seven vertices, so we should print 7.\n\nSample Input 2\n\n4\n0 0 1 0 2\n\nSample Output 2\n\n10\n\nSample Input 3\n\n2\n0 3 1\n\nSample Output 3\n\n-1\n\nSample Input 4\n\n1\n1 1\n\nSample Output 4\n\n-1\n\nSample Input 5\n\n10\n0 0 1 1 2 3 5 8 13 21 34\n\nSample Output 5\n\n264", "sample_input": "3\n0 1 1 2\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02665", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven is an integer sequence of length N+1: A_0, A_1, A_2, \\ldots, A_N. Is there a binary tree of depth N such that, for each d = 0, 1, \\ldots, N, there are exactly A_d leaves at depth d? If such a tree exists, print the maximum possible number of vertices in such a tree; otherwise, print -1.\n\nNotes\n\nA binary tree is a rooted tree such that each vertex has at most two direct children.\n\nA leaf in a binary tree is a vertex with zero children.\n\nThe depth of a vertex v in a binary tree is the distance from the tree's root to v. (The root has the depth of 0.)\n\nThe depth of a binary tree is the maximum depth of a vertex in the tree.\n\nConstraints\n\n0 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{8} (0 \\leq i \\leq N)\n\nA_N \\geq 1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_0 A_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n3\n0 1 1 2\n\nSample Output 1\n\n7\n\nBelow is the tree with the maximum possible number of vertices. It has seven vertices, so we should print 7.\n\nSample Input 2\n\n4\n0 0 1 0 2\n\nSample Output 2\n\n10\n\nSample Input 3\n\n2\n0 3 1\n\nSample Output 3\n\n-1\n\nSample Input 4\n\n1\n1 1\n\nSample Output 4\n\n-1\n\nSample Input 5\n\n10\n0 0 1 1 2 3 5 8 13 21 34\n\nSample Output 5\n\n264", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 52, "memory_kb": 6404}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s949009279", "group_id": "codeNet:p02669", "input_text": "local mma = math.max\nlocal mfl, mce, mmi = math.floor, math.ceil, math.min\n\nlocal AvlTree = {}\nAvlTree.makenode = function(self, val, parent)\n local i = self.box[#self.box]\n if not i then i = #self.v + 1\n else table.remove(self.box)\n end\n self.v[i], self.p[i] = val, parent\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 1, 1\n return i\nend\nAvlTree.create = function(self, lessthan, n)\n self.lessthan = lessthan\n self.root = 1\n self.box = {}\n for i = n + 1, 2, -1 do table.insert(self.box, i) end\n -- value, leftCount, rightCount, left, right, parent\n self.v, self.lc, self.rc, self.l, self.r, self.p = {}, {}, {}, {}, {}, {}\n for i = 1, n + 1 do\n self.v[i], self.p[i] = 0, 1\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 1, 1\n end\nend\nAvlTree.clear = function(self)\n local n = #self.box\n self.root = 1\n self.box = {}\n for i = n + 1, 2, -1 do self.box[n + 2 - i] = i end\n self.v, self.lc, self.rc, self.l, self.r, self.p = {}, {}, {}, {}, {}, {}\n for i = 1, n + 1 do\n self.v[i], self.p[i] = 0, 1\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 1, 1\n end\nend\n\nAvlTree.recalc = function(self, i)\n local kl, kr = self.l[i], self.r[i]\n if 1 < kl then self.lc[i] = 1 + mma(self.lc[kl], self.rc[kl])\n else self.lc[i] = 0\n end\n if 1 < kr then self.rc[i] = 1 + mma(self.lc[kr], self.rc[kr])\n else self.rc[i] = 0\n end\nend\nAvlTree.recalcAll = function(self, i)\n while 1 < i do\n self:recalc(i)\n i = self.p[i]\n end\nend\n\nAvlTree.rotR = function(self, parent)\n local granp, child = self.p[parent], self.l[parent]\n self.r[child], self.l[parent] = parent, self.r[child]\n self.p[child], self.p[parent] = granp, child\n self.p[self.l[parent]] = parent\n if 1 < granp then\n if self.l[granp] == parent then\n self.l[granp] = child\n else\n self.r[granp] = child\n end\n else\n self.root = child\n end\nend\n\nAvlTree.rotL = function(self, parent)\n local granp, child = self.p[parent], self.r[parent]\n self.l[child], self.r[parent] = parent, self.l[child]\n self.p[child], self.p[parent] = granp, child\n self.p[self.r[parent]] = parent\n if 1 < granp then\n if self.r[granp] == parent then\n self.r[granp] = child\n else\n self.l[granp] = child\n end\n else\n self.root = child\n end\nend\n\nAvlTree.rotLR = function(self, lparent, rparent)\n local sp, sl, sr = self.p, self.l, self.r\n local granp, d = sp[rparent], sr[lparent]\n sp[lparent], sr[lparent] = d, sl[d]\n sp[rparent], sl[rparent] = d, sr[d]\n sp[sl[d]], sp[sr[d]] = lparent, rparent\n sp[d], sl[d], sr[d] = granp, lparent, rparent\n if 1 < granp then\n if sr[granp] == rparent then sr[granp] = d\n else sl[granp] = d\n end\n else self.root = d\n end\nend\n\nAvlTree.rotRL = function(self, rparent, lparent)\n local sp, sl, sr = self.p, self.l, self.r\n local granp, d = sp[lparent], sl[rparent]\n sp[rparent], sl[rparent] = d, sr[d]\n sp[lparent], sr[lparent] = d, sl[d]\n sp[sr[d]], sp[sl[d]] = rparent, lparent\n sp[d], sr[d], sl[d] = granp, rparent, lparent\n if 1 < granp then\n if sl[granp] == lparent then sl[granp] = d\n else sr[granp] = d\n end\n else self.root = d\n end\nend\n\nAvlTree.empty = function(self)\n return self.root <= 1\nend\n\nAvlTree.push = function(self, val)\n if self.root <= 1 then self.root = self:makenode(val, 1) return end\n local pos = self.root\n while true do\n if self.lessthan(val, self.v[pos]) then\n if 1 < self.l[pos] then\n pos = self.l[pos]\n else\n self.l[pos] = self:makenode(val, pos)\n pos = self.l[pos]\n break\n end\n else\n if 1 < self.r[pos] then\n pos = self.r[pos]\n else\n self.r[pos] = self:makenode(val, pos)\n pos = self.r[pos]\n break\n end\n end\n end\n while 1 < pos do\n local child, parent = pos, self.p[pos]\n if parent <= 1 then\n break\n end\n self:recalc(parent)\n local lcp_m_rcp = self.lc[parent] - self.rc[parent]\n if lcp_m_rcp % 2 ~= 0 then -- 1 or -1\n pos = parent\n elseif lcp_m_rcp == 2 then\n if self.lc[child] - 1 == self.rc[child] then\n self:rotR(parent)\n self:recalcAll(parent)\n else\n self:rotLR(child, parent)\n self:recalc(child)\n self:recalcAll(parent)\n end\n break\n elseif lcp_m_rcp == -2 then\n if self.rc[child] - 1 == self.lc[child] then\n self:rotL(parent)\n self:recalcAll(parent)\n else\n self:rotRL(child, parent)\n self:recalc(child)\n self:recalcAll(parent)\n end\n break\n else\n break\n end\n end\nend\n\nAvlTree.rmsub = function(self, node)\n while 1 < node do\n self:recalc(node)\n if self.lc[node] == self.rc[node] then\n node = self.p[node]\n elseif self.lc[node] + 1 == self.rc[node] then\n self:recalcAll(self.p[node])\n break\n else\n if self.lc[self.r[node]] == self.rc[self.r[node]] then\n self:rotL(node)\n self:recalcAll(node)\n break\n elseif self.lc[self.r[node]] + 1 == self.rc[self.r[node]] then\n local nr = self.r[node]\n self:rotL(node)\n self:recalc(node)\n node = nr\n else\n local nr = self.r[node]\n local nrl = self.l[nr]\n self:rotRL(nr, node)\n self:recalc(nr)\n self:recalc(node)\n node = nrl\n end\n end\n end\nend\n\nAvlTree.pop = function(self)\n local node = self.root\n while 1 < self.l[node] do\n node = self.l[node]\n end\n local v = self.v[node]\n local kp = self.p[node]\n self.p[self.r[node]] = kp\n if 1 < kp then\n self.l[kp] = self.r[node]\n self:rmsub(kp)\n else\n self.root = self.r[node]\n end\n table.insert(self.box, node)\n return v\nend\n\nAvlTree.new = function(lessthan, n)\n local obj = {}\n setmetatable(obj, {__index = AvlTree})\n obj:create(lessthan, n)\n return obj\nend\n\nlocal q = io.read(\"*n\")\nlocal len = {}\nlocal function lt(x, y)\n return len[x] < len[y]\nend\nlocal avl = AvlTree.new(lt, 1)\n\nlocal function pushfunc(dst, dstcost)\n if not len[dst] or dstcost < len[dst] then\n len[dst] = dstcost\n avl:push(dst)\n end\nend\n\nfor iq = 1, q do\n local n, a, b, c, d = io.read(\"*n\", \"*n\", \"*n\", \"*n\", \"*n\")\n local t = {}\n len = {}\n len[n] = 0\n avl:clear()\n avl:push(n)\n local inf = 1000000007 * 1000000007\n local cand = inf\n while not avl:empty() do\n local src = avl:pop()\n local cost = len[src]\n -- local zf = 1.0 * d * src\n if src <= 1000000000 then\n local z = cost + d * src\n if 0 < z then\n cand = mmi(cand, z)\n end\n end\n -- if 1 <= z then\n -- end\n if 1 < src then\n -- print(src, cost)\n local dst = src // 2\n local dstcost = cost + d * (src % 2) + a\n pushfunc(dst, dstcost)\n if dst % 2 ~= 0 then\n dst = dst + 1\n dstcost = cost + d * (2 - (src % 2)) + a\n pushfunc(dst, dstcost)\n end\n dst = src // 3\n dstcost = cost + d * (src % 3) + b\n pushfunc(dst, dstcost)\n if dst % 3 ~= 0 then\n dst = dst + 1\n dstcost = cost + d * (3 - (src % 3)) + b\n pushfunc(dst, dstcost)\n end\n dst = src // 5\n dstcost = cost + d * (src % 5) + c\n pushfunc(dst, dstcost)\n if dst % 5 ~= 0 then\n dst = dst + 1\n dstcost = cost + d * (5 - (src % 5)) + c\n pushfunc(dst, dstcost)\n end\n end\n end\n print(cand)\nend\n", "language": "Lua", "metadata": {"date": 1590284671, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02669.html", "problem_id": "p02669", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02669/input.txt", "sample_output_relpath": "derived/input_output/data/p02669/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02669/Lua/s949009279.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s949009279", "user_id": "u120582723"}, "prompt_components": {"gold_output": "20\n19\n26\n3821859835\n23441258666\n", "input_to_evaluate": "local mma = math.max\nlocal mfl, mce, mmi = math.floor, math.ceil, math.min\n\nlocal AvlTree = {}\nAvlTree.makenode = function(self, val, parent)\n local i = self.box[#self.box]\n if not i then i = #self.v + 1\n else table.remove(self.box)\n end\n self.v[i], self.p[i] = val, parent\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 1, 1\n return i\nend\nAvlTree.create = function(self, lessthan, n)\n self.lessthan = lessthan\n self.root = 1\n self.box = {}\n for i = n + 1, 2, -1 do table.insert(self.box, i) end\n -- value, leftCount, rightCount, left, right, parent\n self.v, self.lc, self.rc, self.l, self.r, self.p = {}, {}, {}, {}, {}, {}\n for i = 1, n + 1 do\n self.v[i], self.p[i] = 0, 1\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 1, 1\n end\nend\nAvlTree.clear = function(self)\n local n = #self.box\n self.root = 1\n self.box = {}\n for i = n + 1, 2, -1 do self.box[n + 2 - i] = i end\n self.v, self.lc, self.rc, self.l, self.r, self.p = {}, {}, {}, {}, {}, {}\n for i = 1, n + 1 do\n self.v[i], self.p[i] = 0, 1\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 1, 1\n end\nend\n\nAvlTree.recalc = function(self, i)\n local kl, kr = self.l[i], self.r[i]\n if 1 < kl then self.lc[i] = 1 + mma(self.lc[kl], self.rc[kl])\n else self.lc[i] = 0\n end\n if 1 < kr then self.rc[i] = 1 + mma(self.lc[kr], self.rc[kr])\n else self.rc[i] = 0\n end\nend\nAvlTree.recalcAll = function(self, i)\n while 1 < i do\n self:recalc(i)\n i = self.p[i]\n end\nend\n\nAvlTree.rotR = function(self, parent)\n local granp, child = self.p[parent], self.l[parent]\n self.r[child], self.l[parent] = parent, self.r[child]\n self.p[child], self.p[parent] = granp, child\n self.p[self.l[parent]] = parent\n if 1 < granp then\n if self.l[granp] == parent then\n self.l[granp] = child\n else\n self.r[granp] = child\n end\n else\n self.root = child\n end\nend\n\nAvlTree.rotL = function(self, parent)\n local granp, child = self.p[parent], self.r[parent]\n self.l[child], self.r[parent] = parent, self.l[child]\n self.p[child], self.p[parent] = granp, child\n self.p[self.r[parent]] = parent\n if 1 < granp then\n if self.r[granp] == parent then\n self.r[granp] = child\n else\n self.l[granp] = child\n end\n else\n self.root = child\n end\nend\n\nAvlTree.rotLR = function(self, lparent, rparent)\n local sp, sl, sr = self.p, self.l, self.r\n local granp, d = sp[rparent], sr[lparent]\n sp[lparent], sr[lparent] = d, sl[d]\n sp[rparent], sl[rparent] = d, sr[d]\n sp[sl[d]], sp[sr[d]] = lparent, rparent\n sp[d], sl[d], sr[d] = granp, lparent, rparent\n if 1 < granp then\n if sr[granp] == rparent then sr[granp] = d\n else sl[granp] = d\n end\n else self.root = d\n end\nend\n\nAvlTree.rotRL = function(self, rparent, lparent)\n local sp, sl, sr = self.p, self.l, self.r\n local granp, d = sp[lparent], sl[rparent]\n sp[rparent], sl[rparent] = d, sr[d]\n sp[lparent], sr[lparent] = d, sl[d]\n sp[sr[d]], sp[sl[d]] = rparent, lparent\n sp[d], sr[d], sl[d] = granp, rparent, lparent\n if 1 < granp then\n if sl[granp] == lparent then sl[granp] = d\n else sr[granp] = d\n end\n else self.root = d\n end\nend\n\nAvlTree.empty = function(self)\n return self.root <= 1\nend\n\nAvlTree.push = function(self, val)\n if self.root <= 1 then self.root = self:makenode(val, 1) return end\n local pos = self.root\n while true do\n if self.lessthan(val, self.v[pos]) then\n if 1 < self.l[pos] then\n pos = self.l[pos]\n else\n self.l[pos] = self:makenode(val, pos)\n pos = self.l[pos]\n break\n end\n else\n if 1 < self.r[pos] then\n pos = self.r[pos]\n else\n self.r[pos] = self:makenode(val, pos)\n pos = self.r[pos]\n break\n end\n end\n end\n while 1 < pos do\n local child, parent = pos, self.p[pos]\n if parent <= 1 then\n break\n end\n self:recalc(parent)\n local lcp_m_rcp = self.lc[parent] - self.rc[parent]\n if lcp_m_rcp % 2 ~= 0 then -- 1 or -1\n pos = parent\n elseif lcp_m_rcp == 2 then\n if self.lc[child] - 1 == self.rc[child] then\n self:rotR(parent)\n self:recalcAll(parent)\n else\n self:rotLR(child, parent)\n self:recalc(child)\n self:recalcAll(parent)\n end\n break\n elseif lcp_m_rcp == -2 then\n if self.rc[child] - 1 == self.lc[child] then\n self:rotL(parent)\n self:recalcAll(parent)\n else\n self:rotRL(child, parent)\n self:recalc(child)\n self:recalcAll(parent)\n end\n break\n else\n break\n end\n end\nend\n\nAvlTree.rmsub = function(self, node)\n while 1 < node do\n self:recalc(node)\n if self.lc[node] == self.rc[node] then\n node = self.p[node]\n elseif self.lc[node] + 1 == self.rc[node] then\n self:recalcAll(self.p[node])\n break\n else\n if self.lc[self.r[node]] == self.rc[self.r[node]] then\n self:rotL(node)\n self:recalcAll(node)\n break\n elseif self.lc[self.r[node]] + 1 == self.rc[self.r[node]] then\n local nr = self.r[node]\n self:rotL(node)\n self:recalc(node)\n node = nr\n else\n local nr = self.r[node]\n local nrl = self.l[nr]\n self:rotRL(nr, node)\n self:recalc(nr)\n self:recalc(node)\n node = nrl\n end\n end\n end\nend\n\nAvlTree.pop = function(self)\n local node = self.root\n while 1 < self.l[node] do\n node = self.l[node]\n end\n local v = self.v[node]\n local kp = self.p[node]\n self.p[self.r[node]] = kp\n if 1 < kp then\n self.l[kp] = self.r[node]\n self:rmsub(kp)\n else\n self.root = self.r[node]\n end\n table.insert(self.box, node)\n return v\nend\n\nAvlTree.new = function(lessthan, n)\n local obj = {}\n setmetatable(obj, {__index = AvlTree})\n obj:create(lessthan, n)\n return obj\nend\n\nlocal q = io.read(\"*n\")\nlocal len = {}\nlocal function lt(x, y)\n return len[x] < len[y]\nend\nlocal avl = AvlTree.new(lt, 1)\n\nlocal function pushfunc(dst, dstcost)\n if not len[dst] or dstcost < len[dst] then\n len[dst] = dstcost\n avl:push(dst)\n end\nend\n\nfor iq = 1, q do\n local n, a, b, c, d = io.read(\"*n\", \"*n\", \"*n\", \"*n\", \"*n\")\n local t = {}\n len = {}\n len[n] = 0\n avl:clear()\n avl:push(n)\n local inf = 1000000007 * 1000000007\n local cand = inf\n while not avl:empty() do\n local src = avl:pop()\n local cost = len[src]\n -- local zf = 1.0 * d * src\n if src <= 1000000000 then\n local z = cost + d * src\n if 0 < z then\n cand = mmi(cand, z)\n end\n end\n -- if 1 <= z then\n -- end\n if 1 < src then\n -- print(src, cost)\n local dst = src // 2\n local dstcost = cost + d * (src % 2) + a\n pushfunc(dst, dstcost)\n if dst % 2 ~= 0 then\n dst = dst + 1\n dstcost = cost + d * (2 - (src % 2)) + a\n pushfunc(dst, dstcost)\n end\n dst = src // 3\n dstcost = cost + d * (src % 3) + b\n pushfunc(dst, dstcost)\n if dst % 3 ~= 0 then\n dst = dst + 1\n dstcost = cost + d * (3 - (src % 3)) + b\n pushfunc(dst, dstcost)\n end\n dst = src // 5\n dstcost = cost + d * (src % 5) + c\n pushfunc(dst, dstcost)\n if dst % 5 ~= 0 then\n dst = dst + 1\n dstcost = cost + d * (5 - (src % 5)) + c\n pushfunc(dst, dstcost)\n end\n end\n end\n print(cand)\nend\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou start with the number 0 and you want to reach the number N.\n\nYou can change the number, paying a certain amount of coins, with the following operations:\n\nMultiply the number by 2, paying A coins.\n\nMultiply the number by 3, paying B coins.\n\nMultiply the number by 5, paying C coins.\n\nIncrease or decrease the number by 1, paying D coins.\n\nYou can perform these operations in arbitrary order and an arbitrary number of times.\n\nWhat is the minimum number of coins you need to reach N?\n\nYou have to solve T testcases.\n\nConstraints\n\n1 \\le T \\le 10\n\n1 \\le N \\le 10^{18}\n\n1 \\le A, B, C, D \\le 10^9\n\nAll numbers N, A, B, C, D are integers.\n\nInput\n\nThe input is given from Standard Input. The first line of the input is\n\nT\n\nThen, T lines follow describing the T testcases.\nEach of the T lines has the format\n\nN A B C D\n\nOutput\n\nFor each testcase, print the answer on Standard Output followed by a newline.\n\nSample Input 1\n\n5\n11 1 2 4 8\n11 1 2 2 8\n32 10 8 5 4\n29384293847243 454353412 332423423 934923490 1\n900000000000000000 332423423 454353412 934923490 987654321\n\nSample Output 1\n\n20\n19\n26\n3821859835\n23441258666\n\nFor the first testcase, a sequence of moves that achieves the minimum cost of 20 is:\n\nInitially x = 0.\n\nPay 8 to increase by 1 (x = 1).\n\nPay 1 to multiply by 2 (x = 2).\n\nPay 1 to multiply by 2 (x = 4).\n\nPay 2 to multiply by 3 (x = 12).\n\nPay 8 to decrease by 1 (x = 11).\n\nFor the second testcase, a sequence of moves that achieves the minimum cost of 19 is:\n\nInitially x = 0.\n\nPay 8 to increase by 1 (x = 1).\n\nPay 1 to multiply by 2 (x = 2).\n\nPay 2 to multiply by 5 (x = 10).\n\nPay 8 to increase by 1 (x = 11).", "sample_input": "5\n11 1 2 4 8\n11 1 2 2 8\n32 10 8 5 4\n29384293847243 454353412 332423423 934923490 1\n900000000000000000 332423423 454353412 934923490 987654321\n"}, "reference_outputs": ["20\n19\n26\n3821859835\n23441258666\n"], "source_document_id": "p02669", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou start with the number 0 and you want to reach the number N.\n\nYou can change the number, paying a certain amount of coins, with the following operations:\n\nMultiply the number by 2, paying A coins.\n\nMultiply the number by 3, paying B coins.\n\nMultiply the number by 5, paying C coins.\n\nIncrease or decrease the number by 1, paying D coins.\n\nYou can perform these operations in arbitrary order and an arbitrary number of times.\n\nWhat is the minimum number of coins you need to reach N?\n\nYou have to solve T testcases.\n\nConstraints\n\n1 \\le T \\le 10\n\n1 \\le N \\le 10^{18}\n\n1 \\le A, B, C, D \\le 10^9\n\nAll numbers N, A, B, C, D are integers.\n\nInput\n\nThe input is given from Standard Input. The first line of the input is\n\nT\n\nThen, T lines follow describing the T testcases.\nEach of the T lines has the format\n\nN A B C D\n\nOutput\n\nFor each testcase, print the answer on Standard Output followed by a newline.\n\nSample Input 1\n\n5\n11 1 2 4 8\n11 1 2 2 8\n32 10 8 5 4\n29384293847243 454353412 332423423 934923490 1\n900000000000000000 332423423 454353412 934923490 987654321\n\nSample Output 1\n\n20\n19\n26\n3821859835\n23441258666\n\nFor the first testcase, a sequence of moves that achieves the minimum cost of 20 is:\n\nInitially x = 0.\n\nPay 8 to increase by 1 (x = 1).\n\nPay 1 to multiply by 2 (x = 2).\n\nPay 1 to multiply by 2 (x = 4).\n\nPay 2 to multiply by 3 (x = 12).\n\nPay 8 to decrease by 1 (x = 11).\n\nFor the second testcase, a sequence of moves that achieves the minimum cost of 19 is:\n\nInitially x = 0.\n\nPay 8 to increase by 1 (x = 1).\n\nPay 1 to multiply by 2 (x = 2).\n\nPay 2 to multiply by 5 (x = 10).\n\nPay 8 to increase by 1 (x = 11).", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7303, "cpu_time_ms": 1838, "memory_kb": 9768}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s160947872", "group_id": "codeNet:p02669", "input_text": "local mma = math.max\nlocal mfl, mce, mmi = math.floor, math.ceil, math.min\n\nlocal AvlTree = {}\nAvlTree.makenode = function(self, val, parent)\n local i = self.box[#self.box]\n if not i then i = #self.v + 1\n else table.remove(self.box)\n end\n self.v[i], self.p[i] = val, parent\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 1, 1\n return i\nend\nAvlTree.create = function(self, lessthan, n)\n self.lessthan = lessthan\n self.root = 1\n self.box = {}\n for i = n + 1, 2, -1 do table.insert(self.box, i) end\n -- value, leftCount, rightCount, left, right, parent\n self.v, self.lc, self.rc, self.l, self.r, self.p = {}, {}, {}, {}, {}, {}\n for i = 1, n + 1 do\n self.v[i], self.p[i] = 0, 1\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 1, 1\n end\nend\nAvlTree.clear = function(self)\n local n = #self.box\n self.root = 1\n self.box = {}\n for i = n + 1, 2, -1 do self.box[n + 2 - i] = i end\n self.v, self.lc, self.rc, self.l, self.r, self.p = {}, {}, {}, {}, {}, {}\n for i = 1, n + 1 do\n self.v[i], self.p[i] = 0, 1\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 1, 1\n end\nend\n\nAvlTree.recalc = function(self, i)\n local kl, kr = self.l[i], self.r[i]\n if 1 < kl then self.lc[i] = 1 + mma(self.lc[kl], self.rc[kl])\n else self.lc[i] = 0\n end\n if 1 < kr then self.rc[i] = 1 + mma(self.lc[kr], self.rc[kr])\n else self.rc[i] = 0\n end\nend\nAvlTree.recalcAll = function(self, i)\n while 1 < i do\n self:recalc(i)\n i = self.p[i]\n end\nend\n\nAvlTree.rotR = function(self, parent)\n local granp, child = self.p[parent], self.l[parent]\n self.r[child], self.l[parent] = parent, self.r[child]\n self.p[child], self.p[parent] = granp, child\n self.p[self.l[parent]] = parent\n if 1 < granp then\n if self.l[granp] == parent then\n self.l[granp] = child\n else\n self.r[granp] = child\n end\n else\n self.root = child\n end\nend\n\nAvlTree.rotL = function(self, parent)\n local granp, child = self.p[parent], self.r[parent]\n self.l[child], self.r[parent] = parent, self.l[child]\n self.p[child], self.p[parent] = granp, child\n self.p[self.r[parent]] = parent\n if 1 < granp then\n if self.r[granp] == parent then\n self.r[granp] = child\n else\n self.l[granp] = child\n end\n else\n self.root = child\n end\nend\n\nAvlTree.rotLR = function(self, lparent, rparent)\n local sp, sl, sr = self.p, self.l, self.r\n local granp, d = sp[rparent], sr[lparent]\n sp[lparent], sr[lparent] = d, sl[d]\n sp[rparent], sl[rparent] = d, sr[d]\n sp[sl[d]], sp[sr[d]] = lparent, rparent\n sp[d], sl[d], sr[d] = granp, lparent, rparent\n if 1 < granp then\n if sr[granp] == rparent then sr[granp] = d\n else sl[granp] = d\n end\n else self.root = d\n end\nend\n\nAvlTree.rotRL = function(self, rparent, lparent)\n local sp, sl, sr = self.p, self.l, self.r\n local granp, d = sp[lparent], sl[rparent]\n sp[rparent], sl[rparent] = d, sr[d]\n sp[lparent], sr[lparent] = d, sl[d]\n sp[sr[d]], sp[sl[d]] = rparent, lparent\n sp[d], sr[d], sl[d] = granp, rparent, lparent\n if 1 < granp then\n if sl[granp] == lparent then sl[granp] = d\n else sr[granp] = d\n end\n else self.root = d\n end\nend\n\nAvlTree.empty = function(self)\n return self.root <= 1\nend\n\nAvlTree.push = function(self, val)\n if self.root <= 1 then self.root = self:makenode(val, 1) return end\n local pos = self.root\n while true do\n if self.lessthan(val, self.v[pos]) then\n if 1 < self.l[pos] then\n pos = self.l[pos]\n else\n self.l[pos] = self:makenode(val, pos)\n pos = self.l[pos]\n break\n end\n else\n if 1 < self.r[pos] then\n pos = self.r[pos]\n else\n self.r[pos] = self:makenode(val, pos)\n pos = self.r[pos]\n break\n end\n end\n end\n while 1 < pos do\n local child, parent = pos, self.p[pos]\n if parent <= 1 then\n break\n end\n self:recalc(parent)\n local lcp_m_rcp = self.lc[parent] - self.rc[parent]\n if lcp_m_rcp % 2 ~= 0 then -- 1 or -1\n pos = parent\n elseif lcp_m_rcp == 2 then\n if self.lc[child] - 1 == self.rc[child] then\n self:rotR(parent)\n self:recalcAll(parent)\n else\n self:rotLR(child, parent)\n self:recalc(child)\n self:recalcAll(parent)\n end\n break\n elseif lcp_m_rcp == -2 then\n if self.rc[child] - 1 == self.lc[child] then\n self:rotL(parent)\n self:recalcAll(parent)\n else\n self:rotRL(child, parent)\n self:recalc(child)\n self:recalcAll(parent)\n end\n break\n else\n break\n end\n end\nend\n\nAvlTree.rmsub = function(self, node)\n while 1 < node do\n self:recalc(node)\n if self.lc[node] == self.rc[node] then\n node = self.p[node]\n elseif self.lc[node] + 1 == self.rc[node] then\n self:recalcAll(self.p[node])\n break\n else\n if self.lc[self.r[node]] == self.rc[self.r[node]] then\n self:rotL(node)\n self:recalcAll(node)\n break\n elseif self.lc[self.r[node]] + 1 == self.rc[self.r[node]] then\n local nr = self.r[node]\n self:rotL(node)\n self:recalc(node)\n node = nr\n else\n local nr = self.r[node]\n local nrl = self.l[nr]\n self:rotRL(nr, node)\n self:recalc(nr)\n self:recalc(node)\n node = nrl\n end\n end\n end\nend\n\nAvlTree.pop = function(self)\n local node = self.root\n while 1 < self.l[node] do\n node = self.l[node]\n end\n local v = self.v[node]\n local kp = self.p[node]\n self.p[self.r[node]] = kp\n if 1 < kp then\n self.l[kp] = self.r[node]\n self:rmsub(kp)\n else\n self.root = self.r[node]\n end\n table.insert(self.box, node)\n return v\nend\n\nAvlTree.new = function(lessthan, n)\n local obj = {}\n setmetatable(obj, {__index = AvlTree})\n obj:create(lessthan, n)\n return obj\nend\n\nlocal q = io.read(\"*n\")\nlocal len = {}\nlocal function lt(x, y)\n return len[x] < len[y]\nend\nlocal avl = AvlTree.new(lt, 1)\n\nlocal function pushfunc(dst, dstcost)\n if not len[dst] or dstcost < len[dst] then\n len[dst] = dstcost\n avl:push(dst)\n end\nend\n\nfor iq = 1, q do\n local n, a, b, c, d = io.read(\"*n\", \"*n\", \"*n\", \"*n\", \"*n\")\n local t = {}\n len = {}\n len[n] = 0\n avl:clear()\n avl:push(n)\n local inf = 1000000007 * 1000000007\n local cand = inf\n while not avl:empty() do\n local src = avl:pop()\n local cost = len[src]\n local z = cost + d * src\n if 1 <= z then\n cand = mmi(cand, z)\n end\n if src == 1 then\n if not cand then\n cand = cost + d\n else\n cand = mmi(cand, cost + d)\n end\n else\n -- print(src, cost)\n local dst = src // 2\n local dstcost = cost + d * (src % 2) + a\n pushfunc(dst, dstcost)\n if dst % 2 ~= 0 then\n dst = dst + 1\n dstcost = cost + d * (2 - (src % 2)) + a\n pushfunc(dst, dstcost)\n end\n dst = src // 3\n dstcost = cost + d * (src % 3) + b\n pushfunc(dst, dstcost)\n if dst % 3 ~= 0 then\n dst = dst + 1\n dstcost = cost + d * (3 - (src % 3)) + b\n pushfunc(dst, dstcost)\n end\n dst = src // 5\n dstcost = cost + d * (src % 5) + c\n pushfunc(dst, dstcost)\n if dst % 5 ~= 0 then\n dst = dst + 1\n dstcost = cost + d * (5 - (src % 5)) + c\n pushfunc(dst, dstcost)\n end\n end\n end\n print(cand)\nend\n", "language": "Lua", "metadata": {"date": 1590284100, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02669.html", "problem_id": "p02669", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02669/input.txt", "sample_output_relpath": "derived/input_output/data/p02669/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02669/Lua/s160947872.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s160947872", "user_id": "u120582723"}, "prompt_components": {"gold_output": "20\n19\n26\n3821859835\n23441258666\n", "input_to_evaluate": "local mma = math.max\nlocal mfl, mce, mmi = math.floor, math.ceil, math.min\n\nlocal AvlTree = {}\nAvlTree.makenode = function(self, val, parent)\n local i = self.box[#self.box]\n if not i then i = #self.v + 1\n else table.remove(self.box)\n end\n self.v[i], self.p[i] = val, parent\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 1, 1\n return i\nend\nAvlTree.create = function(self, lessthan, n)\n self.lessthan = lessthan\n self.root = 1\n self.box = {}\n for i = n + 1, 2, -1 do table.insert(self.box, i) end\n -- value, leftCount, rightCount, left, right, parent\n self.v, self.lc, self.rc, self.l, self.r, self.p = {}, {}, {}, {}, {}, {}\n for i = 1, n + 1 do\n self.v[i], self.p[i] = 0, 1\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 1, 1\n end\nend\nAvlTree.clear = function(self)\n local n = #self.box\n self.root = 1\n self.box = {}\n for i = n + 1, 2, -1 do self.box[n + 2 - i] = i end\n self.v, self.lc, self.rc, self.l, self.r, self.p = {}, {}, {}, {}, {}, {}\n for i = 1, n + 1 do\n self.v[i], self.p[i] = 0, 1\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 1, 1\n end\nend\n\nAvlTree.recalc = function(self, i)\n local kl, kr = self.l[i], self.r[i]\n if 1 < kl then self.lc[i] = 1 + mma(self.lc[kl], self.rc[kl])\n else self.lc[i] = 0\n end\n if 1 < kr then self.rc[i] = 1 + mma(self.lc[kr], self.rc[kr])\n else self.rc[i] = 0\n end\nend\nAvlTree.recalcAll = function(self, i)\n while 1 < i do\n self:recalc(i)\n i = self.p[i]\n end\nend\n\nAvlTree.rotR = function(self, parent)\n local granp, child = self.p[parent], self.l[parent]\n self.r[child], self.l[parent] = parent, self.r[child]\n self.p[child], self.p[parent] = granp, child\n self.p[self.l[parent]] = parent\n if 1 < granp then\n if self.l[granp] == parent then\n self.l[granp] = child\n else\n self.r[granp] = child\n end\n else\n self.root = child\n end\nend\n\nAvlTree.rotL = function(self, parent)\n local granp, child = self.p[parent], self.r[parent]\n self.l[child], self.r[parent] = parent, self.l[child]\n self.p[child], self.p[parent] = granp, child\n self.p[self.r[parent]] = parent\n if 1 < granp then\n if self.r[granp] == parent then\n self.r[granp] = child\n else\n self.l[granp] = child\n end\n else\n self.root = child\n end\nend\n\nAvlTree.rotLR = function(self, lparent, rparent)\n local sp, sl, sr = self.p, self.l, self.r\n local granp, d = sp[rparent], sr[lparent]\n sp[lparent], sr[lparent] = d, sl[d]\n sp[rparent], sl[rparent] = d, sr[d]\n sp[sl[d]], sp[sr[d]] = lparent, rparent\n sp[d], sl[d], sr[d] = granp, lparent, rparent\n if 1 < granp then\n if sr[granp] == rparent then sr[granp] = d\n else sl[granp] = d\n end\n else self.root = d\n end\nend\n\nAvlTree.rotRL = function(self, rparent, lparent)\n local sp, sl, sr = self.p, self.l, self.r\n local granp, d = sp[lparent], sl[rparent]\n sp[rparent], sl[rparent] = d, sr[d]\n sp[lparent], sr[lparent] = d, sl[d]\n sp[sr[d]], sp[sl[d]] = rparent, lparent\n sp[d], sr[d], sl[d] = granp, rparent, lparent\n if 1 < granp then\n if sl[granp] == lparent then sl[granp] = d\n else sr[granp] = d\n end\n else self.root = d\n end\nend\n\nAvlTree.empty = function(self)\n return self.root <= 1\nend\n\nAvlTree.push = function(self, val)\n if self.root <= 1 then self.root = self:makenode(val, 1) return end\n local pos = self.root\n while true do\n if self.lessthan(val, self.v[pos]) then\n if 1 < self.l[pos] then\n pos = self.l[pos]\n else\n self.l[pos] = self:makenode(val, pos)\n pos = self.l[pos]\n break\n end\n else\n if 1 < self.r[pos] then\n pos = self.r[pos]\n else\n self.r[pos] = self:makenode(val, pos)\n pos = self.r[pos]\n break\n end\n end\n end\n while 1 < pos do\n local child, parent = pos, self.p[pos]\n if parent <= 1 then\n break\n end\n self:recalc(parent)\n local lcp_m_rcp = self.lc[parent] - self.rc[parent]\n if lcp_m_rcp % 2 ~= 0 then -- 1 or -1\n pos = parent\n elseif lcp_m_rcp == 2 then\n if self.lc[child] - 1 == self.rc[child] then\n self:rotR(parent)\n self:recalcAll(parent)\n else\n self:rotLR(child, parent)\n self:recalc(child)\n self:recalcAll(parent)\n end\n break\n elseif lcp_m_rcp == -2 then\n if self.rc[child] - 1 == self.lc[child] then\n self:rotL(parent)\n self:recalcAll(parent)\n else\n self:rotRL(child, parent)\n self:recalc(child)\n self:recalcAll(parent)\n end\n break\n else\n break\n end\n end\nend\n\nAvlTree.rmsub = function(self, node)\n while 1 < node do\n self:recalc(node)\n if self.lc[node] == self.rc[node] then\n node = self.p[node]\n elseif self.lc[node] + 1 == self.rc[node] then\n self:recalcAll(self.p[node])\n break\n else\n if self.lc[self.r[node]] == self.rc[self.r[node]] then\n self:rotL(node)\n self:recalcAll(node)\n break\n elseif self.lc[self.r[node]] + 1 == self.rc[self.r[node]] then\n local nr = self.r[node]\n self:rotL(node)\n self:recalc(node)\n node = nr\n else\n local nr = self.r[node]\n local nrl = self.l[nr]\n self:rotRL(nr, node)\n self:recalc(nr)\n self:recalc(node)\n node = nrl\n end\n end\n end\nend\n\nAvlTree.pop = function(self)\n local node = self.root\n while 1 < self.l[node] do\n node = self.l[node]\n end\n local v = self.v[node]\n local kp = self.p[node]\n self.p[self.r[node]] = kp\n if 1 < kp then\n self.l[kp] = self.r[node]\n self:rmsub(kp)\n else\n self.root = self.r[node]\n end\n table.insert(self.box, node)\n return v\nend\n\nAvlTree.new = function(lessthan, n)\n local obj = {}\n setmetatable(obj, {__index = AvlTree})\n obj:create(lessthan, n)\n return obj\nend\n\nlocal q = io.read(\"*n\")\nlocal len = {}\nlocal function lt(x, y)\n return len[x] < len[y]\nend\nlocal avl = AvlTree.new(lt, 1)\n\nlocal function pushfunc(dst, dstcost)\n if not len[dst] or dstcost < len[dst] then\n len[dst] = dstcost\n avl:push(dst)\n end\nend\n\nfor iq = 1, q do\n local n, a, b, c, d = io.read(\"*n\", \"*n\", \"*n\", \"*n\", \"*n\")\n local t = {}\n len = {}\n len[n] = 0\n avl:clear()\n avl:push(n)\n local inf = 1000000007 * 1000000007\n local cand = inf\n while not avl:empty() do\n local src = avl:pop()\n local cost = len[src]\n local z = cost + d * src\n if 1 <= z then\n cand = mmi(cand, z)\n end\n if src == 1 then\n if not cand then\n cand = cost + d\n else\n cand = mmi(cand, cost + d)\n end\n else\n -- print(src, cost)\n local dst = src // 2\n local dstcost = cost + d * (src % 2) + a\n pushfunc(dst, dstcost)\n if dst % 2 ~= 0 then\n dst = dst + 1\n dstcost = cost + d * (2 - (src % 2)) + a\n pushfunc(dst, dstcost)\n end\n dst = src // 3\n dstcost = cost + d * (src % 3) + b\n pushfunc(dst, dstcost)\n if dst % 3 ~= 0 then\n dst = dst + 1\n dstcost = cost + d * (3 - (src % 3)) + b\n pushfunc(dst, dstcost)\n end\n dst = src // 5\n dstcost = cost + d * (src % 5) + c\n pushfunc(dst, dstcost)\n if dst % 5 ~= 0 then\n dst = dst + 1\n dstcost = cost + d * (5 - (src % 5)) + c\n pushfunc(dst, dstcost)\n end\n end\n end\n print(cand)\nend\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou start with the number 0 and you want to reach the number N.\n\nYou can change the number, paying a certain amount of coins, with the following operations:\n\nMultiply the number by 2, paying A coins.\n\nMultiply the number by 3, paying B coins.\n\nMultiply the number by 5, paying C coins.\n\nIncrease or decrease the number by 1, paying D coins.\n\nYou can perform these operations in arbitrary order and an arbitrary number of times.\n\nWhat is the minimum number of coins you need to reach N?\n\nYou have to solve T testcases.\n\nConstraints\n\n1 \\le T \\le 10\n\n1 \\le N \\le 10^{18}\n\n1 \\le A, B, C, D \\le 10^9\n\nAll numbers N, A, B, C, D are integers.\n\nInput\n\nThe input is given from Standard Input. The first line of the input is\n\nT\n\nThen, T lines follow describing the T testcases.\nEach of the T lines has the format\n\nN A B C D\n\nOutput\n\nFor each testcase, print the answer on Standard Output followed by a newline.\n\nSample Input 1\n\n5\n11 1 2 4 8\n11 1 2 2 8\n32 10 8 5 4\n29384293847243 454353412 332423423 934923490 1\n900000000000000000 332423423 454353412 934923490 987654321\n\nSample Output 1\n\n20\n19\n26\n3821859835\n23441258666\n\nFor the first testcase, a sequence of moves that achieves the minimum cost of 20 is:\n\nInitially x = 0.\n\nPay 8 to increase by 1 (x = 1).\n\nPay 1 to multiply by 2 (x = 2).\n\nPay 1 to multiply by 2 (x = 4).\n\nPay 2 to multiply by 3 (x = 12).\n\nPay 8 to decrease by 1 (x = 11).\n\nFor the second testcase, a sequence of moves that achieves the minimum cost of 19 is:\n\nInitially x = 0.\n\nPay 8 to increase by 1 (x = 1).\n\nPay 1 to multiply by 2 (x = 2).\n\nPay 2 to multiply by 5 (x = 10).\n\nPay 8 to increase by 1 (x = 11).", "sample_input": "5\n11 1 2 4 8\n11 1 2 2 8\n32 10 8 5 4\n29384293847243 454353412 332423423 934923490 1\n900000000000000000 332423423 454353412 934923490 987654321\n"}, "reference_outputs": ["20\n19\n26\n3821859835\n23441258666\n"], "source_document_id": "p02669", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou start with the number 0 and you want to reach the number N.\n\nYou can change the number, paying a certain amount of coins, with the following operations:\n\nMultiply the number by 2, paying A coins.\n\nMultiply the number by 3, paying B coins.\n\nMultiply the number by 5, paying C coins.\n\nIncrease or decrease the number by 1, paying D coins.\n\nYou can perform these operations in arbitrary order and an arbitrary number of times.\n\nWhat is the minimum number of coins you need to reach N?\n\nYou have to solve T testcases.\n\nConstraints\n\n1 \\le T \\le 10\n\n1 \\le N \\le 10^{18}\n\n1 \\le A, B, C, D \\le 10^9\n\nAll numbers N, A, B, C, D are integers.\n\nInput\n\nThe input is given from Standard Input. The first line of the input is\n\nT\n\nThen, T lines follow describing the T testcases.\nEach of the T lines has the format\n\nN A B C D\n\nOutput\n\nFor each testcase, print the answer on Standard Output followed by a newline.\n\nSample Input 1\n\n5\n11 1 2 4 8\n11 1 2 2 8\n32 10 8 5 4\n29384293847243 454353412 332423423 934923490 1\n900000000000000000 332423423 454353412 934923490 987654321\n\nSample Output 1\n\n20\n19\n26\n3821859835\n23441258666\n\nFor the first testcase, a sequence of moves that achieves the minimum cost of 20 is:\n\nInitially x = 0.\n\nPay 8 to increase by 1 (x = 1).\n\nPay 1 to multiply by 2 (x = 2).\n\nPay 1 to multiply by 2 (x = 4).\n\nPay 2 to multiply by 3 (x = 12).\n\nPay 8 to decrease by 1 (x = 11).\n\nFor the second testcase, a sequence of moves that achieves the minimum cost of 19 is:\n\nInitially x = 0.\n\nPay 8 to increase by 1 (x = 1).\n\nPay 1 to multiply by 2 (x = 2).\n\nPay 2 to multiply by 5 (x = 10).\n\nPay 8 to increase by 1 (x = 11).", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7306, "cpu_time_ms": 1880, "memory_kb": 9820}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s538037755", "group_id": "codeNet:p02679", "input_text": "local n=io.read(\"n\")\nlocal iwashi={}\nfor i=1,n do\n local a,b=io.read(\"n\",\"n\")\n iwashi[a/b]=(iwashi[a/b] or 0)+1\n iwashi[-b/a]=(iwashi[-b/a] or 0)+1\nend\n\nlocal counter=1\nfor i=1,n do\n counter=counter*2%1000000007\nend\ncounter=counter-1\n\nfor k,v in pairs(iwashi) do\n if iwashi[k] and iwashi[-1/k] then\n counter=counter-(iwashi[k]*iwashi[-1/k]%1000000007)\n end\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1592960893, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s538037755.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s538037755", "user_id": "u045238009"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal iwashi={}\nfor i=1,n do\n local a,b=io.read(\"n\",\"n\")\n iwashi[a/b]=(iwashi[a/b] or 0)+1\n iwashi[-b/a]=(iwashi[-b/a] or 0)+1\nend\n\nlocal counter=1\nfor i=1,n do\n counter=counter*2%1000000007\nend\ncounter=counter-1\n\nfor k,v in pairs(iwashi) do\n if iwashi[k] and iwashi[-1/k] then\n counter=counter-(iwashi[k]*iwashi[-1/k]%1000000007)\n end\nend\nprint(counter)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 400, "cpu_time_ms": 496, "memory_kb": 26940}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s381967929", "group_id": "codeNet:p02679", "input_text": "local mod = 1000000007\n\nlocal function bmul(x, y)\n return (x * y) % mod\nend\n\nlocal function badd(x, y)\n return (x + y) % mod\nend\n\nlocal function bsub(x, y)\n return x < y and x - y + mod or x - y\nend\n\nlocal function getgcd(x, y)\n while 0 < x do\n x, y = y % x, x\n end\n return y\nend\n\nlocal x1, y1 = {}, {}\nlocal x2, y2 = {}, {}\nlocal xzero = 0\nlocal yzero = 0\nlocal zero = 0\n\nlocal n = io.read(\"*n\", \"*l\")\nfor i = 1, n do\n local a, b = io.read(\"*n\", \"*n\")\n if a == 0 and b == 0 then\n zero = zero + 1\n elseif a == 0 then\n xzero = xzero + 1\n elseif b == 0 then\n yzero = yzero + 1\n else\n if b < 0 then\n a, b = -a, -b\n end\n if 0 < a then\n local gcd = getgcd(a, b)\n table.insert(x1, a / gcd)\n table.insert(y1, b / gcd)\n else\n local gcd = getgcd(-a, b)\n table.insert(x2, -a / gcd)\n table.insert(y2, b / gcd)\n end\n end\nend\n\nlocal pow2 = {1}\nfor i = 1, 200010 do\n pow2[i + 1] = (pow2[i] * 2) % mod\nend\n\nlocal ret = badd(pow2[xzero + 1], pow2[yzero + 1])\nret = bsub(ret, 1)\n\nlocal m1 = {}\nfor i1 = 1, #x1 do\n local xs, ys = tostring(x1[i1]), tostring(y1[i1])\n if not m1[xs] then m1[xs] = {} end\n if not m1[xs][ys] then\n m1[xs][ys] = 1\n else\n m1[xs][ys] = m1[xs][ys] + 1\n end\nend\n\nlocal m2 = {}\nfor i2 = 1, #x2 do\n local xs, ys = tostring(x2[i2]), tostring(y2[i2])\n if not m2[ys] then m2[ys] = {} end\n if not m2[ys][xs] then\n m2[ys][xs] = 1\n else\n m2[ys][xs] = m2[ys][xs] + 1\n end\nend\nfor k1, v in pairs(m1) do\n if m2[k1] then\n local m2k1 = m2[k1]\n for k2, c1 in pairs(v) do\n local c2 = m2k1[k2]\n if c2 then\n ret = bmul(ret, bsub(badd(pow2[c1 + 1], pow2[c2 + 1]), 1))\n m2k1[k2] = nil\n else\n ret = bmul(ret, pow2[c1 + 1])\n end\n end\n else\n for k2, c1 in pairs(v) do\n ret = bmul(ret, pow2[c1 + 1])\n end\n end\nend\nfor k1, v in pairs(m2) do\n for k2, c in pairs(v) do\n ret = bmul(ret, pow2[c + 1])\n end\nend\nret = bsub(ret, 1)\nret = badd(ret, zero)\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1589770318, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s381967929.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s381967929", "user_id": "u120582723"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local mod = 1000000007\n\nlocal function bmul(x, y)\n return (x * y) % mod\nend\n\nlocal function badd(x, y)\n return (x + y) % mod\nend\n\nlocal function bsub(x, y)\n return x < y and x - y + mod or x - y\nend\n\nlocal function getgcd(x, y)\n while 0 < x do\n x, y = y % x, x\n end\n return y\nend\n\nlocal x1, y1 = {}, {}\nlocal x2, y2 = {}, {}\nlocal xzero = 0\nlocal yzero = 0\nlocal zero = 0\n\nlocal n = io.read(\"*n\", \"*l\")\nfor i = 1, n do\n local a, b = io.read(\"*n\", \"*n\")\n if a == 0 and b == 0 then\n zero = zero + 1\n elseif a == 0 then\n xzero = xzero + 1\n elseif b == 0 then\n yzero = yzero + 1\n else\n if b < 0 then\n a, b = -a, -b\n end\n if 0 < a then\n local gcd = getgcd(a, b)\n table.insert(x1, a / gcd)\n table.insert(y1, b / gcd)\n else\n local gcd = getgcd(-a, b)\n table.insert(x2, -a / gcd)\n table.insert(y2, b / gcd)\n end\n end\nend\n\nlocal pow2 = {1}\nfor i = 1, 200010 do\n pow2[i + 1] = (pow2[i] * 2) % mod\nend\n\nlocal ret = badd(pow2[xzero + 1], pow2[yzero + 1])\nret = bsub(ret, 1)\n\nlocal m1 = {}\nfor i1 = 1, #x1 do\n local xs, ys = tostring(x1[i1]), tostring(y1[i1])\n if not m1[xs] then m1[xs] = {} end\n if not m1[xs][ys] then\n m1[xs][ys] = 1\n else\n m1[xs][ys] = m1[xs][ys] + 1\n end\nend\n\nlocal m2 = {}\nfor i2 = 1, #x2 do\n local xs, ys = tostring(x2[i2]), tostring(y2[i2])\n if not m2[ys] then m2[ys] = {} end\n if not m2[ys][xs] then\n m2[ys][xs] = 1\n else\n m2[ys][xs] = m2[ys][xs] + 1\n end\nend\nfor k1, v in pairs(m1) do\n if m2[k1] then\n local m2k1 = m2[k1]\n for k2, c1 in pairs(v) do\n local c2 = m2k1[k2]\n if c2 then\n ret = bmul(ret, bsub(badd(pow2[c1 + 1], pow2[c2 + 1]), 1))\n m2k1[k2] = nil\n else\n ret = bmul(ret, pow2[c1 + 1])\n end\n end\n else\n for k2, c1 in pairs(v) do\n ret = bmul(ret, pow2[c1 + 1])\n end\n end\nend\nfor k1, v in pairs(m2) do\n for k2, c in pairs(v) do\n ret = bmul(ret, pow2[c + 1])\n end\nend\nret = bsub(ret, 1)\nret = badd(ret, zero)\nprint(ret)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2005, "cpu_time_ms": 1204, "memory_kb": 73760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s944564277", "group_id": "codeNet:p02679", "input_text": "local mod = 1000000007\nlocal mfl = math.floor\n\nlocal function bmul(x, y)\n local x1, y1 = mfl(x / 31623), mfl(y / 31623)\n local x0, y0 = x - x1 * 31623, y - y1 * 31623\n return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod\nend\n\nlocal function badd(x, y)\n return (x + y) % mod\nend\n\nlocal function bsub(x, y)\n return x < y and x - y + mod or x - y\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\n\nlocal function getgcd(x, y)\n while 0LL < x do\n x, y = y % x, x\n end\n return y\nend\n\nlocal ffi = require(\"ffi\")\nlocal C = ffi.C\nffi.cdef[[\nlong long atoll(const char*);\n]]\n\nlocal function lltonumber(str)\n return C.atoll(str)\nend\n\nlocal x1, y1 = {}, {}\nlocal x2, y2 = {}, {}\nlocal xzero = 0\nlocal yzero = 0\nlocal zero = 0\n\nlocal n = io.read(\"*n\", \"*l\")\nlocal a, b = {}, {}\nfor i = 1, n do\n local s = io.read()\n local ai, bi = s:match(\"(%-?%d+) (%-?%d+)\")\n a[i] = lltonumber(ai)\n b[i] = lltonumber(bi)\n if a[i] == 0LL and b[i] == 0LL then\n zero = zero + 1\n elseif a[i] == 0LL then\n xzero = xzero + 1\n elseif b[i] == 0LL then\n yzero = yzero + 1\n else\n if b[i] < 0LL then\n a[i], b[i] = -a[i], -b[i]\n end\n if 0LL < a[i] then\n local xi = a[i]\n local yi = b[i]\n local gcd = getgcd(xi, yi)\n table.insert(x1, xi / gcd)\n table.insert(y1, yi / gcd)\n else\n local xi = -a[i]\n local yi = b[i]\n local gcd = getgcd(xi, yi)\n table.insert(x2, xi / gcd)\n table.insert(y2, yi / gcd)\n end\n end\nend\n-- print(os.clock())\n-- local idx1 = {}\n-- for i = 1, #x1 do\n-- idx1[i] = i\n-- end\n-- local idx2 = {}\n-- for i = 1, #x2 do\n-- idx2[i] = i\n-- end\n-- table.sort(idx1, function(aa, bb)\n-- if x1[aa] ~= x1[bb] then\n-- return x1[aa] < x1[bb]\n-- else\n-- return y1[aa] < y1[bb]\n-- end\n-- end)\n--\n-- table.sort(idx2, function(aa, bb)\n-- if y2[aa] ~= y2[bb] then\n-- return y2[aa] < y2[bb]\n-- else\n-- return x2[aa] < x2[bb]\n-- end\n-- end)\n\nlocal pow2 = {1}\nfor i = 1, 200010 do\n pow2[i + 1] = (pow2[i] * 2) % mod\nend\n\nlocal ret = badd(pow2[xzero + 1], pow2[yzero + 1])\nret = bsub(ret, 1)\n\nlocal m1 = {}\nfor i1 = 1, #x1 do\n local xs, ys = tostring(x1[i1]), tostring(y1[i1])\n if not m1[xs] then m1[xs] = {} end\n if not m1[xs][ys] then\n m1[xs][ys] = 1\n else\n m1[xs][ys] = m1[xs][ys] + 1\n end\nend\n\nlocal m2 = {}\nfor i2 = 1, #x2 do\n local xs, ys = tostring(x2[i2]), tostring(y2[i2])\n if not m2[ys] then m2[ys] = {} end\n if not m2[ys][xs] then\n m2[ys][xs] = 1\n else\n m2[ys][xs] = m2[ys][xs] + 1\n end\nend\nfor k1, v in pairs(m1) do\n if m2[k1] then\n local m2k1 = m2[k1]\n for k2, c1 in pairs(v) do\n local c2 = m2k1[k2]\n if c2 then\n ret = bmul(ret, bsub(badd(pow2[c1 + 1], pow2[c2 + 1]), 1))\n m2k1[k2] = nil\n else\n ret = bmul(ret, pow2[c1 + 1])\n end\n end\n else\n for k2, c1 in pairs(v) do\n ret = bmul(ret, pow2[c1 + 1])\n end\n end\nend\nfor k1, v in pairs(m2) do\n for k2, c in pairs(v) do\n ret = bmul(ret, pow2[c + 1])\n end\nend\nret = bsub(ret, 1)\nret = badd(ret, zero)\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1589770082, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s944564277.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s944564277", "user_id": "u120582723"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local mod = 1000000007\nlocal mfl = math.floor\n\nlocal function bmul(x, y)\n local x1, y1 = mfl(x / 31623), mfl(y / 31623)\n local x0, y0 = x - x1 * 31623, y - y1 * 31623\n return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod\nend\n\nlocal function badd(x, y)\n return (x + y) % mod\nend\n\nlocal function bsub(x, y)\n return x < y and x - y + mod or x - y\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\n\nlocal function getgcd(x, y)\n while 0LL < x do\n x, y = y % x, x\n end\n return y\nend\n\nlocal ffi = require(\"ffi\")\nlocal C = ffi.C\nffi.cdef[[\nlong long atoll(const char*);\n]]\n\nlocal function lltonumber(str)\n return C.atoll(str)\nend\n\nlocal x1, y1 = {}, {}\nlocal x2, y2 = {}, {}\nlocal xzero = 0\nlocal yzero = 0\nlocal zero = 0\n\nlocal n = io.read(\"*n\", \"*l\")\nlocal a, b = {}, {}\nfor i = 1, n do\n local s = io.read()\n local ai, bi = s:match(\"(%-?%d+) (%-?%d+)\")\n a[i] = lltonumber(ai)\n b[i] = lltonumber(bi)\n if a[i] == 0LL and b[i] == 0LL then\n zero = zero + 1\n elseif a[i] == 0LL then\n xzero = xzero + 1\n elseif b[i] == 0LL then\n yzero = yzero + 1\n else\n if b[i] < 0LL then\n a[i], b[i] = -a[i], -b[i]\n end\n if 0LL < a[i] then\n local xi = a[i]\n local yi = b[i]\n local gcd = getgcd(xi, yi)\n table.insert(x1, xi / gcd)\n table.insert(y1, yi / gcd)\n else\n local xi = -a[i]\n local yi = b[i]\n local gcd = getgcd(xi, yi)\n table.insert(x2, xi / gcd)\n table.insert(y2, yi / gcd)\n end\n end\nend\n-- print(os.clock())\n-- local idx1 = {}\n-- for i = 1, #x1 do\n-- idx1[i] = i\n-- end\n-- local idx2 = {}\n-- for i = 1, #x2 do\n-- idx2[i] = i\n-- end\n-- table.sort(idx1, function(aa, bb)\n-- if x1[aa] ~= x1[bb] then\n-- return x1[aa] < x1[bb]\n-- else\n-- return y1[aa] < y1[bb]\n-- end\n-- end)\n--\n-- table.sort(idx2, function(aa, bb)\n-- if y2[aa] ~= y2[bb] then\n-- return y2[aa] < y2[bb]\n-- else\n-- return x2[aa] < x2[bb]\n-- end\n-- end)\n\nlocal pow2 = {1}\nfor i = 1, 200010 do\n pow2[i + 1] = (pow2[i] * 2) % mod\nend\n\nlocal ret = badd(pow2[xzero + 1], pow2[yzero + 1])\nret = bsub(ret, 1)\n\nlocal m1 = {}\nfor i1 = 1, #x1 do\n local xs, ys = tostring(x1[i1]), tostring(y1[i1])\n if not m1[xs] then m1[xs] = {} end\n if not m1[xs][ys] then\n m1[xs][ys] = 1\n else\n m1[xs][ys] = m1[xs][ys] + 1\n end\nend\n\nlocal m2 = {}\nfor i2 = 1, #x2 do\n local xs, ys = tostring(x2[i2]), tostring(y2[i2])\n if not m2[ys] then m2[ys] = {} end\n if not m2[ys][xs] then\n m2[ys][xs] = 1\n else\n m2[ys][xs] = m2[ys][xs] + 1\n end\nend\nfor k1, v in pairs(m1) do\n if m2[k1] then\n local m2k1 = m2[k1]\n for k2, c1 in pairs(v) do\n local c2 = m2k1[k2]\n if c2 then\n ret = bmul(ret, bsub(badd(pow2[c1 + 1], pow2[c2 + 1]), 1))\n m2k1[k2] = nil\n else\n ret = bmul(ret, pow2[c1 + 1])\n end\n end\n else\n for k2, c1 in pairs(v) do\n ret = bmul(ret, pow2[c1 + 1])\n end\n end\nend\nfor k1, v in pairs(m2) do\n for k2, c in pairs(v) do\n ret = bmul(ret, pow2[c + 1])\n end\nend\nret = bsub(ret, 1)\nret = badd(ret, zero)\nprint(ret)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3301, "cpu_time_ms": 2207, "memory_kb": 87804}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s605868907", "group_id": "codeNet:p02681", "input_text": "local S, T = io.read(\"*l\", \"*l\")\n\nprint((S == T:sub(1, T:len() - 1)) and \"Yes\" or \"No\")", "language": "Lua", "metadata": {"date": 1589159156, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s605868907.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s605868907", "user_id": "u793881115"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local S, T = io.read(\"*l\", \"*l\")\n\nprint((S == T:sub(1, T:len() - 1)) and \"Yes\" or \"No\")", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 87, "cpu_time_ms": 3, "memory_kb": 2564}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s131138969", "group_id": "codeNet:p02682", "input_text": "a,b,c,k=io.read(\"*n\",\"*n\",\"*n\",\"*n\")\nif a>=k then\n print(k)\nelseif a=k then\n print(a)\n elseif a+bk then\n print(a-(k-a-b))\n end\n end\nend\n", "language": "Lua", "metadata": {"date": 1589300262, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s131138969.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s131138969", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "a,b,c,k=io.read(\"*n\",\"*n\",\"*n\",\"*n\")\nif a>=k then\n print(k)\nelseif a=k then\n print(a)\n elseif a+bk then\n print(a-(k-a-b))\n end\n end\nend\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.\n\nWe will pick up K among these cards. What is the maximum possible sum of the numbers written on the cards chosen?\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, B, C\n\n1 \\leq K \\leq A + B + C \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C K\n\nOutput\n\nPrint the maximum possible sum of the numbers written on the cards chosen.\n\nSample Input 1\n\n2 1 1 3\n\nSample Output 1\n\n2\n\nConsider picking up two cards with 1s and one card with a 0.\nIn this case, the sum of the numbers written on the cards is 2, which is the maximum possible value.\n\nSample Input 2\n\n1 2 3 4\n\nSample Output 2\n\n0\n\nSample Input 3\n\n2000000000 0 0 2000000000\n\nSample Output 3\n\n2000000000", "sample_input": "2 1 1 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02682", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.\n\nWe will pick up K among these cards. What is the maximum possible sum of the numbers written on the cards chosen?\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, B, C\n\n1 \\leq K \\leq A + B + C \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C K\n\nOutput\n\nPrint the maximum possible sum of the numbers written on the cards chosen.\n\nSample Input 1\n\n2 1 1 3\n\nSample Output 1\n\n2\n\nConsider picking up two cards with 1s and one card with a 0.\nIn this case, the sum of the numbers written on the cards is 2, which is the maximum possible value.\n\nSample Input 2\n\n1 2 3 4\n\nSample Output 2\n\n0\n\nSample Input 3\n\n2000000000 0 0 2000000000\n\nSample Output 3\n\n2000000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 2792}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s480193824", "group_id": "codeNet:p02683", "input_text": "local mmi, mma = math.min, math.max\nlocal bls, brs = bit.lshift, bit.rshift\nlocal n, m, x = io.read(\"*n\", \"*n\", \"*n\")\nlocal c = {}\nlocal a = {}\nfor i = 1, n do\n c[i] = io.read(\"*n\")\n a[i] = {}\n for j = 1, m do\n a[i][j] = io.read(\"*n\")\n end\nend\nlocal ret = -1\nlocal tot = bls(1, n)\nfor it = 0, tot - 1 do\n local ti = it\n local cost = 0\n local z = {}\n for j = 1, m do\n z[j] = 0\n end\n for j = 1, n do\n if ti % 2 == 1 then\n for k = 1, m do\n z[k] = z[k] + a[j][k]\n end\n cost = cost + c[j]\n end\n ti = brs(ti, 1)\n end\n local valid = true\n for j = 1, m do\n if z[j] < x then\n valid = false\n end\n end\n if valid then\n if ret == -1 then\n ret = cost\n else\n ret = mmi(ret, cost)\n end\n end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1589159246, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02683.html", "problem_id": "p02683", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02683/input.txt", "sample_output_relpath": "derived/input_output/data/p02683/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02683/Lua/s480193824.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s480193824", "user_id": "u120582723"}, "prompt_components": {"gold_output": "120\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal bls, brs = bit.lshift, bit.rshift\nlocal n, m, x = io.read(\"*n\", \"*n\", \"*n\")\nlocal c = {}\nlocal a = {}\nfor i = 1, n do\n c[i] = io.read(\"*n\")\n a[i] = {}\n for j = 1, m do\n a[i][j] = io.read(\"*n\")\n end\nend\nlocal ret = -1\nlocal tot = bls(1, n)\nfor it = 0, tot - 1 do\n local ti = it\n local cost = 0\n local z = {}\n for j = 1, m do\n z[j] = 0\n end\n for j = 1, n do\n if ti % 2 == 1 then\n for k = 1, m do\n z[k] = z[k] + a[j][k]\n end\n cost = cost + c[j]\n end\n ti = brs(ti, 1)\n end\n local valid = true\n for j = 1, m do\n if z[j] < x then\n valid = false\n end\n end\n if valid then\n if ret == -1 then\n ret = cost\n else\n ret = mmi(ret, cost)\n end\n end\nend\nprint(ret)\n", "problem_context": "Score : 300 points\n\nProblem\n\nTakahashi, who is a novice in competitive programming, wants to learn M algorithms.\nInitially, his understanding level of each of the M algorithms is 0.\n\nTakahashi is visiting a bookstore, where he finds N books on algorithms.\nThe i-th book (1\\leq i\\leq N) is sold for C_i yen (the currency of Japan). If he buys and reads it, his understanding level of the j-th algorithm will increase by A_{i,j} for each j (1\\leq j\\leq M).\nThere is no other way to increase the understanding levels of the algorithms.\n\nTakahashi's objective is to make his understanding levels of all the M algorithms X or higher. Determine whether this objective is achievable. If it is achievable, find the minimum amount of money needed to achieve it.\n\nConstraints\n\nAll values in input are integers.\n\n1\\leq N, M\\leq 12\n\n1\\leq X\\leq 10^5\n\n1\\leq C_i \\leq 10^5\n\n0\\leq A_{i, j} \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X\nC_1 A_{1,1} A_{1,2} \\cdots A_{1,M}\nC_2 A_{2,1} A_{2,2} \\cdots A_{2,M}\n\\vdots\nC_N A_{N,1} A_{N,2} \\cdots A_{N,M}\n\nOutput\n\nIf the objective is not achievable, print -1; otherwise, print the minimum amount of money needed to achieve it.\n\nSample Input 1\n\n3 3 10\n60 2 2 4\n70 8 7 9\n50 2 3 9\n\nSample Output 1\n\n120\n\nBuying the second and third books makes his understanding levels of all the algorithms 10 or higher, at the minimum cost possible.\n\nSample Input 2\n\n3 3 10\n100 3 1 4\n100 1 5 9\n100 2 6 5\n\nSample Output 2\n\n-1\n\nBuying all the books is still not enough to make his understanding levels of all the algorithms 10 or higher.\n\nSample Input 3\n\n8 5 22\n100 3 7 5 3 1\n164 4 5 2 7 8\n334 7 2 7 2 9\n234 4 7 2 8 2\n541 5 4 3 3 6\n235 4 8 6 9 7\n394 3 6 1 6 2\n872 8 4 3 7 2\n\nSample Output 3\n\n1067", "sample_input": "3 3 10\n60 2 2 4\n70 8 7 9\n50 2 3 9\n"}, "reference_outputs": ["120\n"], "source_document_id": "p02683", "source_text": "Score : 300 points\n\nProblem\n\nTakahashi, who is a novice in competitive programming, wants to learn M algorithms.\nInitially, his understanding level of each of the M algorithms is 0.\n\nTakahashi is visiting a bookstore, where he finds N books on algorithms.\nThe i-th book (1\\leq i\\leq N) is sold for C_i yen (the currency of Japan). If he buys and reads it, his understanding level of the j-th algorithm will increase by A_{i,j} for each j (1\\leq j\\leq M).\nThere is no other way to increase the understanding levels of the algorithms.\n\nTakahashi's objective is to make his understanding levels of all the M algorithms X or higher. Determine whether this objective is achievable. If it is achievable, find the minimum amount of money needed to achieve it.\n\nConstraints\n\nAll values in input are integers.\n\n1\\leq N, M\\leq 12\n\n1\\leq X\\leq 10^5\n\n1\\leq C_i \\leq 10^5\n\n0\\leq A_{i, j} \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X\nC_1 A_{1,1} A_{1,2} \\cdots A_{1,M}\nC_2 A_{2,1} A_{2,2} \\cdots A_{2,M}\n\\vdots\nC_N A_{N,1} A_{N,2} \\cdots A_{N,M}\n\nOutput\n\nIf the objective is not achievable, print -1; otherwise, print the minimum amount of money needed to achieve it.\n\nSample Input 1\n\n3 3 10\n60 2 2 4\n70 8 7 9\n50 2 3 9\n\nSample Output 1\n\n120\n\nBuying the second and third books makes his understanding levels of all the algorithms 10 or higher, at the minimum cost possible.\n\nSample Input 2\n\n3 3 10\n100 3 1 4\n100 1 5 9\n100 2 6 5\n\nSample Output 2\n\n-1\n\nBuying all the books is still not enough to make his understanding levels of all the algorithms 10 or higher.\n\nSample Input 3\n\n8 5 22\n100 3 7 5 3 1\n164 4 5 2 7 8\n334 7 2 7 2 9\n234 4 7 2 8 2\n541 5 4 3 3 6\n235 4 8 6 9 7\n394 3 6 1 6 2\n872 8 4 3 7 2\n\nSample Output 3\n\n1067", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 773, "cpu_time_ms": 13, "memory_kb": 2764}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s250362752", "group_id": "codeNet:p02685", "input_text": "local mod = 998244353\nlocal mfl = math.floor\nlocal function bmul(x, y)\n local x0, y0 = x % 31596, y % 31596\n local x1, y1 = mfl(x / 31596), mfl(y / 31596)\n return (x1 * y1 * 62863 + (x1 * y0 + x0 * y1) * 31596 + x0 * y0) % mod\nend\n\nlocal function badd(x, y)\n return (x + y) % mod\nend\n\nlocal function bsub(x, y)\n return x < y and x - y + mod or x - y\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\n\nlocal fact = {1}\nlocal invs = {1}\nlocal invfact = {1}\nfor i = 2, 201000 do\n fact[i] = bmul(fact[i - 1], i)\n invs[i] = bmul(mfl(mod / i), mod - invs[mod % i])\n invfact[i] = bmul(invfact[i - 1], invs[i])\nend\n\nlocal function getComb(n, k)\n if k == 0 or k == n then return 1 end\n return bmul(fact[n], bmul(invfact[k], invfact[n - k]))\nend\n\nlocal ret = 0\nlocal n, m, k = io.read(\"*n\", \"*n\", \"*n\")\nif m == 1 then\n if k == n - 1 then\n print(1)\n else\n print(0)\n end\n os.exit()\nend\nfor i = 0, k do\n local sep_num = n - 1 - i\n local rem = i--n - sep_num - 1\n local comb = getComb(sep_num + rem, rem)\n local mul = 1\n mul = bmul(m, modpow(m - 1, n - 1 - i))\n ret = badd(ret, bmul(mul, comb))\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1589160654, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02685.html", "problem_id": "p02685", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02685/input.txt", "sample_output_relpath": "derived/input_output/data/p02685/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02685/Lua/s250362752.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s250362752", "user_id": "u120582723"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "local mod = 998244353\nlocal mfl = math.floor\nlocal function bmul(x, y)\n local x0, y0 = x % 31596, y % 31596\n local x1, y1 = mfl(x / 31596), mfl(y / 31596)\n return (x1 * y1 * 62863 + (x1 * y0 + x0 * y1) * 31596 + x0 * y0) % mod\nend\n\nlocal function badd(x, y)\n return (x + y) % mod\nend\n\nlocal function bsub(x, y)\n return x < y and x - y + mod or x - y\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\n\nlocal fact = {1}\nlocal invs = {1}\nlocal invfact = {1}\nfor i = 2, 201000 do\n fact[i] = bmul(fact[i - 1], i)\n invs[i] = bmul(mfl(mod / i), mod - invs[mod % i])\n invfact[i] = bmul(invfact[i - 1], invs[i])\nend\n\nlocal function getComb(n, k)\n if k == 0 or k == n then return 1 end\n return bmul(fact[n], bmul(invfact[k], invfact[n - k]))\nend\n\nlocal ret = 0\nlocal n, m, k = io.read(\"*n\", \"*n\", \"*n\")\nif m == 1 then\n if k == n - 1 then\n print(1)\n else\n print(0)\n end\n os.exit()\nend\nfor i = 0, k do\n local sep_num = n - 1 - i\n local rem = i--n - sep_num - 1\n local comb = getComb(sep_num + rem, rem)\n local mul = 1\n mul = bmul(m, modpow(m - 1, n - 1 - i))\n ret = badd(ret, bmul(mul, comb))\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N blocks arranged in a row. Let us paint these blocks.\n\nWe will consider two ways to paint the blocks different if and only if there is a block painted in different colors in those two ways.\n\nFind the number of ways to paint the blocks under the following conditions:\n\nFor each block, use one of the M colors, Color 1 through Color M, to paint it. It is not mandatory to use all the colors.\n\nThere may be at most K pairs of adjacent blocks that are painted in the same color.\n\nSince the count may be enormous, print it modulo 998244353.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 2 \\times 10^5\n\n0 \\leq K \\leq N - 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2 1\n\nSample Output 1\n\n6\n\nThe following ways to paint the blocks satisfy the conditions: 112, 121, 122, 211, 212, and 221. Here, digits represent the colors of the blocks.\n\nSample Input 2\n\n100 100 0\n\nSample Output 2\n\n73074801\n\nSample Input 3\n\n60522 114575 7559\n\nSample Output 3\n\n479519525", "sample_input": "3 2 1\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02685", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N blocks arranged in a row. Let us paint these blocks.\n\nWe will consider two ways to paint the blocks different if and only if there is a block painted in different colors in those two ways.\n\nFind the number of ways to paint the blocks under the following conditions:\n\nFor each block, use one of the M colors, Color 1 through Color M, to paint it. It is not mandatory to use all the colors.\n\nThere may be at most K pairs of adjacent blocks that are painted in the same color.\n\nSince the count may be enormous, print it modulo 998244353.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 2 \\times 10^5\n\n0 \\leq K \\leq N - 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2 1\n\nSample Output 1\n\n6\n\nThe following ways to paint the blocks satisfy the conditions: 112, 121, 122, 211, 212, and 221. Here, digits represent the colors of the blocks.\n\nSample Input 2\n\n100 100 0\n\nSample Output 2\n\n73074801\n\nSample Input 3\n\n60522 114575 7559\n\nSample Output 3\n\n479519525", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 123, "memory_kb": 9208}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s509553522", "group_id": "codeNet:p02686", "input_text": "N=io.read\"*n\"\nio.read()\nS={}\nfor i=1,N do table.insert(S,io.read())end\n\nlocal ls=string.byte\"(\"\nlocal rs=string.byte\")\"\n\nlocal lr={}\n\nfor i,s in ipairs(S)do\n\tlocal n\n\trepeat\n\t\ts,n=s:gsub(\"%(%)\",\"\")\n\tuntil(n==0)\n\tlocal l,r=s:match(\"%)*()%(*()\")\n\tr=r-l\n\tl=l-1\n\t--[[\n\tlocal b={s:byte(1,#s)}\n\tlocal l,r=0,0\n\tfor j,v in ipairs(b) do\n\t\tif(v==ls)then\n\t\t\tr=r+1\n\t\telse\n\t\t\tif(r>0)then r=r-1\n\t\t\telse l=l+1 end\n\t\tend\n\tend\n\t]]\n\tif(l~=0 or r~=0)then table.insert(lr,{l,r})end\nend\n\nif(#lr==0)then print\"Yes\"return end\n\ndo\nlocal s=0\nfor _,v in ipairs(lr)do\n\ts=s+v[1]-v[2]\nend\nif(s~=0)then print\"No\"return end\nend\n\nlocal bl,br=-1,-1\nfor i,v in ipairs(lr)do\n\tif(v[1]==0)then bl=i end\n\tif(v[2]==0)then br=i end\nend\nif(bl==-1 or br==-1)then print\"No\"return end\n\nlocal s=lr[bl][2]\ntable.remove(lr,math.max(bl,br))\ntable.remove(lr,math.min(bl,br))\ntable.sort(lr,function(a,b)return a[1]-a[2]0)then r=r-1\n\t\t\telse l=l+1 end\n\t\tend\n\tend\n\t]]\n\tif(l~=0 or r~=0)then table.insert(lr,{l,r})end\nend\n\nif(#lr==0)then print\"Yes\"return end\n\ndo\nlocal s=0\nfor _,v in ipairs(lr)do\n\ts=s+v[1]-v[2]\nend\nif(s~=0)then print\"No\"return end\nend\n\nlocal bl,br=-1,-1\nfor i,v in ipairs(lr)do\n\tif(v[1]==0)then bl=i end\n\tif(v[2]==0)then br=i end\nend\nif(bl==-1 or br==-1)then print\"No\"return end\n\nlocal s=lr[bl][2]\ntable.remove(lr,math.max(bl,br))\ntable.remove(lr,math.min(bl,br))\ntable.sort(lr,function(a,b)return a[1]-a[2] b[1]\nend\ntable.sort(up, sort1)\ntable.sort(down, sort2)\nlocal cur = 0\nlocal valid = true\nfor i = 1, n do\n local dec, tot = 0, 0\n if i <= #up then\n dec, tot = up[i][1], up[i][2]\n else\n local p = i - #up\n dec, tot = down[p][1], down[p][2]\n end\n if cur - dec < 0 then\n valid = false\n break\n end\n cur = cur + tot\n if cur < 0 then valid = false break end\nend\nif valid then\n valid = cur == 0\nend\n-- valid = valid and cur == 0\nprint(valid and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1589163531, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02686.html", "problem_id": "p02686", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02686/input.txt", "sample_output_relpath": "derived/input_output/data/p02686/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02686/Lua/s030329072.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s030329072", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal n = io.read(\"*n\", \"*l\")\nlocal up, down = {}, {}\nfor i = 1, n do\n local s = io.read()\n local cur = 0\n local min = 0\n for j = 1, #s do\n if s:sub(j, j) == \"(\" then\n cur = cur + 1\n else\n cur = cur - 1\n end\n min = mmi(min, cur)\n end\n local dec = -min\n if 0 <= cur then\n table.insert(up, {dec, cur})\n else\n table.insert(down, {dec, cur})\n end\nend\n\nlocal function sort1(a, b)\n return a[1] < b[1]\nend\nlocal function sort2(a, b)\n return a[1] > b[1]\nend\ntable.sort(up, sort1)\ntable.sort(down, sort2)\nlocal cur = 0\nlocal valid = true\nfor i = 1, n do\n local dec, tot = 0, 0\n if i <= #up then\n dec, tot = up[i][1], up[i][2]\n else\n local p = i - #up\n dec, tot = down[p][1], down[p][2]\n end\n if cur - dec < 0 then\n valid = false\n break\n end\n cur = cur + tot\n if cur < 0 then valid = false break end\nend\nif valid then\n valid = cur == 0\nend\n-- valid = valid and cur == 0\nprint(valid and \"Yes\" or \"No\")\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nA bracket sequence is a string that is one of the following:\n\nAn empty string;\n\nThe concatenation of (, A, and ) in this order, for some bracket sequence A ;\n\nThe concatenation of A and B in this order, for some non-empty bracket sequences A and B /\n\nGiven are N strings S_i. Can a bracket sequence be formed by concatenating all the N strings in some order?\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nThe total length of the strings S_i is at most 10^6.\n\nS_i is a non-empty string consisting of ( and ).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nIf a bracket sequence can be formed by concatenating all the N strings in some order, print Yes; otherwise, print No.\n\nSample Input 1\n\n2\n)\n(()\n\nSample Output 1\n\nYes\n\nConcatenating (() and ) in this order forms a bracket sequence.\n\nSample Input 2\n\n2\n)(\n()\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n4\n((()))\n((((((\n))))))\n()()()\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n3\n(((\n)\n)\n\nSample Output 4\n\nNo", "sample_input": "2\n)\n(()\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02686", "source_text": "Score : 600 points\n\nProblem Statement\n\nA bracket sequence is a string that is one of the following:\n\nAn empty string;\n\nThe concatenation of (, A, and ) in this order, for some bracket sequence A ;\n\nThe concatenation of A and B in this order, for some non-empty bracket sequences A and B /\n\nGiven are N strings S_i. Can a bracket sequence be formed by concatenating all the N strings in some order?\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nThe total length of the strings S_i is at most 10^6.\n\nS_i is a non-empty string consisting of ( and ).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nIf a bracket sequence can be formed by concatenating all the N strings in some order, print Yes; otherwise, print No.\n\nSample Input 1\n\n2\n)\n(()\n\nSample Output 1\n\nYes\n\nConcatenating (() and ) in this order forms a bracket sequence.\n\nSample Input 2\n\n2\n)(\n()\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n4\n((()))\n((((((\n))))))\n()()()\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n3\n(((\n)\n)\n\nSample Output 4\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 990, "cpu_time_ms": 1286, "memory_kb": 73100}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s399194580", "group_id": "codeNet:p02686", "input_text": "local mmi, mma = math.min, math.max\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = {}\nlocal t = {}\nfor i = 1, n do\n s[i] = io.read()\n local cur = 0\n local min = 0\n for j = 1, #s[i] do\n if s[i]:sub(j, j) == \"(\" then\n cur = cur + 1\n else\n cur = cur - 1\n end\n min = mmi(min, cur)\n end\n t[i] = {min, cur}\nend\n\nlocal function sortfunc(a, b)\n if 0 < a[2] and 0 < b[2] then\n return a[1] > b[1]\n elseif a[2] <= 0 and b[2] <= 0 then\n return a[1] < b[1]\n else\n return a[2] > b[2]\n end\nend\ntable.sort(t, sortfunc)\n-- for i = 1, n do\n-- print(i, t[i][1], t[i][2])\n-- end\nlocal cur = 0\nlocal valid = true\nfor i = 1, n do\n local min, last = t[i][1], t[i][2]\n if cur + min < 0 then\n valid = false\n break\n end\n cur = cur + last\nend\nvalid = valid and cur == 0\nprint(valid and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1589162753, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02686.html", "problem_id": "p02686", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02686/input.txt", "sample_output_relpath": "derived/input_output/data/p02686/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02686/Lua/s399194580.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s399194580", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = {}\nlocal t = {}\nfor i = 1, n do\n s[i] = io.read()\n local cur = 0\n local min = 0\n for j = 1, #s[i] do\n if s[i]:sub(j, j) == \"(\" then\n cur = cur + 1\n else\n cur = cur - 1\n end\n min = mmi(min, cur)\n end\n t[i] = {min, cur}\nend\n\nlocal function sortfunc(a, b)\n if 0 < a[2] and 0 < b[2] then\n return a[1] > b[1]\n elseif a[2] <= 0 and b[2] <= 0 then\n return a[1] < b[1]\n else\n return a[2] > b[2]\n end\nend\ntable.sort(t, sortfunc)\n-- for i = 1, n do\n-- print(i, t[i][1], t[i][2])\n-- end\nlocal cur = 0\nlocal valid = true\nfor i = 1, n do\n local min, last = t[i][1], t[i][2]\n if cur + min < 0 then\n valid = false\n break\n end\n cur = cur + last\nend\nvalid = valid and cur == 0\nprint(valid and \"Yes\" or \"No\")\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nA bracket sequence is a string that is one of the following:\n\nAn empty string;\n\nThe concatenation of (, A, and ) in this order, for some bracket sequence A ;\n\nThe concatenation of A and B in this order, for some non-empty bracket sequences A and B /\n\nGiven are N strings S_i. Can a bracket sequence be formed by concatenating all the N strings in some order?\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nThe total length of the strings S_i is at most 10^6.\n\nS_i is a non-empty string consisting of ( and ).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nIf a bracket sequence can be formed by concatenating all the N strings in some order, print Yes; otherwise, print No.\n\nSample Input 1\n\n2\n)\n(()\n\nSample Output 1\n\nYes\n\nConcatenating (() and ) in this order forms a bracket sequence.\n\nSample Input 2\n\n2\n)(\n()\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n4\n((()))\n((((((\n))))))\n()()()\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n3\n(((\n)\n)\n\nSample Output 4\n\nNo", "sample_input": "2\n)\n(()\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02686", "source_text": "Score : 600 points\n\nProblem Statement\n\nA bracket sequence is a string that is one of the following:\n\nAn empty string;\n\nThe concatenation of (, A, and ) in this order, for some bracket sequence A ;\n\nThe concatenation of A and B in this order, for some non-empty bracket sequences A and B /\n\nGiven are N strings S_i. Can a bracket sequence be formed by concatenating all the N strings in some order?\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nThe total length of the strings S_i is at most 10^6.\n\nS_i is a non-empty string consisting of ( and ).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nIf a bracket sequence can be formed by concatenating all the N strings in some order, print Yes; otherwise, print No.\n\nSample Input 1\n\n2\n)\n(()\n\nSample Output 1\n\nYes\n\nConcatenating (() and ) in this order forms a bracket sequence.\n\nSample Input 2\n\n2\n)(\n()\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n4\n((()))\n((((((\n))))))\n()()()\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n3\n(((\n)\n)\n\nSample Output 4\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1130, "memory_kb": 81436}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s104032783", "group_id": "codeNet:p02686", "input_text": "local mmi, mma = math.min, math.max\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = {}\nlocal t = {}\nlocal up, down = {}, {}\nfor i = 1, n do\n s[i] = io.read()\n local cur = 0\n local min = 0\n for j = 1, #s[i] do\n if s[i]:sub(j, j) == \"(\" then\n cur = cur + 1\n else\n cur = cur - 1\n end\n min = mmi(min, cur)\n end\n t[i] = {min, cur}\n -- if 0 <= cur then\n -- table.insert(up, {min, cur})\n -- else\n -- table.insert(down, {min, cur})\n -- end\nend\n\nlocal function sortfunc(a, b)\n if 0 <= a[2] and 0 <= b[2] then\n return a[1] > b[1]\n elseif a[2] < 0 and b[2] < 0 then\n return a[1] < b[1]\n else\n return a[2] > b[2]\n end\nend\ntable.sort(t, sortfunc)\nlocal cur = 0\nlocal valid = true\nfor i = 1, n do\n local min, last = t[i][1], t[i][2]\n if cur + min < 0 then\n valid = false\n break\n end\n cur = cur + last\nend\nvalid = valid and cur == 0\nprint(valid and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1589161512, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02686.html", "problem_id": "p02686", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02686/input.txt", "sample_output_relpath": "derived/input_output/data/p02686/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02686/Lua/s104032783.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s104032783", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = {}\nlocal t = {}\nlocal up, down = {}, {}\nfor i = 1, n do\n s[i] = io.read()\n local cur = 0\n local min = 0\n for j = 1, #s[i] do\n if s[i]:sub(j, j) == \"(\" then\n cur = cur + 1\n else\n cur = cur - 1\n end\n min = mmi(min, cur)\n end\n t[i] = {min, cur}\n -- if 0 <= cur then\n -- table.insert(up, {min, cur})\n -- else\n -- table.insert(down, {min, cur})\n -- end\nend\n\nlocal function sortfunc(a, b)\n if 0 <= a[2] and 0 <= b[2] then\n return a[1] > b[1]\n elseif a[2] < 0 and b[2] < 0 then\n return a[1] < b[1]\n else\n return a[2] > b[2]\n end\nend\ntable.sort(t, sortfunc)\nlocal cur = 0\nlocal valid = true\nfor i = 1, n do\n local min, last = t[i][1], t[i][2]\n if cur + min < 0 then\n valid = false\n break\n end\n cur = cur + last\nend\nvalid = valid and cur == 0\nprint(valid and \"Yes\" or \"No\")\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nA bracket sequence is a string that is one of the following:\n\nAn empty string;\n\nThe concatenation of (, A, and ) in this order, for some bracket sequence A ;\n\nThe concatenation of A and B in this order, for some non-empty bracket sequences A and B /\n\nGiven are N strings S_i. Can a bracket sequence be formed by concatenating all the N strings in some order?\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nThe total length of the strings S_i is at most 10^6.\n\nS_i is a non-empty string consisting of ( and ).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nIf a bracket sequence can be formed by concatenating all the N strings in some order, print Yes; otherwise, print No.\n\nSample Input 1\n\n2\n)\n(()\n\nSample Output 1\n\nYes\n\nConcatenating (() and ) in this order forms a bracket sequence.\n\nSample Input 2\n\n2\n)(\n()\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n4\n((()))\n((((((\n))))))\n()()()\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n3\n(((\n)\n)\n\nSample Output 4\n\nNo", "sample_input": "2\n)\n(()\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02686", "source_text": "Score : 600 points\n\nProblem Statement\n\nA bracket sequence is a string that is one of the following:\n\nAn empty string;\n\nThe concatenation of (, A, and ) in this order, for some bracket sequence A ;\n\nThe concatenation of A and B in this order, for some non-empty bracket sequences A and B /\n\nGiven are N strings S_i. Can a bracket sequence be formed by concatenating all the N strings in some order?\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nThe total length of the strings S_i is at most 10^6.\n\nS_i is a non-empty string consisting of ( and ).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nIf a bracket sequence can be formed by concatenating all the N strings in some order, print Yes; otherwise, print No.\n\nSample Input 1\n\n2\n)\n(()\n\nSample Output 1\n\nYes\n\nConcatenating (() and ) in this order forms a bracket sequence.\n\nSample Input 2\n\n2\n)(\n()\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n4\n((()))\n((((((\n))))))\n()()()\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n3\n(((\n)\n)\n\nSample Output 4\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1169, "memory_kb": 81524}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s479559814", "group_id": "codeNet:p02687", "input_text": "S = io.read()\n\nif S == \"ABC\" then\n\tprint(\"ARC\")\nelse\n\tprint(\"ABC\")\nend\n", "language": "Lua", "metadata": {"date": 1588876077, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s479559814.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s479559814", "user_id": "u903281638"}, "prompt_components": {"gold_output": "ARC\n", "input_to_evaluate": "S = io.read()\n\nif S == \"ABC\" then\n\tprint(\"ARC\")\nelse\n\tprint(\"ABC\")\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoder Inc. holds a contest every Saturday.\n\nThere are two types of contests called ABC and ARC, and just one of them is held at a time.\n\nThe company holds these two types of contests alternately: an ARC follows an ABC and vice versa.\n\nGiven a string S representing the type of the contest held last week, print the string representing the type of the contest held this week.\n\nConstraints\n\nS is ABC or ARC.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the string representing the type of the contest held this week.\n\nSample Input 1\n\nABC\n\nSample Output 1\n\nARC\n\nThey held an ABC last week, so they will hold an ARC this week.", "sample_input": "ABC\n"}, "reference_outputs": ["ARC\n"], "source_document_id": "p02687", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoder Inc. holds a contest every Saturday.\n\nThere are two types of contests called ABC and ARC, and just one of them is held at a time.\n\nThe company holds these two types of contests alternately: an ARC follows an ABC and vice versa.\n\nGiven a string S representing the type of the contest held last week, print the string representing the type of the contest held this week.\n\nConstraints\n\nS is ABC or ARC.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the string representing the type of the contest held this week.\n\nSample Input 1\n\nABC\n\nSample Output 1\n\nARC\n\nThey held an ABC last week, so they will hold an ARC this week.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 2588}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s384466279", "group_id": "codeNet:p02687", "input_text": "print(({ABC=\"ARC\",ARC=\"ABC\"})[io.read()])", "language": "Lua", "metadata": {"date": 1588554064, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s384466279.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s384466279", "user_id": "u726173718"}, "prompt_components": {"gold_output": "ARC\n", "input_to_evaluate": "print(({ABC=\"ARC\",ARC=\"ABC\"})[io.read()])", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 41, "cpu_time_ms": 2, "memory_kb": 2532}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s600337748", "group_id": "codeNet:p02688", "input_text": "local N, K = io.read(\"*n\", \"*n\")\nlocal tricked = {}\nfor i = 1, N do\n\ttricked[i] = true\nend\n\nfor i = 1, K do\n\tlocal d = io.read(\"*n\")\n\tfor j = 1, d do\n\t\ttricked[io.read(\"*n\")] = false\n\tend\nend\n\nlocal count = 0\nfor i = 1, N do\n\tif tricked[i] then\n\t\tcount = count + 1\n\tend\nend\n\nprint(count)", "language": "Lua", "metadata": {"date": 1588555242, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s600337748.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s600337748", "user_id": "u793881115"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local N, K = io.read(\"*n\", \"*n\")\nlocal tricked = {}\nfor i = 1, N do\n\ttricked[i] = true\nend\n\nfor i = 1, K do\n\tlocal d = io.read(\"*n\")\n\tfor j = 1, d do\n\t\ttricked[io.read(\"*n\")] = false\n\tend\nend\n\nlocal count = 0\nfor i = 1, N do\n\tif tricked[i] then\n\t\tcount = count + 1\n\tend\nend\n\nprint(count)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 2728}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s649120096", "group_id": "codeNet:p02688", "input_text": "N=io.read\"*n\"\nK=io.read\"*n\"\n\na={}\nfor i=1,K do\n\td=io.read\"*n\"\n\tfor i=1,d do\n\t\ta[io.read\"*n\"]=0\n\tend\nend\ns=0\nfor i=1,N do\n\tif not(a[i])then s=s+1 end\nend\nprint(s)", "language": "Lua", "metadata": {"date": 1588554238, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s649120096.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s649120096", "user_id": "u726173718"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "N=io.read\"*n\"\nK=io.read\"*n\"\n\na={}\nfor i=1,K do\n\td=io.read\"*n\"\n\tfor i=1,d do\n\t\ta[io.read\"*n\"]=0\n\tend\nend\ns=0\nfor i=1,N do\n\tif not(a[i])then s=s+1 end\nend\nprint(s)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 161, "cpu_time_ms": 5, "memory_kb": 2728}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s016111616", "group_id": "codeNet:p02689", "input_text": "n,m=io.read(\"*n\",\"*n\",\"*l\")\nh={}\nt={}\nfor i=1,n do\n h[i]=io.read(\"*n\")\n t[i]=0\nend\nfor i=1,m do\n a,b=io.read(\"*n\",\"*n\")\n if h[a]>h[b] then\n t[a]=1\n t[b]=0\n else\n t[a]=0\n t[b]=1\n end\nend\n\ncounter=0\nfor i=1,n do\n counter=counter+t[i]\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1588637891, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s016111616.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s016111616", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "n,m=io.read(\"*n\",\"*n\",\"*l\")\nh={}\nt={}\nfor i=1,n do\n h[i]=io.read(\"*n\")\n t[i]=0\nend\nfor i=1,m do\n a,b=io.read(\"*n\",\"*n\")\n if h[a]>h[b] then\n t[a]=1\n t[b]=0\n else\n t[a]=0\n t[b]=1\n end\nend\n\ncounter=0\nfor i=1,n do\n counter=counter+t[i]\nend\nprint(counter)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 299, "cpu_time_ms": 73, "memory_kb": 6348}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s217252269", "group_id": "codeNet:p02689", "input_text": "local N, M = io.read(\"*n\", \"*n\")\nlocal hights, is_good = {}, {}\nfor i = 1, N do\n\thights[i] = io.read(\"*n\")\n\tis_good[i] = true\nend\n\nfor i = 1, M do\n\tlocal A, B = io.read(\"*n\", \"*n\")\n\n\tif is_good[A] and hights[A] <= hights[B] then\n\t\tis_good[A] = false\n\tend\n\tif is_good[B] and hights[B] <= hights[A] then\n\t\tis_good[B] = false\n\tend\nend\n\n\nlocal count = 0\nfor i = 1, N do\n\tif is_good[i] then\n\t\tcount = count + 1\n\tend\n\tprint(is_good[i])\nend\n\nprint(count)", "language": "Lua", "metadata": {"date": 1588556554, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s217252269.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s217252269", "user_id": "u793881115"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local N, M = io.read(\"*n\", \"*n\")\nlocal hights, is_good = {}, {}\nfor i = 1, N do\n\thights[i] = io.read(\"*n\")\n\tis_good[i] = true\nend\n\nfor i = 1, M do\n\tlocal A, B = io.read(\"*n\", \"*n\")\n\n\tif is_good[A] and hights[A] <= hights[B] then\n\t\tis_good[A] = false\n\tend\n\tif is_good[B] and hights[B] <= hights[A] then\n\t\tis_good[B] = false\n\tend\nend\n\n\nlocal count = 0\nfor i = 1, N do\n\tif is_good[i] then\n\t\tcount = count + 1\n\tend\n\tprint(is_good[i])\nend\n\nprint(count)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 447, "cpu_time_ms": 72, "memory_kb": 4896}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s753118277", "group_id": "codeNet:p02690", "input_text": "X=io.read\"*n\"\nfor i=-6208,6208 do\nfor j=-6208,6208 do\n\tif(i*i*i*i*i-j*j*j*j*j==X)then print(i,j)return end\nend\nend\n", "language": "Lua", "metadata": {"date": 1588555406, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s753118277.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s753118277", "user_id": "u726173718"}, "prompt_components": {"gold_output": "2 -1\n", "input_to_evaluate": "X=io.read\"*n\"\nfor i=-6208,6208 do\nfor j=-6208,6208 do\n\tif(i*i*i*i*i-j*j*j*j*j==X)then print(i,j)return end\nend\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 115, "cpu_time_ms": 110, "memory_kb": 2708}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s200380731", "group_id": "codeNet:p02691", "input_text": "n=io.read(\"*n\",\"*l\")\nm={}\ncombination=0\nfor i=1,n do\n a=io.read(\"*n\")\n if not m[i+a] then\n m[i+a]=0\n end\n if m[i-a] then\n combination=combination+m[i-a]\n end\n m[i+a]=m[i+a]+1\nend\nprint(combination)", "language": "Lua", "metadata": {"date": 1588653400, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02691.html", "problem_id": "p02691", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02691/input.txt", "sample_output_relpath": "derived/input_output/data/p02691/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02691/Lua/s200380731.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s200380731", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "n=io.read(\"*n\",\"*l\")\nm={}\ncombination=0\nfor i=1,n do\n a=io.read(\"*n\")\n if not m[i+a] then\n m[i+a]=0\n end\n if m[i-a] then\n combination=combination+m[i-a]\n end\n m[i+a]=m[i+a]+1\nend\nprint(combination)", "problem_context": "Score: 500 points\n\nProblem Statement\n\nYou are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens.\n\nThere are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i.\n\nAccording to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction.\n\nThe absolute difference of their attendee numbers is equal to the sum of their heights.\n\nThere are \\frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above?\n\nP.S.: We cannot let you know the secret.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the number of pairs satisfying the condition.\n\nSample Input 1\n\n6\n2 3 3 1 3 1\n\nSample Output 1\n\n3\n\nA_1 + A_4 = 3, so the pair of Attendee 1 and 4 satisfy the condition.\n\nA_2 + A_6 = 4, so the pair of Attendee 2 and 6 satisfy the condition.\n\nA_4 + A_6 = 2, so the pair of Attendee 4 and 6 satisfy the condition.\n\nNo other pair satisfies the condition, so you should print 3.\n\nSample Input 2\n\n6\n5 2 4 2 8 8\n\nSample Output 2\n\n0\n\nNo pair satisfies the condition, so you should print 0.\n\nSample Input 3\n\n32\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5\n\nSample Output 3\n\n22", "sample_input": "6\n2 3 3 1 3 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02691", "source_text": "Score: 500 points\n\nProblem Statement\n\nYou are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens.\n\nThere are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i.\n\nAccording to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction.\n\nThe absolute difference of their attendee numbers is equal to the sum of their heights.\n\nThere are \\frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above?\n\nP.S.: We cannot let you know the secret.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the number of pairs satisfying the condition.\n\nSample Input 1\n\n6\n2 3 3 1 3 1\n\nSample Output 1\n\n3\n\nA_1 + A_4 = 3, so the pair of Attendee 1 and 4 satisfy the condition.\n\nA_2 + A_6 = 4, so the pair of Attendee 2 and 6 satisfy the condition.\n\nA_4 + A_6 = 2, so the pair of Attendee 4 and 6 satisfy the condition.\n\nNo other pair satisfies the condition, so you should print 3.\n\nSample Input 2\n\n6\n5 2 4 2 8 8\n\nSample Output 2\n\n0\n\nNo pair satisfies the condition, so you should print 0.\n\nSample Input 3\n\n32\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5\n\nSample Output 3\n\n22", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 229, "cpu_time_ms": 71, "memory_kb": 11764}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s015768786", "group_id": "codeNet:p02691", "input_text": "n=io.read(\"*n\",\"*l\")\nm={}\ncombination=0\nfor i=1,n do\n a=io.read(\"*n\")\n combination=combination+m[i-a]\n m[i+a]=m[i+a]+1\nend\nprint(combination)", "language": "Lua", "metadata": {"date": 1588653226, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02691.html", "problem_id": "p02691", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02691/input.txt", "sample_output_relpath": "derived/input_output/data/p02691/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02691/Lua/s015768786.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s015768786", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "n=io.read(\"*n\",\"*l\")\nm={}\ncombination=0\nfor i=1,n do\n a=io.read(\"*n\")\n combination=combination+m[i-a]\n m[i+a]=m[i+a]+1\nend\nprint(combination)", "problem_context": "Score: 500 points\n\nProblem Statement\n\nYou are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens.\n\nThere are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i.\n\nAccording to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction.\n\nThe absolute difference of their attendee numbers is equal to the sum of their heights.\n\nThere are \\frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above?\n\nP.S.: We cannot let you know the secret.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the number of pairs satisfying the condition.\n\nSample Input 1\n\n6\n2 3 3 1 3 1\n\nSample Output 1\n\n3\n\nA_1 + A_4 = 3, so the pair of Attendee 1 and 4 satisfy the condition.\n\nA_2 + A_6 = 4, so the pair of Attendee 2 and 6 satisfy the condition.\n\nA_4 + A_6 = 2, so the pair of Attendee 4 and 6 satisfy the condition.\n\nNo other pair satisfies the condition, so you should print 3.\n\nSample Input 2\n\n6\n5 2 4 2 8 8\n\nSample Output 2\n\n0\n\nNo pair satisfies the condition, so you should print 0.\n\nSample Input 3\n\n32\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5\n\nSample Output 3\n\n22", "sample_input": "6\n2 3 3 1 3 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02691", "source_text": "Score: 500 points\n\nProblem Statement\n\nYou are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens.\n\nThere are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i.\n\nAccording to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction.\n\nThe absolute difference of their attendee numbers is equal to the sum of their heights.\n\nThere are \\frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above?\n\nP.S.: We cannot let you know the secret.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the number of pairs satisfying the condition.\n\nSample Input 1\n\n6\n2 3 3 1 3 1\n\nSample Output 1\n\n3\n\nA_1 + A_4 = 3, so the pair of Attendee 1 and 4 satisfy the condition.\n\nA_2 + A_6 = 4, so the pair of Attendee 2 and 6 satisfy the condition.\n\nA_4 + A_6 = 2, so the pair of Attendee 4 and 6 satisfy the condition.\n\nNo other pair satisfies the condition, so you should print 3.\n\nSample Input 2\n\n6\n5 2 4 2 8 8\n\nSample Output 2\n\n0\n\nNo pair satisfies the condition, so you should print 0.\n\nSample Input 3\n\n32\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5\n\nSample Output 3\n\n22", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 2792}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s138019421", "group_id": "codeNet:p02693", "input_text": "k = io.read(\"*n\")\na, b = io.read(\"*n\", \"*n\")\nfor i = a, b do\n if i % k == 0 then print(\"OK\") os.exit() end\nend\nprint(\"NG\")\n", "language": "Lua", "metadata": {"date": 1589157570, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s138019421.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s138019421", "user_id": "u120582723"}, "prompt_components": {"gold_output": "OK\n", "input_to_evaluate": "k = io.read(\"*n\")\na, b = io.read(\"*n\", \"*n\")\nfor i = a, b do\n if i % k == 0 then print(\"OK\") os.exit() end\nend\nprint(\"NG\")\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2744}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s646138371", "group_id": "codeNet:p02693", "input_text": "local k, a, b = io.read(\"*n\", \"*n\", \"*n\")\nif a % k == 0 then\n print(\"OK\")\nelse\n if b // k == a // k then\n print(\"NG\")\n else\n print(\"OK\")\n end\nend\n", "language": "Lua", "metadata": {"date": 1588468310, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s646138371.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s646138371", "user_id": "u120582723"}, "prompt_components": {"gold_output": "OK\n", "input_to_evaluate": "local k, a, b = io.read(\"*n\", \"*n\", \"*n\")\nif a % k == 0 then\n print(\"OK\")\nelse\n if b // k == a // k then\n print(\"NG\")\n else\n print(\"OK\")\n end\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 156, "cpu_time_ms": 4, "memory_kb": 2648}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s113003494", "group_id": "codeNet:p02694", "input_text": "local x=io.read(\"n\")\nlocal yokin=100\nlocal counter=0\nwhile yokin max then\n\t\tmax = result\n\tend\nend\n\nprint(max)", "language": "Lua", "metadata": {"date": 1588471193, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s657010971.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s657010971", "user_id": "u793881115"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local A, B, N = io.read(\"*n\", \"*n\", \"*n\")\nlocal flo = math.floor\n\nlocal max = 0\nfor x = 1, N do\n\tlocal result = flo(A*x/B) - A * flo(x/B)\n\tif result > max then\n\t\tmax = result\n\tend\nend\n\nprint(max)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2205, "memory_kb": 2700}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s597907804", "group_id": "codeNet:p02697", "input_text": "local min=math.min\nN=io.read\"*n\"\nM=io.read\"*n\"\n\nif(N%2==1)then\n\tfor i=1,M do\n\t\tprint(i,N-i)\n\tend\nelse\n\tif(N%4==2)then\n\t\ta=(N-2)/4\n\t\tfor i=1,min(a,M) do\n\t\t\tprint(i,a+a+2-i)\n\t\tend\n\t\tif(M<=a)then return end\n\t\tM=M-a\n\t\tfor i=1,min(a,M) do\n\t\t\tprint(a+a+1+i,a*4+2-i)\n\t\tend\n\telse\n\t\ta=N/4\n\t\tfor i=1,min(a-1,M) do\n\t\t\tprint(i,a+a-i)\n\t\tend\n\t\tif(M<=a-1)then return end\n\t\tM=M-a+1\n\t\tfor i=1,min(a,M) do\n\t\t\tprint(a+a-1+i,a*4-i)\n\t\tend\n\tend\nend", "language": "Lua", "metadata": {"date": 1589458321, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02697.html", "problem_id": "p02697", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02697/input.txt", "sample_output_relpath": "derived/input_output/data/p02697/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02697/Lua/s597907804.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s597907804", "user_id": "u726173718"}, "prompt_components": {"gold_output": "2 3\n", "input_to_evaluate": "local min=math.min\nN=io.read\"*n\"\nM=io.read\"*n\"\n\nif(N%2==1)then\n\tfor i=1,M do\n\t\tprint(i,N-i)\n\tend\nelse\n\tif(N%4==2)then\n\t\ta=(N-2)/4\n\t\tfor i=1,min(a,M) do\n\t\t\tprint(i,a+a+2-i)\n\t\tend\n\t\tif(M<=a)then return end\n\t\tM=M-a\n\t\tfor i=1,min(a,M) do\n\t\t\tprint(a+a+1+i,a*4+2-i)\n\t\tend\n\telse\n\t\ta=N/4\n\t\tfor i=1,min(a-1,M) do\n\t\t\tprint(i,a+a-i)\n\t\tend\n\t\tif(M<=a-1)then return end\n\t\tM=M-a+1\n\t\tfor i=1,min(a,M) do\n\t\t\tprint(a+a-1+i,a*4-i)\n\t\tend\n\tend\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to hold a competition of one-to-one game called AtCoder Janken. (Janken is the Japanese name for Rock-paper-scissors.)\nN players will participate in this competition, and they are given distinct integers from 1 through N.\nThe arena has M playing fields for two players. You need to assign each playing field two distinct integers between 1 and N (inclusive).\nYou cannot assign the same integer to multiple playing fields.\nThe competition consists of N rounds, each of which proceeds as follows:\n\nFor each player, if there is a playing field that is assigned the player's integer, the player goes to that field and fight the other player who comes there.\n\nThen, each player adds 1 to its integer. If it becomes N+1, change it to 1.\n\nYou want to ensure that no player fights the same opponent more than once during the N rounds.\nPrint an assignment of integers to the playing fields satisfying this condition.\nIt can be proved that such an assignment always exists under the constraints given.\n\nConstraints\n\n1 \\leq M\n\nM \\times 2 +1 \\leq N \\leq 200000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint M lines in the format below.\nThe i-th line should contain the two integers a_i and b_i assigned to the i-th playing field.\n\na_1 b_1\na_2 b_2\n:\na_M b_M\n\nSample Input 1\n\n4 1\n\nSample Output 1\n\n2 3\n\nLet us call the four players A, B, C, and D, and assume that they are initially given the integers 1, 2, 3, and 4, respectively.\n\nThe 1-st round is fought by B and C, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 2, 3, 4, and 1, respectively.\n\nThe 2-nd round is fought by A and B, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 3, 4, 1, and 2, respectively.\n\nThe 3-rd round is fought by D and A, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 4, 1, 2, and 3, respectively.\n\nThe 4-th round is fought by C and D, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 1, 2, 3, and 4, respectively.\n\nNo player fights the same opponent more than once during the four rounds, so this solution will be accepted.\n\nSample Input 2\n\n7 3\n\nSample Output 2\n\n1 6\n2 5\n3 4", "sample_input": "4 1\n"}, "reference_outputs": ["2 3\n"], "source_document_id": "p02697", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to hold a competition of one-to-one game called AtCoder Janken. (Janken is the Japanese name for Rock-paper-scissors.)\nN players will participate in this competition, and they are given distinct integers from 1 through N.\nThe arena has M playing fields for two players. You need to assign each playing field two distinct integers between 1 and N (inclusive).\nYou cannot assign the same integer to multiple playing fields.\nThe competition consists of N rounds, each of which proceeds as follows:\n\nFor each player, if there is a playing field that is assigned the player's integer, the player goes to that field and fight the other player who comes there.\n\nThen, each player adds 1 to its integer. If it becomes N+1, change it to 1.\n\nYou want to ensure that no player fights the same opponent more than once during the N rounds.\nPrint an assignment of integers to the playing fields satisfying this condition.\nIt can be proved that such an assignment always exists under the constraints given.\n\nConstraints\n\n1 \\leq M\n\nM \\times 2 +1 \\leq N \\leq 200000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint M lines in the format below.\nThe i-th line should contain the two integers a_i and b_i assigned to the i-th playing field.\n\na_1 b_1\na_2 b_2\n:\na_M b_M\n\nSample Input 1\n\n4 1\n\nSample Output 1\n\n2 3\n\nLet us call the four players A, B, C, and D, and assume that they are initially given the integers 1, 2, 3, and 4, respectively.\n\nThe 1-st round is fought by B and C, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 2, 3, 4, and 1, respectively.\n\nThe 2-nd round is fought by A and B, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 3, 4, 1, and 2, respectively.\n\nThe 3-rd round is fought by D and A, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 4, 1, 2, and 3, respectively.\n\nThe 4-th round is fought by C and D, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 1, 2, 3, and 4, respectively.\n\nNo player fights the same opponent more than once during the four rounds, so this solution will be accepted.\n\nSample Input 2\n\n7 3\n\nSample Output 2\n\n1 6\n2 5\n3 4", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 426, "cpu_time_ms": 22, "memory_kb": 2760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s415581258", "group_id": "codeNet:p02697", "input_text": "local n, m = io.read(\"*n\", \"*n\")\ndo\n local oddm = m\n if oddm % 2 == 0 then oddm = oddm - 1 end\n local spos = 1\n for i = oddm, 1, -2 do\n print(spos .. \" \" .. spos + i)\n spos = spos + 1\n end\nend\nif 1 < m then\n local evm = m\n if evm % 2 == 1 then evm = evm - 1 end\n local epos = n\n for i = evm, 2, -2 do\n print(epos - i .. \" \" .. epos)\n epos = epos - 1\n end\nend\n", "language": "Lua", "metadata": {"date": 1588470274, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02697.html", "problem_id": "p02697", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02697/input.txt", "sample_output_relpath": "derived/input_output/data/p02697/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02697/Lua/s415581258.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s415581258", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2 3\n", "input_to_evaluate": "local n, m = io.read(\"*n\", \"*n\")\ndo\n local oddm = m\n if oddm % 2 == 0 then oddm = oddm - 1 end\n local spos = 1\n for i = oddm, 1, -2 do\n print(spos .. \" \" .. spos + i)\n spos = spos + 1\n end\nend\nif 1 < m then\n local evm = m\n if evm % 2 == 1 then evm = evm - 1 end\n local epos = n\n for i = evm, 2, -2 do\n print(epos - i .. \" \" .. epos)\n epos = epos - 1\n end\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to hold a competition of one-to-one game called AtCoder Janken. (Janken is the Japanese name for Rock-paper-scissors.)\nN players will participate in this competition, and they are given distinct integers from 1 through N.\nThe arena has M playing fields for two players. You need to assign each playing field two distinct integers between 1 and N (inclusive).\nYou cannot assign the same integer to multiple playing fields.\nThe competition consists of N rounds, each of which proceeds as follows:\n\nFor each player, if there is a playing field that is assigned the player's integer, the player goes to that field and fight the other player who comes there.\n\nThen, each player adds 1 to its integer. If it becomes N+1, change it to 1.\n\nYou want to ensure that no player fights the same opponent more than once during the N rounds.\nPrint an assignment of integers to the playing fields satisfying this condition.\nIt can be proved that such an assignment always exists under the constraints given.\n\nConstraints\n\n1 \\leq M\n\nM \\times 2 +1 \\leq N \\leq 200000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint M lines in the format below.\nThe i-th line should contain the two integers a_i and b_i assigned to the i-th playing field.\n\na_1 b_1\na_2 b_2\n:\na_M b_M\n\nSample Input 1\n\n4 1\n\nSample Output 1\n\n2 3\n\nLet us call the four players A, B, C, and D, and assume that they are initially given the integers 1, 2, 3, and 4, respectively.\n\nThe 1-st round is fought by B and C, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 2, 3, 4, and 1, respectively.\n\nThe 2-nd round is fought by A and B, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 3, 4, 1, and 2, respectively.\n\nThe 3-rd round is fought by D and A, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 4, 1, 2, and 3, respectively.\n\nThe 4-th round is fought by C and D, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 1, 2, 3, and 4, respectively.\n\nNo player fights the same opponent more than once during the four rounds, so this solution will be accepted.\n\nSample Input 2\n\n7 3\n\nSample Output 2\n\n1 6\n2 5\n3 4", "sample_input": "4 1\n"}, "reference_outputs": ["2 3\n"], "source_document_id": "p02697", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to hold a competition of one-to-one game called AtCoder Janken. (Janken is the Japanese name for Rock-paper-scissors.)\nN players will participate in this competition, and they are given distinct integers from 1 through N.\nThe arena has M playing fields for two players. You need to assign each playing field two distinct integers between 1 and N (inclusive).\nYou cannot assign the same integer to multiple playing fields.\nThe competition consists of N rounds, each of which proceeds as follows:\n\nFor each player, if there is a playing field that is assigned the player's integer, the player goes to that field and fight the other player who comes there.\n\nThen, each player adds 1 to its integer. If it becomes N+1, change it to 1.\n\nYou want to ensure that no player fights the same opponent more than once during the N rounds.\nPrint an assignment of integers to the playing fields satisfying this condition.\nIt can be proved that such an assignment always exists under the constraints given.\n\nConstraints\n\n1 \\leq M\n\nM \\times 2 +1 \\leq N \\leq 200000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint M lines in the format below.\nThe i-th line should contain the two integers a_i and b_i assigned to the i-th playing field.\n\na_1 b_1\na_2 b_2\n:\na_M b_M\n\nSample Input 1\n\n4 1\n\nSample Output 1\n\n2 3\n\nLet us call the four players A, B, C, and D, and assume that they are initially given the integers 1, 2, 3, and 4, respectively.\n\nThe 1-st round is fought by B and C, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 2, 3, 4, and 1, respectively.\n\nThe 2-nd round is fought by A and B, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 3, 4, 1, and 2, respectively.\n\nThe 3-rd round is fought by D and A, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 4, 1, 2, and 3, respectively.\n\nThe 4-th round is fought by C and D, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 1, 2, 3, and 4, respectively.\n\nNo player fights the same opponent more than once during the four rounds, so this solution will be accepted.\n\nSample Input 2\n\n7 3\n\nSample Output 2\n\n1 6\n2 5\n3 4", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 381, "cpu_time_ms": 196, "memory_kb": 2924}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s180691623", "group_id": "codeNet:p02699", "input_text": "local S, W = io.read(\"*n\",\"*n\")\n\nprint((S > W) and \"safe\" or \"unsafe\")", "language": "Lua", "metadata": {"date": 1587949471, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s180691623.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s180691623", "user_id": "u793881115"}, "prompt_components": {"gold_output": "unsafe\n", "input_to_evaluate": "local S, W = io.read(\"*n\",\"*n\")\n\nprint((S > W) and \"safe\" or \"unsafe\")", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 70, "cpu_time_ms": 2, "memory_kb": 2740}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s781335979", "group_id": "codeNet:p02699", "input_text": "s, w = io.read(\"*n\", \"*n\")\nprint(s > w and \"safe\" or \"unsafe\")", "language": "Lua", "metadata": {"date": 1587949237, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s781335979.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s781335979", "user_id": "u120582723"}, "prompt_components": {"gold_output": "unsafe\n", "input_to_evaluate": "s, w = io.read(\"*n\", \"*n\")\nprint(s > w and \"safe\" or \"unsafe\")", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 2704}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s565712128", "group_id": "codeNet:p02701", "input_text": "local n=io.read(\"n\")\nio.read()\nlocal smap={}\nfor i=1,n do\n local input=io.read()\n s[input]=(s[input] or 0)+1\nend\n\nlocal counter=0\nfor k,v in pairs(smap) do\n counter=counter+1\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1594175788, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s565712128.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s565712128", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n=io.read(\"n\")\nio.read()\nlocal smap={}\nfor i=1,n do\n local input=io.read()\n s[input]=(s[input] or 0)+1\nend\n\nlocal counter=0\nfor k,v in pairs(smap) do\n counter=counter+1\nend\nprint(counter)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 2708}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s586550248", "group_id": "codeNet:p02701", "input_text": "N=io.read(\"*n\",\"*l\")\nans=1\nL={}\nfor arg in io.read(\"*a\"):gmatch(\"[^%s]+\") do table.insert(L, arg) end\n\ntable.sort(L)\n\nfor i=1,N-1,1 do if L[i]~=L[i+1] then ans=ans+1 end end\n\nprint(ans)", "language": "Lua", "metadata": {"date": 1587955806, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s586550248.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s586550248", "user_id": "u000698877"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "N=io.read(\"*n\",\"*l\")\nans=1\nL={}\nfor arg in io.read(\"*a\"):gmatch(\"[^%s]+\") do table.insert(L, arg) end\n\ntable.sort(L)\n\nfor i=1,N-1,1 do if L[i]~=L[i+1] then ans=ans+1 end end\n\nprint(ans)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 308, "memory_kb": 19892}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s136442023", "group_id": "codeNet:p02701", "input_text": "local function readas(N)local l=io.read()local r={}for s in l:gmatch\"(%a+)\"do table.insert(r,s)end return r end\nN=io.read\"*n\"\nio.read()\nt={}\nfor i=1,N do\n\tt[io.read()]=0\nend\ns=0\nfor _,_ in pairs(t)do s=s+1 end\nprint(s)", "language": "Lua", "metadata": {"date": 1587949566, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s136442023.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s136442023", "user_id": "u726173718"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local function readas(N)local l=io.read()local r={}for s in l:gmatch\"(%a+)\"do table.insert(r,s)end return r end\nN=io.read\"*n\"\nio.read()\nt={}\nfor i=1,N do\n\tt[io.read()]=0\nend\ns=0\nfor _,_ in pairs(t)do s=s+1 end\nprint(s)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 94, "memory_kb": 17820}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s906963147", "group_id": "codeNet:p02704", "input_text": "local function lltonumber(str)\n local ret = 0ULL\n for i = 1, #str do\n ret = ret * 10ULL + (1ULL * str:sub(i, i):byte() - 48ULL)\n end\n return ret\nend\n\nlocal n = io.read(\"*n\")\nlocal s = {}\nfor i = 1, n do\n s[i] = io.read(\"*n\") == 1\nend\nlocal t = {}\nfor i = 1, n do\n t[i] = io.read(\"*n\") == 1\nend\nio.read()\nlocal u = {}\ndo\n local str = io.read()\n local i = 1\n for w in str:gmatch(\"%d+\") do\n u[i] = lltonumber(w)\n i = i + 1\n end\nend\nlocal v = {}\ndo\n local str = io.read()\n local i = 1\n for w in str:gmatch(\"%d+\") do\n v[i] = lltonumber(w)\n i = i + 1\n end\nend\nlocal ret = {}\nfor i = 1, n do\n ret[i] = {}\n for j = 1, n do\n ret[i][j] = 0ULL\n end\nend\nlocal function solveStage(mul)\n local z = {}\n for i = 1, n do\n z[i] = {}\n -- -1: unknown\n for j = 1, n do\n z[i][j] = -1\n end\n end\n local need_0_row = {}\n local need_1_row = {}\n local need_0_col = {}\n local need_1_col = {}\n for i = 1, n do\n -- ROW\n local flag = u[i] % 2ULL == 1ULL\n if s[i] then\n -- OR\n if not flag then\n for j = 1, n do\n if z[i][j] == 1 then\n return false\n end\n z[i][j] = 0\n end\n else\n table.insert(need_1_row, i)\n end\n else\n -- AND\n if flag then\n for j = 1, n do\n if z[i][j] == 0 then\n return false\n end\n z[i][j] = 1\n end\n else\n table.insert(need_0_row, i)\n end\n end\n -- COLUMN\n local flag = v[i] % 2ULL == 1ULL\n if t[i] then\n -- OR\n if not flag then\n for j = 1, n do\n if z[j][i] == 1 then\n return false\n end\n z[j][i] = 0\n end\n else\n table.insert(need_1_col, i)\n end\n else\n -- AND\n if flag then\n for j = 1, n do\n if z[j][i] == 0 then\n return false\n end\n z[j][i] = 1\n end\n else\n table.insert(need_0_col, i)\n end\n end\n end\n -- refresh\n local any = false\n local function flushcol(row)\n for k = #need_0_col, 1, -1 do\n local col = need_0_col[k]\n z[row][col] = 0\n table.remove(need_0_col)\n end\n for k = #need_1_col, 1, -1 do\n local col = need_1_col[k]\n z[row][col] = 1\n table.remove(need_1_col)\n end\n for j = 1, n do\n if z[row][j] == -1 then\n z[row][j] = 0\n end\n end\n any = true\n end\n local function flushrow(col)\n for k = #need_0_row, 1, -1 do\n local row = need_0_row[k]\n z[row][col] = 0\n table.remove(need_0_row)\n end\n for k = #need_1_row, 1, -1 do\n local row = need_1_row[k]\n z[row][col] = 1\n table.remove(need_1_row)\n end\n for j = 1, n do\n if z[j][col] == -1 then\n z[j][col] = 0\n end\n end\n any = true\n end\n for i = #need_0_row, 1, -1 do\n local row = need_0_row[i]\n local found = false\n for j = 1, n do\n if z[row][j] == 0 then\n table.remove(need_0_row, i)\n found = true\n break\n end\n end\n if found then\n flushcol(row)\n end\n end\n for i = #need_1_row, 1, -1 do\n local row = need_1_row[i]\n local found = false\n for j = 1, n do\n if z[row][j] == 1 then\n table.remove(need_1_row, i)\n found = true\n break\n end\n end\n if found then\n flushcol(row)\n end\n end\n for i = #need_0_col, 1, -1 do\n local col = need_0_col[i]\n local found = false\n for j = 1, n do\n if z[j][col] == 0 then\n table.remove(need_0_col, i)\n found = true\n break\n end\n end\n if found then\n flushrow(col)\n end\n end\n for i = #need_1_col, 1, -1 do\n local col = need_1_col[i]\n local found = false\n for j = 1, n do\n if z[j][col] == 1 then\n table.remove(need_1_col, i)\n found = true\n break\n end\n end\n if found then\n flushrow(col)\n end\n end\n local remrow = #need_0_row + #need_1_row\n local remcol = #need_0_col + #need_1_col\n if any then\n for i = 1, #need_0_row do\n local row = need_0_row[i]\n for j = 1, n do\n if z[row][j] == -1 then z[row][j] = 0 end\n end\n end\n for i = 1, #need_1_row do\n local row = need_1_row[i]\n for j = 1, n do\n if z[row][j] == -1 then z[row][j] = 1 end\n end\n end\n for i = 1, #need_0_col do\n local col = need_0_col[i]\n for j = 1, n do\n if z[j][col] == -1 then z[j][col] = 0 end\n end\n end\n for i = 1, #need_1_col do\n local col = need_1_col[i]\n for j = 1, n do\n if z[j][col] == -1 then z[j][col] = 1 end\n end\n end\n elseif remrow == 0 and 0 < remcol then\n return false\n elseif remcol == 0 and 0 < remrow then\n return false\n elseif 0 < remrow and 0 < remcol then\n if #need_0_row == 0 and #need_1_row == 1 then\n if #need_1_col == 0 then\n return false\n end\n local row = need_1_row[1]\n for i = 1, #need_1_col do\n z[row][need_1_col[i]] = 1\n end\n for i = 1, #need_0_col do\n z[row][need_0_col[i]] = 0\n end\n elseif #need_0_row == 1 and #need_1_row == 0 then\n if #need_0_col == 0 then\n return false\n end\n local row = need_0_row[1]\n for i = 1, #need_1_col do\n z[row][need_1_col[i]] = 1\n end\n for i = 1, #need_0_col do\n z[row][need_0_col[i]] = 0\n end\n elseif #need_0_col == 0 and #need_1_col == 1 then\n if #need_1_row == 0 then\n return false\n end\n local col = need_1_col[1]\n for i = 1, #need_1_row do\n z[need_1_row[i]][col] = 1\n end\n for i = 1, #need_0_row do\n z[need_0_row[i]][col] = 0\n end\n elseif #need_0_col == 1 and #need_1_col == 0 then\n if #need_0_row == 0 then\n return false\n end\n local col = need_0_col[1]\n for i = 1, #need_1_row do\n z[need_1_row[i]][col] = 1\n end\n for i = 1, #need_0_row do\n z[need_0_row[i]][col] = 0\n end\n else\n local rows = {}\n local cols = {}\n for i = 1, #need_0_row do\n table.insert(rows, need_0_row[i])\n end\n for i = 1, #need_1_row do\n table.insert(rows, need_1_row[i])\n end\n for i = 1, #need_0_col do\n table.insert(cols, need_0_col[i])\n end\n for i = 1, #need_1_col do\n table.insert(cols, need_1_col[i])\n end\n for i = 1, #rows do\n for j = 1, #cols do\n local r, c = rows[i], cols[j]\n if i * j == 1 then\n z[r][c] = 1\n elseif i == 1 or j == 1 then\n z[r][c] = 0\n else\n z[r][c] = 1\n end\n end\n end\n end\n end\n for i = 1, n do\n for j = 1, n do\n assert(z[i][j] ~= -1)\n if z[i][j] == 1 then\n ret[i][j] = ret[i][j] + mul\n end\n end\n end\n return true\nend\nlocal function reduce()\n for i = 1, n do\n u[i] = u[i] / 2ULL\n v[i] = v[i] / 2ULL\n end\nend\nlocal add = 1ULL\nfor i = 0, 63 do\n local ret = solveStage(add)\n if not ret then\n print(-1)\n os.exit()\n end\n reduce()\n add = add * 2LL\nend\nfor i = 1, n do\n for j = 1, n do\n local str = tostring(ret[i][j]):gsub(\"ULL\", \"\")\n io.write(str)\n io.write(j == n and \"\\n\" or \" \")\n end\nend\n", "language": "Lua", "metadata": {"date": 1587954649, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02704.html", "problem_id": "p02704", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02704/input.txt", "sample_output_relpath": "derived/input_output/data/p02704/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02704/Lua/s906963147.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s906963147", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1 1\n1 0\n", "input_to_evaluate": "local function lltonumber(str)\n local ret = 0ULL\n for i = 1, #str do\n ret = ret * 10ULL + (1ULL * str:sub(i, i):byte() - 48ULL)\n end\n return ret\nend\n\nlocal n = io.read(\"*n\")\nlocal s = {}\nfor i = 1, n do\n s[i] = io.read(\"*n\") == 1\nend\nlocal t = {}\nfor i = 1, n do\n t[i] = io.read(\"*n\") == 1\nend\nio.read()\nlocal u = {}\ndo\n local str = io.read()\n local i = 1\n for w in str:gmatch(\"%d+\") do\n u[i] = lltonumber(w)\n i = i + 1\n end\nend\nlocal v = {}\ndo\n local str = io.read()\n local i = 1\n for w in str:gmatch(\"%d+\") do\n v[i] = lltonumber(w)\n i = i + 1\n end\nend\nlocal ret = {}\nfor i = 1, n do\n ret[i] = {}\n for j = 1, n do\n ret[i][j] = 0ULL\n end\nend\nlocal function solveStage(mul)\n local z = {}\n for i = 1, n do\n z[i] = {}\n -- -1: unknown\n for j = 1, n do\n z[i][j] = -1\n end\n end\n local need_0_row = {}\n local need_1_row = {}\n local need_0_col = {}\n local need_1_col = {}\n for i = 1, n do\n -- ROW\n local flag = u[i] % 2ULL == 1ULL\n if s[i] then\n -- OR\n if not flag then\n for j = 1, n do\n if z[i][j] == 1 then\n return false\n end\n z[i][j] = 0\n end\n else\n table.insert(need_1_row, i)\n end\n else\n -- AND\n if flag then\n for j = 1, n do\n if z[i][j] == 0 then\n return false\n end\n z[i][j] = 1\n end\n else\n table.insert(need_0_row, i)\n end\n end\n -- COLUMN\n local flag = v[i] % 2ULL == 1ULL\n if t[i] then\n -- OR\n if not flag then\n for j = 1, n do\n if z[j][i] == 1 then\n return false\n end\n z[j][i] = 0\n end\n else\n table.insert(need_1_col, i)\n end\n else\n -- AND\n if flag then\n for j = 1, n do\n if z[j][i] == 0 then\n return false\n end\n z[j][i] = 1\n end\n else\n table.insert(need_0_col, i)\n end\n end\n end\n -- refresh\n local any = false\n local function flushcol(row)\n for k = #need_0_col, 1, -1 do\n local col = need_0_col[k]\n z[row][col] = 0\n table.remove(need_0_col)\n end\n for k = #need_1_col, 1, -1 do\n local col = need_1_col[k]\n z[row][col] = 1\n table.remove(need_1_col)\n end\n for j = 1, n do\n if z[row][j] == -1 then\n z[row][j] = 0\n end\n end\n any = true\n end\n local function flushrow(col)\n for k = #need_0_row, 1, -1 do\n local row = need_0_row[k]\n z[row][col] = 0\n table.remove(need_0_row)\n end\n for k = #need_1_row, 1, -1 do\n local row = need_1_row[k]\n z[row][col] = 1\n table.remove(need_1_row)\n end\n for j = 1, n do\n if z[j][col] == -1 then\n z[j][col] = 0\n end\n end\n any = true\n end\n for i = #need_0_row, 1, -1 do\n local row = need_0_row[i]\n local found = false\n for j = 1, n do\n if z[row][j] == 0 then\n table.remove(need_0_row, i)\n found = true\n break\n end\n end\n if found then\n flushcol(row)\n end\n end\n for i = #need_1_row, 1, -1 do\n local row = need_1_row[i]\n local found = false\n for j = 1, n do\n if z[row][j] == 1 then\n table.remove(need_1_row, i)\n found = true\n break\n end\n end\n if found then\n flushcol(row)\n end\n end\n for i = #need_0_col, 1, -1 do\n local col = need_0_col[i]\n local found = false\n for j = 1, n do\n if z[j][col] == 0 then\n table.remove(need_0_col, i)\n found = true\n break\n end\n end\n if found then\n flushrow(col)\n end\n end\n for i = #need_1_col, 1, -1 do\n local col = need_1_col[i]\n local found = false\n for j = 1, n do\n if z[j][col] == 1 then\n table.remove(need_1_col, i)\n found = true\n break\n end\n end\n if found then\n flushrow(col)\n end\n end\n local remrow = #need_0_row + #need_1_row\n local remcol = #need_0_col + #need_1_col\n if any then\n for i = 1, #need_0_row do\n local row = need_0_row[i]\n for j = 1, n do\n if z[row][j] == -1 then z[row][j] = 0 end\n end\n end\n for i = 1, #need_1_row do\n local row = need_1_row[i]\n for j = 1, n do\n if z[row][j] == -1 then z[row][j] = 1 end\n end\n end\n for i = 1, #need_0_col do\n local col = need_0_col[i]\n for j = 1, n do\n if z[j][col] == -1 then z[j][col] = 0 end\n end\n end\n for i = 1, #need_1_col do\n local col = need_1_col[i]\n for j = 1, n do\n if z[j][col] == -1 then z[j][col] = 1 end\n end\n end\n elseif remrow == 0 and 0 < remcol then\n return false\n elseif remcol == 0 and 0 < remrow then\n return false\n elseif 0 < remrow and 0 < remcol then\n if #need_0_row == 0 and #need_1_row == 1 then\n if #need_1_col == 0 then\n return false\n end\n local row = need_1_row[1]\n for i = 1, #need_1_col do\n z[row][need_1_col[i]] = 1\n end\n for i = 1, #need_0_col do\n z[row][need_0_col[i]] = 0\n end\n elseif #need_0_row == 1 and #need_1_row == 0 then\n if #need_0_col == 0 then\n return false\n end\n local row = need_0_row[1]\n for i = 1, #need_1_col do\n z[row][need_1_col[i]] = 1\n end\n for i = 1, #need_0_col do\n z[row][need_0_col[i]] = 0\n end\n elseif #need_0_col == 0 and #need_1_col == 1 then\n if #need_1_row == 0 then\n return false\n end\n local col = need_1_col[1]\n for i = 1, #need_1_row do\n z[need_1_row[i]][col] = 1\n end\n for i = 1, #need_0_row do\n z[need_0_row[i]][col] = 0\n end\n elseif #need_0_col == 1 and #need_1_col == 0 then\n if #need_0_row == 0 then\n return false\n end\n local col = need_0_col[1]\n for i = 1, #need_1_row do\n z[need_1_row[i]][col] = 1\n end\n for i = 1, #need_0_row do\n z[need_0_row[i]][col] = 0\n end\n else\n local rows = {}\n local cols = {}\n for i = 1, #need_0_row do\n table.insert(rows, need_0_row[i])\n end\n for i = 1, #need_1_row do\n table.insert(rows, need_1_row[i])\n end\n for i = 1, #need_0_col do\n table.insert(cols, need_0_col[i])\n end\n for i = 1, #need_1_col do\n table.insert(cols, need_1_col[i])\n end\n for i = 1, #rows do\n for j = 1, #cols do\n local r, c = rows[i], cols[j]\n if i * j == 1 then\n z[r][c] = 1\n elseif i == 1 or j == 1 then\n z[r][c] = 0\n else\n z[r][c] = 1\n end\n end\n end\n end\n end\n for i = 1, n do\n for j = 1, n do\n assert(z[i][j] ~= -1)\n if z[i][j] == 1 then\n ret[i][j] = ret[i][j] + mul\n end\n end\n end\n return true\nend\nlocal function reduce()\n for i = 1, n do\n u[i] = u[i] / 2ULL\n v[i] = v[i] / 2ULL\n end\nend\nlocal add = 1ULL\nfor i = 0, 63 do\n local ret = solveStage(add)\n if not ret then\n print(-1)\n os.exit()\n end\n reduce()\n add = add * 2LL\nend\nfor i = 1, n do\n for j = 1, n do\n local str = tostring(ret[i][j]):gsub(\"ULL\", \"\")\n io.write(str)\n io.write(j == n and \"\\n\" or \" \")\n end\nend\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven are an integer N and arrays S, T, U, and V, each of length N.\nConstruct an N×N matrix a that satisfy the following conditions:\n\na_{i,j} is an integer.\n\n0 \\leq a_{i,j} \\lt 2^{64}.\n\nIf S_{i} = 0, the bitwise AND of the elements in the i-th row is U_{i}.\n\nIf S_{i} = 1, the bitwise OR of the elements in the i-th row is U_{i}.\n\nIf T_{i} = 0, the bitwise AND of the elements in the i-th column is V_{i}.\n\nIf T_{i} = 1, the bitwise OR of the elements in the i-th column is V_{i}.\n\nHowever, there may be cases where no matrix satisfies the conditions.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 500\n\n0 \\leq S_{i} \\leq 1\n\n0 \\leq T_{i} \\leq 1\n\n0 \\leq U_{i} \\lt 2^{64}\n\n0 \\leq V_{i} \\lt 2^{64}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_{1} S_{2} ... S_{N}\nT_{1} T_{2} ... T_{N}\nU_{1} U_{2} ... U_{N}\nV_{1} V_{2} ... V_{N}\n\nOutput\n\nIf there exists a matrix that satisfies the conditions, print one such matrix in the following format:\n\na_{1,1} ... a_{1,N}\n:\na_{N,1} ... a_{N,N}\n\nNote that any matrix satisfying the conditions is accepted.\n\nIf no matrix satisfies the conditions, print -1.\n\nSample Input 1\n\n2\n0 1\n1 0\n1 1\n1 0\n\nSample Output 1\n\n1 1\n1 0\n\nIn Sample Input 1, we need to find a matrix such that:\n\nthe bitwise AND of the elements in the 1-st row is 1;\n\nthe bitwise OR of the elements in the 2-nd row is 1;\n\nthe bitwise OR of the elements in the 1-st column is 1;\n\nthe bitwise AND of the elements in the 2-nd column is 0.\n\nSample Input 2\n\n2\n1 1\n1 0\n15 15\n15 11\n\nSample Output 2\n\n15 11\n15 11", "sample_input": "2\n0 1\n1 0\n1 1\n1 0\n"}, "reference_outputs": ["1 1\n1 0\n"], "source_document_id": "p02704", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven are an integer N and arrays S, T, U, and V, each of length N.\nConstruct an N×N matrix a that satisfy the following conditions:\n\na_{i,j} is an integer.\n\n0 \\leq a_{i,j} \\lt 2^{64}.\n\nIf S_{i} = 0, the bitwise AND of the elements in the i-th row is U_{i}.\n\nIf S_{i} = 1, the bitwise OR of the elements in the i-th row is U_{i}.\n\nIf T_{i} = 0, the bitwise AND of the elements in the i-th column is V_{i}.\n\nIf T_{i} = 1, the bitwise OR of the elements in the i-th column is V_{i}.\n\nHowever, there may be cases where no matrix satisfies the conditions.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 500\n\n0 \\leq S_{i} \\leq 1\n\n0 \\leq T_{i} \\leq 1\n\n0 \\leq U_{i} \\lt 2^{64}\n\n0 \\leq V_{i} \\lt 2^{64}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_{1} S_{2} ... S_{N}\nT_{1} T_{2} ... T_{N}\nU_{1} U_{2} ... U_{N}\nV_{1} V_{2} ... V_{N}\n\nOutput\n\nIf there exists a matrix that satisfies the conditions, print one such matrix in the following format:\n\na_{1,1} ... a_{1,N}\n:\na_{N,1} ... a_{N,N}\n\nNote that any matrix satisfying the conditions is accepted.\n\nIf no matrix satisfies the conditions, print -1.\n\nSample Input 1\n\n2\n0 1\n1 0\n1 1\n1 0\n\nSample Output 1\n\n1 1\n1 0\n\nIn Sample Input 1, we need to find a matrix such that:\n\nthe bitwise AND of the elements in the 1-st row is 1;\n\nthe bitwise OR of the elements in the 2-nd row is 1;\n\nthe bitwise OR of the elements in the 1-st column is 1;\n\nthe bitwise AND of the elements in the 2-nd column is 0.\n\nSample Input 2\n\n2\n1 1\n1 0\n15 15\n15 11\n\nSample Output 2\n\n15 11\n15 11", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7234, "cpu_time_ms": 1495, "memory_kb": 54784}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s482586816", "group_id": "codeNet:p02706", "input_text": "local n, m = io.read(\"*n\", \"*n\")\nfor i = 1, m do\n n = n - io.read(\"*n\")\nend\nprint(n < 0 and -1 or n)\n", "language": "Lua", "metadata": {"date": 1587344652, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s482586816.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s482586816", "user_id": "u120582723"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "local n, m = io.read(\"*n\", \"*n\")\nfor i = 1, m do\n n = n - io.read(\"*n\")\nend\nprint(n < 0 and -1 or 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 2768}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s491813132", "group_id": "codeNet:p02707", "input_text": "n=io.read(\"*n\",\"*l\")\nt={}\nfor i=2,n do\n a=io.read(\"*n\")\n if not t[a] then\n t[a]=1\n else\n t[a]=t[a]+1\n end\nend\n\nfor i=1,n do\n if not t[i] then\n print(0)\n else\n print(t[i])\n end\nend", "language": "Lua", "metadata": {"date": 1588898230, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s491813132.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s491813132", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n2\n0\n0\n0\n", "input_to_evaluate": "n=io.read(\"*n\",\"*l\")\nt={}\nfor i=2,n do\n a=io.read(\"*n\")\n if not t[a] then\n t[a]=1\n else\n t[a]=t[a]+1\n end\nend\n\nfor i=1,n do\n if not t[i] then\n print(0)\n else\n print(t[i])\n end\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 396, "memory_kb": 6340}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s220063224", "group_id": "codeNet:p02708", "input_text": "n,k=io.read(\"*n\",\"*n\")\ncombination=0\nfor i=k,n+1 do\n min=i*(i-1)//2\n max=(2*n-i+1)*i//2\n combination=(combination+(max-min+1))%1000000007\nend\nprint(combination)", "language": "Lua", "metadata": {"date": 1588903595, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s220063224.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s220063224", "user_id": "u045238009"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "n,k=io.read(\"*n\",\"*n\")\ncombination=0\nfor i=k,n+1 do\n min=i*(i-1)//2\n max=(2*n-i+1)*i//2\n combination=(combination+(max-min+1))%1000000007\nend\nprint(combination)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 169, "cpu_time_ms": 34, "memory_kb": 2784}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s670553166", "group_id": "codeNet:p02709", "input_text": "local mmi, mma = math.min, math.max\nlocal mab = math.abs\nlocal n = io.read(\"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = {io.read(\"*n\")}\n t[i][2] = i\nend\ntable.sort(t, function(a, b) return a[1] > b[1] end)\nlocal dp = {}\nfor i = 1, n do\n local val, idx = t[i][1], t[i][2]\n dp[i] = {}\n for j = 1, i + 1 do\n -- j: left use count - 1\n dp[i][j] = 0\n end\n if i == 1 then\n dp[i][1] = val * (n - idx)\n dp[i][2] = val * (idx - 1)\n else\n for j = 1, i do\n -- dst: j\n dp[i][j + 1] = mma(dp[i][j + 1], dp[i - 1][j] + val * mab(idx - j))\n -- dst: n - (i - (j - 1)) + 1\n dp[i][j] = mma(dp[i][j], dp[i - 1][j] + val * mab(n - i + j - idx))\n end\n end\n -- print(table.concat(dp[i], \" \"))\nend\nlocal ret = 0\nfor i = 1, n + 1 do\n ret = mma(ret, dp[n][i])\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1587348101, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s670553166.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s670553166", "user_id": "u120582723"}, "prompt_components": {"gold_output": "20\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal mab = math.abs\nlocal n = io.read(\"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = {io.read(\"*n\")}\n t[i][2] = i\nend\ntable.sort(t, function(a, b) return a[1] > b[1] end)\nlocal dp = {}\nfor i = 1, n do\n local val, idx = t[i][1], t[i][2]\n dp[i] = {}\n for j = 1, i + 1 do\n -- j: left use count - 1\n dp[i][j] = 0\n end\n if i == 1 then\n dp[i][1] = val * (n - idx)\n dp[i][2] = val * (idx - 1)\n else\n for j = 1, i do\n -- dst: j\n dp[i][j + 1] = mma(dp[i][j + 1], dp[i - 1][j] + val * mab(idx - j))\n -- dst: n - (i - (j - 1)) + 1\n dp[i][j] = mma(dp[i][j], dp[i - 1][j] + val * mab(n - i + j - idx))\n end\n end\n -- print(table.concat(dp[i], \" \"))\nend\nlocal ret = 0\nfor i = 1, n + 1 do\n ret = mma(ret, dp[n][i])\nend\nprint(ret)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 603, "memory_kb": 45400}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s592056894", "group_id": "codeNet:p02709", "input_text": "local mmi, mma = math.min, math.max\nlocal mab = math.abs\nlocal n = io.read(\"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = {io.read(\"*n\")}\n t[i][2] = i\nend\ntable.sort(t, function(a, b) return a[1] > b[1] end)\nlocal dp = {}\nfor i = 1, n do\n local val, idx = t[i][1], t[i][2]\n dp[i] = {}\n for j = 1, i + 1 do\n -- j: left use count - 1\n dp[i][j] = 0\n end\n if i == 1 then\n dp[i][1] = val * (n - idx)\n dp[i][2] = val * (idx - 1)\n else\n for j = 1, i do\n -- dst: j\n dp[i][j + 1] = mma(dp[i][j + 1], dp[i - 1][j] + val * mab(idx - j))\n -- dst: n - (i - (j - 1)) + 1\n dp[i][j] = mma(dp[i][j], dp[i - 1][j] + val * mab(n - i + j - idx))\n end\n end\n -- print(table.concat(dp[i], \" \"))\nend\nlocal ret = 0\nfor i = 1, n + 1 do\n ret = mma(ret, dp[n][i])\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1587347196, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s592056894.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s592056894", "user_id": "u120582723"}, "prompt_components": {"gold_output": "20\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal mab = math.abs\nlocal n = io.read(\"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = {io.read(\"*n\")}\n t[i][2] = i\nend\ntable.sort(t, function(a, b) return a[1] > b[1] end)\nlocal dp = {}\nfor i = 1, n do\n local val, idx = t[i][1], t[i][2]\n dp[i] = {}\n for j = 1, i + 1 do\n -- j: left use count - 1\n dp[i][j] = 0\n end\n if i == 1 then\n dp[i][1] = val * (n - idx)\n dp[i][2] = val * (idx - 1)\n else\n for j = 1, i do\n -- dst: j\n dp[i][j + 1] = mma(dp[i][j + 1], dp[i - 1][j] + val * mab(idx - j))\n -- dst: n - (i - (j - 1)) + 1\n dp[i][j] = mma(dp[i][j], dp[i - 1][j] + val * mab(n - i + j - idx))\n end\n end\n -- print(table.concat(dp[i], \" \"))\nend\nlocal ret = 0\nfor i = 1, n + 1 do\n ret = mma(ret, dp[n][i])\nend\nprint(ret)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 46, "memory_kb": 25180}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s491882012", "group_id": "codeNet:p02712", "input_text": "local n = io.read(\"*n\")\nlocal ret = 0\nfor i = 1, n do\n if i % 3 ~= 0 and i % 5 ~= 0 then\n ret = ret + i\n end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1586739705, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s491882012.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s491882012", "user_id": "u120582723"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal ret = 0\nfor i = 1, n do\n if i % 3 ~= 0 and i % 5 ~= 0 then\n ret = ret + i\n end\nend\nprint(ret)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 50, "memory_kb": 2748}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s488196885", "group_id": "codeNet:p02715", "input_text": "local mce, mfl, msq, mmi, mma, mab = math.ceil, math.floor, math.sqrt, math.min, math.max, math.abs\nlocal mod = 1000000007\nlocal function bmul(x, y)\n local x1, y1 = mfl(x / 31623), mfl(y / 31623)\n local x0, y0 = x - x1 * 31623, y - y1 * 31623\n return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod\nend\nlocal function badd(x, y)\n return (x + y) % mod\nend\n\nlocal function bsub(x, y)\n return x < y and x - y + mod or x - y\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal ret = 0\n\nlocal primecnt = {}\nlocal t = {}\nfor i = 1, k do t[i] = 0 end\nfor i = k, 1, -1 do\n local c = mfl(k / i)\n local z = modpow(c, n)\n for j = 2, c do\n z = bsub(z, t[j * i])\n end\n t[i] = z\n ret = badd(ret, bmul(i, z))\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1586745870, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02715.html", "problem_id": "p02715", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02715/input.txt", "sample_output_relpath": "derived/input_output/data/p02715/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02715/Lua/s488196885.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s488196885", "user_id": "u120582723"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "local mce, mfl, msq, mmi, mma, mab = math.ceil, math.floor, math.sqrt, math.min, math.max, math.abs\nlocal mod = 1000000007\nlocal function bmul(x, y)\n local x1, y1 = mfl(x / 31623), mfl(y / 31623)\n local x0, y0 = x - x1 * 31623, y - y1 * 31623\n return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod\nend\nlocal function badd(x, y)\n return (x + y) % mod\nend\n\nlocal function bsub(x, y)\n return x < y and x - y + mod or x - y\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal ret = 0\n\nlocal primecnt = {}\nlocal t = {}\nfor i = 1, k do t[i] = 0 end\nfor i = k, 1, -1 do\n local c = mfl(k / i)\n local z = modpow(c, n)\n for j = 2, c do\n z = bsub(z, t[j * i])\n end\n t[i] = z\n ret = badd(ret, bmul(i, z))\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nConsider sequences \\{A_1,...,A_N\\} of length N consisting of integers between 1 and K (inclusive).\n\nThere are K^N such sequences. Find the sum of \\gcd(A_1, ..., A_N) over all of them.\n\nSince this sum can be enormous, print the value modulo (10^9+7).\n\nHere \\gcd(A_1, ..., A_N) denotes the greatest common divisor of A_1, ..., A_N.\n\nConstraints\n\n2 \\leq N \\leq 10^5\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\nN K\n\nOutput\n\nPrint the sum of \\gcd(A_1, ..., A_N) over all K^N sequences, modulo (10^9+7).\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n3 200\n\nSample Output 2\n\n10813692\n\nSample Input 3\n\n100000 100000\n\nSample Output 3\n\n742202979\n\nBe sure to print the sum modulo (10^9+7).", "sample_input": "3 2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02715", "source_text": "Score : 500 points\n\nProblem Statement\n\nConsider sequences \\{A_1,...,A_N\\} of length N consisting of integers between 1 and K (inclusive).\n\nThere are K^N such sequences. Find the sum of \\gcd(A_1, ..., A_N) over all of them.\n\nSince this sum can be enormous, print the value modulo (10^9+7).\n\nHere \\gcd(A_1, ..., A_N) denotes the greatest common divisor of A_1, ..., A_N.\n\nConstraints\n\n2 \\leq N \\leq 10^5\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\nN K\n\nOutput\n\nPrint the sum of \\gcd(A_1, ..., A_N) over all K^N sequences, modulo (10^9+7).\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n3 200\n\nSample Output 2\n\n10813692\n\nSample Input 3\n\n100000 100000\n\nSample Output 3\n\n742202979\n\nBe sure to print the sum modulo (10^9+7).", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 950, "cpu_time_ms": 56, "memory_kb": 3740}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s231748044", "group_id": "codeNet:p02716", "input_text": "local mmi, mma = math.min, math.max\nlocal bls, brs = bit.lshift, bit.rshift\nlocal mfl, mce = math.floor, math.ceil\nlocal n = io.read(\"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = io.read(\"*n\")\nend\nif n % 2 == 0 then\n local hn = brs(n, 1)\n local p1, p2 = {t[1]}, {t[2]}\n for i = 2, hn do\n p1[i] = p1[i - 1] + t[2 * i - 1]\n p2[i] = p2[i - 1] + t[2 * i]\n end\n local ret = mma(p1[hn], p2[hn])\n for i = 1, hn - 1 do\n local cand = p1[i] + p2[hn] - p2[i]\n ret = mma(ret, cand)\n end\n if ret < 100000000000000 then\n print(ret)\n else\n print(\"100000000000000\")\n end\nelse\n -- use0, nouse0, use1, nouse1, use2, nouse2\n local dp = {t[1], false, false, 0, false, false}\n for i = 2, n do\n local dst = {false, false, false, false, false, false}\n if dp[1] then\n dst[2] = dp[1]\n end\n if dp[2] then\n dst[1] = dp[2] + t[i]\n dst[4] = dp[2]\n end\n if dp[3] then\n if dst[4] then\n dst[4] = mma(dst[4], dp[3])\n else\n dst[4] = dp[3]\n end\n end\n if dp[4] then\n dst[3] = dp[4] + t[i]\n dst[6] = dp[4]\n end\n if dp[5] then\n if dst[6] then\n dst[6] = mma(dst[6], dp[5])\n else\n dst[6] = dp[5]\n end\n end\n if dp[6] then\n dst[5] = dp[6] + t[i]\n end\n for j = 1, 6 do\n dp[j] = dst[j]\n -- io.write(tostring(dp[j]))\n -- io.write(j == 6 and \"\\n\" or \" \")\n end\n end\n if not dp[5] then\n print(dp[6])\n elseif not dp[6] then\n print(dp[5])\n else\n print(mma(dp[5], dp[6]))\n end\nend\n", "language": "Lua", "metadata": {"date": 1586742135, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02716.html", "problem_id": "p02716", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02716/input.txt", "sample_output_relpath": "derived/input_output/data/p02716/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02716/Lua/s231748044.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s231748044", "user_id": "u120582723"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal bls, brs = bit.lshift, bit.rshift\nlocal mfl, mce = math.floor, math.ceil\nlocal n = io.read(\"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = io.read(\"*n\")\nend\nif n % 2 == 0 then\n local hn = brs(n, 1)\n local p1, p2 = {t[1]}, {t[2]}\n for i = 2, hn do\n p1[i] = p1[i - 1] + t[2 * i - 1]\n p2[i] = p2[i - 1] + t[2 * i]\n end\n local ret = mma(p1[hn], p2[hn])\n for i = 1, hn - 1 do\n local cand = p1[i] + p2[hn] - p2[i]\n ret = mma(ret, cand)\n end\n if ret < 100000000000000 then\n print(ret)\n else\n print(\"100000000000000\")\n end\nelse\n -- use0, nouse0, use1, nouse1, use2, nouse2\n local dp = {t[1], false, false, 0, false, false}\n for i = 2, n do\n local dst = {false, false, false, false, false, false}\n if dp[1] then\n dst[2] = dp[1]\n end\n if dp[2] then\n dst[1] = dp[2] + t[i]\n dst[4] = dp[2]\n end\n if dp[3] then\n if dst[4] then\n dst[4] = mma(dst[4], dp[3])\n else\n dst[4] = dp[3]\n end\n end\n if dp[4] then\n dst[3] = dp[4] + t[i]\n dst[6] = dp[4]\n end\n if dp[5] then\n if dst[6] then\n dst[6] = mma(dst[6], dp[5])\n else\n dst[6] = dp[5]\n end\n end\n if dp[6] then\n dst[5] = dp[6] + t[i]\n end\n for j = 1, 6 do\n dp[j] = dst[j]\n -- io.write(tostring(dp[j]))\n -- io.write(j == 6 and \"\\n\" or \" \")\n end\n end\n if not dp[5] then\n print(dp[6])\n elseif not dp[6] then\n print(dp[5])\n else\n print(mma(dp[5], dp[6]))\n end\nend\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven is an integer sequence A_1, ..., A_N of length N.\n\nWe will choose exactly \\left\\lfloor \\frac{N}{2} \\right\\rfloor elements from this sequence so that no two adjacent elements are chosen.\n\nFind the maximum possible sum of the chosen elements.\n\nHere \\lfloor x \\rfloor denotes the greatest integer not greater than x.\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n|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_N\n\nOutput\n\nPrint the maximum possible sum of the chosen elements.\n\nSample Input 1\n\n6\n1 2 3 4 5 6\n\nSample Output 1\n\n12\n\nChoosing 2, 4, and 6 makes the sum 12, which is the maximum possible value.\n\nSample Input 2\n\n5\n-1000 -100 -10 0 10\n\nSample Output 2\n\n0\n\nChoosing -10 and 10 makes the sum 0, which is the maximum possible value.\n\nSample Input 3\n\n10\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n5000000000\n\nWatch out for overflow.\n\nSample Input 4\n\n27\n18 -28 18 28 -45 90 -45 23 -53 60 28 -74 -71 35 -26 -62 49 -77 57 24 -70 -93 69 -99 59 57 -49\n\nSample Output 4\n\n295", "sample_input": "6\n1 2 3 4 5 6\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02716", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven is an integer sequence A_1, ..., A_N of length N.\n\nWe will choose exactly \\left\\lfloor \\frac{N}{2} \\right\\rfloor elements from this sequence so that no two adjacent elements are chosen.\n\nFind the maximum possible sum of the chosen elements.\n\nHere \\lfloor x \\rfloor denotes the greatest integer not greater than x.\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n|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_N\n\nOutput\n\nPrint the maximum possible sum of the chosen elements.\n\nSample Input 1\n\n6\n1 2 3 4 5 6\n\nSample Output 1\n\n12\n\nChoosing 2, 4, and 6 makes the sum 12, which is the maximum possible value.\n\nSample Input 2\n\n5\n-1000 -100 -10 0 10\n\nSample Output 2\n\n0\n\nChoosing -10 and 10 makes the sum 0, which is the maximum possible value.\n\nSample Input 3\n\n10\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n5000000000\n\nWatch out for overflow.\n\nSample Input 4\n\n27\n18 -28 18 28 -45 90 -45 23 -53 60 28 -74 -71 35 -26 -62 49 -77 57 24 -70 -93 69 -99 59 57 -49\n\nSample Output 4\n\n295", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1521, "cpu_time_ms": 62, "memory_kb": 6928}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s985573274", "group_id": "codeNet:p02719", "input_text": "local n, k = io.read(\"*n\", \"*n\")\nn = n % k\nprint(math.min(n, k - n))\n", "language": "Lua", "metadata": {"date": 1586048685, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "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/Lua/s985573274.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s985573274", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local n, k = io.read(\"*n\", \"*n\")\nn = n % k\nprint(math.min(n, k - n))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven any integer x, Aoki can do the operation below.\n\nOperation: Replace x with the absolute difference of x and K.\n\nYou are given the initial value of an integer N. Find the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nConstraints\n\n0 ≤ N ≤ 10^{18}\n\n1 ≤ K ≤ 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nSample Input 1\n\n7 4\n\nSample Output 1\n\n1\n\nInitially, N=7.\n\nAfter one operation, N becomes |7-4| = 3.\n\nAfter two operations, N becomes |3-4| = 1, which is the minimum value taken by N.\n\nSample Input 2\n\n2 6\n\nSample Output 2\n\n2\n\nN=2 after zero operations is the minimum.\n\nSample Input 3\n\n1000000000000000000 1\n\nSample Output 3\n\n0", "sample_input": "7 4\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02719", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven any integer x, Aoki can do the operation below.\n\nOperation: Replace x with the absolute difference of x and K.\n\nYou are given the initial value of an integer N. Find the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nConstraints\n\n0 ≤ N ≤ 10^{18}\n\n1 ≤ K ≤ 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nSample Input 1\n\n7 4\n\nSample Output 1\n\n1\n\nInitially, N=7.\n\nAfter one operation, N becomes |7-4| = 3.\n\nAfter two operations, N becomes |3-4| = 1, which is the minimum value taken by N.\n\nSample Input 2\n\n2 6\n\nSample Output 2\n\n2\n\nN=2 after zero operations is the minimum.\n\nSample Input 3\n\n1000000000000000000 1\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 69, "cpu_time_ms": 68, "memory_kb": 1008}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s528122205", "group_id": "codeNet:p02721", "input_text": "local n, k, c = io.read(\"*n\", \"*n\", \"*n\", \"*l\")\nlocal s = io.read()\nlocal t = {}\nlocal okday = {}\nfor i = 1, n do\n t[i] = s:sub(i, i) == \"o\"\n if t[i] then\n table.insert(okday, i)\n end\nend\nlocal score = {}\nfor i = 1, #okday do\n score[i] = 1\nend\nlocal dayleft, dayright = {}, {}\nfor i = 1, k do\n dayleft[i], dayright[i] = 0, 0\nend\nlocal curscore, curday = 1, okday[1]\ndayleft[1] = 1\nfor i = 2, #okday do\n if curday + c < okday[i] then\n curscore = curscore + 1\n if curscore == k + 1 then break end\n dayleft[curscore] = okday[i]\n curday = okday[i]\n end\nend\n\ncurscore, curday = k, okday[#okday]\ndayright[k] = curday\nfor i = #okday - 1, 1, -1 do\n if okday[i] + c < curday then\n curscore = curscore - 1\n if curscore == 0 then break end\n dayright[curscore] = okday[i]\n curday = okday[i]\n end\nend\nfor i = 1, k do\n if 0 < dayleft[i] * dayright[i]\n and dayleft[i] == dayright[i] then\n print(dayleft[i])\n end\nend\n", "language": "Lua", "metadata": {"date": 1586055141, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s528122205.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s528122205", "user_id": "u120582723"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "local n, k, c = io.read(\"*n\", \"*n\", \"*n\", \"*l\")\nlocal s = io.read()\nlocal t = {}\nlocal okday = {}\nfor i = 1, n do\n t[i] = s:sub(i, i) == \"o\"\n if t[i] then\n table.insert(okday, i)\n end\nend\nlocal score = {}\nfor i = 1, #okday do\n score[i] = 1\nend\nlocal dayleft, dayright = {}, {}\nfor i = 1, k do\n dayleft[i], dayright[i] = 0, 0\nend\nlocal curscore, curday = 1, okday[1]\ndayleft[1] = 1\nfor i = 2, #okday do\n if curday + c < okday[i] then\n curscore = curscore + 1\n if curscore == k + 1 then break end\n dayleft[curscore] = okday[i]\n curday = okday[i]\n end\nend\n\ncurscore, curday = k, okday[#okday]\ndayright[k] = curday\nfor i = #okday - 1, 1, -1 do\n if okday[i] + c < curday then\n curscore = curscore - 1\n if curscore == 0 then break end\n dayright[curscore] = okday[i]\n curday = okday[i]\n end\nend\nfor i = 1, k do\n if 0 < dayleft[i] * dayright[i]\n and dayleft[i] == dayright[i] then\n print(dayleft[i])\n end\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 943, "cpu_time_ms": 134, "memory_kb": 12344}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s049325871", "group_id": "codeNet:p02721", "input_text": "local n, k, c = io.read(\"*n\", \"*n\", \"*n\", \"*l\")\nlocal s = io.read()\nlocal t = {}\nlocal okday = {}\nfor i = 1, n do\n t[i] = s:sub(i, i) == \"o\"\n if t[i] then\n table.insert(okday, i)\n end\nend\nlocal score = {}\nfor i = 1, #okday do\n score[i] = 1\nend\nlocal curscore, curday = 1, okday[#okday]\nfor i = #okday - 1, 1, -1 do\n if okday[i] + c < curday then\n curday = okday[i]\n curscore = curscore + 1\n end\n score[i] = curscore\nend\nlocal scoreleft = {}\nlocal scoreright = {}\nif 0 < #score then\n local maxscore = score[1]\n for i = 1, maxscore do\n scoreleft[i] = 0\n scoreright[i] = 0\n end\n local prvscore = -1\n for i = 1, #score do\n local s = score[i]\n if s ~= prvscore then\n prvscore = s\n scoreleft[s] = i\n end\n scoreright[s] = i\n end\n -- print(table.concat(scoreleft, \" \"))\n -- print(table.concat(scoreright, \" \"))\nend\n\nlocal ret = {}\nif score[1] == k then\n for iok = #okday, 1, -1 do\n local rem = k\n if iok ~= #okday then\n if k <= score[iok + 1] then break end\n rem = rem - score[iok + 1]\n end\n local s = score[iok]\n if scoreleft[s] == scoreright[s] then\n table.insert(ret, okday[iok])\n elseif s < k then\n local idx = scoreleft[s + 1]\n local prvday = okday[idx]\n local idx2 = scoreright[s]\n -- print(idx, prvday, idx2)\n if idx2 == iok and okday[idx2 - 1] <=prvday + c then\n table.insert(ret, okday[iok])\n end\n end\n end\nend\ntable.sort(ret)\nprint(table.concat(ret, \"\\n\"))\n", "language": "Lua", "metadata": {"date": 1586054087, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s049325871.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s049325871", "user_id": "u120582723"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "local n, k, c = io.read(\"*n\", \"*n\", \"*n\", \"*l\")\nlocal s = io.read()\nlocal t = {}\nlocal okday = {}\nfor i = 1, n do\n t[i] = s:sub(i, i) == \"o\"\n if t[i] then\n table.insert(okday, i)\n end\nend\nlocal score = {}\nfor i = 1, #okday do\n score[i] = 1\nend\nlocal curscore, curday = 1, okday[#okday]\nfor i = #okday - 1, 1, -1 do\n if okday[i] + c < curday then\n curday = okday[i]\n curscore = curscore + 1\n end\n score[i] = curscore\nend\nlocal scoreleft = {}\nlocal scoreright = {}\nif 0 < #score then\n local maxscore = score[1]\n for i = 1, maxscore do\n scoreleft[i] = 0\n scoreright[i] = 0\n end\n local prvscore = -1\n for i = 1, #score do\n local s = score[i]\n if s ~= prvscore then\n prvscore = s\n scoreleft[s] = i\n end\n scoreright[s] = i\n end\n -- print(table.concat(scoreleft, \" \"))\n -- print(table.concat(scoreright, \" \"))\nend\n\nlocal ret = {}\nif score[1] == k then\n for iok = #okday, 1, -1 do\n local rem = k\n if iok ~= #okday then\n if k <= score[iok + 1] then break end\n rem = rem - score[iok + 1]\n end\n local s = score[iok]\n if scoreleft[s] == scoreright[s] then\n table.insert(ret, okday[iok])\n elseif s < k then\n local idx = scoreleft[s + 1]\n local prvday = okday[idx]\n local idx2 = scoreright[s]\n -- print(idx, prvday, idx2)\n if idx2 == iok and okday[idx2 - 1] <=prvday + c then\n table.insert(ret, okday[iok])\n end\n end\n end\nend\ntable.sort(ret)\nprint(table.concat(ret, \"\\n\"))\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nTakahashi has decided to work on K days of his choice from the N days starting with tomorrow.\n\nYou are given an integer C and a string S. Takahashi will choose his workdays as follows:\n\nAfter working for a day, he will refrain from working on the subsequent C days.\n\nIf the i-th character of S is x, he will not work on Day i, where Day 1 is tomorrow, Day 2 is the day after tomorrow, and so on.\n\nFind all days on which Takahashi is bound to work.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq N\n\n0 \\leq C \\leq N\n\nThe length of S is N.\n\nEach character of S is o or x.\n\nTakahashi can choose his workdays so that the conditions in Problem Statement are satisfied.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K C\nS\n\nOutput\n\nPrint all days on which Takahashi is bound to work in ascending order, one per line.\n\nSample Input 1\n\n11 3 2\nooxxxoxxxoo\n\nSample Output 1\n\n6\n\nTakahashi is going to work on 3 days out of the 11 days. After working for a day, he will refrain from working on the subsequent 2 days.\n\nThere are four possible choices for his workdays: Day 1,6,10, Day 1,6,11, Day 2,6,10, and Day 2,6,11.\n\nThus, he is bound to work on Day 6.\n\nSample Input 2\n\n5 2 3\nooxoo\n\nSample Output 2\n\n1\n5\n\nThere is only one possible choice for his workdays: Day 1,5.\n\nSample Input 3\n\n5 1 0\nooooo\n\nSample Output 3\n\nThere may be no days on which he is bound to work.\n\nSample Input 4\n\n16 4 3\nooxxoxoxxxoxoxxo\n\nSample Output 4\n\n11\n16", "sample_input": "11 3 2\nooxxxoxxxoo\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02721", "source_text": "Score : 500 points\n\nProblem Statement\n\nTakahashi has decided to work on K days of his choice from the N days starting with tomorrow.\n\nYou are given an integer C and a string S. Takahashi will choose his workdays as follows:\n\nAfter working for a day, he will refrain from working on the subsequent C days.\n\nIf the i-th character of S is x, he will not work on Day i, where Day 1 is tomorrow, Day 2 is the day after tomorrow, and so on.\n\nFind all days on which Takahashi is bound to work.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq N\n\n0 \\leq C \\leq N\n\nThe length of S is N.\n\nEach character of S is o or x.\n\nTakahashi can choose his workdays so that the conditions in Problem Statement are satisfied.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K C\nS\n\nOutput\n\nPrint all days on which Takahashi is bound to work in ascending order, one per line.\n\nSample Input 1\n\n11 3 2\nooxxxoxxxoo\n\nSample Output 1\n\n6\n\nTakahashi is going to work on 3 days out of the 11 days. After working for a day, he will refrain from working on the subsequent 2 days.\n\nThere are four possible choices for his workdays: Day 1,6,10, Day 1,6,11, Day 2,6,10, and Day 2,6,11.\n\nThus, he is bound to work on Day 6.\n\nSample Input 2\n\n5 2 3\nooxoo\n\nSample Output 2\n\n1\n5\n\nThere is only one possible choice for his workdays: Day 1,5.\n\nSample Input 3\n\n5 1 0\nooooo\n\nSample Output 3\n\nThere may be no days on which he is bound to work.\n\nSample Input 4\n\n16 4 3\nooxxoxoxxxoxoxxo\n\nSample Output 4\n\n11\n16", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1486, "cpu_time_ms": 333, "memory_kb": 28512}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s450822794", "group_id": "codeNet:p02723", "input_text": "local s=io.read()\nif s:sub(3,3)==s:sub(4,4) and s:sub(5,5)==s:sub(6,6) then\n print(\"Yes\")\nelse\n print(\"No\")\nend", "language": "Lua", "metadata": {"date": 1591925089, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02723.html", "problem_id": "p02723", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02723/input.txt", "sample_output_relpath": "derived/input_output/data/p02723/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02723/Lua/s450822794.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s450822794", "user_id": "u045238009"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local s=io.read()\nif s:sub(3,3)==s:sub(4,4) and s:sub(5,5)==s:sub(6,6) then\n print(\"Yes\")\nelse\n print(\"No\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.\n\nGiven a string S, determine whether it is coffee-like.\n\nConstraints\n\nS is a string of length 6 consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is coffee-like, print Yes; otherwise, print No.\n\nSample Input 1\n\nsippuu\n\nSample Output 1\n\nYes\n\nIn sippuu, the 3-rd and 4-th characters are equal, and the 5-th and 6-th characters are also equal.\n\nSample Input 2\n\niphone\n\nSample Output 2\n\nNo\n\nSample Input 3\n\ncoffee\n\nSample Output 3\n\nYes", "sample_input": "sippuu\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02723", "source_text": "Score : 100 points\n\nProblem Statement\n\nA string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.\n\nGiven a string S, determine whether it is coffee-like.\n\nConstraints\n\nS is a string of length 6 consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is coffee-like, print Yes; otherwise, print No.\n\nSample Input 1\n\nsippuu\n\nSample Output 1\n\nYes\n\nIn sippuu, the 3-rd and 4-th characters are equal, and the 5-th and 6-th characters are also equal.\n\nSample Input 2\n\niphone\n\nSample Output 2\n\nNo\n\nSample Input 3\n\ncoffee\n\nSample Output 3\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s707512768", "group_id": "codeNet:p02724", "input_text": "local x=io.read(\"n\")\nprint((x//500)*1000+((x-(x//500)*500)//5)*5)", "language": "Lua", "metadata": {"date": 1593834414, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02724.html", "problem_id": "p02724", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02724/input.txt", "sample_output_relpath": "derived/input_output/data/p02724/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02724/Lua/s707512768.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s707512768", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2020\n", "input_to_evaluate": "local x=io.read(\"n\")\nprint((x//500)*1000+((x-(x//500)*500)//5)*5)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves gold coins. He gains 1000 happiness points for each 500-yen coin he has and gains 5 happiness points for each 5-yen coin he has. (Yen is the currency of Japan.)\n\nTakahashi has X yen. If he exchanges his money so that he will gain the most happiness points, how many happiness points will he earn?\n\n(We assume that there are six kinds of coins available: 500-yen, 100-yen, 50-yen, 10-yen, 5-yen, and 1-yen coins.)\n\nConstraints\n\n0 \\leq X \\leq 10^9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the maximum number of happiness points that can be earned.\n\nSample Input 1\n\n1024\n\nSample Output 1\n\n2020\n\nBy exchanging his money so that he gets two 500-yen coins and four 5-yen coins, he gains 2020 happiness points, which is the maximum number of happiness points that can be earned.\n\nSample Input 2\n\n0\n\nSample Output 2\n\n0\n\nHe is penniless - or yenless.\n\nSample Input 3\n\n1000000000\n\nSample Output 3\n\n2000000000\n\nHe is a billionaire - in yen.", "sample_input": "1024\n"}, "reference_outputs": ["2020\n"], "source_document_id": "p02724", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves gold coins. He gains 1000 happiness points for each 500-yen coin he has and gains 5 happiness points for each 5-yen coin he has. (Yen is the currency of Japan.)\n\nTakahashi has X yen. If he exchanges his money so that he will gain the most happiness points, how many happiness points will he earn?\n\n(We assume that there are six kinds of coins available: 500-yen, 100-yen, 50-yen, 10-yen, 5-yen, and 1-yen coins.)\n\nConstraints\n\n0 \\leq X \\leq 10^9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the maximum number of happiness points that can be earned.\n\nSample Input 1\n\n1024\n\nSample Output 1\n\n2020\n\nBy exchanging his money so that he gets two 500-yen coins and four 5-yen coins, he gains 2020 happiness points, which is the maximum number of happiness points that can be earned.\n\nSample Input 2\n\n0\n\nSample Output 2\n\n0\n\nHe is penniless - or yenless.\n\nSample Input 3\n\n1000000000\n\nSample Output 3\n\n2000000000\n\nHe is a billionaire - in yen.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 65, "cpu_time_ms": 11, "memory_kb": 2756}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s035215336", "group_id": "codeNet:p02724", "input_text": "n=io.read\"*n\"\nr=math.floor(n/500)*1000\nn=n%500\nr=r+math.floor(n/5)*5\nprint(r)", "language": "Lua", "metadata": {"date": 1586152664, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02724.html", "problem_id": "p02724", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02724/input.txt", "sample_output_relpath": "derived/input_output/data/p02724/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02724/Lua/s035215336.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s035215336", "user_id": "u726173718"}, "prompt_components": {"gold_output": "2020\n", "input_to_evaluate": "n=io.read\"*n\"\nr=math.floor(n/500)*1000\nn=n%500\nr=r+math.floor(n/5)*5\nprint(r)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves gold coins. He gains 1000 happiness points for each 500-yen coin he has and gains 5 happiness points for each 5-yen coin he has. (Yen is the currency of Japan.)\n\nTakahashi has X yen. If he exchanges his money so that he will gain the most happiness points, how many happiness points will he earn?\n\n(We assume that there are six kinds of coins available: 500-yen, 100-yen, 50-yen, 10-yen, 5-yen, and 1-yen coins.)\n\nConstraints\n\n0 \\leq X \\leq 10^9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the maximum number of happiness points that can be earned.\n\nSample Input 1\n\n1024\n\nSample Output 1\n\n2020\n\nBy exchanging his money so that he gets two 500-yen coins and four 5-yen coins, he gains 2020 happiness points, which is the maximum number of happiness points that can be earned.\n\nSample Input 2\n\n0\n\nSample Output 2\n\n0\n\nHe is penniless - or yenless.\n\nSample Input 3\n\n1000000000\n\nSample Output 3\n\n2000000000\n\nHe is a billionaire - in yen.", "sample_input": "1024\n"}, "reference_outputs": ["2020\n"], "source_document_id": "p02724", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves gold coins. He gains 1000 happiness points for each 500-yen coin he has and gains 5 happiness points for each 5-yen coin he has. (Yen is the currency of Japan.)\n\nTakahashi has X yen. If he exchanges his money so that he will gain the most happiness points, how many happiness points will he earn?\n\n(We assume that there are six kinds of coins available: 500-yen, 100-yen, 50-yen, 10-yen, 5-yen, and 1-yen coins.)\n\nConstraints\n\n0 \\leq X \\leq 10^9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the maximum number of happiness points that can be earned.\n\nSample Input 1\n\n1024\n\nSample Output 1\n\n2020\n\nBy exchanging his money so that he gets two 500-yen coins and four 5-yen coins, he gains 2020 happiness points, which is the maximum number of happiness points that can be earned.\n\nSample Input 2\n\n0\n\nSample Output 2\n\n0\n\nHe is penniless - or yenless.\n\nSample Input 3\n\n1000000000\n\nSample Output 3\n\n2000000000\n\nHe is a billionaire - in yen.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 77, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s625022083", "group_id": "codeNet:p02724", "input_text": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\nlocal function array(dimension, default_val) assert(type(default_val) ~= 'table') local n=dimension local m={}if default_val~=nil then m[1]={__index=function()return default_val end}end for i=2,n do m[i]={__index=function(p, k)local c=setmetatable({},m[i-1])rawset(p,k,c)return c end}end return setmetatable({},m[n])end\n----\nlocal X = read.n()\nlocal c500 = X // 500\nlocal r = X % 500\nlocal c5 = r // 5\nlocal p = c500 * 1000 + c5 * 5\nprint(p)", "language": "Lua", "metadata": {"date": 1585443929, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02724.html", "problem_id": "p02724", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02724/input.txt", "sample_output_relpath": "derived/input_output/data/p02724/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02724/Lua/s625022083.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s625022083", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2020\n", "input_to_evaluate": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\nlocal function array(dimension, default_val) assert(type(default_val) ~= 'table') local n=dimension local m={}if default_val~=nil then m[1]={__index=function()return default_val end}end for i=2,n do m[i]={__index=function(p, k)local c=setmetatable({},m[i-1])rawset(p,k,c)return c end}end return setmetatable({},m[n])end\n----\nlocal X = read.n()\nlocal c500 = X // 500\nlocal r = X % 500\nlocal c5 = r // 5\nlocal p = c500 * 1000 + c5 * 5\nprint(p)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves gold coins. He gains 1000 happiness points for each 500-yen coin he has and gains 5 happiness points for each 5-yen coin he has. (Yen is the currency of Japan.)\n\nTakahashi has X yen. If he exchanges his money so that he will gain the most happiness points, how many happiness points will he earn?\n\n(We assume that there are six kinds of coins available: 500-yen, 100-yen, 50-yen, 10-yen, 5-yen, and 1-yen coins.)\n\nConstraints\n\n0 \\leq X \\leq 10^9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the maximum number of happiness points that can be earned.\n\nSample Input 1\n\n1024\n\nSample Output 1\n\n2020\n\nBy exchanging his money so that he gets two 500-yen coins and four 5-yen coins, he gains 2020 happiness points, which is the maximum number of happiness points that can be earned.\n\nSample Input 2\n\n0\n\nSample Output 2\n\n0\n\nHe is penniless - or yenless.\n\nSample Input 3\n\n1000000000\n\nSample Output 3\n\n2000000000\n\nHe is a billionaire - in yen.", "sample_input": "1024\n"}, "reference_outputs": ["2020\n"], "source_document_id": "p02724", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves gold coins. He gains 1000 happiness points for each 500-yen coin he has and gains 5 happiness points for each 5-yen coin he has. (Yen is the currency of Japan.)\n\nTakahashi has X yen. If he exchanges his money so that he will gain the most happiness points, how many happiness points will he earn?\n\n(We assume that there are six kinds of coins available: 500-yen, 100-yen, 50-yen, 10-yen, 5-yen, and 1-yen coins.)\n\nConstraints\n\n0 \\leq X \\leq 10^9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the maximum number of happiness points that can be earned.\n\nSample Input 1\n\n1024\n\nSample Output 1\n\n2020\n\nBy exchanging his money so that he gets two 500-yen coins and four 5-yen coins, he gains 2020 happiness points, which is the maximum number of happiness points that can be earned.\n\nSample Input 2\n\n0\n\nSample Output 2\n\n0\n\nHe is penniless - or yenless.\n\nSample Input 3\n\n1000000000\n\nSample Output 3\n\n2000000000\n\nHe is a billionaire - in yen.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 112, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s191122846", "group_id": "codeNet:p02726", "input_text": "local n,x,y=io.read(\"*n\",\"*n\",\"*n\")\n\nlocal ma=math.abs\nlocal t={}\nfor i=1,n do\n for j=i+1,n do\n local mindist=math.min(ma(j-i),ma(x-i)+1+ma(j-y),ma(y-i)+1+ma(j-x))\n t[mindist]=(t[mindist] or 0)+1\n end\nend\n\nfor i=1,n-1 do\n print(t[i] or 0)\nend", "language": "Lua", "metadata": {"date": 1591588186, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02726.html", "problem_id": "p02726", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02726/input.txt", "sample_output_relpath": "derived/input_output/data/p02726/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02726/Lua/s191122846.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s191122846", "user_id": "u045238009"}, "prompt_components": {"gold_output": "5\n4\n1\n0\n", "input_to_evaluate": "local n,x,y=io.read(\"*n\",\"*n\",\"*n\")\n\nlocal ma=math.abs\nlocal t={}\nfor i=1,n do\n for j=i+1,n do\n local mindist=math.min(ma(j-i),ma(x-i)+1+ma(j-y),ma(y-i)+1+ma(j-x))\n t[mindist]=(t[mindist] or 0)+1\n end\nend\n\nfor i=1,n-1 do\n print(t[i] or 0)\nend", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have an undirected graph G with N vertices numbered 1 to N and N edges as follows:\n\nFor each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.\n\nThere is an edge between Vertex X and Vertex Y.\n\nFor each k=1,2,...,N-1, solve the problem below:\n\nFind the number of pairs of integers (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j in G is k.\n\nConstraints\n\n3 \\leq N \\leq 2 \\times 10^3\n\n1 \\leq X,Y \\leq N\n\nX+1 < Y\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X Y\n\nOutput\n\nFor each k=1, 2, ..., N-1 in this order, print a line containing the answer to the problem.\n\nSample Input 1\n\n5 2 4\n\nSample Output 1\n\n5\n4\n1\n0\n\nThe graph in this input is as follows:\n\nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 1: (1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5).\n\nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5).\n\nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 3: (1,5).\n\nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 4.\n\nSample Input 2\n\n3 1 3\n\nSample Output 2\n\n3\n0\n\nThe graph in this input is as follows:\n\nSample Input 3\n\n7 3 7\n\nSample Output 3\n\n7\n8\n4\n2\n0\n0\n\nSample Input 4\n\n10 4 8\n\nSample Output 4\n\n10\n12\n10\n8\n4\n1\n0\n0\n0", "sample_input": "5 2 4\n"}, "reference_outputs": ["5\n4\n1\n0\n"], "source_document_id": "p02726", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have an undirected graph G with N vertices numbered 1 to N and N edges as follows:\n\nFor each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.\n\nThere is an edge between Vertex X and Vertex Y.\n\nFor each k=1,2,...,N-1, solve the problem below:\n\nFind the number of pairs of integers (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j in G is k.\n\nConstraints\n\n3 \\leq N \\leq 2 \\times 10^3\n\n1 \\leq X,Y \\leq N\n\nX+1 < Y\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X Y\n\nOutput\n\nFor each k=1, 2, ..., N-1 in this order, print a line containing the answer to the problem.\n\nSample Input 1\n\n5 2 4\n\nSample Output 1\n\n5\n4\n1\n0\n\nThe graph in this input is as follows:\n\nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 1: (1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5).\n\nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5).\n\nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 3: (1,5).\n\nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 4.\n\nSample Input 2\n\n3 1 3\n\nSample Output 2\n\n3\n0\n\nThe graph in this input is as follows:\n\nSample Input 3\n\n7 3 7\n\nSample Output 3\n\n7\n8\n4\n2\n0\n0\n\nSample Input 4\n\n10 4 8\n\nSample Output 4\n\n10\n12\n10\n8\n4\n1\n0\n0\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 265, "cpu_time_ms": 11, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s394550624", "group_id": "codeNet:p02726", "input_text": "local n,x,y=io.read(\"n\",\"n\",\"n\")\n\nlocal ma=math.abs\nlocal t={}\nfor i=1,n do\n for j=i+1,n do\n local mindist=math.min(ma(j-i),ma(x-i)+1+ma(j-y),ma(y-i)+1+ma(j-x))\n t[mindist]=(t[mindist] or 0)+1\n end\nend\n\nfor i=1,n-1 do\n print(t[i] or 0)\nend", "language": "Lua", "metadata": {"date": 1591588120, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02726.html", "problem_id": "p02726", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02726/input.txt", "sample_output_relpath": "derived/input_output/data/p02726/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02726/Lua/s394550624.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s394550624", "user_id": "u045238009"}, "prompt_components": {"gold_output": "5\n4\n1\n0\n", "input_to_evaluate": "local n,x,y=io.read(\"n\",\"n\",\"n\")\n\nlocal ma=math.abs\nlocal t={}\nfor i=1,n do\n for j=i+1,n do\n local mindist=math.min(ma(j-i),ma(x-i)+1+ma(j-y),ma(y-i)+1+ma(j-x))\n t[mindist]=(t[mindist] or 0)+1\n end\nend\n\nfor i=1,n-1 do\n print(t[i] or 0)\nend", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have an undirected graph G with N vertices numbered 1 to N and N edges as follows:\n\nFor each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.\n\nThere is an edge between Vertex X and Vertex Y.\n\nFor each k=1,2,...,N-1, solve the problem below:\n\nFind the number of pairs of integers (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j in G is k.\n\nConstraints\n\n3 \\leq N \\leq 2 \\times 10^3\n\n1 \\leq X,Y \\leq N\n\nX+1 < Y\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X Y\n\nOutput\n\nFor each k=1, 2, ..., N-1 in this order, print a line containing the answer to the problem.\n\nSample Input 1\n\n5 2 4\n\nSample Output 1\n\n5\n4\n1\n0\n\nThe graph in this input is as follows:\n\nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 1: (1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5).\n\nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5).\n\nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 3: (1,5).\n\nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 4.\n\nSample Input 2\n\n3 1 3\n\nSample Output 2\n\n3\n0\n\nThe graph in this input is as follows:\n\nSample Input 3\n\n7 3 7\n\nSample Output 3\n\n7\n8\n4\n2\n0\n0\n\nSample Input 4\n\n10 4 8\n\nSample Output 4\n\n10\n12\n10\n8\n4\n1\n0\n0\n0", "sample_input": "5 2 4\n"}, "reference_outputs": ["5\n4\n1\n0\n"], "source_document_id": "p02726", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have an undirected graph G with N vertices numbered 1 to N and N edges as follows:\n\nFor each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.\n\nThere is an edge between Vertex X and Vertex Y.\n\nFor each k=1,2,...,N-1, solve the problem below:\n\nFind the number of pairs of integers (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j in G is k.\n\nConstraints\n\n3 \\leq N \\leq 2 \\times 10^3\n\n1 \\leq X,Y \\leq N\n\nX+1 < Y\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X Y\n\nOutput\n\nFor each k=1, 2, ..., N-1 in this order, print a line containing the answer to the problem.\n\nSample Input 1\n\n5 2 4\n\nSample Output 1\n\n5\n4\n1\n0\n\nThe graph in this input is as follows:\n\nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 1: (1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5).\n\nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5).\n\nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 3: (1,5).\n\nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 4.\n\nSample Input 2\n\n3 1 3\n\nSample Output 2\n\n3\n0\n\nThe graph in this input is as follows:\n\nSample Input 3\n\n7 3 7\n\nSample Output 3\n\n7\n8\n4\n2\n0\n0\n\nSample Input 4\n\n10 4 8\n\nSample Output 4\n\n10\n12\n10\n8\n4\n1\n0\n0\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 262, "cpu_time_ms": 850, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s166613561", "group_id": "codeNet:p02728", "input_text": "local mod = 1000000007\nlocal mfl = math.floor\n\nlocal function bmul(x, y)\n local x0, y0 = x % 31623, y % 31623\n local x1, y1 = mfl(x / 31623), mfl(y / 31623)\n return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod\nend\n\nlocal function badd(x, y)\n return (x + y) % mod\nend\n\nlocal function bsub(x, y)\n return x < y and x - y + mod or x - y\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\nlocal n = io.read(\"*n\")\n\nlocal fact = {1}\nfor i = 2, n do\n fact[i] = bmul(fact[i - 1], i)\nend\nlocal function getComb(n, k)\n if k == 0 or k == n then return 1 end\n return bmul(fact[n], modinv(bmul(fact[k], fact[n - k])))\nend\nlocal function getInvComb(n, k)\n if k == 0 or k == n then return 1 end\n return bmul(fact[k], bmul(fact[n - k], modinv(fact[n])))\nend\n\n\nlocal edge = {}\nlocal parent = {}\nlocal childcnt = {}\nlocal child_asked_cnt = {}\nfor i = 1, n do\n edge[i] = {}\n parent[i] = 0\n childcnt[i] = 0\n child_asked_cnt[i] = 0\nend\nfor i = 1, n - 1 do\n local a, b = io.read(\"*n\", \"*n\")\n table.insert(edge[a], b)\n table.insert(edge[b], a)\nend\nlocal tasks = {1}\nfor itask = 1, n do\n local src = tasks[itask]\n for i = 1, #edge[src] do\n local dst = edge[src][i]\n if parent[src] ~= dst then\n parent[dst] = src\n table.insert(tasks, dst)\n end\n end\nend\ntasks = {}\n-- find leaf\nfor i = 2, n do\n if #edge[i] == 1 then\n table.insert(tasks, i)\n end\nend\nfor itask = 1, n - 1 do\n local child = tasks[itask]\n local p = parent[child]\n childcnt[p] = childcnt[p] + 1 + childcnt[child]\n child_asked_cnt[p] = child_asked_cnt[p] + 1\n if child_asked_cnt[p] + 1 == #edge[p] then\n table.insert(tasks, p)\n end\nend\nlocal allmult = 1\nlocal multiple = {}\nfor i = 1, n do\n multiple[i] = 1\nend\ntasks = { {1, 1} }\nfor itask = 1, n do\n local src, mul = tasks[itask][1], tasks[itask][2]\n -- when start from parents\n multiple[src] = bmul(multiple[src], mul)\n local childall = childcnt[src]\n local otherall = n - 1\n local prog_mul = 1\n for i = 1, #edge[src] do\n local dst = edge[src][i]\n if parent[src] ~= dst then\n prog_mul = bmul(prog_mul, getComb(otherall, 1 + childcnt[dst]))\n otherall = otherall - 1 - childcnt[dst]\n end\n end\n -- when start from src\n multiple[src] = bmul(multiple[src], prog_mul)\n -- affect to parents\n local affect = bmul(prog_mul, getInvComb(n - 1, n - 1 - childcnt[src]))\n allmult = bmul(allmult, affect)\n -- print(src, prog_mul, allmult)\n local afinv = modinv(affect)\n mul = bmul(mul, afinv)\n multiple[src] = bmul(multiple[src], afinv)\n -- when start from children\n for i = 1, #edge[src] do\n local dst = edge[src][i]\n if parent[src] ~= dst then\n local prog = bmul(prog_mul, mul)\n prog = bmul(prog, getInvComb(n - 1, 1 + childcnt[dst]))\n table.insert(tasks, {dst, prog})\n end\n end\nend\nfor i = 1, n do\n -- print(i, allmult, multiple[i])\n local z = bmul(allmult, multiple[i])\n print(z)\nend\n", "language": "Lua", "metadata": {"date": 1585448964, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s166613561.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s166613561", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n1\n1\n", "input_to_evaluate": "local mod = 1000000007\nlocal mfl = math.floor\n\nlocal function bmul(x, y)\n local x0, y0 = x % 31623, y % 31623\n local x1, y1 = mfl(x / 31623), mfl(y / 31623)\n return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod\nend\n\nlocal function badd(x, y)\n return (x + y) % mod\nend\n\nlocal function bsub(x, y)\n return x < y and x - y + mod or x - y\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\nlocal n = io.read(\"*n\")\n\nlocal fact = {1}\nfor i = 2, n do\n fact[i] = bmul(fact[i - 1], i)\nend\nlocal function getComb(n, k)\n if k == 0 or k == n then return 1 end\n return bmul(fact[n], modinv(bmul(fact[k], fact[n - k])))\nend\nlocal function getInvComb(n, k)\n if k == 0 or k == n then return 1 end\n return bmul(fact[k], bmul(fact[n - k], modinv(fact[n])))\nend\n\n\nlocal edge = {}\nlocal parent = {}\nlocal childcnt = {}\nlocal child_asked_cnt = {}\nfor i = 1, n do\n edge[i] = {}\n parent[i] = 0\n childcnt[i] = 0\n child_asked_cnt[i] = 0\nend\nfor i = 1, n - 1 do\n local a, b = io.read(\"*n\", \"*n\")\n table.insert(edge[a], b)\n table.insert(edge[b], a)\nend\nlocal tasks = {1}\nfor itask = 1, n do\n local src = tasks[itask]\n for i = 1, #edge[src] do\n local dst = edge[src][i]\n if parent[src] ~= dst then\n parent[dst] = src\n table.insert(tasks, dst)\n end\n end\nend\ntasks = {}\n-- find leaf\nfor i = 2, n do\n if #edge[i] == 1 then\n table.insert(tasks, i)\n end\nend\nfor itask = 1, n - 1 do\n local child = tasks[itask]\n local p = parent[child]\n childcnt[p] = childcnt[p] + 1 + childcnt[child]\n child_asked_cnt[p] = child_asked_cnt[p] + 1\n if child_asked_cnt[p] + 1 == #edge[p] then\n table.insert(tasks, p)\n end\nend\nlocal allmult = 1\nlocal multiple = {}\nfor i = 1, n do\n multiple[i] = 1\nend\ntasks = { {1, 1} }\nfor itask = 1, n do\n local src, mul = tasks[itask][1], tasks[itask][2]\n -- when start from parents\n multiple[src] = bmul(multiple[src], mul)\n local childall = childcnt[src]\n local otherall = n - 1\n local prog_mul = 1\n for i = 1, #edge[src] do\n local dst = edge[src][i]\n if parent[src] ~= dst then\n prog_mul = bmul(prog_mul, getComb(otherall, 1 + childcnt[dst]))\n otherall = otherall - 1 - childcnt[dst]\n end\n end\n -- when start from src\n multiple[src] = bmul(multiple[src], prog_mul)\n -- affect to parents\n local affect = bmul(prog_mul, getInvComb(n - 1, n - 1 - childcnt[src]))\n allmult = bmul(allmult, affect)\n -- print(src, prog_mul, allmult)\n local afinv = modinv(affect)\n mul = bmul(mul, afinv)\n multiple[src] = bmul(multiple[src], afinv)\n -- when start from children\n for i = 1, #edge[src] do\n local dst = edge[src][i]\n if parent[src] ~= dst then\n local prog = bmul(prog_mul, mul)\n prog = bmul(prog, getInvComb(n - 1, 1 + childcnt[dst]))\n table.insert(tasks, {dst, prog})\n end\n end\nend\nfor i = 1, n do\n -- print(i, allmult, multiple[i])\n local z = bmul(allmult, multiple[i])\n print(z)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3133, "cpu_time_ms": 1340, "memory_kb": 45240}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s315882816", "group_id": "codeNet:p02728", "input_text": "local mod = 1000000007\nlocal mfl = math.floor\n\nlocal function bmul(x, y)\n local x0, y0 = x % 31623, y % 31623\n local x1, y1 = mfl(x / 31623), mfl(y / 31623)\n return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod\nend\n\nlocal function badd(x, y)\n return (x + y) % mod\nend\n\nlocal function bsub(x, y)\n return x < y and x - y + mod or x - y\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\nlocal n = io.read(\"*n\")\n\nlocal fact = {1}\nfor i = 2, n do\n fact[i] = bmul(fact[i - 1], i)\nend\nlocal function getComb(n, k)\n if k == 0 or k == n then return 1 end\n return bmul(fact[n], modinv(bmul(fact[k], fact[n - k])))\nend\nlocal function getInvComb(n, k)\n if k == 0 or k == n then return 1 end\n return bmul(fact[k], bmul(fact[n - k], modinv(fact[n])))\nend\n\n\nlocal edge = {}\nlocal parent = {}\nlocal childcnt = {}\nlocal child_asked_cnt = {}\nfor i = 1, n do\n edge[i] = {}\n parent[i] = 0\n childcnt[i] = 0\n child_asked_cnt[i] = 0\nend\nfor i = 1, n - 1 do\n local a, b = io.read(\"*n\", \"*n\")\n table.insert(edge[a], b)\n table.insert(edge[b], a)\nend\nlocal tasks = {1}\nfor itask = 1, n do\n local src = tasks[itask]\n for i = 1, #edge[src] do\n local dst = edge[src][i]\n if parent[src] ~= dst then\n parent[dst] = src\n table.insert(tasks, dst)\n end\n end\nend\ntasks = {}\n-- find leaf\nfor i = 2, n do\n if #edge[i] == 1 then\n table.insert(tasks, i)\n end\nend\nfor itask = 1, n - 1 do\n local child = tasks[itask]\n local p = parent[child]\n childcnt[p] = childcnt[p] + 1 + childcnt[child]\n child_asked_cnt[p] = child_asked_cnt[p] + 1\n if child_asked_cnt[p] + 1 == #edge[p] then\n table.insert(tasks, p)\n end\nend\nlocal allmult = 1\nlocal multiple = {}\nfor i = 1, n do\n multiple[i] = 1\nend\ntasks = { {1, 1} }\nfor itask = 1, n do\n local src, mul = tasks[itask][1], tasks[itask][2]\n -- when start from parents\n multiple[src] = bmul(multiple[src], mul)\n local childall = childcnt[src]\n local otherall = n - 1\n local prog_mul = 1\n for i = 1, #edge[src] do\n local dst = edge[src][i]\n if parent[src] ~= dst then\n prog_mul = bmul(prog_mul, getComb(otherall, 1 + childcnt[dst]))\n otherall = otherall - 1 - childcnt[dst]\n end\n end\n -- when start from src\n multiple[src] = bmul(multiple[src], prog_mul)\n -- affect to parents\n local affect = bmul(prog_mul, getInvComb(n - 1, n - 1 - childcnt[src]))\n allmult = bmul(allmult, affect)\n -- print(src, prog_mul, allmult)\n mul = bmul(mul, modinv(affect))\n multiple[src] = bmul(multiple[src], modinv(affect))\n -- when start from children\n for i = 1, #edge[src] do\n local dst = edge[src][i]\n if parent[src] ~= dst then\n local prog = bmul(prog_mul, mul)\n prog = bmul(prog, getInvComb(n - 1, 1 + childcnt[dst]))\n table.insert(tasks, {dst, prog})\n end\n end\nend\nfor i = 1, n do\n -- print(i, allmult, multiple[i])\n local z = bmul(allmult, multiple[i])\n print(z)\nend\n", "language": "Lua", "metadata": {"date": 1585448818, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s315882816.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s315882816", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n1\n1\n", "input_to_evaluate": "local mod = 1000000007\nlocal mfl = math.floor\n\nlocal function bmul(x, y)\n local x0, y0 = x % 31623, y % 31623\n local x1, y1 = mfl(x / 31623), mfl(y / 31623)\n return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod\nend\n\nlocal function badd(x, y)\n return (x + y) % mod\nend\n\nlocal function bsub(x, y)\n return x < y and x - y + mod or x - y\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\nlocal n = io.read(\"*n\")\n\nlocal fact = {1}\nfor i = 2, n do\n fact[i] = bmul(fact[i - 1], i)\nend\nlocal function getComb(n, k)\n if k == 0 or k == n then return 1 end\n return bmul(fact[n], modinv(bmul(fact[k], fact[n - k])))\nend\nlocal function getInvComb(n, k)\n if k == 0 or k == n then return 1 end\n return bmul(fact[k], bmul(fact[n - k], modinv(fact[n])))\nend\n\n\nlocal edge = {}\nlocal parent = {}\nlocal childcnt = {}\nlocal child_asked_cnt = {}\nfor i = 1, n do\n edge[i] = {}\n parent[i] = 0\n childcnt[i] = 0\n child_asked_cnt[i] = 0\nend\nfor i = 1, n - 1 do\n local a, b = io.read(\"*n\", \"*n\")\n table.insert(edge[a], b)\n table.insert(edge[b], a)\nend\nlocal tasks = {1}\nfor itask = 1, n do\n local src = tasks[itask]\n for i = 1, #edge[src] do\n local dst = edge[src][i]\n if parent[src] ~= dst then\n parent[dst] = src\n table.insert(tasks, dst)\n end\n end\nend\ntasks = {}\n-- find leaf\nfor i = 2, n do\n if #edge[i] == 1 then\n table.insert(tasks, i)\n end\nend\nfor itask = 1, n - 1 do\n local child = tasks[itask]\n local p = parent[child]\n childcnt[p] = childcnt[p] + 1 + childcnt[child]\n child_asked_cnt[p] = child_asked_cnt[p] + 1\n if child_asked_cnt[p] + 1 == #edge[p] then\n table.insert(tasks, p)\n end\nend\nlocal allmult = 1\nlocal multiple = {}\nfor i = 1, n do\n multiple[i] = 1\nend\ntasks = { {1, 1} }\nfor itask = 1, n do\n local src, mul = tasks[itask][1], tasks[itask][2]\n -- when start from parents\n multiple[src] = bmul(multiple[src], mul)\n local childall = childcnt[src]\n local otherall = n - 1\n local prog_mul = 1\n for i = 1, #edge[src] do\n local dst = edge[src][i]\n if parent[src] ~= dst then\n prog_mul = bmul(prog_mul, getComb(otherall, 1 + childcnt[dst]))\n otherall = otherall - 1 - childcnt[dst]\n end\n end\n -- when start from src\n multiple[src] = bmul(multiple[src], prog_mul)\n -- affect to parents\n local affect = bmul(prog_mul, getInvComb(n - 1, n - 1 - childcnt[src]))\n allmult = bmul(allmult, affect)\n -- print(src, prog_mul, allmult)\n mul = bmul(mul, modinv(affect))\n multiple[src] = bmul(multiple[src], modinv(affect))\n -- when start from children\n for i = 1, #edge[src] do\n local dst = edge[src][i]\n if parent[src] ~= dst then\n local prog = bmul(prog_mul, mul)\n prog = bmul(prog, getInvComb(n - 1, 1 + childcnt[dst]))\n table.insert(tasks, {dst, prog})\n end\n end\nend\nfor i = 1, n do\n -- print(i, allmult, multiple[i])\n local z = bmul(allmult, multiple[i])\n print(z)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3120, "cpu_time_ms": 1653, "memory_kb": 45356}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s699135169", "group_id": "codeNet:p02730", "input_text": "local function no()\n print(\"No\")\n os.exit()\nend\n\nlocal s = \"\"..io.read(\"*l\")\nif s ~= s:reverse() then\n no()\nend\nlocal front_s = s:sub(1, (s:len() - 1) / 2)\nif front_s ~= front_s:reverse() then\n no()\nend\nlocal back_s = s:sub((s:len() + 3) / 2, s:len())\nif back_s ~= back_s:reverse() then\n no()\nend\n\nprint(\"Yes\")", "language": "Lua", "metadata": {"date": 1586291118, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02730.html", "problem_id": "p02730", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02730/input.txt", "sample_output_relpath": "derived/input_output/data/p02730/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02730/Lua/s699135169.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s699135169", "user_id": "u793881115"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local function no()\n print(\"No\")\n os.exit()\nend\n\nlocal s = \"\"..io.read(\"*l\")\nif s ~= s:reverse() then\n no()\nend\nlocal front_s = s:sub(1, (s:len() - 1) / 2)\nif front_s ~= front_s:reverse() then\n no()\nend\nlocal back_s = s:sub((s:len() + 3) / 2, s:len())\nif back_s ~= back_s:reverse() then\n no()\nend\n\nprint(\"Yes\")", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:\n\nS is a palindrome.\n\nLet N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome.\n\nThe string consisting of the (N+3)/2-st through N-th characters of S is a palindrome.\n\nDetermine whether S is a strong palindrome.\n\nConstraints\n\nS consists of lowercase English letters.\n\nThe length of S is an odd number between 3 and 99 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a strong palindrome, print Yes;\notherwise, print No.\n\nSample Input 1\n\nakasaka\n\nSample Output 1\n\nYes\n\nS is akasaka.\n\nThe string formed by the 1-st through the 3-rd characters is aka.\n\nThe string formed by the 5-th through the 7-th characters is aka.\nAll of these are palindromes, so S is a strong palindrome.\n\nSample Input 2\n\nlevel\n\nSample Output 2\n\nNo\n\nSample Input 3\n\natcoder\n\nSample Output 3\n\nNo", "sample_input": "akasaka\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02730", "source_text": "Score : 200 points\n\nProblem Statement\n\nA string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:\n\nS is a palindrome.\n\nLet N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome.\n\nThe string consisting of the (N+3)/2-st through N-th characters of S is a palindrome.\n\nDetermine whether S is a strong palindrome.\n\nConstraints\n\nS consists of lowercase English letters.\n\nThe length of S is an odd number between 3 and 99 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a strong palindrome, print Yes;\notherwise, print No.\n\nSample Input 1\n\nakasaka\n\nSample Output 1\n\nYes\n\nS is akasaka.\n\nThe string formed by the 1-st through the 3-rd characters is aka.\n\nThe string formed by the 5-th through the 7-th characters is aka.\nAll of these are palindromes, so S is a strong palindrome.\n\nSample Input 2\n\nlevel\n\nSample Output 2\n\nNo\n\nSample Input 3\n\natcoder\n\nSample Output 3\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 325, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s456016535", "group_id": "codeNet:p02730", "input_text": "local function no()\n print(\"no\")\n os.exit()\nend\n\nlocal s = \"\"..io.read(\"*l\")\nif s ~= s:reverse() then\n no()\nend\nlocal front_s = s:sub(1, (s:len() - 1) / 2)\nif front_s ~= front_s:reverse() then\n no()\nend\nlocal back_s = s:sub((s:len() + 3) / 2, s:len())\nif back_s ~= back_s:reverse() then\n no()\nend\n\nprint(\"yes\")", "language": "Lua", "metadata": {"date": 1586291020, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02730.html", "problem_id": "p02730", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02730/input.txt", "sample_output_relpath": "derived/input_output/data/p02730/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02730/Lua/s456016535.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s456016535", "user_id": "u793881115"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local function no()\n print(\"no\")\n os.exit()\nend\n\nlocal s = \"\"..io.read(\"*l\")\nif s ~= s:reverse() then\n no()\nend\nlocal front_s = s:sub(1, (s:len() - 1) / 2)\nif front_s ~= front_s:reverse() then\n no()\nend\nlocal back_s = s:sub((s:len() + 3) / 2, s:len())\nif back_s ~= back_s:reverse() then\n no()\nend\n\nprint(\"yes\")", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:\n\nS is a palindrome.\n\nLet N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome.\n\nThe string consisting of the (N+3)/2-st through N-th characters of S is a palindrome.\n\nDetermine whether S is a strong palindrome.\n\nConstraints\n\nS consists of lowercase English letters.\n\nThe length of S is an odd number between 3 and 99 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a strong palindrome, print Yes;\notherwise, print No.\n\nSample Input 1\n\nakasaka\n\nSample Output 1\n\nYes\n\nS is akasaka.\n\nThe string formed by the 1-st through the 3-rd characters is aka.\n\nThe string formed by the 5-th through the 7-th characters is aka.\nAll of these are palindromes, so S is a strong palindrome.\n\nSample Input 2\n\nlevel\n\nSample Output 2\n\nNo\n\nSample Input 3\n\natcoder\n\nSample Output 3\n\nNo", "sample_input": "akasaka\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02730", "source_text": "Score : 200 points\n\nProblem Statement\n\nA string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:\n\nS is a palindrome.\n\nLet N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome.\n\nThe string consisting of the (N+3)/2-st through N-th characters of S is a palindrome.\n\nDetermine whether S is a strong palindrome.\n\nConstraints\n\nS consists of lowercase English letters.\n\nThe length of S is an odd number between 3 and 99 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a strong palindrome, print Yes;\notherwise, print No.\n\nSample Input 1\n\nakasaka\n\nSample Output 1\n\nYes\n\nS is akasaka.\n\nThe string formed by the 1-st through the 3-rd characters is aka.\n\nThe string formed by the 5-th through the 7-th characters is aka.\nAll of these are palindromes, so S is a strong palindrome.\n\nSample Input 2\n\nlevel\n\nSample Output 2\n\nNo\n\nSample Input 3\n\natcoder\n\nSample Output 3\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 325, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s759999562", "group_id": "codeNet:p02730", "input_text": "local s = io.read()\nlocal function j(z)\n local n = #z\n for i = 1, n do\n if z:sub(i, i) ~= z:sub(n + 1 - i, n + 1 - i) then\n return false\n end\n end\n return true\nend\n\nlocal s1 = s:sub(1, (#s - 1) // 2)\nlocal s2 = s:sub((#s + 3) // 2, #s)\nlocal f = j(s) and j(s1) and j(s2)\nprint(f and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1584925588, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02730.html", "problem_id": "p02730", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02730/input.txt", "sample_output_relpath": "derived/input_output/data/p02730/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02730/Lua/s759999562.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s759999562", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local s = io.read()\nlocal function j(z)\n local n = #z\n for i = 1, n do\n if z:sub(i, i) ~= z:sub(n + 1 - i, n + 1 - i) then\n return false\n end\n end\n return true\nend\n\nlocal s1 = s:sub(1, (#s - 1) // 2)\nlocal s2 = s:sub((#s + 3) // 2, #s)\nlocal f = j(s) and j(s1) and j(s2)\nprint(f and \"Yes\" or \"No\")\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:\n\nS is a palindrome.\n\nLet N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome.\n\nThe string consisting of the (N+3)/2-st through N-th characters of S is a palindrome.\n\nDetermine whether S is a strong palindrome.\n\nConstraints\n\nS consists of lowercase English letters.\n\nThe length of S is an odd number between 3 and 99 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a strong palindrome, print Yes;\notherwise, print No.\n\nSample Input 1\n\nakasaka\n\nSample Output 1\n\nYes\n\nS is akasaka.\n\nThe string formed by the 1-st through the 3-rd characters is aka.\n\nThe string formed by the 5-th through the 7-th characters is aka.\nAll of these are palindromes, so S is a strong palindrome.\n\nSample Input 2\n\nlevel\n\nSample Output 2\n\nNo\n\nSample Input 3\n\natcoder\n\nSample Output 3\n\nNo", "sample_input": "akasaka\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02730", "source_text": "Score : 200 points\n\nProblem Statement\n\nA string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:\n\nS is a palindrome.\n\nLet N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome.\n\nThe string consisting of the (N+3)/2-st through N-th characters of S is a palindrome.\n\nDetermine whether S is a strong palindrome.\n\nConstraints\n\nS consists of lowercase English letters.\n\nThe length of S is an odd number between 3 and 99 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a strong palindrome, print Yes;\notherwise, print No.\n\nSample Input 1\n\nakasaka\n\nSample Output 1\n\nYes\n\nS is akasaka.\n\nThe string formed by the 1-st through the 3-rd characters is aka.\n\nThe string formed by the 5-th through the 7-th characters is aka.\nAll of these are palindromes, so S is a strong palindrome.\n\nSample Input 2\n\nlevel\n\nSample Output 2\n\nNo\n\nSample Input 3\n\natcoder\n\nSample Output 3\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s447332419", "group_id": "codeNet:p02732", "input_text": "local n = io.read(\"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = io.read(\"*n\")\nend\nlocal z = {}\nfor i = 1, n do\n local v = t[i]\n if not z[v] then z[v] = 1\n else z[v] = z[v] + 1\n end\nend\nlocal tot = 0\nfor k, val in pairs(z) do\n tot = tot + (val * (val - 1)) // 2\nend\n\nfor i = 1, n do\n local ret = tot\n local v = t[i]\n ret = ret - (z[v] * (z[v] - 1)) // 2\n ret = ret + ((z[v] - 1) * (z[v] - 2)) // 2\n print(ret)\nend\n", "language": "Lua", "metadata": {"date": 1584925888, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s447332419.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s447332419", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n2\n3\n2\n3\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = io.read(\"*n\")\nend\nlocal z = {}\nfor i = 1, n do\n local v = t[i]\n if not z[v] then z[v] = 1\n else z[v] = z[v] + 1\n end\nend\nlocal tot = 0\nfor k, val in pairs(z) do\n tot = tot + (val * (val - 1)) // 2\nend\n\nfor i = 1, n do\n local ret = tot\n local v = t[i]\n ret = ret - (z[v] * (z[v] - 1)) // 2\n ret = ret + ((z[v] - 1) * (z[v] - 2)) // 2\n print(ret)\nend\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N balls. The i-th ball has an integer A_i written on it.\n\nFor each k=1, 2, ..., N, solve the following problem and print the answer.\n\nFind the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.\n\nConstraints\n\n3 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFor each k=1,2,...,N, print a line containing the answer.\n\nSample Input 1\n\n5\n1 1 2 1 2\n\nSample Output 1\n\n2\n2\n3\n2\n3\n\nConsider the case k=1 for example. The numbers written on the remaining balls are 1,2,1,2.\n\nFrom these balls, there are two ways to choose two distinct balls so that the integers written on them are equal.\n\nThus, the answer for k=1 is 2.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n0\n0\n0\n\nNo two balls have equal numbers written on them.\n\nSample Input 3\n\n5\n3 3 3 3 3\n\nSample Output 3\n\n6\n6\n6\n6\n6\n\nAny two balls have equal numbers written on them.\n\nSample Input 4\n\n8\n1 2 1 4 2 1 4 1\n\nSample Output 4\n\n5\n7\n5\n7\n7\n5\n7\n5", "sample_input": "5\n1 1 2 1 2\n"}, "reference_outputs": ["2\n2\n3\n2\n3\n"], "source_document_id": "p02732", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N balls. The i-th ball has an integer A_i written on it.\n\nFor each k=1, 2, ..., N, solve the following problem and print the answer.\n\nFind the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.\n\nConstraints\n\n3 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFor each k=1,2,...,N, print a line containing the answer.\n\nSample Input 1\n\n5\n1 1 2 1 2\n\nSample Output 1\n\n2\n2\n3\n2\n3\n\nConsider the case k=1 for example. The numbers written on the remaining balls are 1,2,1,2.\n\nFrom these balls, there are two ways to choose two distinct balls so that the integers written on them are equal.\n\nThus, the answer for k=1 is 2.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n0\n0\n0\n\nNo two balls have equal numbers written on them.\n\nSample Input 3\n\n5\n3 3 3 3 3\n\nSample Output 3\n\n6\n6\n6\n6\n6\n\nAny two balls have equal numbers written on them.\n\nSample Input 4\n\n8\n1 2 1 4 2 1 4 1\n\nSample Output 4\n\n5\n7\n5\n7\n7\n5\n7\n5", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 592, "memory_kb": 12396}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s387841970", "group_id": "codeNet:p02733", "input_text": "local mmi, mma = math.min, math.max\nlocal bls, brs = bit.lshift, bit.rshift\nlocal h, w, k = io.read(\"*n\", \"*n\", \"*n\", \"*l\")\nlocal map = {}\nfor i = 1, h do\n local s = io.read()\n for j = 1, w do\n local ss = s:sub(j, j)\n map[(i - 1) * w + j] = ss == \"1\"\n end\nend\nlocal ans = false\nlocal tot = 2^(h - 1)\nfor it = 0, tot - 1 do\n local tmpi = it\n local box = {1}\n local pos = 1\n for j = 2, h do\n if it % 2 == 1 then\n pos = pos + 1\n end\n box[j] = pos\n it = brs(it, 1)\n end\n local bsize = pos\n local ret = bsize - 1\n -- print(tmpi, ret)\n local bcnt = {}\n for i = 1, bsize do\n bcnt[i] = 0\n end\n local valid = true\n local start_w = 1\n for j = 1, w do\n for i = 1, h do\n local idx = (i - 1) * w + j\n if map[idx] then\n bcnt[box[i]] = bcnt[box[i]] + 1\n end\n end\n local over = false\n for ib = 1, bsize do\n if k < bcnt[ib] then\n over = true\n break\n end\n end\n if over then\n if start_w == j then\n valid = false\n break\n end\n start_w = j\n ret = ret + 1\n for ib = 1, bsize do\n bcnt[ib] = 0\n end\n for i = 1, h do\n local idx = (i - 1) * w + j\n if map[idx] then\n bcnt[box[i]] = bcnt[box[i]] + 1\n end\n end\n end\n end\n if valid then\n if not ans then ans = ret\n else ans = mmi(ans, ret)\n end\n end\nend\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1584926772, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s387841970.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s387841970", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal bls, brs = bit.lshift, bit.rshift\nlocal h, w, k = io.read(\"*n\", \"*n\", \"*n\", \"*l\")\nlocal map = {}\nfor i = 1, h do\n local s = io.read()\n for j = 1, w do\n local ss = s:sub(j, j)\n map[(i - 1) * w + j] = ss == \"1\"\n end\nend\nlocal ans = false\nlocal tot = 2^(h - 1)\nfor it = 0, tot - 1 do\n local tmpi = it\n local box = {1}\n local pos = 1\n for j = 2, h do\n if it % 2 == 1 then\n pos = pos + 1\n end\n box[j] = pos\n it = brs(it, 1)\n end\n local bsize = pos\n local ret = bsize - 1\n -- print(tmpi, ret)\n local bcnt = {}\n for i = 1, bsize do\n bcnt[i] = 0\n end\n local valid = true\n local start_w = 1\n for j = 1, w do\n for i = 1, h do\n local idx = (i - 1) * w + j\n if map[idx] then\n bcnt[box[i]] = bcnt[box[i]] + 1\n end\n end\n local over = false\n for ib = 1, bsize do\n if k < bcnt[ib] then\n over = true\n break\n end\n end\n if over then\n if start_w == j then\n valid = false\n break\n end\n start_w = j\n ret = ret + 1\n for ib = 1, bsize do\n bcnt[ib] = 0\n end\n for i = 1, h do\n local idx = (i - 1) * w + j\n if map[idx] then\n bcnt[box[i]] = bcnt[box[i]] + 1\n end\n end\n end\n end\n if valid then\n if not ans then ans = ret\n else ans = mmi(ans, ret)\n end\n end\nend\nprint(ans)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1397, "cpu_time_ms": 89, "memory_kb": 640}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s212410927", "group_id": "codeNet:p02744", "input_text": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\nlocal function array(dimension, default_val) assert(type(default_val) ~= 'table') local n=dimension local m={}if default_val~=nil then m[1]={__index=function()return default_val end}end for i=2,n do m[i]={__index=function(p, k)local c=setmetatable({},m[i-1])rawset(p,k,c)return c end}end return setmetatable({},m[n])end\nlocal function open(...) for _,t in pairs{...} do for k,v in pairs(t) do _G[k]=v end end end\n----\nopen(table, math)\nlocal A = {\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\"}\nlocal N = read.n()\n\nlocal ans = {}\nlocal build = {}\nlocal function count(s)\n return #s\nend\nlocal function pop(s)\n return remove(s)\nend\nlocal function push(s, a)\n insert(s, a)\nend\nlocal stack_data = {}\nlocal stack_frame = {}\npush(stack_frame, {[\"a\"]=\"d\"})\npush(stack_data, {0, 0})\ndo\n ::entry::\n --print(\"entry\", count(stack_data), count(stack_frame))\n local i, mx = unpack(pop(stack_data))\n --print(\"i,mx\",i,mx)\n local j, lim, f\n if i == N then\n insert(ans, concat(build, \"\"))\n --print(\"going to branch_end\")\n goto branch_end\n end\n j = 1\n lim = mx + 1\n ::loop_start::\n --print(\"loop_start\")\n if j>lim then\n goto loop_end\n end\n build[i+1] = A[j]\n f = {}\n f.a = \"r\"\n f.i = i\n f.mx = mx\n f.j = j\n f.lim = lim\n --print(\"recursive\")\n push(stack_frame, f)\n push(stack_data, {i+1, max(j,mx)})\n goto entry\n ::respawn::\n --print(\"respawn\")\n goto loop_start\n ::loop_end::\n ::branch_end::\n --print(\"#stack_frame\", count(stack_frame))\n local upper_frame = pop(stack_frame)\n if upper_frame.a == \"d\" then\n goto done\n elseif upper_frame.a == \"r\" then\n i = upper_frame.i\n mx = upper_frame.mx\n j = upper_frame.j\n lim = upper_frame.lim\n j = j + 1\n goto respawn\n end\nend\n::done::\n\nfor i=1,#ans do\n print(ans[i])\nend", "language": "Lua", "metadata": {"date": 1584281817, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02744.html", "problem_id": "p02744", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02744/input.txt", "sample_output_relpath": "derived/input_output/data/p02744/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02744/Lua/s212410927.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s212410927", "user_id": "u162773977"}, "prompt_components": {"gold_output": "a\n", "input_to_evaluate": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\nlocal function array(dimension, default_val) assert(type(default_val) ~= 'table') local n=dimension local m={}if default_val~=nil then m[1]={__index=function()return default_val end}end for i=2,n do m[i]={__index=function(p, k)local c=setmetatable({},m[i-1])rawset(p,k,c)return c end}end return setmetatable({},m[n])end\nlocal function open(...) for _,t in pairs{...} do for k,v in pairs(t) do _G[k]=v end end end\n----\nopen(table, math)\nlocal A = {\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\"}\nlocal N = read.n()\n\nlocal ans = {}\nlocal build = {}\nlocal function count(s)\n return #s\nend\nlocal function pop(s)\n return remove(s)\nend\nlocal function push(s, a)\n insert(s, a)\nend\nlocal stack_data = {}\nlocal stack_frame = {}\npush(stack_frame, {[\"a\"]=\"d\"})\npush(stack_data, {0, 0})\ndo\n ::entry::\n --print(\"entry\", count(stack_data), count(stack_frame))\n local i, mx = unpack(pop(stack_data))\n --print(\"i,mx\",i,mx)\n local j, lim, f\n if i == N then\n insert(ans, concat(build, \"\"))\n --print(\"going to branch_end\")\n goto branch_end\n end\n j = 1\n lim = mx + 1\n ::loop_start::\n --print(\"loop_start\")\n if j>lim then\n goto loop_end\n end\n build[i+1] = A[j]\n f = {}\n f.a = \"r\"\n f.i = i\n f.mx = mx\n f.j = j\n f.lim = lim\n --print(\"recursive\")\n push(stack_frame, f)\n push(stack_data, {i+1, max(j,mx)})\n goto entry\n ::respawn::\n --print(\"respawn\")\n goto loop_start\n ::loop_end::\n ::branch_end::\n --print(\"#stack_frame\", count(stack_frame))\n local upper_frame = pop(stack_frame)\n if upper_frame.a == \"d\" then\n goto done\n elseif upper_frame.a == \"r\" then\n i = upper_frame.i\n mx = upper_frame.mx\n j = upper_frame.j\n lim = upper_frame.lim\n j = j + 1\n goto respawn\n end\nend\n::done::\n\nfor i=1,#ans do\n print(ans[i])\nend", "problem_context": "Score : 400 points\n\nProblem Statement\n\nIn this problem, we only consider strings consisting of lowercase English letters.\n\nStrings s and t are said to be isomorphic when the following conditions are satisfied:\n\n|s| = |t| holds.\n\nFor every pair i, j, one of the following holds:\n\ns_i = s_j and t_i = t_j.\n\ns_i \\neq s_j and t_i \\neq t_j.\n\nFor example, abcac and zyxzx are isomorphic, while abcac and ppppp are not.\n\nA string s is said to be in normal form when the following condition is satisfied:\n\nFor every string t that is isomorphic to s, s \\leq t holds. Here \\leq denotes lexicographic comparison.\n\nFor example, abcac is in normal form, but zyxzx is not since it is isomorphic to abcac, which is lexicographically smaller than zyxzx.\n\nYou are given an integer N.\nPrint all strings of length N that are in normal form, in lexicographically ascending order.\n\nConstraints\n\n1 \\leq N \\leq 10\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\nAssume that there are K strings of length N that are in normal form: w_1, \\ldots, w_K in lexicographical order.\nOutput should be in the following format:\n\nw_1\n:\nw_K\n\nSample Input 1\n\n1\n\nSample Output 1\n\na\n\nSample Input 2\n\n2\n\nSample Output 2\n\naa\nab", "sample_input": "1\n"}, "reference_outputs": ["a\n"], "source_document_id": "p02744", "source_text": "Score : 400 points\n\nProblem Statement\n\nIn this problem, we only consider strings consisting of lowercase English letters.\n\nStrings s and t are said to be isomorphic when the following conditions are satisfied:\n\n|s| = |t| holds.\n\nFor every pair i, j, one of the following holds:\n\ns_i = s_j and t_i = t_j.\n\ns_i \\neq s_j and t_i \\neq t_j.\n\nFor example, abcac and zyxzx are isomorphic, while abcac and ppppp are not.\n\nA string s is said to be in normal form when the following condition is satisfied:\n\nFor every string t that is isomorphic to s, s \\leq t holds. Here \\leq denotes lexicographic comparison.\n\nFor example, abcac is in normal form, but zyxzx is not since it is isomorphic to abcac, which is lexicographically smaller than zyxzx.\n\nYou are given an integer N.\nPrint all strings of length N that are in normal form, in lexicographically ascending order.\n\nConstraints\n\n1 \\leq N \\leq 10\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\nAssume that there are K strings of length N that are in normal form: w_1, \\ldots, w_K in lexicographical order.\nOutput should be in the following format:\n\nw_1\n:\nw_K\n\nSample Input 1\n\n1\n\nSample Output 1\n\na\n\nSample Input 2\n\n2\n\nSample Output 2\n\naa\nab", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2430, "cpu_time_ms": 654, "memory_kb": 22648}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s842753590", "group_id": "codeNet:p02744", "input_text": "local mfl = math.floor\nlocal n = io.read(\"*n\")\nlocal t = {string.rep(\"a\", n)}\nif 1 < n then\n t[2] = string.rep(\"a\", n - 1) .. \"b\"\n\n local function solve(prefix, used, rem)\n if rem == 0 then\n table.insert(t, prefix)\n return end\n local mul = used\n for i = 1, rem - 1 do\n mul = mul * (used + 1)\n end\n for i = 0, mul - 1 do\n local str = \"\"\n for j = 1, rem do\n str = string.char(97 + i % (used + 1)) .. str\n i = mfl(i / (used + 1))\n end\n table.insert(t, prefix .. str)\n end\n used = used + 1\n prefix = prefix .. string.char(96 + used)\n solve(prefix, used, rem - 1)\n end\n\n for i = n - 2, 1, -1 do\n local prefix = string.rep(\"a\", i) .. \"b\"\n solve(prefix, 2, n - i - 1)\n end\nend\nprint(table.concat(t, \"\\n\"))\n", "language": "Lua", "metadata": {"date": 1584236353, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02744.html", "problem_id": "p02744", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02744/input.txt", "sample_output_relpath": "derived/input_output/data/p02744/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02744/Lua/s842753590.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s842753590", "user_id": "u120582723"}, "prompt_components": {"gold_output": "a\n", "input_to_evaluate": "local mfl = math.floor\nlocal n = io.read(\"*n\")\nlocal t = {string.rep(\"a\", n)}\nif 1 < n then\n t[2] = string.rep(\"a\", n - 1) .. \"b\"\n\n local function solve(prefix, used, rem)\n if rem == 0 then\n table.insert(t, prefix)\n return end\n local mul = used\n for i = 1, rem - 1 do\n mul = mul * (used + 1)\n end\n for i = 0, mul - 1 do\n local str = \"\"\n for j = 1, rem do\n str = string.char(97 + i % (used + 1)) .. str\n i = mfl(i / (used + 1))\n end\n table.insert(t, prefix .. str)\n end\n used = used + 1\n prefix = prefix .. string.char(96 + used)\n solve(prefix, used, rem - 1)\n end\n\n for i = n - 2, 1, -1 do\n local prefix = string.rep(\"a\", i) .. \"b\"\n solve(prefix, 2, n - i - 1)\n end\nend\nprint(table.concat(t, \"\\n\"))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nIn this problem, we only consider strings consisting of lowercase English letters.\n\nStrings s and t are said to be isomorphic when the following conditions are satisfied:\n\n|s| = |t| holds.\n\nFor every pair i, j, one of the following holds:\n\ns_i = s_j and t_i = t_j.\n\ns_i \\neq s_j and t_i \\neq t_j.\n\nFor example, abcac and zyxzx are isomorphic, while abcac and ppppp are not.\n\nA string s is said to be in normal form when the following condition is satisfied:\n\nFor every string t that is isomorphic to s, s \\leq t holds. Here \\leq denotes lexicographic comparison.\n\nFor example, abcac is in normal form, but zyxzx is not since it is isomorphic to abcac, which is lexicographically smaller than zyxzx.\n\nYou are given an integer N.\nPrint all strings of length N that are in normal form, in lexicographically ascending order.\n\nConstraints\n\n1 \\leq N \\leq 10\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\nAssume that there are K strings of length N that are in normal form: w_1, \\ldots, w_K in lexicographical order.\nOutput should be in the following format:\n\nw_1\n:\nw_K\n\nSample Input 1\n\n1\n\nSample Output 1\n\na\n\nSample Input 2\n\n2\n\nSample Output 2\n\naa\nab", "sample_input": "1\n"}, "reference_outputs": ["a\n"], "source_document_id": "p02744", "source_text": "Score : 400 points\n\nProblem Statement\n\nIn this problem, we only consider strings consisting of lowercase English letters.\n\nStrings s and t are said to be isomorphic when the following conditions are satisfied:\n\n|s| = |t| holds.\n\nFor every pair i, j, one of the following holds:\n\ns_i = s_j and t_i = t_j.\n\ns_i \\neq s_j and t_i \\neq t_j.\n\nFor example, abcac and zyxzx are isomorphic, while abcac and ppppp are not.\n\nA string s is said to be in normal form when the following condition is satisfied:\n\nFor every string t that is isomorphic to s, s \\leq t holds. Here \\leq denotes lexicographic comparison.\n\nFor example, abcac is in normal form, but zyxzx is not since it is isomorphic to abcac, which is lexicographically smaller than zyxzx.\n\nYou are given an integer N.\nPrint all strings of length N that are in normal form, in lexicographically ascending order.\n\nConstraints\n\n1 \\leq N \\leq 10\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\nAssume that there are K strings of length N that are in normal form: w_1, \\ldots, w_K in lexicographical order.\nOutput should be in the following format:\n\nw_1\n:\nw_K\n\nSample Input 1\n\n1\n\nSample Output 1\n\na\n\nSample Input 2\n\n2\n\nSample Output 2\n\naa\nab", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 784, "cpu_time_ms": 123, "memory_kb": 6776}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s562187307", "group_id": "codeNet:p02744", "input_text": "local mfl = math.floor\nlocal n = io.read(\"*n\")\nlocal t = {string.rep(\"a\", n)}\nif 1 < n then\n t[2] = string.rep(\"a\", n - 1) .. \"b\"\n\n local function solve(prefix, used, rem)\n if rem == 0 then\n table.insert(t, prefix)\n return end\n local mul = 1\n for i = 1, rem do\n mul = mul * used\n end\n for i = 0, mul - 1 do\n local str = \"\"\n for j = 1, rem do\n str = string.char(97 + i % used) .. str\n i = mfl(i / used)\n end\n table.insert(t, prefix .. str)\n end\n used = used + 1\n prefix = prefix .. string.char(96 + used)\n solve(prefix, used, rem - 1)\n end\n\n for i = n - 2, 1, -1 do\n local prefix = string.rep(\"a\", i) .. \"b\"\n solve(prefix, 2, n - i - 1)\n end\nend\nprint(table.concat(t, \"\\n\"))\n", "language": "Lua", "metadata": {"date": 1584236147, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02744.html", "problem_id": "p02744", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02744/input.txt", "sample_output_relpath": "derived/input_output/data/p02744/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02744/Lua/s562187307.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s562187307", "user_id": "u120582723"}, "prompt_components": {"gold_output": "a\n", "input_to_evaluate": "local mfl = math.floor\nlocal n = io.read(\"*n\")\nlocal t = {string.rep(\"a\", n)}\nif 1 < n then\n t[2] = string.rep(\"a\", n - 1) .. \"b\"\n\n local function solve(prefix, used, rem)\n if rem == 0 then\n table.insert(t, prefix)\n return end\n local mul = 1\n for i = 1, rem do\n mul = mul * used\n end\n for i = 0, mul - 1 do\n local str = \"\"\n for j = 1, rem do\n str = string.char(97 + i % used) .. str\n i = mfl(i / used)\n end\n table.insert(t, prefix .. str)\n end\n used = used + 1\n prefix = prefix .. string.char(96 + used)\n solve(prefix, used, rem - 1)\n end\n\n for i = n - 2, 1, -1 do\n local prefix = string.rep(\"a\", i) .. \"b\"\n solve(prefix, 2, n - i - 1)\n end\nend\nprint(table.concat(t, \"\\n\"))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nIn this problem, we only consider strings consisting of lowercase English letters.\n\nStrings s and t are said to be isomorphic when the following conditions are satisfied:\n\n|s| = |t| holds.\n\nFor every pair i, j, one of the following holds:\n\ns_i = s_j and t_i = t_j.\n\ns_i \\neq s_j and t_i \\neq t_j.\n\nFor example, abcac and zyxzx are isomorphic, while abcac and ppppp are not.\n\nA string s is said to be in normal form when the following condition is satisfied:\n\nFor every string t that is isomorphic to s, s \\leq t holds. Here \\leq denotes lexicographic comparison.\n\nFor example, abcac is in normal form, but zyxzx is not since it is isomorphic to abcac, which is lexicographically smaller than zyxzx.\n\nYou are given an integer N.\nPrint all strings of length N that are in normal form, in lexicographically ascending order.\n\nConstraints\n\n1 \\leq N \\leq 10\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\nAssume that there are K strings of length N that are in normal form: w_1, \\ldots, w_K in lexicographical order.\nOutput should be in the following format:\n\nw_1\n:\nw_K\n\nSample Input 1\n\n1\n\nSample Output 1\n\na\n\nSample Input 2\n\n2\n\nSample Output 2\n\naa\nab", "sample_input": "1\n"}, "reference_outputs": ["a\n"], "source_document_id": "p02744", "source_text": "Score : 400 points\n\nProblem Statement\n\nIn this problem, we only consider strings consisting of lowercase English letters.\n\nStrings s and t are said to be isomorphic when the following conditions are satisfied:\n\n|s| = |t| holds.\n\nFor every pair i, j, one of the following holds:\n\ns_i = s_j and t_i = t_j.\n\ns_i \\neq s_j and t_i \\neq t_j.\n\nFor example, abcac and zyxzx are isomorphic, while abcac and ppppp are not.\n\nA string s is said to be in normal form when the following condition is satisfied:\n\nFor every string t that is isomorphic to s, s \\leq t holds. Here \\leq denotes lexicographic comparison.\n\nFor example, abcac is in normal form, but zyxzx is not since it is isomorphic to abcac, which is lexicographically smaller than zyxzx.\n\nYou are given an integer N.\nPrint all strings of length N that are in normal form, in lexicographically ascending order.\n\nConstraints\n\n1 \\leq N \\leq 10\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\nAssume that there are K strings of length N that are in normal form: w_1, \\ldots, w_K in lexicographical order.\nOutput should be in the following format:\n\nw_1\n:\nw_K\n\nSample Input 1\n\n1\n\nSample Output 1\n\na\n\nSample Input 2\n\n2\n\nSample Output 2\n\naa\nab", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 17, "memory_kb": 2176}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s958427467", "group_id": "codeNet:p02744", "input_text": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\nlocal function array(dimension, default_val) assert(type(default_val) ~= 'table') local n=dimension local m={}if default_val~=nil then m[1]={__index=function()return default_val end}end for i=2,n do m[i]={__index=function(p, k)local c=setmetatable({},m[i-1])rawset(p,k,c)return c end}end return setmetatable({},m[n])end\n----\nlocal A = {\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\"}\nlocal N = read.n()\n\nlocal function dfs(i, mx, s)\n if i == N then\n local a = {}\n while s do\n table.insert(a, s.val)\n s = s.next\n end\n local ss = table.concat(a, \"\")\n print(ss:reverse())\n else\n for j=1,mx+1 do\n local new = {}\n new.val = A[j]\n new.next = s\n dfs(i+1, math.max(j,mx),new)\n end\n end\nend\ndfs(0, 0, nil)\n", "language": "Lua", "metadata": {"date": 1584235280, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02744.html", "problem_id": "p02744", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02744/input.txt", "sample_output_relpath": "derived/input_output/data/p02744/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02744/Lua/s958427467.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s958427467", "user_id": "u162773977"}, "prompt_components": {"gold_output": "a\n", "input_to_evaluate": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\nlocal function array(dimension, default_val) assert(type(default_val) ~= 'table') local n=dimension local m={}if default_val~=nil then m[1]={__index=function()return default_val end}end for i=2,n do m[i]={__index=function(p, k)local c=setmetatable({},m[i-1])rawset(p,k,c)return c end}end return setmetatable({},m[n])end\n----\nlocal A = {\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\"}\nlocal N = read.n()\n\nlocal function dfs(i, mx, s)\n if i == N then\n local a = {}\n while s do\n table.insert(a, s.val)\n s = s.next\n end\n local ss = table.concat(a, \"\")\n print(ss:reverse())\n else\n for j=1,mx+1 do\n local new = {}\n new.val = A[j]\n new.next = s\n dfs(i+1, math.max(j,mx),new)\n end\n end\nend\ndfs(0, 0, nil)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nIn this problem, we only consider strings consisting of lowercase English letters.\n\nStrings s and t are said to be isomorphic when the following conditions are satisfied:\n\n|s| = |t| holds.\n\nFor every pair i, j, one of the following holds:\n\ns_i = s_j and t_i = t_j.\n\ns_i \\neq s_j and t_i \\neq t_j.\n\nFor example, abcac and zyxzx are isomorphic, while abcac and ppppp are not.\n\nA string s is said to be in normal form when the following condition is satisfied:\n\nFor every string t that is isomorphic to s, s \\leq t holds. Here \\leq denotes lexicographic comparison.\n\nFor example, abcac is in normal form, but zyxzx is not since it is isomorphic to abcac, which is lexicographically smaller than zyxzx.\n\nYou are given an integer N.\nPrint all strings of length N that are in normal form, in lexicographically ascending order.\n\nConstraints\n\n1 \\leq N \\leq 10\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\nAssume that there are K strings of length N that are in normal form: w_1, \\ldots, w_K in lexicographical order.\nOutput should be in the following format:\n\nw_1\n:\nw_K\n\nSample Input 1\n\n1\n\nSample Output 1\n\na\n\nSample Input 2\n\n2\n\nSample Output 2\n\naa\nab", "sample_input": "1\n"}, "reference_outputs": ["a\n"], "source_document_id": "p02744", "source_text": "Score : 400 points\n\nProblem Statement\n\nIn this problem, we only consider strings consisting of lowercase English letters.\n\nStrings s and t are said to be isomorphic when the following conditions are satisfied:\n\n|s| = |t| holds.\n\nFor every pair i, j, one of the following holds:\n\ns_i = s_j and t_i = t_j.\n\ns_i \\neq s_j and t_i \\neq t_j.\n\nFor example, abcac and zyxzx are isomorphic, while abcac and ppppp are not.\n\nA string s is said to be in normal form when the following condition is satisfied:\n\nFor every string t that is isomorphic to s, s \\leq t holds. Here \\leq denotes lexicographic comparison.\n\nFor example, abcac is in normal form, but zyxzx is not since it is isomorphic to abcac, which is lexicographically smaller than zyxzx.\n\nYou are given an integer N.\nPrint all strings of length N that are in normal form, in lexicographically ascending order.\n\nConstraints\n\n1 \\leq N \\leq 10\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\nAssume that there are K strings of length N that are in normal form: w_1, \\ldots, w_K in lexicographical order.\nOutput should be in the following format:\n\nw_1\n:\nw_K\n\nSample Input 1\n\n1\n\nSample Output 1\n\na\n\nSample Input 2\n\n2\n\nSample Output 2\n\naa\nab", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1369, "cpu_time_ms": 728, "memory_kb": 1656}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s283432866", "group_id": "codeNet:p02747", "input_text": "a = io.read()\na = a:gsub(\"hi\", \"\")\nprint(a == \"\" and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1589856238, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02747.html", "problem_id": "p02747", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02747/input.txt", "sample_output_relpath": "derived/input_output/data/p02747/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02747/Lua/s283432866.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s283432866", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "a = io.read()\na = a:gsub(\"hi\", \"\")\nprint(a == \"\" and \"Yes\" or \"No\")\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA Hitachi string is a concatenation of one or more copies of the string hi.\n\nFor example, hi and hihi are Hitachi strings, while ha and hii are not.\n\nGiven a string S, determine whether S is a Hitachi string.\n\nConstraints\n\nThe length of S is between 1 and 10 (inclusive).\n\nS is a string consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a Hitachi string, print Yes; otherwise, print No.\n\nSample Input 1\n\nhihi\n\nSample Output 1\n\nYes\n\nhihi is the concatenation of two copies of hi, so it is a Hitachi string.\n\nSample Input 2\n\nhi\n\nSample Output 2\n\nYes\n\nSample Input 3\n\nha\n\nSample Output 3\n\nNo", "sample_input": "hihi\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02747", "source_text": "Score : 100 points\n\nProblem Statement\n\nA Hitachi string is a concatenation of one or more copies of the string hi.\n\nFor example, hi and hihi are Hitachi strings, while ha and hii are not.\n\nGiven a string S, determine whether S is a Hitachi string.\n\nConstraints\n\nThe length of S is between 1 and 10 (inclusive).\n\nS is a string consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a Hitachi string, print Yes; otherwise, print No.\n\nSample Input 1\n\nhihi\n\nSample Output 1\n\nYes\n\nhihi is the concatenation of two copies of hi, so it is a Hitachi string.\n\nSample Input 2\n\nhi\n\nSample Output 2\n\nYes\n\nSample Input 3\n\nha\n\nSample Output 3\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 68, "cpu_time_ms": 6, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s960168778", "group_id": "codeNet:p02748", "input_text": "local mmi, mma = math.min, math.max\na, b, m = io.read(\"*n\", \"*n\", \"*n\")\nx = {}\ny = {}\nxmin, ymin = 1000000007, 1000000007\nfor i = 1, a do\n x[i] = io.read(\"*n\")\n xmin = mmi(xmin, x[i])\nend\nfor i = 1, b do\n y[i] = io.read(\"*n\")\n ymin = mmi(ymin, y[i])\nend\nret = xmin + ymin\nfor i = 1, m do\n xi, yi, c = io.read(\"*n\", \"*n\", \"*n\")\n ret = mmi(ret, x[xi] + y[yi] - c)\nend\nprint(ret)", "language": "Lua", "metadata": {"date": 1589856426, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02748.html", "problem_id": "p02748", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02748/input.txt", "sample_output_relpath": "derived/input_output/data/p02748/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02748/Lua/s960168778.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s960168778", "user_id": "u120582723"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\na, b, m = io.read(\"*n\", \"*n\", \"*n\")\nx = {}\ny = {}\nxmin, ymin = 1000000007, 1000000007\nfor i = 1, a do\n x[i] = io.read(\"*n\")\n xmin = mmi(xmin, x[i])\nend\nfor i = 1, b do\n y[i] = io.read(\"*n\")\n ymin = mmi(ymin, y[i])\nend\nret = xmin + ymin\nfor i = 1, m do\n xi, yi, c = io.read(\"*n\", \"*n\", \"*n\")\n ret = mmi(ret, x[xi] + y[yi] - c)\nend\nprint(ret)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are visiting a large electronics store to buy a refrigerator and a microwave.\n\nThe store sells A kinds of refrigerators and B kinds of microwaves. The i-th refrigerator ( 1 \\le i \\le A ) is sold at a_i yen (the currency of Japan), and the j-th microwave ( 1 \\le j \\le B ) is sold at b_j yen.\n\nYou have M discount tickets. With the i-th ticket ( 1 \\le i \\le M ), you can get a discount of c_i yen from the total price when buying the x_i-th refrigerator and the y_i-th microwave together. Only one ticket can be used at a time.\n\nYou are planning to buy one refrigerator and one microwave. Find the minimum amount of money required.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\le A \\le 10^5\n\n1 \\le B \\le 10^5\n\n1 \\le M \\le 10^5\n\n1 \\le a_i , b_i , c_i \\le 10^5\n\n1 \\le x_i \\le A\n\n1 \\le y_i \\le B\n\nc_i \\le a_{x_i} + b_{y_i}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B M\na_1 a_2 ... a_A\nb_1 b_2 ... b_B\nx_1 y_1 c_1\n\\vdots\nx_M y_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 1\n3 3\n3 3 3\n1 2 1\n\nSample Output 1\n\n5\n\nWith the ticket, you can get the 1-st refrigerator and the 2-nd microwave for 3+3-1=5 yen.\n\nSample Input 2\n\n1 1 2\n10\n10\n1 1 5\n1 1 10\n\nSample Output 2\n\n10\n\nNote that you cannot use more than one ticket at a time.\n\nSample Input 3\n\n2 2 1\n3 5\n3 5\n2 2 2\n\nSample Output 3\n\n6\n\nYou can get the 1-st refrigerator and the 1-st microwave for 6 yen, which is the minimum amount to pay in this case.\nNote that using a ticket is optional.", "sample_input": "2 3 1\n3 3\n3 3 3\n1 2 1\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02748", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are visiting a large electronics store to buy a refrigerator and a microwave.\n\nThe store sells A kinds of refrigerators and B kinds of microwaves. The i-th refrigerator ( 1 \\le i \\le A ) is sold at a_i yen (the currency of Japan), and the j-th microwave ( 1 \\le j \\le B ) is sold at b_j yen.\n\nYou have M discount tickets. With the i-th ticket ( 1 \\le i \\le M ), you can get a discount of c_i yen from the total price when buying the x_i-th refrigerator and the y_i-th microwave together. Only one ticket can be used at a time.\n\nYou are planning to buy one refrigerator and one microwave. Find the minimum amount of money required.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\le A \\le 10^5\n\n1 \\le B \\le 10^5\n\n1 \\le M \\le 10^5\n\n1 \\le a_i , b_i , c_i \\le 10^5\n\n1 \\le x_i \\le A\n\n1 \\le y_i \\le B\n\nc_i \\le a_{x_i} + b_{y_i}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B M\na_1 a_2 ... a_A\nb_1 b_2 ... b_B\nx_1 y_1 c_1\n\\vdots\nx_M y_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 1\n3 3\n3 3 3\n1 2 1\n\nSample Output 1\n\n5\n\nWith the ticket, you can get the 1-st refrigerator and the 2-nd microwave for 3+3-1=5 yen.\n\nSample Input 2\n\n1 1 2\n10\n10\n1 1 5\n1 1 10\n\nSample Output 2\n\n10\n\nNote that you cannot use more than one ticket at a time.\n\nSample Input 3\n\n2 2 1\n3 5\n3 5\n2 2 2\n\nSample Output 3\n\n6\n\nYou can get the 1-st refrigerator and the 1-st microwave for 6 yen, which is the minimum amount to pay in this case.\nNote that using a ticket is optional.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 382, "cpu_time_ms": 155, "memory_kb": 4472}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s045963685", "group_id": "codeNet:p02748", "input_text": "local A, B, M = io.read(\"*n\", \"*n\", \"*n\")\nlocal a, b = {}, {}\nfor i = 1, A do\n a[i] = io.read(\"*n\")\nend\nfor i = 1, B do\n b[i] = io.read(\"*n\")\nend\nlocal min_a = 10^5\nlocal min_b = 10^5\nfor i = 1, A do\n min_a = math.min(min_a, a[i])\nend\nfor i = 1, B do\n min_b = math.min(min_b, b[i])\nend\n\nlocal min_value = min_a + min_b\nfor i = 1, M do\n local x, y, c = io.read(\"*n\", \"*n\", \"*n\")\n min_value = math.min(min_value, a[x] + b[y] - c)\nend\n\nprint(min_value)", "language": "Lua", "metadata": {"date": 1586940714, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02748.html", "problem_id": "p02748", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02748/input.txt", "sample_output_relpath": "derived/input_output/data/p02748/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02748/Lua/s045963685.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s045963685", "user_id": "u045238009"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local A, B, M = io.read(\"*n\", \"*n\", \"*n\")\nlocal a, b = {}, {}\nfor i = 1, A do\n a[i] = io.read(\"*n\")\nend\nfor i = 1, B do\n b[i] = io.read(\"*n\")\nend\nlocal min_a = 10^5\nlocal min_b = 10^5\nfor i = 1, A do\n min_a = math.min(min_a, a[i])\nend\nfor i = 1, B do\n min_b = math.min(min_b, b[i])\nend\n\nlocal min_value = min_a + min_b\nfor i = 1, M do\n local x, y, c = io.read(\"*n\", \"*n\", \"*n\")\n min_value = math.min(min_value, a[x] + b[y] - c)\nend\n\nprint(min_value)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are visiting a large electronics store to buy a refrigerator and a microwave.\n\nThe store sells A kinds of refrigerators and B kinds of microwaves. The i-th refrigerator ( 1 \\le i \\le A ) is sold at a_i yen (the currency of Japan), and the j-th microwave ( 1 \\le j \\le B ) is sold at b_j yen.\n\nYou have M discount tickets. With the i-th ticket ( 1 \\le i \\le M ), you can get a discount of c_i yen from the total price when buying the x_i-th refrigerator and the y_i-th microwave together. Only one ticket can be used at a time.\n\nYou are planning to buy one refrigerator and one microwave. Find the minimum amount of money required.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\le A \\le 10^5\n\n1 \\le B \\le 10^5\n\n1 \\le M \\le 10^5\n\n1 \\le a_i , b_i , c_i \\le 10^5\n\n1 \\le x_i \\le A\n\n1 \\le y_i \\le B\n\nc_i \\le a_{x_i} + b_{y_i}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B M\na_1 a_2 ... a_A\nb_1 b_2 ... b_B\nx_1 y_1 c_1\n\\vdots\nx_M y_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 1\n3 3\n3 3 3\n1 2 1\n\nSample Output 1\n\n5\n\nWith the ticket, you can get the 1-st refrigerator and the 2-nd microwave for 3+3-1=5 yen.\n\nSample Input 2\n\n1 1 2\n10\n10\n1 1 5\n1 1 10\n\nSample Output 2\n\n10\n\nNote that you cannot use more than one ticket at a time.\n\nSample Input 3\n\n2 2 1\n3 5\n3 5\n2 2 2\n\nSample Output 3\n\n6\n\nYou can get the 1-st refrigerator and the 1-st microwave for 6 yen, which is the minimum amount to pay in this case.\nNote that using a ticket is optional.", "sample_input": "2 3 1\n3 3\n3 3 3\n1 2 1\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02748", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are visiting a large electronics store to buy a refrigerator and a microwave.\n\nThe store sells A kinds of refrigerators and B kinds of microwaves. The i-th refrigerator ( 1 \\le i \\le A ) is sold at a_i yen (the currency of Japan), and the j-th microwave ( 1 \\le j \\le B ) is sold at b_j yen.\n\nYou have M discount tickets. With the i-th ticket ( 1 \\le i \\le M ), you can get a discount of c_i yen from the total price when buying the x_i-th refrigerator and the y_i-th microwave together. Only one ticket can be used at a time.\n\nYou are planning to buy one refrigerator and one microwave. Find the minimum amount of money required.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\le A \\le 10^5\n\n1 \\le B \\le 10^5\n\n1 \\le M \\le 10^5\n\n1 \\le a_i , b_i , c_i \\le 10^5\n\n1 \\le x_i \\le A\n\n1 \\le y_i \\le B\n\nc_i \\le a_{x_i} + b_{y_i}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B M\na_1 a_2 ... a_A\nb_1 b_2 ... b_B\nx_1 y_1 c_1\n\\vdots\nx_M y_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 1\n3 3\n3 3 3\n1 2 1\n\nSample Output 1\n\n5\n\nWith the ticket, you can get the 1-st refrigerator and the 2-nd microwave for 3+3-1=5 yen.\n\nSample Input 2\n\n1 1 2\n10\n10\n1 1 5\n1 1 10\n\nSample Output 2\n\n10\n\nNote that you cannot use more than one ticket at a time.\n\nSample Input 3\n\n2 2 1\n3 5\n3 5\n2 2 2\n\nSample Output 3\n\n6\n\nYou can get the 1-st refrigerator and the 1-st microwave for 6 yen, which is the minimum amount to pay in this case.\nNote that using a ticket is optional.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 467, "cpu_time_ms": 126, "memory_kb": 4600}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s594707229", "group_id": "codeNet:p02748", "input_text": "local A, B, M = io.read(\"*n\", \"*n\", \"*n\")\nlocal a, b = {}, {}\nfor i = 1, A do\n a[i] = io.read(\"*n\")\nend\nfor i = 1, B do\n b[i] = io.read(\"*n\")\nend\n\nlocal min_value = a[1]+b[1]\nfor i = 1, M do\n local x, y, c = io.read(\"*n\", \"*n\", \"*n\")\n min_value = math.min(min_value, a[x] + b[y] - c)\nend\n\nprint(min_value)", "language": "Lua", "metadata": {"date": 1586940068, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02748.html", "problem_id": "p02748", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02748/input.txt", "sample_output_relpath": "derived/input_output/data/p02748/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02748/Lua/s594707229.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s594707229", "user_id": "u045238009"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local A, B, M = io.read(\"*n\", \"*n\", \"*n\")\nlocal a, b = {}, {}\nfor i = 1, A do\n a[i] = io.read(\"*n\")\nend\nfor i = 1, B do\n b[i] = io.read(\"*n\")\nend\n\nlocal min_value = a[1]+b[1]\nfor i = 1, M do\n local x, y, c = io.read(\"*n\", \"*n\", \"*n\")\n min_value = math.min(min_value, a[x] + b[y] - c)\nend\n\nprint(min_value)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are visiting a large electronics store to buy a refrigerator and a microwave.\n\nThe store sells A kinds of refrigerators and B kinds of microwaves. The i-th refrigerator ( 1 \\le i \\le A ) is sold at a_i yen (the currency of Japan), and the j-th microwave ( 1 \\le j \\le B ) is sold at b_j yen.\n\nYou have M discount tickets. With the i-th ticket ( 1 \\le i \\le M ), you can get a discount of c_i yen from the total price when buying the x_i-th refrigerator and the y_i-th microwave together. Only one ticket can be used at a time.\n\nYou are planning to buy one refrigerator and one microwave. Find the minimum amount of money required.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\le A \\le 10^5\n\n1 \\le B \\le 10^5\n\n1 \\le M \\le 10^5\n\n1 \\le a_i , b_i , c_i \\le 10^5\n\n1 \\le x_i \\le A\n\n1 \\le y_i \\le B\n\nc_i \\le a_{x_i} + b_{y_i}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B M\na_1 a_2 ... a_A\nb_1 b_2 ... b_B\nx_1 y_1 c_1\n\\vdots\nx_M y_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 1\n3 3\n3 3 3\n1 2 1\n\nSample Output 1\n\n5\n\nWith the ticket, you can get the 1-st refrigerator and the 2-nd microwave for 3+3-1=5 yen.\n\nSample Input 2\n\n1 1 2\n10\n10\n1 1 5\n1 1 10\n\nSample Output 2\n\n10\n\nNote that you cannot use more than one ticket at a time.\n\nSample Input 3\n\n2 2 1\n3 5\n3 5\n2 2 2\n\nSample Output 3\n\n6\n\nYou can get the 1-st refrigerator and the 1-st microwave for 6 yen, which is the minimum amount to pay in this case.\nNote that using a ticket is optional.", "sample_input": "2 3 1\n3 3\n3 3 3\n1 2 1\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02748", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are visiting a large electronics store to buy a refrigerator and a microwave.\n\nThe store sells A kinds of refrigerators and B kinds of microwaves. The i-th refrigerator ( 1 \\le i \\le A ) is sold at a_i yen (the currency of Japan), and the j-th microwave ( 1 \\le j \\le B ) is sold at b_j yen.\n\nYou have M discount tickets. With the i-th ticket ( 1 \\le i \\le M ), you can get a discount of c_i yen from the total price when buying the x_i-th refrigerator and the y_i-th microwave together. Only one ticket can be used at a time.\n\nYou are planning to buy one refrigerator and one microwave. Find the minimum amount of money required.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\le A \\le 10^5\n\n1 \\le B \\le 10^5\n\n1 \\le M \\le 10^5\n\n1 \\le a_i , b_i , c_i \\le 10^5\n\n1 \\le x_i \\le A\n\n1 \\le y_i \\le B\n\nc_i \\le a_{x_i} + b_{y_i}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B M\na_1 a_2 ... a_A\nb_1 b_2 ... b_B\nx_1 y_1 c_1\n\\vdots\nx_M y_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 1\n3 3\n3 3 3\n1 2 1\n\nSample Output 1\n\n5\n\nWith the ticket, you can get the 1-st refrigerator and the 2-nd microwave for 3+3-1=5 yen.\n\nSample Input 2\n\n1 1 2\n10\n10\n1 1 5\n1 1 10\n\nSample Output 2\n\n10\n\nNote that you cannot use more than one ticket at a time.\n\nSample Input 3\n\n2 2 1\n3 5\n3 5\n2 2 2\n\nSample Output 3\n\n6\n\nYou can get the 1-st refrigerator and the 1-st microwave for 6 yen, which is the minimum amount to pay in this case.\nNote that using a ticket is optional.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 317, "cpu_time_ms": 108, "memory_kb": 4472}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s962837916", "group_id": "codeNet:p02748", "input_text": "local a, b, m = io.read(\"*n\", \"*n\", \"*n\")\nlocal at = {}\nlocal bt = {}\nlocal mina, minb = 0, 0\nfor i = 1, a do\n at[i] = io.read(\"*n\")\n if i == 1 then mina = at[1]\n elseif at[i] < mina then mina = at[i] end\nend\nfor i = 1, b do\n bt[i] = io.read(\"*n\")\n if i == 1 then minb = bt[1]\n elseif bt[i] < minb then minb = bt[i] end\nend\nlocal ret = mina + minb\nfor i = 1, m do\n local x, y, c = io.read(\"*n\", \"*n\", \"*n\")\n local r = at[x] + bt[y] - c\n ret = math.min(ret, r)\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1583717278, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02748.html", "problem_id": "p02748", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02748/input.txt", "sample_output_relpath": "derived/input_output/data/p02748/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02748/Lua/s962837916.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s962837916", "user_id": "u120582723"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local a, b, m = io.read(\"*n\", \"*n\", \"*n\")\nlocal at = {}\nlocal bt = {}\nlocal mina, minb = 0, 0\nfor i = 1, a do\n at[i] = io.read(\"*n\")\n if i == 1 then mina = at[1]\n elseif at[i] < mina then mina = at[i] end\nend\nfor i = 1, b do\n bt[i] = io.read(\"*n\")\n if i == 1 then minb = bt[1]\n elseif bt[i] < minb then minb = bt[i] end\nend\nlocal ret = mina + minb\nfor i = 1, m do\n local x, y, c = io.read(\"*n\", \"*n\", \"*n\")\n local r = at[x] + bt[y] - c\n ret = math.min(ret, r)\nend\nprint(ret)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are visiting a large electronics store to buy a refrigerator and a microwave.\n\nThe store sells A kinds of refrigerators and B kinds of microwaves. The i-th refrigerator ( 1 \\le i \\le A ) is sold at a_i yen (the currency of Japan), and the j-th microwave ( 1 \\le j \\le B ) is sold at b_j yen.\n\nYou have M discount tickets. With the i-th ticket ( 1 \\le i \\le M ), you can get a discount of c_i yen from the total price when buying the x_i-th refrigerator and the y_i-th microwave together. Only one ticket can be used at a time.\n\nYou are planning to buy one refrigerator and one microwave. Find the minimum amount of money required.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\le A \\le 10^5\n\n1 \\le B \\le 10^5\n\n1 \\le M \\le 10^5\n\n1 \\le a_i , b_i , c_i \\le 10^5\n\n1 \\le x_i \\le A\n\n1 \\le y_i \\le B\n\nc_i \\le a_{x_i} + b_{y_i}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B M\na_1 a_2 ... a_A\nb_1 b_2 ... b_B\nx_1 y_1 c_1\n\\vdots\nx_M y_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 1\n3 3\n3 3 3\n1 2 1\n\nSample Output 1\n\n5\n\nWith the ticket, you can get the 1-st refrigerator and the 2-nd microwave for 3+3-1=5 yen.\n\nSample Input 2\n\n1 1 2\n10\n10\n1 1 5\n1 1 10\n\nSample Output 2\n\n10\n\nNote that you cannot use more than one ticket at a time.\n\nSample Input 3\n\n2 2 1\n3 5\n3 5\n2 2 2\n\nSample Output 3\n\n6\n\nYou can get the 1-st refrigerator and the 1-st microwave for 6 yen, which is the minimum amount to pay in this case.\nNote that using a ticket is optional.", "sample_input": "2 3 1\n3 3\n3 3 3\n1 2 1\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02748", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are visiting a large electronics store to buy a refrigerator and a microwave.\n\nThe store sells A kinds of refrigerators and B kinds of microwaves. The i-th refrigerator ( 1 \\le i \\le A ) is sold at a_i yen (the currency of Japan), and the j-th microwave ( 1 \\le j \\le B ) is sold at b_j yen.\n\nYou have M discount tickets. With the i-th ticket ( 1 \\le i \\le M ), you can get a discount of c_i yen from the total price when buying the x_i-th refrigerator and the y_i-th microwave together. Only one ticket can be used at a time.\n\nYou are planning to buy one refrigerator and one microwave. Find the minimum amount of money required.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\le A \\le 10^5\n\n1 \\le B \\le 10^5\n\n1 \\le M \\le 10^5\n\n1 \\le a_i , b_i , c_i \\le 10^5\n\n1 \\le x_i \\le A\n\n1 \\le y_i \\le B\n\nc_i \\le a_{x_i} + b_{y_i}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B M\na_1 a_2 ... a_A\nb_1 b_2 ... b_B\nx_1 y_1 c_1\n\\vdots\nx_M y_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 1\n3 3\n3 3 3\n1 2 1\n\nSample Output 1\n\n5\n\nWith the ticket, you can get the 1-st refrigerator and the 2-nd microwave for 3+3-1=5 yen.\n\nSample Input 2\n\n1 1 2\n10\n10\n1 1 5\n1 1 10\n\nSample Output 2\n\n10\n\nNote that you cannot use more than one ticket at a time.\n\nSample Input 3\n\n2 2 1\n3 5\n3 5\n2 2 2\n\nSample Output 3\n\n6\n\nYou can get the 1-st refrigerator and the 1-st microwave for 6 yen, which is the minimum amount to pay in this case.\nNote that using a ticket is optional.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 98, "memory_kb": 2304}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s405400649", "group_id": "codeNet:p02749", "input_text": "local n = io.read(\"*n\")\nlocal edge = {}\nlocal num = {}\nlocal len = {}\nlocal lim, use = {}, {}\nlim[1] = math.ceil(n / 3)\nlim[2] = math.ceil((n - 1) / 3)\nlim[3] = math.floor(n / 3)\nuse[1], use[2], use[3] = 0, 0, 0\n\nfor i = 1, n do\n edge[i] = {}\n num[i] = 0\n len[i] = -1\nend\nfor i = 1, n - 1 do\n local a, b = io.read(\"*n\", \"*n\")\n edge[a][b], edge[b][a] = true, true\nend\nlocal tasks = {1}\nlen[1] = 0\nnum[1] = 2\nuse[2] = 1\nfor i = 1, n do\n local src = tasks[i]\n local srcnum = num[src] % 3\n for dst, _u in pairs(edge[src]) do\n if len[dst] == -1 then\n len[dst] = len[src] + 1\n if len[dst] % 2 == 0 then\n if use[2] < lim[2] then\n use[2] = use[2] + 1\n num[dst] = use[2] * 3 - 1\n elseif use[3] < lim[3] then\n use[3] = use[3] + 1\n num[dst] = use[3] * 3\n else\n use[1] = use[1] + 1\n num[dst] = use[1] * 3 - 2\n end\n else\n if use[1] < lim[1] then\n use[1] = use[1] + 1\n num[dst] = use[1] * 3 - 2\n elseif use[3] < lim[3] then\n use[3] = use[3] + 1\n num[dst] = use[3] * 3\n else\n use[2] = use[2] + 1\n num[dst] = use[2] * 3 - 1\n end\n end\n table.insert(tasks, dst)\n end\n end\nend\nprint(table.concat(num, \" \"))\n", "language": "Lua", "metadata": {"date": 1583717713, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02749.html", "problem_id": "p02749", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02749/input.txt", "sample_output_relpath": "derived/input_output/data/p02749/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02749/Lua/s405400649.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s405400649", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1 2 5 4 3\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal edge = {}\nlocal num = {}\nlocal len = {}\nlocal lim, use = {}, {}\nlim[1] = math.ceil(n / 3)\nlim[2] = math.ceil((n - 1) / 3)\nlim[3] = math.floor(n / 3)\nuse[1], use[2], use[3] = 0, 0, 0\n\nfor i = 1, n do\n edge[i] = {}\n num[i] = 0\n len[i] = -1\nend\nfor i = 1, n - 1 do\n local a, b = io.read(\"*n\", \"*n\")\n edge[a][b], edge[b][a] = true, true\nend\nlocal tasks = {1}\nlen[1] = 0\nnum[1] = 2\nuse[2] = 1\nfor i = 1, n do\n local src = tasks[i]\n local srcnum = num[src] % 3\n for dst, _u in pairs(edge[src]) do\n if len[dst] == -1 then\n len[dst] = len[src] + 1\n if len[dst] % 2 == 0 then\n if use[2] < lim[2] then\n use[2] = use[2] + 1\n num[dst] = use[2] * 3 - 1\n elseif use[3] < lim[3] then\n use[3] = use[3] + 1\n num[dst] = use[3] * 3\n else\n use[1] = use[1] + 1\n num[dst] = use[1] * 3 - 2\n end\n else\n if use[1] < lim[1] then\n use[1] = use[1] + 1\n num[dst] = use[1] * 3 - 2\n elseif use[3] < lim[3] then\n use[3] = use[3] + 1\n num[dst] = use[3] * 3\n else\n use[2] = use[2] + 1\n num[dst] = use[2] * 3 - 1\n end\n end\n table.insert(tasks, dst)\n end\n end\nend\nprint(table.concat(num, \" \"))\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have a tree with N vertices. The vertices are numbered 1 to N, and the i-th edge connects Vertex a_i and Vertex b_i.\n\nTakahashi loves the number 3. He is seeking a permutation p_1, p_2, \\ldots , p_N of integers from 1 to N satisfying the following condition:\n\nFor every pair of vertices (i, j), if the distance between Vertex i and Vertex j is 3, the sum or product of p_i and p_j is a multiple of 3.\n\nHere the distance between Vertex i and Vertex j is the number of edges contained in the shortest path from Vertex i to Vertex j.\n\nHelp Takahashi by finding a permutation that satisfies the condition.\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\na_2 b_2\n\\vdots\na_{N-1} b_{N-1}\n\nOutput\n\nIf no permutation satisfies the condition, print -1.\n\nOtherwise, print a permutation satisfying the condition, with space in between.\nIf there are multiple solutions, you can print any of them.\n\nSample Input 1\n\n5\n1 2\n1 3\n3 4\n3 5\n\nSample Output 1\n\n1 2 5 4 3\n\nThe distance between two vertices is 3 for the two pairs (2, 4) and (2, 5).\n\np_2 + p_4 = 6\n\np_2\\times p_5 = 6\n\nThus, this permutation satisfies the condition.", "sample_input": "5\n1 2\n1 3\n3 4\n3 5\n"}, "reference_outputs": ["1 2 5 4 3\n"], "source_document_id": "p02749", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have a tree with N vertices. The vertices are numbered 1 to N, and the i-th edge connects Vertex a_i and Vertex b_i.\n\nTakahashi loves the number 3. He is seeking a permutation p_1, p_2, \\ldots , p_N of integers from 1 to N satisfying the following condition:\n\nFor every pair of vertices (i, j), if the distance between Vertex i and Vertex j is 3, the sum or product of p_i and p_j is a multiple of 3.\n\nHere the distance between Vertex i and Vertex j is the number of edges contained in the shortest path from Vertex i to Vertex j.\n\nHelp Takahashi by finding a permutation that satisfies the condition.\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\na_2 b_2\n\\vdots\na_{N-1} b_{N-1}\n\nOutput\n\nIf no permutation satisfies the condition, print -1.\n\nOtherwise, print a permutation satisfying the condition, with space in between.\nIf there are multiple solutions, you can print any of them.\n\nSample Input 1\n\n5\n1 2\n1 3\n3 4\n3 5\n\nSample Output 1\n\n1 2 5 4 3\n\nThe distance between two vertices is 3 for the two pairs (2, 4) and (2, 5).\n\np_2 + p_4 = 6\n\np_2\\times p_5 = 6\n\nThus, this permutation satisfies the condition.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1292, "cpu_time_ms": 472, "memory_kb": 46836}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s674908733", "group_id": "codeNet:p02749", "input_text": "local n = io.read(\"*n\")\nlocal edge = {}\nlocal num = {}\nlocal len = {}\nlocal lim, use = {}, {}\nlim[1] = math.ceil(n / 3)\nlim[2] = math.ceil((n - 1) / 3)\nuse[1], use[2], use[3] = 0, 0, 0\n\nfor i = 1, n do\n edge[i] = {}\n num[i] = 0\n len[i] = -1\nend\nfor i = 1, n - 1 do\n local a, b = io.read(\"*n\", \"*n\")\n edge[a][b], edge[b][a] = true, true\nend\nlocal tasks = {1}\nlen[1] = 0\nnum[1] = 1\nuse[1] = 1\nfor i = 1, n do\n local src = tasks[i]\n local srcnum = num[src] % 3\n for dst, _u in pairs(edge[src]) do\n if len[dst] == -1 then\n len[dst] = len[src] + 1\n if len[dst] % 2 == 0 then\n if use[2] < lim[2] then\n use[2] = use[2] + 1\n num[dst] = use[2] * 3 - 1\n else\n use[3] = use[3] + 1\n num[dst] = use[3] * 3\n end\n else\n if use[1] < lim[1] then\n use[1] = use[1] + 1\n num[dst] = use[1] * 3 - 2\n else\n use[3] = use[3] + 1\n num[dst] = use[3] * 3\n end\n end\n table.insert(tasks, dst)\n end\n end\nend\nprint(table.concat(num, \" \"))\n", "language": "Lua", "metadata": {"date": 1583716997, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02749.html", "problem_id": "p02749", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02749/input.txt", "sample_output_relpath": "derived/input_output/data/p02749/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02749/Lua/s674908733.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s674908733", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1 2 5 4 3\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal edge = {}\nlocal num = {}\nlocal len = {}\nlocal lim, use = {}, {}\nlim[1] = math.ceil(n / 3)\nlim[2] = math.ceil((n - 1) / 3)\nuse[1], use[2], use[3] = 0, 0, 0\n\nfor i = 1, n do\n edge[i] = {}\n num[i] = 0\n len[i] = -1\nend\nfor i = 1, n - 1 do\n local a, b = io.read(\"*n\", \"*n\")\n edge[a][b], edge[b][a] = true, true\nend\nlocal tasks = {1}\nlen[1] = 0\nnum[1] = 1\nuse[1] = 1\nfor i = 1, n do\n local src = tasks[i]\n local srcnum = num[src] % 3\n for dst, _u in pairs(edge[src]) do\n if len[dst] == -1 then\n len[dst] = len[src] + 1\n if len[dst] % 2 == 0 then\n if use[2] < lim[2] then\n use[2] = use[2] + 1\n num[dst] = use[2] * 3 - 1\n else\n use[3] = use[3] + 1\n num[dst] = use[3] * 3\n end\n else\n if use[1] < lim[1] then\n use[1] = use[1] + 1\n num[dst] = use[1] * 3 - 2\n else\n use[3] = use[3] + 1\n num[dst] = use[3] * 3\n end\n end\n table.insert(tasks, dst)\n end\n end\nend\nprint(table.concat(num, \" \"))\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have a tree with N vertices. The vertices are numbered 1 to N, and the i-th edge connects Vertex a_i and Vertex b_i.\n\nTakahashi loves the number 3. He is seeking a permutation p_1, p_2, \\ldots , p_N of integers from 1 to N satisfying the following condition:\n\nFor every pair of vertices (i, j), if the distance between Vertex i and Vertex j is 3, the sum or product of p_i and p_j is a multiple of 3.\n\nHere the distance between Vertex i and Vertex j is the number of edges contained in the shortest path from Vertex i to Vertex j.\n\nHelp Takahashi by finding a permutation that satisfies the condition.\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\na_2 b_2\n\\vdots\na_{N-1} b_{N-1}\n\nOutput\n\nIf no permutation satisfies the condition, print -1.\n\nOtherwise, print a permutation satisfying the condition, with space in between.\nIf there are multiple solutions, you can print any of them.\n\nSample Input 1\n\n5\n1 2\n1 3\n3 4\n3 5\n\nSample Output 1\n\n1 2 5 4 3\n\nThe distance between two vertices is 3 for the two pairs (2, 4) and (2, 5).\n\np_2 + p_4 = 6\n\np_2\\times p_5 = 6\n\nThus, this permutation satisfies the condition.", "sample_input": "5\n1 2\n1 3\n3 4\n3 5\n"}, "reference_outputs": ["1 2 5 4 3\n"], "source_document_id": "p02749", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have a tree with N vertices. The vertices are numbered 1 to N, and the i-th edge connects Vertex a_i and Vertex b_i.\n\nTakahashi loves the number 3. He is seeking a permutation p_1, p_2, \\ldots , p_N of integers from 1 to N satisfying the following condition:\n\nFor every pair of vertices (i, j), if the distance between Vertex i and Vertex j is 3, the sum or product of p_i and p_j is a multiple of 3.\n\nHere the distance between Vertex i and Vertex j is the number of edges contained in the shortest path from Vertex i to Vertex j.\n\nHelp Takahashi by finding a permutation that satisfies the condition.\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\na_2 b_2\n\\vdots\na_{N-1} b_{N-1}\n\nOutput\n\nIf no permutation satisfies the condition, print -1.\n\nOtherwise, print a permutation satisfying the condition, with space in between.\nIf there are multiple solutions, you can print any of them.\n\nSample Input 1\n\n5\n1 2\n1 3\n3 4\n3 5\n\nSample Output 1\n\n1 2 5 4 3\n\nThe distance between two vertices is 3 for the two pairs (2, 4) and (2, 5).\n\np_2 + p_4 = 6\n\np_2\\times p_5 = 6\n\nThus, this permutation satisfies the condition.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1061, "cpu_time_ms": 508, "memory_kb": 46740}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s762750814", "group_id": "codeNet:p02753", "input_text": "s = io.read(\"*line\")\n\nif string.sub(s, 1, 1) == string.sub(s, 2, 2) and string.sub(s, 2, 2) == string.sub(s, 3, 3) then\n print(\"No\")\nelse\n print(\"Yes\")\nend\n", "language": "Lua", "metadata": {"date": 1583722933, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02753.html", "problem_id": "p02753", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02753/input.txt", "sample_output_relpath": "derived/input_output/data/p02753/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02753/Lua/s762750814.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s762750814", "user_id": "u471898432"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "s = io.read(\"*line\")\n\nif string.sub(s, 1, 1) == string.sub(s, 2, 2) and string.sub(s, 2, 2) == string.sub(s, 3, 3) then\n print(\"No\")\nelse\n print(\"Yes\")\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn AtCoder City, there are three stations numbered 1, 2, and 3.\n\nEach of these stations is operated by one of the two railway companies, A and B. A string S of length 3 represents which company operates each station. If S_i is A, Company A operates Station i; if S_i is B, Company B operates Station i.\n\nTo improve the transportation condition, for each pair of a station operated by Company A and one operated by Company B, there will be a bus service connecting them.\n\nDetermine if there is a pair of stations that will be connected by a bus service.\n\nConstraints\n\nEach character of S is A or B.\n\n|S| = 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf there is a pair of stations that will be connected by a bus service, print Yes; otherwise, print No.\n\nSample Input 1\n\nABA\n\nSample Output 1\n\nYes\n\nCompany A operates Station 1 and 3, while Company B operates Station 2.\n\nThere will be a bus service between Station 1 and 2, and between Station 2 and 3, so print Yes.\n\nSample Input 2\n\nBBA\n\nSample Output 2\n\nYes\n\nCompany B operates Station 1 and 2, while Company A operates Station 3.\n\nThere will be a bus service between Station 1 and 3, and between Station 2 and 3, so print Yes.\n\nSample Input 3\n\nBBB\n\nSample Output 3\n\nNo\n\nCompany B operates all the stations. Thus, there will be no bus service, so print No.", "sample_input": "ABA\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02753", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn AtCoder City, there are three stations numbered 1, 2, and 3.\n\nEach of these stations is operated by one of the two railway companies, A and B. A string S of length 3 represents which company operates each station. If S_i is A, Company A operates Station i; if S_i is B, Company B operates Station i.\n\nTo improve the transportation condition, for each pair of a station operated by Company A and one operated by Company B, there will be a bus service connecting them.\n\nDetermine if there is a pair of stations that will be connected by a bus service.\n\nConstraints\n\nEach character of S is A or B.\n\n|S| = 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf there is a pair of stations that will be connected by a bus service, print Yes; otherwise, print No.\n\nSample Input 1\n\nABA\n\nSample Output 1\n\nYes\n\nCompany A operates Station 1 and 3, while Company B operates Station 2.\n\nThere will be a bus service between Station 1 and 2, and between Station 2 and 3, so print Yes.\n\nSample Input 2\n\nBBA\n\nSample Output 2\n\nYes\n\nCompany B operates Station 1 and 2, while Company A operates Station 3.\n\nThere will be a bus service between Station 1 and 3, and between Station 2 and 3, so print Yes.\n\nSample Input 3\n\nBBB\n\nSample Output 3\n\nNo\n\nCompany B operates all the stations. Thus, there will be no bus service, so print No.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s553820779", "group_id": "codeNet:p02754", "input_text": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\nlocal function array(dimension, default_val) local n=dimension local m={}if default_val~=nil then m[1]={__index=function()return default_val end}end for i=2,n do m[i]={__index=function(p, k)local c=setmetatable({},m[i-1])rawset(p,k,c)return c end}end return setmetatable({},m[n])end\n----\nlocal N, A, B = read.nnn()\nlocal n, rem = N // (A+B), N % (A+B)\nlocal b = n * A + math.min(A, rem)\nprint(b)", "language": "Lua", "metadata": {"date": 1583633118, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02754.html", "problem_id": "p02754", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02754/input.txt", "sample_output_relpath": "derived/input_output/data/p02754/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02754/Lua/s553820779.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s553820779", "user_id": "u162773977"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\nlocal function array(dimension, default_val) local n=dimension local m={}if default_val~=nil then m[1]={__index=function()return default_val end}end for i=2,n do m[i]={__index=function(p, k)local c=setmetatable({},m[i-1])rawset(p,k,c)return c end}end return setmetatable({},m[n])end\n----\nlocal N, A, B = read.nnn()\nlocal n, rem = N // (A+B), N % (A+B)\nlocal b = n * A + math.min(A, rem)\nprint(b)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has many red balls and blue balls. Now, he will place them in a row.\n\nInitially, there is no ball placed.\n\nTakahashi, who is very patient, will do the following operation 10^{100} times:\n\nPlace A blue balls at the end of the row of balls already placed. Then, place B red balls at the end of the row.\n\nHow many blue balls will be there among the first N balls in the row of balls made this way?\n\nConstraints\n\n1 \\leq N \\leq 10^{18}\n\nA, B \\geq 0\n\n0 < A + B \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of blue balls that will be there among the first N balls in the row of balls.\n\nSample Input 1\n\n8 3 4\n\nSample Output 1\n\n4\n\nLet b denote a blue ball, and r denote a red ball. The first eight balls in the row will be bbbrrrrb, among which there are four blue balls.\n\nSample Input 2\n\n8 0 4\n\nSample Output 2\n\n0\n\nHe placed only red balls from the beginning.\n\nSample Input 3\n\n6 2 4\n\nSample Output 3\n\n2\n\nAmong bbrrrr, there are two blue balls.", "sample_input": "8 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02754", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has many red balls and blue balls. Now, he will place them in a row.\n\nInitially, there is no ball placed.\n\nTakahashi, who is very patient, will do the following operation 10^{100} times:\n\nPlace A blue balls at the end of the row of balls already placed. Then, place B red balls at the end of the row.\n\nHow many blue balls will be there among the first N balls in the row of balls made this way?\n\nConstraints\n\n1 \\leq N \\leq 10^{18}\n\nA, B \\geq 0\n\n0 < A + B \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of blue balls that will be there among the first N balls in the row of balls.\n\nSample Input 1\n\n8 3 4\n\nSample Output 1\n\n4\n\nLet b denote a blue ball, and r denote a red ball. The first eight balls in the row will be bbbrrrrb, among which there are four blue balls.\n\nSample Input 2\n\n8 0 4\n\nSample Output 2\n\n0\n\nHe placed only red balls from the beginning.\n\nSample Input 3\n\n6 2 4\n\nSample Output 3\n\n2\n\nAmong bbrrrr, there are two blue balls.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 104, "memory_kb": 1008}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s188834525", "group_id": "codeNet:p02756", "input_text": "\ns=string.gsub(io.read(),\" \",\"\")\nq=io.read(\"*n\",\"*l\")\nshould_reverse=0\nleft,right={},{}\nfor i=1,q do\n t=io.read(\"*n\")\n if t==1 then\n should_reverse=should_reverse+1\n else\n f=io.read(\"*n\")\n c=string.gsub(io.read(),\" \",\"\")\n if f==1 then\n if should_reverse%2==1 then\n table.insert(right,c)\n else\n table.insert(left,c)\n end\n else\n if should_reverse%2==1 then\n table.insert(left,c)\n else\n table.insert(right,c)\n end\n end\n end\nend\ns=string.reverse(table.concat(left,\"\"))..s..table.concat(right,\"\")\nprint(should_reverse%2==1 and string.reverse(s) or s)", "language": "Lua", "metadata": {"date": 1588826987, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s188834525.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s188834525", "user_id": "u045238009"}, "prompt_components": {"gold_output": "cpa\n", "input_to_evaluate": "\ns=string.gsub(io.read(),\" \",\"\")\nq=io.read(\"*n\",\"*l\")\nshould_reverse=0\nleft,right={},{}\nfor i=1,q do\n t=io.read(\"*n\")\n if t==1 then\n should_reverse=should_reverse+1\n else\n f=io.read(\"*n\")\n c=string.gsub(io.read(),\" \",\"\")\n if f==1 then\n if should_reverse%2==1 then\n table.insert(right,c)\n else\n table.insert(left,c)\n end\n else\n if should_reverse%2==1 then\n table.insert(left,c)\n else\n table.insert(right,c)\n end\n end\n end\nend\ns=string.reverse(table.concat(left,\"\"))..s..table.concat(right,\"\")\nprint(should_reverse%2==1 and string.reverse(s) or s)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 725, "cpu_time_ms": 167, "memory_kb": 4500}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s589667969", "group_id": "codeNet:p02757", "input_text": "n,p=io.read(\"*n\",\"*n\",\"*l\")\ns=io.read()\n\ncombination=0\nif p==2 or p==5 then\n for i=1,n do\n x=tonumber(s:sub(i,i))\n if x%p==0 then\n combination=combination+1\n end\n end\n print(combination)\n return\nend\n\nt={}\nfor i=1,p do\n t[i]=0\nend\nt[1]=1\ndigit=1\nsmod=0\nfor i=1,n do\n x=tonumber(s:sub(i,i))\n smod=(smod+x*digit)%p\n combination=combination+t[smod+1]\n t[smod+1]=t[smod+1]+1\n digit=(digit*10)%p\nend\n\nprint(combination)", "language": "Lua", "metadata": {"date": 1588841996, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s589667969.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s589667969", "user_id": "u045238009"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "n,p=io.read(\"*n\",\"*n\",\"*l\")\ns=io.read()\n\ncombination=0\nif p==2 or p==5 then\n for i=1,n do\n x=tonumber(s:sub(i,i))\n if x%p==0 then\n combination=combination+1\n end\n end\n print(combination)\n return\nend\n\nt={}\nfor i=1,p do\n t[i]=0\nend\nt[1]=1\ndigit=1\nsmod=0\nfor i=1,n do\n x=tonumber(s:sub(i,i))\n smod=(smod+x*digit)%p\n combination=combination+t[smod+1]\n t[smod+1]=t[smod+1]+1\n digit=(digit*10)%p\nend\n\nprint(combination)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 475, "cpu_time_ms": 148, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s133573125", "group_id": "codeNet:p02760", "input_text": "a = {}\nfor i = 1, 9 do\n a[i] = io.read(\"*n\")\nend\nn = io.read(\"*n\")\nt = {}\nfor i = 1, n do\n v = io.read(\"*n\")\n t[v] = true\nend\nz = {\n {1, 2, 3},\n {4, 5, 6},\n {7, 8, 9},\n {1, 4, 7},\n {2, 5, 8},\n {3, 6, 9},\n {1, 5, 9},\n {3, 5, 7}\n}\nv = false\nfor i = 1, 8 do\n if t[a[z[i][1]]] and t[a[z[i][2]]] and t[a[z[i][3]]] then\n v = true\n end\nend\nprint(v and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1589908591, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02760.html", "problem_id": "p02760", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02760/input.txt", "sample_output_relpath": "derived/input_output/data/p02760/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02760/Lua/s133573125.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s133573125", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "a = {}\nfor i = 1, 9 do\n a[i] = io.read(\"*n\")\nend\nn = io.read(\"*n\")\nt = {}\nfor i = 1, n do\n v = io.read(\"*n\")\n t[v] = true\nend\nz = {\n {1, 2, 3},\n {4, 5, 6},\n {7, 8, 9},\n {1, 4, 7},\n {2, 5, 8},\n {3, 6, 9},\n {1, 5, 9},\n {3, 5, 7}\n}\nv = false\nfor i = 1, 8 do\n if t[a[z[i][1]]] and t[a[z[i][2]]] and t[a[z[i][3]]] then\n v = true\n end\nend\nprint(v and \"Yes\" or \"No\")\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "sample_input": "84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02760", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s220108904", "group_id": "codeNet:p02760", "input_text": "a = {}\nfor i = 1, 9 do\n a[i] = io.read(\"*n\")\nend\nn = io.read(\"*n\")\nt = {}\nfor i = 1, n do\n v = io.read(\"*n\")\n t[v] = true\nend\nz = {\n {1, 2, 3},\n {4, 5, 6},\n {7, 8, 9},\n {1, 4, 7},\n {2, 5, 8},\n {3, 6, 9},\n {1, 4, 9},\n {3, 5, 7}\n}\nv = false\nfor i = 1, 8 do\n if t[a[z[i][1]]] and t[a[z[i][2]]] and t[a[z[i][3]]] then\n v = true\n end\nend\nprint(v and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1589908564, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02760.html", "problem_id": "p02760", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02760/input.txt", "sample_output_relpath": "derived/input_output/data/p02760/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02760/Lua/s220108904.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s220108904", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "a = {}\nfor i = 1, 9 do\n a[i] = io.read(\"*n\")\nend\nn = io.read(\"*n\")\nt = {}\nfor i = 1, n do\n v = io.read(\"*n\")\n t[v] = true\nend\nz = {\n {1, 2, 3},\n {4, 5, 6},\n {7, 8, 9},\n {1, 4, 7},\n {2, 5, 8},\n {3, 6, 9},\n {1, 4, 9},\n {3, 5, 7}\n}\nv = false\nfor i = 1, 8 do\n if t[a[z[i][1]]] and t[a[z[i][2]]] and t[a[z[i][3]]] then\n v = true\n end\nend\nprint(v and \"Yes\" or \"No\")\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "sample_input": "84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02760", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s660233399", "group_id": "codeNet:p02760", "input_text": "function mark(a_rev, b)\n local marked = {false, false, false,\n false, false, false,\n false, false, false}\n for i = 1, #b do\n local bi = b[i]\n if a_rev[bi] then\n marked[a_rev[bi]] = true\n end\n end\n return marked\nend\n\nfunction bingo(marked)\n local bingos = {\n {1, 4, 7}, {2, 5, 8}, {3, 6, 9},\n {1, 2, 3}, {4, 5, 6}, {7, 8, 9},\n {1, 5, 9}, {3, 5, 7}\n }\n\n for i = 1, 8 do\n local c = bingos[i]\n if marked[c[1]] and marked[c[2]] and marked[c[3]] then\n return true\n end\n end\n\n return false\nend\n\nlocal a_rev = {}\nfor i = 1, 9 do\n a = io.read(\"*n\")\n a_rev[a] = i\nend\n\nlocal n = io.read(\"*n\")\n\nlocal b = {}\nfor i = 1, n do\n b[i] = io.read(\"*n\")\nend\n\nlocal marked = mark(a_rev, b)\nif bingo(marked) then\n print(\"Yes\")\nelse\n print(\"No\")\nend\n", "language": "Lua", "metadata": {"date": 1584495123, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02760.html", "problem_id": "p02760", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02760/input.txt", "sample_output_relpath": "derived/input_output/data/p02760/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02760/Lua/s660233399.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s660233399", "user_id": "u471898432"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "function mark(a_rev, b)\n local marked = {false, false, false,\n false, false, false,\n false, false, false}\n for i = 1, #b do\n local bi = b[i]\n if a_rev[bi] then\n marked[a_rev[bi]] = true\n end\n end\n return marked\nend\n\nfunction bingo(marked)\n local bingos = {\n {1, 4, 7}, {2, 5, 8}, {3, 6, 9},\n {1, 2, 3}, {4, 5, 6}, {7, 8, 9},\n {1, 5, 9}, {3, 5, 7}\n }\n\n for i = 1, 8 do\n local c = bingos[i]\n if marked[c[1]] and marked[c[2]] and marked[c[3]] then\n return true\n end\n end\n\n return false\nend\n\nlocal a_rev = {}\nfor i = 1, 9 do\n a = io.read(\"*n\")\n a_rev[a] = i\nend\n\nlocal n = io.read(\"*n\")\n\nlocal b = {}\nfor i = 1, n do\n b[i] = io.read(\"*n\")\nend\n\nlocal marked = mark(a_rev, b)\nif bingo(marked) then\n print(\"Yes\")\nelse\n print(\"No\")\nend\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "sample_input": "84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02760", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 813, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s037129195", "group_id": "codeNet:p02762", "input_text": "local par={}\nlocal rank={}\n\nlocal function init(n)\n for i=1,n do\n par[i]=i\n rank[i]=1\n end\nend\n\nlocal function root(x)\n return par[x]==x and x or root(par[x])\nend\n\nlocal function same(x,y)\n return root(x)==root(y)\nend\n\nlocal function unite(x,y)\n x=root(x)\n y=root(y)\n if x==y then\n return\n end\n if rank[x]>rank[y] then\n x,y=y,x\n end\n par[x]=y\n rank[y]=rank[y]+rank[x]\nend\n\nlocal function size(x)\n return rank[root(x)]\nend\n\nlocal n,m,k=io.read(\"n\",\"n\",\"n\")\n\ninit(n)\n\nlocal graph={}\nfor i=1,n do\n graph[i]={}\nend\nfor i=1,m do\n local a,b=io.read(\"n\",\"n\")\n table.insert(graph[a],b)\n table.insert(graph[b],a)\n unite(a,b)\nend\nfor i=1,k do\n local c,d=io.read(\"n\",\"n\")\n if same(c,d) then\n table.insert(graph[c],d)\n table.insert(graph[d],c)\n end\nend\n\nfor i=1,n do\n local kouho=size(i)-#graph[i]-1\n io.write(kouho..\" \")\nend\nprint()", "language": "Lua", "metadata": {"date": 1598077811, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02762.html", "problem_id": "p02762", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02762/input.txt", "sample_output_relpath": "derived/input_output/data/p02762/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02762/Lua/s037129195.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s037129195", "user_id": "u045238009"}, "prompt_components": {"gold_output": "0 1 0 1\n", "input_to_evaluate": "local par={}\nlocal rank={}\n\nlocal function init(n)\n for i=1,n do\n par[i]=i\n rank[i]=1\n end\nend\n\nlocal function root(x)\n return par[x]==x and x or root(par[x])\nend\n\nlocal function same(x,y)\n return root(x)==root(y)\nend\n\nlocal function unite(x,y)\n x=root(x)\n y=root(y)\n if x==y then\n return\n end\n if rank[x]>rank[y] then\n x,y=y,x\n end\n par[x]=y\n rank[y]=rank[y]+rank[x]\nend\n\nlocal function size(x)\n return rank[root(x)]\nend\n\nlocal n,m,k=io.read(\"n\",\"n\",\"n\")\n\ninit(n)\n\nlocal graph={}\nfor i=1,n do\n graph[i]={}\nend\nfor i=1,m do\n local a,b=io.read(\"n\",\"n\")\n table.insert(graph[a],b)\n table.insert(graph[b],a)\n unite(a,b)\nend\nfor i=1,k do\n local c,d=io.read(\"n\",\"n\")\n if same(c,d) then\n table.insert(graph[c],d)\n table.insert(graph[d],c)\n end\nend\n\nfor i=1,n do\n local kouho=size(i)-#graph[i]-1\n io.write(kouho..\" \")\nend\nprint()", "problem_context": "Score : 400 points\n\nProblem Statement\n\nAn SNS has N users - User 1, User 2, \\cdots, User N.\n\nBetween these N users, there are some relationships - M friendships and K blockships.\n\nFor each i = 1, 2, \\cdots, M, there is a bidirectional friendship between User A_i and User B_i.\n\nFor each i = 1, 2, \\cdots, K, there is a bidirectional blockship between User C_i and User D_i.\n\nWe define User a to be a friend candidate for User b when all of the following four conditions are satisfied:\n\na \\neq b.\n\nThere is not a friendship between User a and User b.\n\nThere is not a blockship between User a and User b.\n\nThere exists a sequence c_0, c_1, c_2, \\cdots, c_L consisting of integers between 1 and N (inclusive) such that c_0 = a, c_L = b, and there is a friendship between User c_i and c_{i+1} for each i = 0, 1, \\cdots, L - 1.\n\nFor each user i = 1, 2, ... N, how many friend candidates does it have?\n\nConstraints\n\nAll values in input are integers.\n\n2 ≤ N ≤ 10^5\n\n0 \\leq M \\leq 10^5\n\n0 \\leq K \\leq 10^5\n\n1 \\leq A_i, B_i \\leq N\n\nA_i \\neq B_i\n\n1 \\leq C_i, D_i \\leq N\n\nC_i \\neq D_i\n\n(A_i, B_i) \\neq (A_j, B_j) (i \\neq j)\n\n(A_i, B_i) \\neq (B_j, A_j)\n\n(C_i, D_i) \\neq (C_j, D_j) (i \\neq j)\n\n(C_i, D_i) \\neq (D_j, C_j)\n\n(A_i, B_i) \\neq (C_j, D_j)\n\n(A_i, B_i) \\neq (D_j, C_j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 B_1\n\\vdots\nA_M B_M\nC_1 D_1\n\\vdots\nC_K D_K\n\nOutput\n\nPrint the answers in order, with space in between.\n\nSample Input 1\n\n4 4 1\n2 1\n1 3\n3 2\n3 4\n4 1\n\nSample Output 1\n\n0 1 0 1\n\nThere is a friendship between User 2 and 3, and between 3 and 4. Also, there is no friendship or blockship between User 2 and 4. Thus, User 4 is a friend candidate for User 2.\n\nHowever, neither User 1 or 3 is a friend candidate for User 2, so User 2 has one friend candidate.\n\nSample Input 2\n\n5 10 0\n1 2\n1 3\n1 4\n1 5\n3 2\n2 4\n2 5\n4 3\n5 3\n4 5\n\nSample Output 2\n\n0 0 0 0 0\n\nEveryone is a friend of everyone else and has no friend candidate.\n\nSample Input 3\n\n10 9 3\n10 1\n6 7\n8 2\n2 5\n8 4\n7 3\n10 9\n6 4\n5 8\n2 6\n7 5\n3 1\n\nSample Output 3\n\n1 3 5 4 3 3 3 3 1 0", "sample_input": "4 4 1\n2 1\n1 3\n3 2\n3 4\n4 1\n"}, "reference_outputs": ["0 1 0 1\n"], "source_document_id": "p02762", "source_text": "Score : 400 points\n\nProblem Statement\n\nAn SNS has N users - User 1, User 2, \\cdots, User N.\n\nBetween these N users, there are some relationships - M friendships and K blockships.\n\nFor each i = 1, 2, \\cdots, M, there is a bidirectional friendship between User A_i and User B_i.\n\nFor each i = 1, 2, \\cdots, K, there is a bidirectional blockship between User C_i and User D_i.\n\nWe define User a to be a friend candidate for User b when all of the following four conditions are satisfied:\n\na \\neq b.\n\nThere is not a friendship between User a and User b.\n\nThere is not a blockship between User a and User b.\n\nThere exists a sequence c_0, c_1, c_2, \\cdots, c_L consisting of integers between 1 and N (inclusive) such that c_0 = a, c_L = b, and there is a friendship between User c_i and c_{i+1} for each i = 0, 1, \\cdots, L - 1.\n\nFor each user i = 1, 2, ... N, how many friend candidates does it have?\n\nConstraints\n\nAll values in input are integers.\n\n2 ≤ N ≤ 10^5\n\n0 \\leq M \\leq 10^5\n\n0 \\leq K \\leq 10^5\n\n1 \\leq A_i, B_i \\leq N\n\nA_i \\neq B_i\n\n1 \\leq C_i, D_i \\leq N\n\nC_i \\neq D_i\n\n(A_i, B_i) \\neq (A_j, B_j) (i \\neq j)\n\n(A_i, B_i) \\neq (B_j, A_j)\n\n(C_i, D_i) \\neq (C_j, D_j) (i \\neq j)\n\n(C_i, D_i) \\neq (D_j, C_j)\n\n(A_i, B_i) \\neq (C_j, D_j)\n\n(A_i, B_i) \\neq (D_j, C_j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 B_1\n\\vdots\nA_M B_M\nC_1 D_1\n\\vdots\nC_K D_K\n\nOutput\n\nPrint the answers in order, with space in between.\n\nSample Input 1\n\n4 4 1\n2 1\n1 3\n3 2\n3 4\n4 1\n\nSample Output 1\n\n0 1 0 1\n\nThere is a friendship between User 2 and 3, and between 3 and 4. Also, there is no friendship or blockship between User 2 and 4. Thus, User 4 is a friend candidate for User 2.\n\nHowever, neither User 1 or 3 is a friend candidate for User 2, so User 2 has one friend candidate.\n\nSample Input 2\n\n5 10 0\n1 2\n1 3\n1 4\n1 5\n3 2\n2 4\n2 5\n4 3\n5 3\n4 5\n\nSample Output 2\n\n0 0 0 0 0\n\nEveryone is a friend of everyone else and has no friend candidate.\n\nSample Input 3\n\n10 9 3\n10 1\n6 7\n8 2\n2 5\n8 4\n7 3\n10 9\n6 4\n5 8\n2 6\n7 5\n3 1\n\nSample Output 3\n\n1 3 5 4 3 3 3 3 1 0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 932, "cpu_time_ms": 382, "memory_kb": 26356}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s426846679", "group_id": "codeNet:p02763", "input_text": "local mfl, mce = math.floor, math.ceil\nlocal mmi, mma = math.min, math.max\nlocal bls, brs = bit.lshift, bit.rshift\nlocal bor = bit.bor\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n local cnt = bls(1, i - 1)\n for j = 1, cnt do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.stage = {{}}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.stage[stagenum] = {}\n end\n self.stagenum = stagenum\n self.left_stage = {}\n for i = 1, n do\n local sp, sz = 1, bls(1, stagenum - 1)\n while(i - 1) % sz ~= 0 do\n sp, sz = sp + 1, brs(sz, 1)\n end\n self.left_stage[i] = sp\n end\n self.sz_stage = {}\n local tmp, sp = 1, stagenum\n for i = 1, n do\n if tmp * 2 == i then tmp, sp = tmp * 2, sp - 1 end\n self.sz_stage[i] = sp\n end\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local stagenum = self.stagenum\n local ret = self.emptyvalue\n while left <= right do\n local stage = mma(self.left_stage[left], self.sz_stage[right - left + 1])\n local sz = bls(1, stagenum - stage)\n ret = self.func(ret, self.stage[stage][1 + brs(left - 1, stagenum - stage)])\n left = left + sz\n end\n return ret\nend\nSegTree.update = function(self, idx)\n for i = self.stagenum - 1, 1, -1 do\n local dst = brs(idx + 1, 1)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\nend\nSegTree.setValue = function(self, idx, value, silent)\n self.stage[self.stagenum][idx] = value\n if not silent then\n self:update(idx)\n end\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal st = SegTree.new(n, bor, 0)\nfor i = 1, n do\n local v = s:byte(i) - 96\n st:setValue(i, bls(1, v - 1))\nend\nlocal q = io.read(\"*n\", \"*l\")\nfor iq = 1, q do\n local qstr = io.read()\n if qstr:byte(1) == 49 then\n local _u, pos, val = qstr:match(\"(%d) (%d+) (%w)\")\n pos = tonumber(pos)\n val = val:byte(1) - 96\n st:setValue(pos, bls(1, val - 1))\n else\n local _u, l, r = qstr:match(\"(%d) (%d+) (%d+)\")\n l = tonumber(l)\n r = tonumber(r)\n local v = st:getRange(l, r)\n local c = 0\n for i = 1, 26 do\n if v % 2 == 1 then c = c + 1 end\n v = brs(v, 1)\n end\n print(c)\n end\nend\n", "language": "Lua", "metadata": {"date": 1597538523, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s426846679.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s426846679", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n1\n5\n", "input_to_evaluate": "local mfl, mce = math.floor, math.ceil\nlocal mmi, mma = math.min, math.max\nlocal bls, brs = bit.lshift, bit.rshift\nlocal bor = bit.bor\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n local cnt = bls(1, i - 1)\n for j = 1, cnt do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.stage = {{}}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.stage[stagenum] = {}\n end\n self.stagenum = stagenum\n self.left_stage = {}\n for i = 1, n do\n local sp, sz = 1, bls(1, stagenum - 1)\n while(i - 1) % sz ~= 0 do\n sp, sz = sp + 1, brs(sz, 1)\n end\n self.left_stage[i] = sp\n end\n self.sz_stage = {}\n local tmp, sp = 1, stagenum\n for i = 1, n do\n if tmp * 2 == i then tmp, sp = tmp * 2, sp - 1 end\n self.sz_stage[i] = sp\n end\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local stagenum = self.stagenum\n local ret = self.emptyvalue\n while left <= right do\n local stage = mma(self.left_stage[left], self.sz_stage[right - left + 1])\n local sz = bls(1, stagenum - stage)\n ret = self.func(ret, self.stage[stage][1 + brs(left - 1, stagenum - stage)])\n left = left + sz\n end\n return ret\nend\nSegTree.update = function(self, idx)\n for i = self.stagenum - 1, 1, -1 do\n local dst = brs(idx + 1, 1)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\nend\nSegTree.setValue = function(self, idx, value, silent)\n self.stage[self.stagenum][idx] = value\n if not silent then\n self:update(idx)\n end\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal st = SegTree.new(n, bor, 0)\nfor i = 1, n do\n local v = s:byte(i) - 96\n st:setValue(i, bls(1, v - 1))\nend\nlocal q = io.read(\"*n\", \"*l\")\nfor iq = 1, q do\n local qstr = io.read()\n if qstr:byte(1) == 49 then\n local _u, pos, val = qstr:match(\"(%d) (%d+) (%w)\")\n pos = tonumber(pos)\n val = val:byte(1) - 96\n st:setValue(pos, bls(1, val - 1))\n else\n local _u, l, r = qstr:match(\"(%d) (%d+) (%d+)\")\n l = tonumber(l)\n r = tonumber(r)\n local v = st:getRange(l, r)\n local c = 0\n for i = 1, 26 do\n if v % 2 == 1 then c = c + 1 end\n v = brs(v, 1)\n end\n print(c)\n end\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2752, "cpu_time_ms": 151, "memory_kb": 21864}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s092705280", "group_id": "codeNet:p02763", "input_text": "local mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal bls, brs = bit.lshift, bit.rshift\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = false\n end\n end\nend\nSegTree.create = function(self, n)\n local stagenum, mul = 1, 1\n self.cnt, self.stage = {1}, {{}}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n self.stagenum = stagenum\n for i = 1, mul do self.stage[stagenum][i] = false end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local stagenum = self.stagenum\n local ret = false\n while true do\n local stage = 1\n local sz = bls(1, stagenum - stage)\n local len = right + 1 - left\n while (left - 1) % sz ~= 0 or len < sz do\n stage = stage + 1\n sz = brs(sz, 1)\n end\n ret = ret or self.stage[stage][1 + brs(left - 1, stagenum - stage)]\n left = left + sz\n if right < left then break end\n end\n return ret\nend\nSegTree.setValue = function(self, idx, value)\n self.stage[self.stagenum][idx] = value\n for i = self.stagenum - 1, 1, -1 do\n local dst = brs(idx + 1, 1)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.stage[i + 1][idx] or self.stage[i + 1][rem]\n idx = dst\n end\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal q = io.read(\"*n\", \"*l\")\nlocal sts = {}\nlocal t = {}\nfor i = 1, 26 do\n sts[i] = SegTree.new(n, function(a, b) return a or b end, false)\nend\nfor i = 1, n do\n t[i] = s:sub(i, i):byte() - 96\n sts[t[i]]:setValue(i, true)\nend\n\nfor iq = 1, q do\n local iqstr = io.read()\n local ic = iqstr:sub(1, 1)\n if ic == \"1\" then\n local i, cs = iqstr:match(\"%d (%d+) (%w)\")\n i = tonumber(i)\n local c = cs:byte() - 96\n if t[i] ~= c then\n sts[t[i]]:setValue(i, false)\n t[i] = c\n sts[c]:setValue(i, true)\n end\n else\n local l, r = iqstr:match(\"%d (%d+) (%d+)\")\n l, r = tonumber(l), tonumber(r)\n local cnt = 0\n for i = 1, 26 do\n if sts[i]:getRange(l, r) then cnt = cnt + 1 end\n end\n print(cnt)\n end\nend\n", "language": "Lua", "metadata": {"date": 1583213162, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s092705280.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s092705280", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n1\n5\n", "input_to_evaluate": "local mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal bls, brs = bit.lshift, bit.rshift\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = false\n end\n end\nend\nSegTree.create = function(self, n)\n local stagenum, mul = 1, 1\n self.cnt, self.stage = {1}, {{}}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n self.stagenum = stagenum\n for i = 1, mul do self.stage[stagenum][i] = false end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local stagenum = self.stagenum\n local ret = false\n while true do\n local stage = 1\n local sz = bls(1, stagenum - stage)\n local len = right + 1 - left\n while (left - 1) % sz ~= 0 or len < sz do\n stage = stage + 1\n sz = brs(sz, 1)\n end\n ret = ret or self.stage[stage][1 + brs(left - 1, stagenum - stage)]\n left = left + sz\n if right < left then break end\n end\n return ret\nend\nSegTree.setValue = function(self, idx, value)\n self.stage[self.stagenum][idx] = value\n for i = self.stagenum - 1, 1, -1 do\n local dst = brs(idx + 1, 1)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.stage[i + 1][idx] or self.stage[i + 1][rem]\n idx = dst\n end\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal q = io.read(\"*n\", \"*l\")\nlocal sts = {}\nlocal t = {}\nfor i = 1, 26 do\n sts[i] = SegTree.new(n, function(a, b) return a or b end, false)\nend\nfor i = 1, n do\n t[i] = s:sub(i, i):byte() - 96\n sts[t[i]]:setValue(i, true)\nend\n\nfor iq = 1, q do\n local iqstr = io.read()\n local ic = iqstr:sub(1, 1)\n if ic == \"1\" then\n local i, cs = iqstr:match(\"%d (%d+) (%w)\")\n i = tonumber(i)\n local c = cs:byte() - 96\n if t[i] ~= c then\n sts[t[i]]:setValue(i, false)\n t[i] = c\n sts[c]:setValue(i, true)\n end\n else\n local l, r = iqstr:match(\"%d (%d+) (%d+)\")\n l, r = tonumber(l), tonumber(r)\n local cnt = 0\n for i = 1, 26 do\n if sts[i]:getRange(l, r) then cnt = cnt + 1 end\n end\n print(cnt)\n end\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2357, "cpu_time_ms": 806, "memory_kb": 221004}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s761254897", "group_id": "codeNet:p02764", "input_text": "local mma, mmi = math.max, math.min\nlocal msq = math.sqrt\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = {io.read(\"*n\", \"*n\", \"*n\")}\nend\n\nlocal function func(x, y)\n local q = {}\n for i = 1, n do\n q[i] = t[i][3] * t[i][3] * ((t[i][1] - x) * (t[i][1] - x) + (t[i][2] - y) * (t[i][2] - y))\n end\n table.sort(q)\n return msq(q[k])\nend\n\nlocal function solve(tbl)\n local xmin, xmax, ymin, ymax = tbl[1], tbl[2], tbl[3], tbl[4]\n local dv = 96\n local dxrange = (xmax - xmin) / (dv * 2)\n local dyrange = (ymax - ymin) / (dv * 2)\n local mpx, mpy, minval = false, false, 0\n for i = 1, dv do\n local xp = xmin + dxrange * (i * 2 - 1)\n yp = ymin - dyrange\n for j = 1, dv do\n yp = yp + dyrange * 2\n local v = func(xp, yp)\n if not mpx or v < minval then\n minval = v\n mpx, mpy = i, j\n end\n end\n end\n tbl[1] = xmin + mma(0, dxrange * (mpx * 2 - 1 - dv / 2))\n tbl[2] = mmi(xmax, xmin + dxrange * (mpx * 2 - 1 + dv / 2))\n tbl[3] = ymin + mma(0, dyrange * (mpy * 2 - 1 - dv / 2))\n tbl[4] = mmi(ymax, ymin + dyrange * (mpy * 2 - 1 + dv / 2))\nend\n\nlocal tbl = {-1000, 1000, -1000, 1000}\nlocal rep = 10000000\nwhile true do\n solve(tbl)\n if 1.84 < os.clock() then break end\nend\nlocal xm, ym = (tbl[1] + tbl[2]) / 2, (tbl[3] + tbl[4]) / 2\nlocal ret = func(xm, ym)\nprint(string.format(\"%.10f\", ret))\n", "language": "Lua", "metadata": {"date": 1583120375, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s761254897.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s761254897", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2.4\n", "input_to_evaluate": "local mma, mmi = math.max, math.min\nlocal msq = math.sqrt\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = {io.read(\"*n\", \"*n\", \"*n\")}\nend\n\nlocal function func(x, y)\n local q = {}\n for i = 1, n do\n q[i] = t[i][3] * t[i][3] * ((t[i][1] - x) * (t[i][1] - x) + (t[i][2] - y) * (t[i][2] - y))\n end\n table.sort(q)\n return msq(q[k])\nend\n\nlocal function solve(tbl)\n local xmin, xmax, ymin, ymax = tbl[1], tbl[2], tbl[3], tbl[4]\n local dv = 96\n local dxrange = (xmax - xmin) / (dv * 2)\n local dyrange = (ymax - ymin) / (dv * 2)\n local mpx, mpy, minval = false, false, 0\n for i = 1, dv do\n local xp = xmin + dxrange * (i * 2 - 1)\n yp = ymin - dyrange\n for j = 1, dv do\n yp = yp + dyrange * 2\n local v = func(xp, yp)\n if not mpx or v < minval then\n minval = v\n mpx, mpy = i, j\n end\n end\n end\n tbl[1] = xmin + mma(0, dxrange * (mpx * 2 - 1 - dv / 2))\n tbl[2] = mmi(xmax, xmin + dxrange * (mpx * 2 - 1 + dv / 2))\n tbl[3] = ymin + mma(0, dyrange * (mpy * 2 - 1 - dv / 2))\n tbl[4] = mmi(ymax, ymin + dyrange * (mpy * 2 - 1 + dv / 2))\nend\n\nlocal tbl = {-1000, 1000, -1000, 1000}\nlocal rep = 10000000\nwhile true do\n solve(tbl)\n if 1.84 < os.clock() then break end\nend\nlocal xm, ym = (tbl[1] + tbl[2]) / 2, (tbl[3] + tbl[4]) / 2\nlocal ret = func(xm, ym)\nprint(string.format(\"%.10f\", ret))\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1361, "cpu_time_ms": 1937, "memory_kb": 260}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s703254547", "group_id": "codeNet:p02764", "input_text": "local mma, mmi = math.max, math.min\nlocal msq = math.sqrt\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = {io.read(\"*n\", \"*n\", \"*n\")}\nend\n\nlocal function func(x, y)\n local q = {}\n for i = 1, n do\n q[i] = t[i][3] * t[i][3] * ((t[i][1] - x) * (t[i][1] - x) + (t[i][2] - y) * (t[i][2] - y))\n end\n table.sort(q)\n return msq(q[k])\nend\n\nlocal function solve(tbl)\n local xmin, xmax, ymin, ymax = tbl[1], tbl[2], tbl[3], tbl[4]\n local dv = 128\n local dxrange = (xmax - xmin) / (dv * 2)\n local dyrange = (ymax - ymin) / (dv * 2)\n local xp = {}\n for i = 1, dv do\n xp[i] = xmin + dxrange * (i * 2 - 1)\n end\n local yp = {}\n for i = 1, dv do\n yp[i] = ymin + dyrange * (i * 2 - 1)\n end\n local mp, minval = false, 0\n for i = 1, dv do\n for j = 1, dv do\n local v = func(xp[i], yp[j])\n if not mp or v < minval then\n minval = v\n mp = {i, j}\n end\n end\n end\n tbl[1] = xmin + mma(0, dxrange * (mp[1] * 2 - 1 - dv / 4))\n tbl[2] = mmi(xmax, xmin + dxrange * (mp[1] * 2 - 1 + dv / 4))\n tbl[3] = ymin + mma(0, dyrange * (mp[2] * 2 - 1 - dv / 4))\n tbl[4] = mmi(ymax, ymin + dyrange * (mp[2] * 2 - 1 + dv / 4))\nend\n\nlocal tbl = {-1000, 1000, -1000, 1000}\nlocal rep = 10000000\nwhile true do\n solve(tbl)\n if 1.85 < os.clock() then break end\nend\nlocal xm, ym = (tbl[1] + tbl[2]) / 2, (tbl[3] + tbl[4]) / 2\nlocal ret = func(xm, ym)\nprint(string.format(\"%.10f\", ret))\n", "language": "Lua", "metadata": {"date": 1583119580, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s703254547.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s703254547", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2.4\n", "input_to_evaluate": "local mma, mmi = math.max, math.min\nlocal msq = math.sqrt\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = {io.read(\"*n\", \"*n\", \"*n\")}\nend\n\nlocal function func(x, y)\n local q = {}\n for i = 1, n do\n q[i] = t[i][3] * t[i][3] * ((t[i][1] - x) * (t[i][1] - x) + (t[i][2] - y) * (t[i][2] - y))\n end\n table.sort(q)\n return msq(q[k])\nend\n\nlocal function solve(tbl)\n local xmin, xmax, ymin, ymax = tbl[1], tbl[2], tbl[3], tbl[4]\n local dv = 128\n local dxrange = (xmax - xmin) / (dv * 2)\n local dyrange = (ymax - ymin) / (dv * 2)\n local xp = {}\n for i = 1, dv do\n xp[i] = xmin + dxrange * (i * 2 - 1)\n end\n local yp = {}\n for i = 1, dv do\n yp[i] = ymin + dyrange * (i * 2 - 1)\n end\n local mp, minval = false, 0\n for i = 1, dv do\n for j = 1, dv do\n local v = func(xp[i], yp[j])\n if not mp or v < minval then\n minval = v\n mp = {i, j}\n end\n end\n end\n tbl[1] = xmin + mma(0, dxrange * (mp[1] * 2 - 1 - dv / 4))\n tbl[2] = mmi(xmax, xmin + dxrange * (mp[1] * 2 - 1 + dv / 4))\n tbl[3] = ymin + mma(0, dyrange * (mp[2] * 2 - 1 - dv / 4))\n tbl[4] = mmi(ymax, ymin + dyrange * (mp[2] * 2 - 1 + dv / 4))\nend\n\nlocal tbl = {-1000, 1000, -1000, 1000}\nlocal rep = 10000000\nwhile true do\n solve(tbl)\n if 1.85 < os.clock() then break end\nend\nlocal xm, ym = (tbl[1] + tbl[2]) / 2, (tbl[3] + tbl[4]) / 2\nlocal ret = func(xm, ym)\nprint(string.format(\"%.10f\", ret))\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1426, "cpu_time_ms": 2017, "memory_kb": 384}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s394162516", "group_id": "codeNet:p02764", "input_text": "local mma, mmi = math.max, math.min\nlocal msq = math.sqrt\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = {io.read(\"*n\", \"*n\", \"*n\")}\nend\n\nlocal function func(x, y)\n local q = {}\n for i = 1, n do\n q[i] = t[i][3] * t[i][3] * ((t[i][1] - x) * (t[i][1] - x) + (t[i][2] - y) * (t[i][2] - y))\n end\n table.sort(q)\n return msq(q[k])\nend\n\nlocal function solve(tbl)\n local xmin, xmax, ymin, ymax = tbl[1], tbl[2], tbl[3], tbl[4]\n local dv = 256\n local dxrange = (xmax - xmin) / (dv * 2)\n local dyrange = (ymax - ymin) / (dv * 2)\n local xp = {}\n for i = 1, dv do\n xp[i] = xmin + dxrange * (i * 2 - 1)\n end\n local yp = {}\n for i = 1, dv do\n yp[i] = ymin + dyrange * (i * 2 - 1)\n end\n local mp, minval = false, 0\n for i = 1, dv do\n for j = 1, dv do\n local v = func(xp[i], yp[j])\n if not mp or v < minval then\n minval = v\n mp = {i, j}\n end\n end\n end\n tbl[1] = xmin + mma(0, dxrange * (mp[1] * 2 - 1 - dv / 4))\n tbl[2] = mmi(xmax, xmin + dxrange * (mp[1] * 2 - 1 + dv / 4))\n tbl[3] = ymin + mma(0, dyrange * (mp[2] * 2 - 1 - dv / 4))\n tbl[4] = mmi(ymax, ymin + dyrange * (mp[2] * 2 - 1 + dv / 4))\nend\n\nlocal tbl = {-1000, 1000, -1000, 1000}\nlocal rep = 10000000\nwhile true do\n solve(tbl)\n if 1.85 < os.clock() then break end\nend\nlocal xm, ym = (tbl[1] + tbl[2]) / 2, (tbl[3] + tbl[4]) / 2\nlocal ret = func(xm, ym)\nprint(string.format(\"%.10f\", ret))\n", "language": "Lua", "metadata": {"date": 1583119486, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s394162516.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s394162516", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2.4\n", "input_to_evaluate": "local mma, mmi = math.max, math.min\nlocal msq = math.sqrt\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = {io.read(\"*n\", \"*n\", \"*n\")}\nend\n\nlocal function func(x, y)\n local q = {}\n for i = 1, n do\n q[i] = t[i][3] * t[i][3] * ((t[i][1] - x) * (t[i][1] - x) + (t[i][2] - y) * (t[i][2] - y))\n end\n table.sort(q)\n return msq(q[k])\nend\n\nlocal function solve(tbl)\n local xmin, xmax, ymin, ymax = tbl[1], tbl[2], tbl[3], tbl[4]\n local dv = 256\n local dxrange = (xmax - xmin) / (dv * 2)\n local dyrange = (ymax - ymin) / (dv * 2)\n local xp = {}\n for i = 1, dv do\n xp[i] = xmin + dxrange * (i * 2 - 1)\n end\n local yp = {}\n for i = 1, dv do\n yp[i] = ymin + dyrange * (i * 2 - 1)\n end\n local mp, minval = false, 0\n for i = 1, dv do\n for j = 1, dv do\n local v = func(xp[i], yp[j])\n if not mp or v < minval then\n minval = v\n mp = {i, j}\n end\n end\n end\n tbl[1] = xmin + mma(0, dxrange * (mp[1] * 2 - 1 - dv / 4))\n tbl[2] = mmi(xmax, xmin + dxrange * (mp[1] * 2 - 1 + dv / 4))\n tbl[3] = ymin + mma(0, dyrange * (mp[2] * 2 - 1 - dv / 4))\n tbl[4] = mmi(ymax, ymin + dyrange * (mp[2] * 2 - 1 + dv / 4))\nend\n\nlocal tbl = {-1000, 1000, -1000, 1000}\nlocal rep = 10000000\nwhile true do\n solve(tbl)\n if 1.85 < os.clock() then break end\nend\nlocal xm, ym = (tbl[1] + tbl[2]) / 2, (tbl[3] + tbl[4]) / 2\nlocal ret = func(xm, ym)\nprint(string.format(\"%.10f\", ret))\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1426, "cpu_time_ms": 2107, "memory_kb": 384}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s728587687", "group_id": "codeNet:p02765", "input_text": "N=io.read\"*n\"\nR=io.read\"*n\"\nif(N<10)then print(R+100*(10-N))\nelse print(R)end", "language": "Lua", "metadata": {"date": 1587246113, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02765.html", "problem_id": "p02765", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02765/input.txt", "sample_output_relpath": "derived/input_output/data/p02765/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02765/Lua/s728587687.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s728587687", "user_id": "u726173718"}, "prompt_components": {"gold_output": "3719\n", "input_to_evaluate": "N=io.read\"*n\"\nR=io.read\"*n\"\nif(N<10)then print(R+100*(10-N))\nelse print(R)end", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is a member of a programming competition site, ButCoder.\n\nEach member of ButCoder is assigned two values: Inner Rating and Displayed Rating.\n\nThe Displayed Rating of a member is equal to their Inner Rating if the member has participated in 10 or more contests. Otherwise, the Displayed Rating will be their Inner Rating minus 100 \\times (10 - K) when the member has participated in K contests.\n\nTakahashi has participated in N contests, and his Displayed Rating is R. Find his Inner Rating.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n0 \\leq R \\leq 4111\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN R\n\nOutput\n\nPrint his Inner Rating.\n\nSample Input 1\n\n2 2919\n\nSample Output 1\n\n3719\n\nTakahashi has participated in 2 contests, which is less than 10, so his Displayed Rating is his Inner Rating minus 100 \\times (10 - 2) = 800.\n\nThus, Takahashi's Inner Rating is 2919 + 800 = 3719.\n\nSample Input 2\n\n22 3051\n\nSample Output 2\n\n3051", "sample_input": "2 2919\n"}, "reference_outputs": ["3719\n"], "source_document_id": "p02765", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is a member of a programming competition site, ButCoder.\n\nEach member of ButCoder is assigned two values: Inner Rating and Displayed Rating.\n\nThe Displayed Rating of a member is equal to their Inner Rating if the member has participated in 10 or more contests. Otherwise, the Displayed Rating will be their Inner Rating minus 100 \\times (10 - K) when the member has participated in K contests.\n\nTakahashi has participated in N contests, and his Displayed Rating is R. Find his Inner Rating.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n0 \\leq R \\leq 4111\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN R\n\nOutput\n\nPrint his Inner Rating.\n\nSample Input 1\n\n2 2919\n\nSample Output 1\n\n3719\n\nTakahashi has participated in 2 contests, which is less than 10, so his Displayed Rating is his Inner Rating minus 100 \\times (10 - 2) = 800.\n\nThus, Takahashi's Inner Rating is 2919 + 800 = 3719.\n\nSample Input 2\n\n22 3051\n\nSample Output 2\n\n3051", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 77, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s565897940", "group_id": "codeNet:p02767", "input_text": "N=io.read\"*n\"\nX={}\nfor i=1,N do\n\tX[i]=io.read\"*n\"\nend\nb,c=0,0\nfor i=1,N do\n\tb=b-X[i]*2\n\tc=c+X[i]*X[i]\nend\nr=-math.floor(b/N*.5+.5)\nprint(N*r*r+b*r+c)", "language": "Lua", "metadata": {"date": 1587246994, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s565897940.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s565897940", "user_id": "u726173718"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "N=io.read\"*n\"\nX={}\nfor i=1,N do\n\tX[i]=io.read\"*n\"\nend\nb,c=0,0\nfor i=1,N do\n\tb=b-X[i]*2\n\tc=c+X[i]*X[i]\nend\nr=-math.floor(b/N*.5+.5)\nprint(N*r*r+b*r+c)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s381507976", "group_id": "codeNet:p02771", "input_text": "local A, B, C = io.read(\"n\", \"n\", \"n\")\nif A == B and B == C then\n print(\"No\")\nelseif A ~= B and B ~= C and C ~= A then\n print(\"No\")\nelse\n print(\"Yes\")\nend\n", "language": "Lua", "metadata": {"date": 1589170842, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "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/Lua/s381507976.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s381507976", "user_id": "u162773977"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local A, B, C = io.read(\"n\", \"n\", \"n\")\nif A == B and B == C then\n print(\"No\")\nelseif A ~= B and B ~= C and C ~= A then\n print(\"No\")\nelse\n print(\"Yes\")\nend\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nA triple of numbers is said to be poor when two of those numbers are equal but the other number is different from those two numbers.\n\nYou will be given three integers A, B, and C. If this triple is poor, print Yes; otherwise, print No.\n\nConstraints\n\nA, B, and C are all integers between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the given triple is poor, print Yes; otherwise, print No.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\nYes\n\nA and C are equal, but B is different from those two numbers, so this triple is poor.\n\nSample Input 2\n\n4 4 4\n\nSample Output 2\n\nNo\n\nA, B, and C are all equal, so this triple is not poor.\n\nSample Input 3\n\n4 9 6\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3 3 4\n\nSample Output 4\n\nYes", "sample_input": "5 7 5\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02771", "source_text": "Score: 100 points\n\nProblem Statement\n\nA triple of numbers is said to be poor when two of those numbers are equal but the other number is different from those two numbers.\n\nYou will be given three integers A, B, and C. If this triple is poor, print Yes; otherwise, print No.\n\nConstraints\n\nA, B, and C are all integers between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the given triple is poor, print Yes; otherwise, print No.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\nYes\n\nA and C are equal, but B is different from those two numbers, so this triple is poor.\n\nSample Input 2\n\n4 4 4\n\nSample Output 2\n\nNo\n\nA, B, and C are all equal, so this triple is not poor.\n\nSample Input 3\n\n4 9 6\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3 3 4\n\nSample Output 4\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s412512896", "group_id": "codeNet:p02773", "input_text": "local N = io.read(\"n\", \"l\")\nlocal counts = setmetatable({}, {__index=function()return 0 end})\nlocal max = 0\nfor i=1,N do\n local s = io.read(\"l\")\n counts[s] = counts[s] + 1\n if counts[s] > max then\n max = counts[s]\n end\nend\nlocal anstbl = {}\nfor s, c in pairs(counts) do\n if c == max then\n table.insert(anstbl, s)\n end\nend\ntable.sort(anstbl)\nfor i=1,#anstbl do\n print(anstbl[i])\nend\n", "language": "Lua", "metadata": {"date": 1581890102, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s412512896.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s412512896", "user_id": "u162773977"}, "prompt_components": {"gold_output": "beet\nvet\n", "input_to_evaluate": "local N = io.read(\"n\", \"l\")\nlocal counts = setmetatable({}, {__index=function()return 0 end})\nlocal max = 0\nfor i=1,N do\n local s = io.read(\"l\")\n counts[s] = counts[s] + 1\n if counts[s] > max then\n max = counts[s]\n end\nend\nlocal anstbl = {}\nfor s, c in pairs(counts) do\n if c == max then\n table.insert(anstbl, s)\n end\nend\ntable.sort(anstbl)\nfor i=1,#anstbl do\n print(anstbl[i])\nend\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nWe have N voting papers. The i-th vote (1 \\leq i \\leq N) has the string S_i written on it.\n\nPrint all strings that are written on the most number of votes, in lexicographical order.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nS_i (1 \\leq i \\leq N) are strings consisting of lowercase English letters.\n\nThe length of S_i (1 \\leq i \\leq N) is between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nPrint all strings in question in lexicographical order.\n\nSample Input 1\n\n7\nbeat\nvet\nbeet\nbed\nvet\nbet\nbeet\n\nSample Output 1\n\nbeet\nvet\n\nbeet and vet are written on two sheets each, while beat, bed, and bet are written on one vote each. Thus, we should print the strings beet and vet.\n\nSample Input 2\n\n8\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\n\nSample Output 2\n\nbuffalo\n\nSample Input 3\n\n7\nbass\nbass\nkick\nkick\nbass\nkick\nkick\n\nSample Output 3\n\nkick\n\nSample Input 4\n\n4\nushi\ntapu\nnichia\nkun\n\nSample Output 4\n\nkun\nnichia\ntapu\nushi", "sample_input": "7\nbeat\nvet\nbeet\nbed\nvet\nbet\nbeet\n"}, "reference_outputs": ["beet\nvet\n"], "source_document_id": "p02773", "source_text": "Score: 300 points\n\nProblem Statement\n\nWe have N voting papers. The i-th vote (1 \\leq i \\leq N) has the string S_i written on it.\n\nPrint all strings that are written on the most number of votes, in lexicographical order.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nS_i (1 \\leq i \\leq N) are strings consisting of lowercase English letters.\n\nThe length of S_i (1 \\leq i \\leq N) is between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nPrint all strings in question in lexicographical order.\n\nSample Input 1\n\n7\nbeat\nvet\nbeet\nbed\nvet\nbet\nbeet\n\nSample Output 1\n\nbeet\nvet\n\nbeet and vet are written on two sheets each, while beat, bed, and bet are written on one vote each. Thus, we should print the strings beet and vet.\n\nSample Input 2\n\n8\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\n\nSample Output 2\n\nbuffalo\n\nSample Input 3\n\n7\nbass\nbass\nkick\nkick\nbass\nkick\nkick\n\nSample Output 3\n\nkick\n\nSample Input 4\n\n4\nushi\ntapu\nnichia\nkun\n\nSample Output 4\n\nkun\nnichia\ntapu\nushi", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 773, "memory_kb": 25696}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s378096502", "group_id": "codeNet:p02780", "input_text": "N=io.read\"*n\"\nK=io.read\"*n\"\ns={0}\nfor i=1,N do\n\ttable.insert(s,s[i]+io.read\"*n\"*.5+.5)\nend\nmax=0\nfor i=1,N-K+1 do\n\tmax=math.max(max,s[i+K]-s[i])\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1588804819, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s378096502.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s378096502", "user_id": "u726173718"}, "prompt_components": {"gold_output": "7.000000000000\n", "input_to_evaluate": "N=io.read\"*n\"\nK=io.read\"*n\"\ns={0}\nfor i=1,N do\n\ttable.insert(s,s[i]+io.read\"*n\"*.5+.5)\nend\nmax=0\nfor i=1,N-K+1 do\n\tmax=math.max(max,s[i+K]-s[i])\nend\nprint(max)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 72, "memory_kb": 2304}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s333257061", "group_id": "codeNet:p02781", "input_text": "local mfl = math.floor\nlocal ns = io.read()\nlocal k = io.read(\"*n\")\nif k == 1 then\n local a = tonumber(ns:sub(1, 1))\n print(a + 9 * (#ns - 1))\nelseif k == 2 then\n if #ns == 1 or ns == \"10\" then print(0)\n else\n local a = tonumber(ns:sub(1, 1))\n local b = tonumber(ns:sub(2, 2))\n -- use 1st but not max\n local ret = (#ns - 1) * 9 * (a - 1)\n -- don't use 1st\n ret = ret + 81 * mfl((#ns - 1) * (#ns - 2) / 2)\n -- use 1st by max\n ret = ret + b + 9 * (#ns - 2)\n print(ret)\n end\nelse\n if #ns < 3 or ns == \"100\" then print(0)\n else\n local a = tonumber(ns:sub(1, 1))\n local b = tonumber(ns:sub(2, 2))\n local c = tonumber(ns:sub(3, 3))\n -- don't use 1st\n ret = 729 * mfl((#ns - 1) * (#ns - 2) * (#ns - 3) / 6)\n -- use 1st but not max\n ret = ret + (a - 1) * 81 * mfl((#ns - 1) * (#ns - 2) / 2)\n -- use 1st by max\n do\n -- don't use second\n ret = ret + 81 * mfl((#ns - 2) * (#ns - 3) / 2)\n -- use 2nd but not max\n ret = ret + (b - 1) * 9 * (#ns - 2)\n -- use 2nd by max\n ret = ret + c + 9 * (#ns - 3)\n end\n print(ret)\n end\nend\n", "language": "Lua", "metadata": {"date": 1581851700, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02781.html", "problem_id": "p02781", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02781/input.txt", "sample_output_relpath": "derived/input_output/data/p02781/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02781/Lua/s333257061.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s333257061", "user_id": "u120582723"}, "prompt_components": {"gold_output": "19\n", "input_to_evaluate": "local mfl = math.floor\nlocal ns = io.read()\nlocal k = io.read(\"*n\")\nif k == 1 then\n local a = tonumber(ns:sub(1, 1))\n print(a + 9 * (#ns - 1))\nelseif k == 2 then\n if #ns == 1 or ns == \"10\" then print(0)\n else\n local a = tonumber(ns:sub(1, 1))\n local b = tonumber(ns:sub(2, 2))\n -- use 1st but not max\n local ret = (#ns - 1) * 9 * (a - 1)\n -- don't use 1st\n ret = ret + 81 * mfl((#ns - 1) * (#ns - 2) / 2)\n -- use 1st by max\n ret = ret + b + 9 * (#ns - 2)\n print(ret)\n end\nelse\n if #ns < 3 or ns == \"100\" then print(0)\n else\n local a = tonumber(ns:sub(1, 1))\n local b = tonumber(ns:sub(2, 2))\n local c = tonumber(ns:sub(3, 3))\n -- don't use 1st\n ret = 729 * mfl((#ns - 1) * (#ns - 2) * (#ns - 3) / 6)\n -- use 1st but not max\n ret = ret + (a - 1) * 81 * mfl((#ns - 1) * (#ns - 2) / 2)\n -- use 1st by max\n do\n -- don't use second\n ret = ret + 81 * mfl((#ns - 2) * (#ns - 3) / 2)\n -- use 2nd but not max\n ret = ret + (b - 1) * 9 * (#ns - 2)\n -- use 2nd by max\n ret = ret + c + 9 * (#ns - 3)\n end\n print(ret)\n end\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nFind the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten.\n\nConstraints\n\n1 \\leq N < 10^{100}\n\n1 \\leq K \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nK\n\nOutput\n\nPrint the count.\n\nSample Input 1\n\n100\n1\n\nSample Output 1\n\n19\n\nThe following 19 integers satisfy the condition:\n\n1,2,3,4,5,6,7,8,9,10,20,30,40,50,60,70,80,90,100\n\nSample Input 2\n\n25\n2\n\nSample Output 2\n\n14\n\nThe following 14 integers satisfy the condition:\n\n11,12,13,14,15,16,17,18,19,21,22,23,24,25\n\nSample Input 3\n\n314159\n2\n\nSample Output 3\n\n937\n\nSample Input 4\n\n9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999\n3\n\nSample Output 4\n\n117879300", "sample_input": "100\n1\n"}, "reference_outputs": ["19\n"], "source_document_id": "p02781", "source_text": "Score : 500 points\n\nProblem Statement\n\nFind the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten.\n\nConstraints\n\n1 \\leq N < 10^{100}\n\n1 \\leq K \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nK\n\nOutput\n\nPrint the count.\n\nSample Input 1\n\n100\n1\n\nSample Output 1\n\n19\n\nThe following 19 integers satisfy the condition:\n\n1,2,3,4,5,6,7,8,9,10,20,30,40,50,60,70,80,90,100\n\nSample Input 2\n\n25\n2\n\nSample Output 2\n\n14\n\nThe following 14 integers satisfy the condition:\n\n11,12,13,14,15,16,17,18,19,21,22,23,24,25\n\nSample Input 3\n\n314159\n2\n\nSample Output 3\n\n937\n\nSample Input 4\n\n9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999\n3\n\nSample Output 4\n\n117879300", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1111, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s031126717", "group_id": "codeNet:p02783", "input_text": "a, b = io.read(\"*n\", \"*n\")\nprint(math.ceil(a / b))\n", "language": "Lua", "metadata": {"date": 1580114634, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "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/Lua/s031126717.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s031126717", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "a, b = io.read(\"*n\", \"*n\")\nprint(math.ceil(a / b))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nServal is fighting with a monster.\n\nThe health of the monster is H.\n\nIn one attack, Serval can decrease the monster's health by A.\nThere is no other way to decrease the monster's health.\n\nServal wins when the monster's health becomes 0 or below.\n\nFind the number of attacks Serval needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq A \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH A\n\nOutput\n\nPrint the number of attacks Serval needs to make before winning.\n\nSample Input 1\n\n10 4\n\nSample Output 1\n\n3\n\nAfter one attack, the monster's health will be 6.\n\nAfter two attacks, the monster's health will be 2.\n\nAfter three attacks, the monster's health will be -2.\n\nThus, Serval needs to make three attacks to win.\n\nSample Input 2\n\n1 10000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10000 1\n\nSample Output 3\n\n10000", "sample_input": "10 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02783", "source_text": "Score : 100 points\n\nProblem Statement\n\nServal is fighting with a monster.\n\nThe health of the monster is H.\n\nIn one attack, Serval can decrease the monster's health by A.\nThere is no other way to decrease the monster's health.\n\nServal wins when the monster's health becomes 0 or below.\n\nFind the number of attacks Serval needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq A \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH A\n\nOutput\n\nPrint the number of attacks Serval needs to make before winning.\n\nSample Input 1\n\n10 4\n\nSample Output 1\n\n3\n\nAfter one attack, the monster's health will be 6.\n\nAfter two attacks, the monster's health will be 2.\n\nAfter three attacks, the monster's health will be -2.\n\nThus, Serval needs to make three attacks to win.\n\nSample Input 2\n\n1 10000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10000 1\n\nSample Output 3\n\n10000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s875197362", "group_id": "codeNet:p02784", "input_text": "h,n = io.read(\"*n\",\"*n\")\nal = io.read()\nfor a in string.gmatch( al,\"%d+\" ) do\n h = h - a\nend\n\nif h <= 0 then \n print(\"Yes\")\nelse \n print(\"No\")\nend", "language": "Lua", "metadata": {"date": 1581114353, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s875197362.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s875197362", "user_id": "u330661451"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "h,n = io.read(\"*n\",\"*n\")\nal = io.read()\nfor a in string.gmatch( al,\"%d+\" ) do\n h = h - a\nend\n\nif h <= 0 then \n print(\"Yes\")\nelse \n print(\"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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 155, "cpu_time_ms": 6, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s099023313", "group_id": "codeNet:p02784", "input_text": "h,n = io.read(\"*n\",\"*n\",\"*l\")\nal = io.read()\nfor a in string.gmatch( al,\"%d+\" ) do\n h = h - tonumber(a)\n io.stderr:write(tostring(h)..\"\\n\")\nend\n\nif h <= 0 then \n print(\"Yes\")\nelse \n print(\"No\")\nend", "language": "Lua", "metadata": {"date": 1581022694, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s099023313.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s099023313", "user_id": "u330661451"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "h,n = io.read(\"*n\",\"*n\",\"*l\")\nal = io.read()\nfor a in string.gmatch( al,\"%d+\" ) do\n h = h - tonumber(a)\n io.stderr:write(tostring(h)..\"\\n\")\nend\n\nif h <= 0 then \n print(\"Yes\")\nelse \n print(\"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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 207, "cpu_time_ms": 170, "memory_kb": 4772}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s077161673", "group_id": "codeNet:p02785", "input_text": "N=io.read\"*n\"\nK=io.read\"*n\"\nH={}for i=1,N do\nH[i]=io.read\"*n\"end\ntable.sort(H)\ns=0\nfor i=1,N-K do s=s+H[i]end\nprint(s)", "language": "Lua", "metadata": {"date": 1587308019, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s077161673.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s077161673", "user_id": "u726173718"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "N=io.read\"*n\"\nK=io.read\"*n\"\nH={}for i=1,N do\nH[i]=io.read\"*n\"end\ntable.sort(H)\ns=0\nfor i=1,N-K do s=s+H[i]end\nprint(s)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 202, "memory_kb": 4472}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s935612626", "group_id": "codeNet:p02785", "input_text": "n,k = io.read(\"*n\",\"*n\", \"*l\")\nt = {}\nfor i = 1, n do\n t[i] = io.read(\"*n\")\nend\ntable.sort( t )\na = 0\ni = 1\nwhile i <= n-k do\n a = a + t[i]\n i = i + 1\nend\nio.write(string.format(\"%d\\n\", a))\n", "language": "Lua", "metadata": {"date": 1581113960, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s935612626.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s935612626", "user_id": "u330661451"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "n,k = io.read(\"*n\",\"*n\", \"*l\")\nt = {}\nfor i = 1, n do\n t[i] = io.read(\"*n\")\nend\ntable.sort( t )\na = 0\ni = 1\nwhile i <= n-k do\n a = a + t[i]\n i = i + 1\nend\nio.write(string.format(\"%d\\n\", a))\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 154, "memory_kb": 2304}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s204162349", "group_id": "codeNet:p02786", "input_text": "H=io.read\"*n\"\ns=0\nwhile(H~=0)do\n\tH=math.floor(H*.5)\n\ts=s*2+1\nend\nprint(s)", "language": "Lua", "metadata": {"date": 1587662327, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02786.html", "problem_id": "p02786", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02786/input.txt", "sample_output_relpath": "derived/input_output/data/p02786/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02786/Lua/s204162349.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s204162349", "user_id": "u726173718"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "H=io.read\"*n\"\ns=0\nwhile(H~=0)do\n\tH=math.floor(H*.5)\n\ts=s*2+1\nend\nprint(s)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nCaracal is fighting with a monster.\n\nThe health of the monster is H.\n\nCaracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:\n\nIf the monster's health is 1, it drops to 0.\n\nIf the monster's health, X, is greater than 1, that monster disappears. Then, two new monsters appear, each with the health of \\lfloor X/2 \\rfloor.\n\n(\\lfloor r \\rfloor denotes the greatest integer not exceeding r.)\n\nCaracal wins when the healths of all existing monsters become 0 or below.\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH\n\nOutput\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n3\n\nWhen Caracal attacks the initial monster, it disappears, and two monsters appear, each with the health of 1.\n\nThen, Caracal can attack each of these new monsters once and win with a total of three attacks.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n1000000000000\n\nSample Output 3\n\n1099511627775", "sample_input": "2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02786", "source_text": "Score : 400 points\n\nProblem Statement\n\nCaracal is fighting with a monster.\n\nThe health of the monster is H.\n\nCaracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:\n\nIf the monster's health is 1, it drops to 0.\n\nIf the monster's health, X, is greater than 1, that monster disappears. Then, two new monsters appear, each with the health of \\lfloor X/2 \\rfloor.\n\n(\\lfloor r \\rfloor denotes the greatest integer not exceeding r.)\n\nCaracal wins when the healths of all existing monsters become 0 or below.\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH\n\nOutput\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n3\n\nWhen Caracal attacks the initial monster, it disappears, and two monsters appear, each with the health of 1.\n\nThen, Caracal can attack each of these new monsters once and win with a total of three attacks.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n1000000000000\n\nSample Output 3\n\n1099511627775", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 73, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s137715707", "group_id": "codeNet:p02786", "input_text": "local a = io.read(\"*n\")\nlocal s = 0\nlocal mul = 1\nwhile 0 < a do\n a = a // 2\n s = s + mul\n mul = mul * 2\nend\nprint(s)\n", "language": "Lua", "metadata": {"date": 1580112615, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02786.html", "problem_id": "p02786", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02786/input.txt", "sample_output_relpath": "derived/input_output/data/p02786/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02786/Lua/s137715707.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s137715707", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local a = io.read(\"*n\")\nlocal s = 0\nlocal mul = 1\nwhile 0 < a do\n a = a // 2\n s = s + mul\n mul = mul * 2\nend\nprint(s)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nCaracal is fighting with a monster.\n\nThe health of the monster is H.\n\nCaracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:\n\nIf the monster's health is 1, it drops to 0.\n\nIf the monster's health, X, is greater than 1, that monster disappears. Then, two new monsters appear, each with the health of \\lfloor X/2 \\rfloor.\n\n(\\lfloor r \\rfloor denotes the greatest integer not exceeding r.)\n\nCaracal wins when the healths of all existing monsters become 0 or below.\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH\n\nOutput\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n3\n\nWhen Caracal attacks the initial monster, it disappears, and two monsters appear, each with the health of 1.\n\nThen, Caracal can attack each of these new monsters once and win with a total of three attacks.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n1000000000000\n\nSample Output 3\n\n1099511627775", "sample_input": "2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02786", "source_text": "Score : 400 points\n\nProblem Statement\n\nCaracal is fighting with a monster.\n\nThe health of the monster is H.\n\nCaracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:\n\nIf the monster's health is 1, it drops to 0.\n\nIf the monster's health, X, is greater than 1, that monster disappears. Then, two new monsters appear, each with the health of \\lfloor X/2 \\rfloor.\n\n(\\lfloor r \\rfloor denotes the greatest integer not exceeding r.)\n\nCaracal wins when the healths of all existing monsters become 0 or below.\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH\n\nOutput\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n3\n\nWhen Caracal attacks the initial monster, it disappears, and two monsters appear, each with the health of 1.\n\nThen, Caracal can attack each of these new monsters once and win with a total of three attacks.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n1000000000000\n\nSample Output 3\n\n1099511627775", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 121, "cpu_time_ms": 6, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s292074699", "group_id": "codeNet:p02787", "input_text": "local mce, mma, mmi = math.ceil, math.max, math.min\nlocal h, n = io.read(\"*n\", \"*n\")\nlocal inf = 1000000007\nlocal z = {}\nfor i = 1, 10000 do\n z[i] = inf\nend\nfor i = 1, n do\n local a, b = io.read(\"*n\", \"*n\")\n z[a] = mmi(z[a], b)\nend\nlocal t = {}\nfor i = 1, h do\n t[i] = inf\nend\nfor a = 1, 10000 do\n local b = z[a]\n if b < inf then\n for src = h - 1, 1, -1 do\n local lim = mce((h - src) / a)\n for j = 1, lim do\n local dst = mmi(h, src + a * j)\n t[dst] = mmi(t[dst], t[src] + b * j)\n end\n end\n do -- src = 0\n local lim = mce(h / a)\n for j = 1, lim do\n local dst = mmi(h, a * j)\n t[dst] = mmi(t[dst], b * j)\n end\n end\n end\nend\nprint(t[h])\n", "language": "Lua", "metadata": {"date": 1580113205, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s292074699.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s292074699", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local mce, mma, mmi = math.ceil, math.max, math.min\nlocal h, n = io.read(\"*n\", \"*n\")\nlocal inf = 1000000007\nlocal z = {}\nfor i = 1, 10000 do\n z[i] = inf\nend\nfor i = 1, n do\n local a, b = io.read(\"*n\", \"*n\")\n z[a] = mmi(z[a], b)\nend\nlocal t = {}\nfor i = 1, h do\n t[i] = inf\nend\nfor a = 1, 10000 do\n local b = z[a]\n if b < inf then\n for src = h - 1, 1, -1 do\n local lim = mce((h - src) / a)\n for j = 1, lim do\n local dst = mmi(h, src + a * j)\n t[dst] = mmi(t[dst], t[src] + b * j)\n end\n end\n do -- src = 0\n local lim = mce(h / a)\n for j = 1, lim do\n local dst = mmi(h, a * j)\n t[dst] = mmi(t[dst], b * j)\n end\n end\n end\nend\nprint(t[h])\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nIbis is fighting with a monster.\n\nThe health of the monster is H.\n\nIbis can cast N kinds of spells. Casting the i-th spell decreases the monster's health by A_i, at the cost of B_i Magic Points.\n\nThe same spell can be cast multiple times. There is no way other than spells to decrease the monster's health.\n\nIbis wins when the health of the monster becomes 0 or below.\n\nFind the minimum total Magic Points that have to be consumed before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq N \\leq 10^3\n\n1 \\leq A_i \\leq 10^4\n\n1 \\leq B_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH N\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the minimum total Magic Points that have to be consumed before winning.\n\nSample Input 1\n\n9 3\n8 3\n4 2\n2 1\n\nSample Output 1\n\n4\n\nFirst, let us cast the first spell to decrease the monster's health by 8, at the cost of 3 Magic Points. The monster's health is now 1.\n\nThen, cast the third spell to decrease the monster's health by 2, at the cost of 1 Magic Point. The monster's health is now -1.\n\nIn this way, we can win at the total cost of 4 Magic Points.\n\nSample Input 2\n\n100 6\n1 1\n2 3\n3 9\n4 27\n5 81\n6 243\n\nSample Output 2\n\n100\n\nIt is optimal to cast the first spell 100 times.\n\nSample Input 3\n\n9999 10\n540 7550\n691 9680\n700 9790\n510 7150\n415 5818\n551 7712\n587 8227\n619 8671\n588 8228\n176 2461\n\nSample Output 3\n\n139815", "sample_input": "9 3\n8 3\n4 2\n2 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02787", "source_text": "Score : 500 points\n\nProblem Statement\n\nIbis is fighting with a monster.\n\nThe health of the monster is H.\n\nIbis can cast N kinds of spells. Casting the i-th spell decreases the monster's health by A_i, at the cost of B_i Magic Points.\n\nThe same spell can be cast multiple times. There is no way other than spells to decrease the monster's health.\n\nIbis wins when the health of the monster becomes 0 or below.\n\nFind the minimum total Magic Points that have to be consumed before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq N \\leq 10^3\n\n1 \\leq A_i \\leq 10^4\n\n1 \\leq B_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH N\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the minimum total Magic Points that have to be consumed before winning.\n\nSample Input 1\n\n9 3\n8 3\n4 2\n2 1\n\nSample Output 1\n\n4\n\nFirst, let us cast the first spell to decrease the monster's health by 8, at the cost of 3 Magic Points. The monster's health is now 1.\n\nThen, cast the third spell to decrease the monster's health by 2, at the cost of 1 Magic Point. The monster's health is now -1.\n\nIn this way, we can win at the total cost of 4 Magic Points.\n\nSample Input 2\n\n100 6\n1 1\n2 3\n3 9\n4 27\n5 81\n6 243\n\nSample Output 2\n\n100\n\nIt is optimal to cast the first spell 100 times.\n\nSample Input 3\n\n9999 10\n540 7550\n691 9680\n700 9790\n510 7150\n415 5818\n551 7712\n587 8227\n619 8671\n588 8228\n176 2461\n\nSample Output 3\n\n139815", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1652, "memory_kb": 640}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s137354080", "group_id": "codeNet:p02788", "input_text": "local function meld(a,b)\n if not a then\n return b\n elseif not b then\n return a\n elseif a[1]0)then\n\t\t\tif(S[i]==\"WA\")then\n\t\t\t\tt[p[i]]=t[p[i]]+1\n\t\t\telse\n\t\t\t\tt[p[i]]=-t[p[i]]\n\t\t\tend\n\t\tend\n\telse\n\t\tif(S[i]==\"WA\")then\n\t\t\tt[p[i]]=1\n\t\telse\n\t\t\tt[p[i]]=0\n\t\tend\n\tend\nend\nac,pn=0,0\nfor i=1,N do\n\tif(t[i])then\n\t\tif(t[i]<=0)then\n\t\t\tac=ac+1\n\t\t\tpn=pn-t[i]\n\t\tend\n\tend\nend\nprint(ac,pn)", "language": "Lua", "metadata": {"date": 1587683593, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s049430948.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s049430948", "user_id": "u726173718"}, "prompt_components": {"gold_output": "2 2\n", "input_to_evaluate": "local function read_a(n,m)m=m or 1 r={}for i=1,m do r[i]={}end for i=1,n do for j=1,m do r[j][i]=io.read\"*n\"end end return unpack(r)end\nN=io.read\"*n\"\nM=io.read\"*n\"\nio.read()\np,S={},{}\nfor i=1,M do\np[i],S[i]=io.read():match\"(%d+)%s+(%S+)\"\np[i]=tonumber(p[i])\nend\n\nt={}\nfor i=1,M do\n\tif(t[p[i]])then\n\t\tif(t[p[i]]>0)then\n\t\t\tif(S[i]==\"WA\")then\n\t\t\t\tt[p[i]]=t[p[i]]+1\n\t\t\telse\n\t\t\t\tt[p[i]]=-t[p[i]]\n\t\t\tend\n\t\tend\n\telse\n\t\tif(S[i]==\"WA\")then\n\t\t\tt[p[i]]=1\n\t\telse\n\t\t\tt[p[i]]=0\n\t\tend\n\tend\nend\nac,pn=0,0\nfor i=1,N do\n\tif(t[i])then\n\t\tif(t[i]<=0)then\n\t\t\tac=ac+1\n\t\t\tpn=pn-t[i]\n\t\tend\n\tend\nend\nprint(ac,pn)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 72, "memory_kb": 7192}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s154093058", "group_id": "codeNet:p02803", "input_text": "--https://www.lua.org/pil/11.4.html\nlocal List = {}\nfunction List.new ()\n return {first = 0, last = -1}\nend\n\nfunction List.pushleft (list, value)\n local first = list.first - 1\n list.first = first\n list[first] = value\nend\n\nfunction List.pushright (list, value)\n local last = list.last + 1\n list.last = last\n list[last] = value\nend\n\nfunction List.popleft (list)\n local first = list.first\n if first > list.last then return false end\n local value = list[first]\n list[first] = nil\n list.first = first + 1\n return value\nend\n\nfunction List.popright (list)\n local last = list.last\n if list.first > last then return false end\n local value = list[last]\n list[last] = nil\n list.last = last - 1\n return value\nend\n\n----------\n\nlocal h,w=io.read(\"*n\",\"*n\",\"*l\")\nlocal maze={}\nfor i=1,h do\n local s=io.read()\n maze[i]={}\n for j=1,w do\n maze[i][j]=s:sub(j,j)\n end\nend\n\nlocal dx={1,0,-1,0}\nlocal dy={0,1,0,-1}\n\nlocal function bfs(x,y)\n local dist={}\n for i=1,h do\n dist[i]={}\n for j=1,w do\n dist[i][j]=-1\n end\n end\n local que=List.new()\n \n local result=0\n List.pushright(que,{x,y})\n dist[x][y]=0\n while true do\n local q=List.popleft(que)\n if not q then\n break\n end\n x,y=q[1],q[2]\n result=math.max(result,dist[x][y])\n for i=1,4 do\n local nx,ny=x+dx[i],y+dy[i]\n local checker=(nx<1 or nx>h or ny<1 or ny>w)\n if not checker and maze[nx][ny]~=\"#\" and dist[nx][ny]==-1 then\n dist[nx][ny]=dist[x][y]+1\n List.pushright(que,{nx,ny})\n end\n end\n end\n\n return result\nend\n\nlocal result=0\nfor i=1,h do\n for j=1,w do\n if maze[i][j]~=\"#\" then\n result=math.max(result,bfs(i,j))\n end\n end\nend\nprint(result)", "language": "Lua", "metadata": {"date": 1592442576, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02803.html", "problem_id": "p02803", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02803/input.txt", "sample_output_relpath": "derived/input_output/data/p02803/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02803/Lua/s154093058.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s154093058", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "--https://www.lua.org/pil/11.4.html\nlocal List = {}\nfunction List.new ()\n return {first = 0, last = -1}\nend\n\nfunction List.pushleft (list, value)\n local first = list.first - 1\n list.first = first\n list[first] = value\nend\n\nfunction List.pushright (list, value)\n local last = list.last + 1\n list.last = last\n list[last] = value\nend\n\nfunction List.popleft (list)\n local first = list.first\n if first > list.last then return false end\n local value = list[first]\n list[first] = nil\n list.first = first + 1\n return value\nend\n\nfunction List.popright (list)\n local last = list.last\n if list.first > last then return false end\n local value = list[last]\n list[last] = nil\n list.last = last - 1\n return value\nend\n\n----------\n\nlocal h,w=io.read(\"*n\",\"*n\",\"*l\")\nlocal maze={}\nfor i=1,h do\n local s=io.read()\n maze[i]={}\n for j=1,w do\n maze[i][j]=s:sub(j,j)\n end\nend\n\nlocal dx={1,0,-1,0}\nlocal dy={0,1,0,-1}\n\nlocal function bfs(x,y)\n local dist={}\n for i=1,h do\n dist[i]={}\n for j=1,w do\n dist[i][j]=-1\n end\n end\n local que=List.new()\n \n local result=0\n List.pushright(que,{x,y})\n dist[x][y]=0\n while true do\n local q=List.popleft(que)\n if not q then\n break\n end\n x,y=q[1],q[2]\n result=math.max(result,dist[x][y])\n for i=1,4 do\n local nx,ny=x+dx[i],y+dy[i]\n local checker=(nx<1 or nx>h or ny<1 or ny>w)\n if not checker and maze[nx][ny]~=\"#\" and dist[nx][ny]==-1 then\n dist[nx][ny]=dist[x][y]+1\n List.pushright(que,{nx,ny})\n end\n end\n end\n\n return result\nend\n\nlocal result=0\nfor i=1,h do\n for j=1,w do\n if maze[i][j]~=\"#\" then\n result=math.max(result,bfs(i,j))\n end\n end\nend\nprint(result)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a maze, which is a grid of H \\times W squares with H horizontal rows and W vertical columns.\n\nThe square at the i-th row from the top and the j-th column is a \"wall\" square if S_{ij} is #, and a \"road\" square if S_{ij} is ..\n\nFrom a road square, you can move to a horizontally or vertically adjacent road square.\n\nYou cannot move out of the maze, move to a wall square, or move diagonally.\n\nTakahashi will choose a starting square and a goal square, which can be any road squares, and give the maze to Aoki.\n\nAoki will then travel from the starting square to the goal square, in the minimum number of moves required.\n\nIn this situation, find the maximum possible number of moves Aoki has to make.\n\nConstraints\n\n1 \\leq H,W \\leq 20\n\nS_{ij} is . or #.\n\nS contains at least two occurrences of ..\n\nAny road square can be reached from any road square in zero or more moves.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_{11}...S_{1W}\n:\nS_{H1}...S_{HW}\n\nOutput\n\nPrint the maximum possible number of moves Aoki has to make.\n\nSample Input 1\n\n3 3\n...\n...\n...\n\nSample Output 1\n\n4\n\nIf Takahashi chooses the top-left square as the starting square and the bottom-right square as the goal square, Aoki has to make four moves.\n\nSample Input 2\n\n3 5\n...#.\n.#.#.\n.#...\n\nSample Output 2\n\n10\n\nIf Takahashi chooses the bottom-left square as the starting square and the top-right square as the goal square, Aoki has to make ten moves.", "sample_input": "3 3\n...\n...\n...\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02803", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a maze, which is a grid of H \\times W squares with H horizontal rows and W vertical columns.\n\nThe square at the i-th row from the top and the j-th column is a \"wall\" square if S_{ij} is #, and a \"road\" square if S_{ij} is ..\n\nFrom a road square, you can move to a horizontally or vertically adjacent road square.\n\nYou cannot move out of the maze, move to a wall square, or move diagonally.\n\nTakahashi will choose a starting square and a goal square, which can be any road squares, and give the maze to Aoki.\n\nAoki will then travel from the starting square to the goal square, in the minimum number of moves required.\n\nIn this situation, find the maximum possible number of moves Aoki has to make.\n\nConstraints\n\n1 \\leq H,W \\leq 20\n\nS_{ij} is . or #.\n\nS contains at least two occurrences of ..\n\nAny road square can be reached from any road square in zero or more moves.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_{11}...S_{1W}\n:\nS_{H1}...S_{HW}\n\nOutput\n\nPrint the maximum possible number of moves Aoki has to make.\n\nSample Input 1\n\n3 3\n...\n...\n...\n\nSample Output 1\n\n4\n\nIf Takahashi chooses the top-left square as the starting square and the bottom-right square as the goal square, Aoki has to make four moves.\n\nSample Input 2\n\n3 5\n...#.\n.#.#.\n.#...\n\nSample Output 2\n\n10\n\nIf Takahashi chooses the bottom-left square as the starting square and the top-right square as the goal square, Aoki has to make ten moves.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1840, "cpu_time_ms": 129, "memory_kb": 1408}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s840618259", "group_id": "codeNet:p02803", "input_text": "--https://www.lua.org/pil/11.4.html\nlocal List = {}\nfunction List.new ()\n return {first = 0, last = -1}\nend\n\nfunction List.pushleft (list, value)\n local first = list.first - 1\n list.first = first\n list[first] = value\nend\n\nfunction List.pushright (list, value)\n local last = list.last + 1\n list.last = last\n list[last] = value\nend\n\nfunction List.popleft (list)\n local first = list.first\n if first > list.last then return false end\n local value = list[first]\n list[first] = nil\n list.first = first + 1\n return value\nend\n\nfunction List.popright (list)\n local last = list.last\n if list.first > last then return false end\n local value = list[last]\n list[last] = nil\n list.last = last - 1\n return value\nend\n\n----------\n\nlocal h,w=io.read(\"n\",\"n\",\"l\")\nlocal maze={}\nfor i=1,h do\n local s=io.read()\n maze[i]={}\n for j=1,w do\n maze[i][j]=s:sub(j,j)\n end\nend\n\nlocal dx={1,0,-1,0}\nlocal dy={0,1,0,-1}\n\nlocal function bfs(x,y)\n local dist={}\n for i=1,h do\n dist[i]={}\n for j=1,w do\n dist[i][j]=-1\n end\n end\n local que=List.new()\n \n local result=0\n List.pushright(que,{x,y})\n dist[x][y]=0\n while true do\n local q=List.popleft(que)\n if not q then\n break\n end\n x,y=q[1],q[2]\n result=math.max(result,dist[x][y])\n for i=1,4 do\n local nx,ny=x+dx[i],y+dy[i]\n local checker=(nx<1 or nx>h or ny<1 or ny>w)\n if not checker and maze[nx][ny]~=\"#\" and dist[nx][ny]==-1 then\n dist[nx][ny]=dist[x][y]+1\n List.pushright(que,{nx,ny})\n end\n end\n end\n\n return result\nend\n\nlocal result=0\nfor i=1,h do\n for j=1,w do\n if maze[i][j]~=\"#\" then\n result=math.max(result,bfs(i,j))\n end\n end\nend\nprint(result)", "language": "Lua", "metadata": {"date": 1592442460, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02803.html", "problem_id": "p02803", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02803/input.txt", "sample_output_relpath": "derived/input_output/data/p02803/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02803/Lua/s840618259.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s840618259", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "--https://www.lua.org/pil/11.4.html\nlocal List = {}\nfunction List.new ()\n return {first = 0, last = -1}\nend\n\nfunction List.pushleft (list, value)\n local first = list.first - 1\n list.first = first\n list[first] = value\nend\n\nfunction List.pushright (list, value)\n local last = list.last + 1\n list.last = last\n list[last] = value\nend\n\nfunction List.popleft (list)\n local first = list.first\n if first > list.last then return false end\n local value = list[first]\n list[first] = nil\n list.first = first + 1\n return value\nend\n\nfunction List.popright (list)\n local last = list.last\n if list.first > last then return false end\n local value = list[last]\n list[last] = nil\n list.last = last - 1\n return value\nend\n\n----------\n\nlocal h,w=io.read(\"n\",\"n\",\"l\")\nlocal maze={}\nfor i=1,h do\n local s=io.read()\n maze[i]={}\n for j=1,w do\n maze[i][j]=s:sub(j,j)\n end\nend\n\nlocal dx={1,0,-1,0}\nlocal dy={0,1,0,-1}\n\nlocal function bfs(x,y)\n local dist={}\n for i=1,h do\n dist[i]={}\n for j=1,w do\n dist[i][j]=-1\n end\n end\n local que=List.new()\n \n local result=0\n List.pushright(que,{x,y})\n dist[x][y]=0\n while true do\n local q=List.popleft(que)\n if not q then\n break\n end\n x,y=q[1],q[2]\n result=math.max(result,dist[x][y])\n for i=1,4 do\n local nx,ny=x+dx[i],y+dy[i]\n local checker=(nx<1 or nx>h or ny<1 or ny>w)\n if not checker and maze[nx][ny]~=\"#\" and dist[nx][ny]==-1 then\n dist[nx][ny]=dist[x][y]+1\n List.pushright(que,{nx,ny})\n end\n end\n end\n\n return result\nend\n\nlocal result=0\nfor i=1,h do\n for j=1,w do\n if maze[i][j]~=\"#\" then\n result=math.max(result,bfs(i,j))\n end\n end\nend\nprint(result)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a maze, which is a grid of H \\times W squares with H horizontal rows and W vertical columns.\n\nThe square at the i-th row from the top and the j-th column is a \"wall\" square if S_{ij} is #, and a \"road\" square if S_{ij} is ..\n\nFrom a road square, you can move to a horizontally or vertically adjacent road square.\n\nYou cannot move out of the maze, move to a wall square, or move diagonally.\n\nTakahashi will choose a starting square and a goal square, which can be any road squares, and give the maze to Aoki.\n\nAoki will then travel from the starting square to the goal square, in the minimum number of moves required.\n\nIn this situation, find the maximum possible number of moves Aoki has to make.\n\nConstraints\n\n1 \\leq H,W \\leq 20\n\nS_{ij} is . or #.\n\nS contains at least two occurrences of ..\n\nAny road square can be reached from any road square in zero or more moves.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_{11}...S_{1W}\n:\nS_{H1}...S_{HW}\n\nOutput\n\nPrint the maximum possible number of moves Aoki has to make.\n\nSample Input 1\n\n3 3\n...\n...\n...\n\nSample Output 1\n\n4\n\nIf Takahashi chooses the top-left square as the starting square and the bottom-right square as the goal square, Aoki has to make four moves.\n\nSample Input 2\n\n3 5\n...#.\n.#.#.\n.#...\n\nSample Output 2\n\n10\n\nIf Takahashi chooses the bottom-left square as the starting square and the top-right square as the goal square, Aoki has to make ten moves.", "sample_input": "3 3\n...\n...\n...\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02803", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a maze, which is a grid of H \\times W squares with H horizontal rows and W vertical columns.\n\nThe square at the i-th row from the top and the j-th column is a \"wall\" square if S_{ij} is #, and a \"road\" square if S_{ij} is ..\n\nFrom a road square, you can move to a horizontally or vertically adjacent road square.\n\nYou cannot move out of the maze, move to a wall square, or move diagonally.\n\nTakahashi will choose a starting square and a goal square, which can be any road squares, and give the maze to Aoki.\n\nAoki will then travel from the starting square to the goal square, in the minimum number of moves required.\n\nIn this situation, find the maximum possible number of moves Aoki has to make.\n\nConstraints\n\n1 \\leq H,W \\leq 20\n\nS_{ij} is . or #.\n\nS contains at least two occurrences of ..\n\nAny road square can be reached from any road square in zero or more moves.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_{11}...S_{1W}\n:\nS_{H1}...S_{HW}\n\nOutput\n\nPrint the maximum possible number of moves Aoki has to make.\n\nSample Input 1\n\n3 3\n...\n...\n...\n\nSample Output 1\n\n4\n\nIf Takahashi chooses the top-left square as the starting square and the bottom-right square as the goal square, Aoki has to make four moves.\n\nSample Input 2\n\n3 5\n...#.\n.#.#.\n.#...\n\nSample Output 2\n\n10\n\nIf Takahashi chooses the bottom-left square as the starting square and the top-right square as the goal square, Aoki has to make ten moves.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1837, "cpu_time_ms": 328, "memory_kb": 1136}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s371705874", "group_id": "codeNet:p02803", "input_text": "local mma = math.max\nlocal h, w = io.read(\"*n\", \"*n\", \"*l\")\nlocal map = {}\nfor i = 1, h do\n local s = io.read()\n for j = 1, w do\n map[(i - 1) * w + j] = s:sub(j, j) == \".\"\n end\nend\n\n\nlocal function getlength(start_idx, dst_idx)\n local taskstate = {}\n for i = 1, h * w do taskstate[i] = false end\n local tasks = {}\n local tasknum = 0\n local done = 0\n\n local len = {}\n local inf = -1\n for i = 1, h * w do len[i] = inf end\n len[start_idx] = 0\n\n local function addtask(idx)\n if not taskstate[idx] then\n taskstate[idx] = true\n tasknum = tasknum + 1\n tasks[tasknum] = idx\n end\n end\n addtask(start_idx)\n\n local function walk(src, dst)\n if map[dst] then\n if len[dst] == inf or len[src] + 1 < len[dst] then\n len[dst] = len[src] + 1\n addtask(dst)\n end\n end\n end\n\n while done < tasknum do\n done = done + 1\n local idx = tasks[done]\n taskstate[idx] = false\n local tmp = {}\n\n if w < idx then walk(idx, idx - w) end\n if idx <= (h - 1) * w then walk(idx, idx + w) end\n if 1 < w then\n if idx % w ~= 0 then walk(idx, idx + 1) end\n if idx % w ~= 1 then walk(idx, idx - 1) end\n end\n end\n local ret = 0\n for i = 1, h * w do\n if 0 < len[i] then\n ret = mma(ret, len[i])\n end\n end\n return ret\nend\nlocal totret = 0\nfor i = 1, h * w do\n if map[i] then\n totret = mma(totret, getlength(i))\n end\nend\nprint(totret)\n", "language": "Lua", "metadata": {"date": 1578882312, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02803.html", "problem_id": "p02803", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02803/input.txt", "sample_output_relpath": "derived/input_output/data/p02803/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02803/Lua/s371705874.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s371705874", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local mma = math.max\nlocal h, w = io.read(\"*n\", \"*n\", \"*l\")\nlocal map = {}\nfor i = 1, h do\n local s = io.read()\n for j = 1, w do\n map[(i - 1) * w + j] = s:sub(j, j) == \".\"\n end\nend\n\n\nlocal function getlength(start_idx, dst_idx)\n local taskstate = {}\n for i = 1, h * w do taskstate[i] = false end\n local tasks = {}\n local tasknum = 0\n local done = 0\n\n local len = {}\n local inf = -1\n for i = 1, h * w do len[i] = inf end\n len[start_idx] = 0\n\n local function addtask(idx)\n if not taskstate[idx] then\n taskstate[idx] = true\n tasknum = tasknum + 1\n tasks[tasknum] = idx\n end\n end\n addtask(start_idx)\n\n local function walk(src, dst)\n if map[dst] then\n if len[dst] == inf or len[src] + 1 < len[dst] then\n len[dst] = len[src] + 1\n addtask(dst)\n end\n end\n end\n\n while done < tasknum do\n done = done + 1\n local idx = tasks[done]\n taskstate[idx] = false\n local tmp = {}\n\n if w < idx then walk(idx, idx - w) end\n if idx <= (h - 1) * w then walk(idx, idx + w) end\n if 1 < w then\n if idx % w ~= 0 then walk(idx, idx + 1) end\n if idx % w ~= 1 then walk(idx, idx - 1) end\n end\n end\n local ret = 0\n for i = 1, h * w do\n if 0 < len[i] then\n ret = mma(ret, len[i])\n end\n end\n return ret\nend\nlocal totret = 0\nfor i = 1, h * w do\n if map[i] then\n totret = mma(totret, getlength(i))\n end\nend\nprint(totret)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a maze, which is a grid of H \\times W squares with H horizontal rows and W vertical columns.\n\nThe square at the i-th row from the top and the j-th column is a \"wall\" square if S_{ij} is #, and a \"road\" square if S_{ij} is ..\n\nFrom a road square, you can move to a horizontally or vertically adjacent road square.\n\nYou cannot move out of the maze, move to a wall square, or move diagonally.\n\nTakahashi will choose a starting square and a goal square, which can be any road squares, and give the maze to Aoki.\n\nAoki will then travel from the starting square to the goal square, in the minimum number of moves required.\n\nIn this situation, find the maximum possible number of moves Aoki has to make.\n\nConstraints\n\n1 \\leq H,W \\leq 20\n\nS_{ij} is . or #.\n\nS contains at least two occurrences of ..\n\nAny road square can be reached from any road square in zero or more moves.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_{11}...S_{1W}\n:\nS_{H1}...S_{HW}\n\nOutput\n\nPrint the maximum possible number of moves Aoki has to make.\n\nSample Input 1\n\n3 3\n...\n...\n...\n\nSample Output 1\n\n4\n\nIf Takahashi chooses the top-left square as the starting square and the bottom-right square as the goal square, Aoki has to make four moves.\n\nSample Input 2\n\n3 5\n...#.\n.#.#.\n.#...\n\nSample Output 2\n\n10\n\nIf Takahashi chooses the bottom-left square as the starting square and the top-right square as the goal square, Aoki has to make ten moves.", "sample_input": "3 3\n...\n...\n...\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02803", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a maze, which is a grid of H \\times W squares with H horizontal rows and W vertical columns.\n\nThe square at the i-th row from the top and the j-th column is a \"wall\" square if S_{ij} is #, and a \"road\" square if S_{ij} is ..\n\nFrom a road square, you can move to a horizontally or vertically adjacent road square.\n\nYou cannot move out of the maze, move to a wall square, or move diagonally.\n\nTakahashi will choose a starting square and a goal square, which can be any road squares, and give the maze to Aoki.\n\nAoki will then travel from the starting square to the goal square, in the minimum number of moves required.\n\nIn this situation, find the maximum possible number of moves Aoki has to make.\n\nConstraints\n\n1 \\leq H,W \\leq 20\n\nS_{ij} is . or #.\n\nS contains at least two occurrences of ..\n\nAny road square can be reached from any road square in zero or more moves.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_{11}...S_{1W}\n:\nS_{H1}...S_{HW}\n\nOutput\n\nPrint the maximum possible number of moves Aoki has to make.\n\nSample Input 1\n\n3 3\n...\n...\n...\n\nSample Output 1\n\n4\n\nIf Takahashi chooses the top-left square as the starting square and the bottom-right square as the goal square, Aoki has to make four moves.\n\nSample Input 2\n\n3 5\n...#.\n.#.#.\n.#...\n\nSample Output 2\n\n10\n\nIf Takahashi chooses the bottom-left square as the starting square and the top-right square as the goal square, Aoki has to make ten moves.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1412, "cpu_time_ms": 16, "memory_kb": 768}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s696763335", "group_id": "codeNet:p02807", "input_text": "local mod = 1000000007\nlocal mfl = math.floor\nlocal function bmul(x, y)\n local x0, y0 = x % 31623, y % 31623\n local x1, y1 = mfl(x / 31623), mfl(y / 31623)\n return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod\nend\n\nlocal function badd(x, y)\n return (x + y) % mod\nend\n\nlocal function bsub(x, y)\n return x < y and x - y + mod or x - y\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\n\nlocal n = io.read(\"*n\")\nlocal t = {io.read(\"*n\")}\nfor i = 2, n do\n t[i] = io.read(\"*n\")\nend\n\nlocal curlen = 0\nlocal ret = 0\ndo\n curlen = t[n - 1] - t[1]\n ret = badd(ret, bmul(curlen, modinv(2)))\nend\nfor i_range = 2, n - 1 do\n curlen = curlen + t[n] - t[i_range] - (t[n] - t[n - i_range])\n local a = bmul(i_range, i_range + 1) % mod\n ret = badd(ret, bmul(curlen, modinv(a)))\nend\nfor i_range = 1, n - 1 do\n ret = badd(ret, bmul(modinv(i_range), t[n] - t[n - i_range]))\nend\nfor i = 2, n - 1 do\n ret = bmul(ret, i)\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1578794362, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02807.html", "problem_id": "p02807", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02807/input.txt", "sample_output_relpath": "derived/input_output/data/p02807/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02807/Lua/s696763335.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s696763335", "user_id": "u120582723"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local mod = 1000000007\nlocal mfl = math.floor\nlocal function bmul(x, y)\n local x0, y0 = x % 31623, y % 31623\n local x1, y1 = mfl(x / 31623), mfl(y / 31623)\n return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod\nend\n\nlocal function badd(x, y)\n return (x + y) % mod\nend\n\nlocal function bsub(x, y)\n return x < y and x - y + mod or x - y\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\n\nlocal n = io.read(\"*n\")\nlocal t = {io.read(\"*n\")}\nfor i = 2, n do\n t[i] = io.read(\"*n\")\nend\n\nlocal curlen = 0\nlocal ret = 0\ndo\n curlen = t[n - 1] - t[1]\n ret = badd(ret, bmul(curlen, modinv(2)))\nend\nfor i_range = 2, n - 1 do\n curlen = curlen + t[n] - t[i_range] - (t[n] - t[n - i_range])\n local a = bmul(i_range, i_range + 1) % mod\n ret = badd(ret, bmul(curlen, modinv(a)))\nend\nfor i_range = 1, n - 1 do\n ret = badd(ret, bmul(modinv(i_range), t[n] - t[n - i_range]))\nend\nfor i = 2, n - 1 do\n ret = bmul(ret, i)\nend\nprint(ret)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere are N slimes standing on a number line.\nThe i-th slime from the left is at position x_i.\n\nIt is guaruanteed that 1 \\leq x_1 < x_2 < \\ldots < x_N \\leq 10^{9}.\n\nNiwango will perform N-1 operations. The i-th operation consists of the following procedures:\n\nChoose an integer k between 1 and N-i (inclusive) with equal probability.\n\nMove the k-th slime from the left, to the position of the neighboring slime to the right.\n\nFuse the two slimes at the same position into one slime.\n\nFind the total distance traveled by the slimes multiplied by (N-1)! (we can show that this value is an integer), modulo (10^{9}+7). If a slime is born by a fuse and that slime moves, we count it as just one slime.\n\nConstraints\n\n2 \\leq N \\leq 10^{5}\n\n1 \\leq x_1 < x_2 < \\ldots < x_N \\leq 10^{9}\n\nx_i is an integer.\n\nSubtasks\n\n400 points will be awarded for passing the test cases satisfying N \\leq 2000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 x_2 \\ldots x_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n5\n\nWith probability \\frac{1}{2}, the leftmost slime is chosen in the first operation, in which case the total distance traveled is 2.\n\nWith probability \\frac{1}{2}, the middle slime is chosen in the first operation, in which case the total distance traveled is 3.\n\nThe answer is the expected total distance traveled, 2.5, multiplied by 2!, which is 5.\n\nSample Input 2\n\n12\n161735902 211047202 430302156 450968417 628894325 707723857 731963982 822804784 880895728 923078537 971407775 982631932\n\nSample Output 2\n\n750927044\n\nFind the expected value multiplied by (N-1)!, modulo (10^9+7).", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02807", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere are N slimes standing on a number line.\nThe i-th slime from the left is at position x_i.\n\nIt is guaruanteed that 1 \\leq x_1 < x_2 < \\ldots < x_N \\leq 10^{9}.\n\nNiwango will perform N-1 operations. The i-th operation consists of the following procedures:\n\nChoose an integer k between 1 and N-i (inclusive) with equal probability.\n\nMove the k-th slime from the left, to the position of the neighboring slime to the right.\n\nFuse the two slimes at the same position into one slime.\n\nFind the total distance traveled by the slimes multiplied by (N-1)! (we can show that this value is an integer), modulo (10^{9}+7). If a slime is born by a fuse and that slime moves, we count it as just one slime.\n\nConstraints\n\n2 \\leq N \\leq 10^{5}\n\n1 \\leq x_1 < x_2 < \\ldots < x_N \\leq 10^{9}\n\nx_i is an integer.\n\nSubtasks\n\n400 points will be awarded for passing the test cases satisfying N \\leq 2000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 x_2 \\ldots x_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n5\n\nWith probability \\frac{1}{2}, the leftmost slime is chosen in the first operation, in which case the total distance traveled is 2.\n\nWith probability \\frac{1}{2}, the middle slime is chosen in the first operation, in which case the total distance traveled is 3.\n\nThe answer is the expected total distance traveled, 2.5, multiplied by 2!, which is 5.\n\nSample Input 2\n\n12\n161735902 211047202 430302156 450968417 628894325 707723857 731963982 822804784 880895728 923078537 971407775 982631932\n\nSample Output 2\n\n750927044\n\nFind the expected value multiplied by (N-1)!, modulo (10^9+7).", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1176, "cpu_time_ms": 214, "memory_kb": 1280}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s209796413", "group_id": "codeNet:p02807", "input_text": "local mod = 1000000007\nlocal mfl = math.floor\nlocal function bmul(x, y)\n local x0, y0 = x % 31623, y % 31623\n local x1, y1 = mfl(x / 31623), mfl(y / 31623)\n return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod\nend\n\nlocal function badd(x, y)\n return (x + y) % mod\nend\n\nlocal function bsub(x, y)\n return x < y and x - y + mod or x - y\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\n\nlocal n = io.read(\"*n\")\nlocal t = {io.read(\"*n\")}\nfor i = 2, n do\n t[i] = io.read(\"*n\")\nend\n\nlocal curlen = 0\nlocal ret = 0\ndo\n curlen = t[n - 1] - t[1]\n ret = badd(ret, bmul(curlen, modinv(2)))\nend\nfor i_range = 2, n - 1 do\n curlen = curlen + t[n] - t[i_range] - (t[n] - t[n - i_range])\n local a = (i_range * (i_range + 1)) % mod\n ret = badd(ret, bmul(curlen, modinv(a)))\nend\nfor i_range = 1, n - 1 do\n ret = badd(ret, bmul(modinv(i_range), t[n] - t[n - i_range]))\nend\nfor i = 2, n - 1 do\n ret = bmul(ret, i)\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1578793937, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02807.html", "problem_id": "p02807", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02807/input.txt", "sample_output_relpath": "derived/input_output/data/p02807/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02807/Lua/s209796413.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s209796413", "user_id": "u120582723"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local mod = 1000000007\nlocal mfl = math.floor\nlocal function bmul(x, y)\n local x0, y0 = x % 31623, y % 31623\n local x1, y1 = mfl(x / 31623), mfl(y / 31623)\n return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod\nend\n\nlocal function badd(x, y)\n return (x + y) % mod\nend\n\nlocal function bsub(x, y)\n return x < y and x - y + mod or x - y\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\n\nlocal n = io.read(\"*n\")\nlocal t = {io.read(\"*n\")}\nfor i = 2, n do\n t[i] = io.read(\"*n\")\nend\n\nlocal curlen = 0\nlocal ret = 0\ndo\n curlen = t[n - 1] - t[1]\n ret = badd(ret, bmul(curlen, modinv(2)))\nend\nfor i_range = 2, n - 1 do\n curlen = curlen + t[n] - t[i_range] - (t[n] - t[n - i_range])\n local a = (i_range * (i_range + 1)) % mod\n ret = badd(ret, bmul(curlen, modinv(a)))\nend\nfor i_range = 1, n - 1 do\n ret = badd(ret, bmul(modinv(i_range), t[n] - t[n - i_range]))\nend\nfor i = 2, n - 1 do\n ret = bmul(ret, i)\nend\nprint(ret)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere are N slimes standing on a number line.\nThe i-th slime from the left is at position x_i.\n\nIt is guaruanteed that 1 \\leq x_1 < x_2 < \\ldots < x_N \\leq 10^{9}.\n\nNiwango will perform N-1 operations. The i-th operation consists of the following procedures:\n\nChoose an integer k between 1 and N-i (inclusive) with equal probability.\n\nMove the k-th slime from the left, to the position of the neighboring slime to the right.\n\nFuse the two slimes at the same position into one slime.\n\nFind the total distance traveled by the slimes multiplied by (N-1)! (we can show that this value is an integer), modulo (10^{9}+7). If a slime is born by a fuse and that slime moves, we count it as just one slime.\n\nConstraints\n\n2 \\leq N \\leq 10^{5}\n\n1 \\leq x_1 < x_2 < \\ldots < x_N \\leq 10^{9}\n\nx_i is an integer.\n\nSubtasks\n\n400 points will be awarded for passing the test cases satisfying N \\leq 2000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 x_2 \\ldots x_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n5\n\nWith probability \\frac{1}{2}, the leftmost slime is chosen in the first operation, in which case the total distance traveled is 2.\n\nWith probability \\frac{1}{2}, the middle slime is chosen in the first operation, in which case the total distance traveled is 3.\n\nThe answer is the expected total distance traveled, 2.5, multiplied by 2!, which is 5.\n\nSample Input 2\n\n12\n161735902 211047202 430302156 450968417 628894325 707723857 731963982 822804784 880895728 923078537 971407775 982631932\n\nSample Output 2\n\n750927044\n\nFind the expected value multiplied by (N-1)!, modulo (10^9+7).", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02807", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere are N slimes standing on a number line.\nThe i-th slime from the left is at position x_i.\n\nIt is guaruanteed that 1 \\leq x_1 < x_2 < \\ldots < x_N \\leq 10^{9}.\n\nNiwango will perform N-1 operations. The i-th operation consists of the following procedures:\n\nChoose an integer k between 1 and N-i (inclusive) with equal probability.\n\nMove the k-th slime from the left, to the position of the neighboring slime to the right.\n\nFuse the two slimes at the same position into one slime.\n\nFind the total distance traveled by the slimes multiplied by (N-1)! (we can show that this value is an integer), modulo (10^{9}+7). If a slime is born by a fuse and that slime moves, we count it as just one slime.\n\nConstraints\n\n2 \\leq N \\leq 10^{5}\n\n1 \\leq x_1 < x_2 < \\ldots < x_N \\leq 10^{9}\n\nx_i is an integer.\n\nSubtasks\n\n400 points will be awarded for passing the test cases satisfying N \\leq 2000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 x_2 \\ldots x_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n5\n\nWith probability \\frac{1}{2}, the leftmost slime is chosen in the first operation, in which case the total distance traveled is 2.\n\nWith probability \\frac{1}{2}, the middle slime is chosen in the first operation, in which case the total distance traveled is 3.\n\nThe answer is the expected total distance traveled, 2.5, multiplied by 2!, which is 5.\n\nSample Input 2\n\n12\n161735902 211047202 430302156 450968417 628894325 707723857 731963982 822804784 880895728 923078537 971407775 982631932\n\nSample Output 2\n\n750927044\n\nFind the expected value multiplied by (N-1)!, modulo (10^9+7).", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1175, "cpu_time_ms": 216, "memory_kb": 1280}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s647148305", "group_id": "codeNet:p02811", "input_text": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\n----\nlocal K, X = read.nn()\nprint(500 * K >= X and \"Yes\" or \"No\")", "language": "Lua", "metadata": {"date": 1578711620, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "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/Lua/s647148305.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s647148305", "user_id": "u162773977"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\n----\nlocal K, X = read.nn()\nprint(500 * K >= X and \"Yes\" or \"No\")", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 11, "memory_kb": 636}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s796070534", "group_id": "codeNet:p02812", "input_text": "N=io.read\"*n\"\nio.read()\nS=io.read()\ns=0\nfor _ in S:gmatch(\"(ABC)\")do s=s+1 end\nprint(s)", "language": "Lua", "metadata": {"date": 1587684358, "filename_ext": "lua", "original_language": "LuaJIT (2.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/Lua/s796070534.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s796070534", "user_id": "u726173718"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "N=io.read\"*n\"\nio.read()\nS=io.read()\ns=0\nfor _ in S:gmatch(\"(ABC)\")do s=s+1 end\nprint(s)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 87, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s691117279", "group_id": "codeNet:p02813", "input_text": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\n----\n-- https://www.youtube.com/watch?v=nYFd7VHKyWQ\n-- https://github.com/mission-peace/interview/blob/master/python/recursion/stringpermutation.py\n\n-- For simplicity, this algorithm does not allow duplicate elements.\n\nlocal function permute(seq)\n local inuse = {}\n local result = {}\n local function rec(level)\n if level > #seq then\n --print(table.concat(result, \"\"))\n coroutine.yield(result)\n return\n end\n for i=1,#seq do\n if not inuse[i] then\n result[level] = seq[i]\n inuse[i] = true\n rec(level + 1)\n inuse[i] = false\n end\n end\n end\n local function start()\n rec(1)\n end\n return coroutine.wrap(start)\nend\n----\n-----\nlocal N = read.n()\nlocal A = {}\nfor i=1,N do\n A[i] = i\nend\nlocal function test()\n for k in permute(A) do\n print(table.concat(k,\"\"))\n end\nend\n--test()\nlocal P, Q = {}, {}\nfor i=1,N do\n P[i] = read.n()\nend\nfor i=1,N do\n Q[i] = read.n()\nend\n\nlocal function sameseq(a, b)\n return table.concat(a, \" \") == table.concat(b, \" \")\nend\n\nlocal a, b\nlocal i = 1\nfor k in permute(A) do\n if sameseq(k, P) then\n a = i\n end\n if sameseq(k, Q) then\n b = i\n end\n i = i + 1\nend\nprint(math.abs(a-b))", "language": "Lua", "metadata": {"date": 1578711611, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "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/Lua/s691117279.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s691117279", "user_id": "u162773977"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\n----\n-- https://www.youtube.com/watch?v=nYFd7VHKyWQ\n-- https://github.com/mission-peace/interview/blob/master/python/recursion/stringpermutation.py\n\n-- For simplicity, this algorithm does not allow duplicate elements.\n\nlocal function permute(seq)\n local inuse = {}\n local result = {}\n local function rec(level)\n if level > #seq then\n --print(table.concat(result, \"\"))\n coroutine.yield(result)\n return\n end\n for i=1,#seq do\n if not inuse[i] then\n result[level] = seq[i]\n inuse[i] = true\n rec(level + 1)\n inuse[i] = false\n end\n end\n end\n local function start()\n rec(1)\n end\n return coroutine.wrap(start)\nend\n----\n-----\nlocal N = read.n()\nlocal A = {}\nfor i=1,N do\n A[i] = i\nend\nlocal function test()\n for k in permute(A) do\n print(table.concat(k,\"\"))\n end\nend\n--test()\nlocal P, Q = {}, {}\nfor i=1,N do\n P[i] = read.n()\nend\nfor i=1,N do\n Q[i] = read.n()\nend\n\nlocal function sameseq(a, b)\n return table.concat(a, \" \") == table.concat(b, \" \")\nend\n\nlocal a, b\nlocal i = 1\nfor k in permute(A) do\n if sameseq(k, P) then\n a = i\n end\n if sameseq(k, Q) then\n b = i\n end\n i = i + 1\nend\nprint(math.abs(a-b))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1865, "cpu_time_ms": 295, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s364260781", "group_id": "codeNet:p02816", "input_text": "local mmi, mma = math.min, math.max\nlocal mfl = math.floor\nlocal xor = bit.bxor\n-- local function xor(x, y) return x end\n\nlocal n = io.read(\"*n\")\nlocal ar, br = {}, {}\nfor i = 1, n do\n ar[i] = io.read(\"*n\")\nend\nfor i = 1, n do\n br[i] = io.read(\"*n\")\nend\nlocal as, bs = {}, {}\nfor i = 1, n - 1 do\n as[i], bs[i] = xor(ar[i], ar[i + 1]), xor(br[i], br[i + 1])\nend\nas[n], bs[n] = xor(ar[n], ar[1]), xor(br[n], br[1])\nlocal idx = {}\nlocal v = {}\nfor i = 1, n do\n idx[i] = i\n v[i] = as[i]\nend\n-- stage 1\ntable.sort(idx, function(a, b) return v[a] < v[b] end)\ndo\n local cur = 1\n local v_nxt = {}\n for i = 1, n do v_nxt[i] = 0 end\n v_nxt[idx[1]] = 1\n for i = 2, n do\n if v[idx[i]] ~= v[idx[i - 1]] then\n cur = cur + 1\n end\n v_nxt[idx[i]] = cur\n end\n for i = 1, n do v[i] = v_nxt[i] end\nend\nlocal step = 1\nlocal vd = {}\nwhile step < n do\n local stepdst = {}\n for i = 1, n do\n local dst = i + step\n if n < dst then dst = dst - n end\n stepdst[i] = dst\n end\n local left, major = 1, v[idx[1]]\n local minor_min = v[stepdst[idx[1]]]\n local minor_max = minor_min\n local cur = 0\n for i = 1, n do\n local minor = v[stepdst[idx[i]]]\n minor_min, minor_max = mmi(minor_min, minor), mma(minor_max, minor)\n local isend = i == n or major ~= v[idx[i + 1]]\n if isend then\n local right = i\n if minor_min ~= minor_max then\n local t = {}\n for j = left, right do\n t[j - left + 1] = idx[j]\n end\n -- R-L=A, Max-Min=B: O(A+B) or O(AlogA)\n if minor_max - minor_min < 100000 then\n local box = {}\n for b = 1, minor_max - minor_min + 1 do box[b] = {} end\n for ti = 1, right - left + 1 do\n local tminor = v[stepdst[t[ti]]]\n table.insert(box[tminor - minor_min + 1], t[ti])\n end\n local tcur = 1\n for b = 1, minor_max - minor_min + 1 do\n for bb = 1, #box[b] do\n t[tcur] = box[b][bb]\n tcur = tcur + 1\n end\n end\n else\n table.sort(t, function(x, y) return v[stepdst[x]] < v[stepdst[y]] end)\n end\n local v_prv = 0\n for j = left, right do\n idx[j] = t[j - left + 1]\n local v_nxt = v[stepdst[idx[j]]]\n if j == left or v_nxt ~= v_prv then\n cur = cur + 1\n end\n vd[idx[j]] = cur\n v_prv = v_nxt\n end\n else\n cur = cur + 1\n for j = left, right do\n vd[idx[j]] = cur\n end\n end\n if i < n then\n left, major = i + 1, v[idx[i + 1]]\n minor_min = v[stepdst[idx[i + 1]]]\n minor_max = minor_min\n end\n else\n -- local minor = v[stepdst[idx[i]]]\n -- minor_min, minor_max = mmi(minor_min, minor), mma(minor_max, minor)\n end\n end\n for i = 1, n do v[i] = vd[i] end\n step = step * 2\nend\n\nlocal function comp_l(offset)\n for i = 1, n do\n local ai = offset - 1 + i\n if n < ai then ai = ai - n end\n if as[ai] < bs[i] then return true\n elseif bs[i] < as[ai] then return false\n end\n end\n return false\nend\n\nlocal function comp_u(offset)\n for i = 1, n do\n local ai = offset - 1 + i\n if n < ai then ai = ai - n end\n if bs[i] < as[ai] then return true\n elseif as[ai] < bs[i] then return false\n end\n end\n return false\nend\n\nlocal function lower_bound(ary)\n local num = #ary\n if num == 0 then return 1 end\n if not comp_l(ary[1]) then return 1 end\n if comp_l(ary[num]) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if comp_l(ary[mid]) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal function upper_bound(ary)\n local num = #ary\n if num == 0 then return 1 end\n if comp_u(ary[1]) then return 1 end\n if not comp_u(ary[num]) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if not comp_u(ary[mid]) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\nlocal lb = lower_bound(idx)\nlocal ub = upper_bound(idx)\nlocal t = {}\nfor i = lb, ub - 1 do\n table.insert(t, idx[i])\nend\ntable.sort(t)\nfor i = 1, #t do\n local k = t[i] - 1\n local v = xor(ar[t[i]], br[1])\n print(k .. \" \" .. v)\nend\n-- print(os.clock())\n", "language": "Lua", "metadata": {"date": 1580915194, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02816.html", "problem_id": "p02816", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02816/input.txt", "sample_output_relpath": "derived/input_output/data/p02816/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02816/Lua/s364260781.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s364260781", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1 3\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal mfl = math.floor\nlocal xor = bit.bxor\n-- local function xor(x, y) return x end\n\nlocal n = io.read(\"*n\")\nlocal ar, br = {}, {}\nfor i = 1, n do\n ar[i] = io.read(\"*n\")\nend\nfor i = 1, n do\n br[i] = io.read(\"*n\")\nend\nlocal as, bs = {}, {}\nfor i = 1, n - 1 do\n as[i], bs[i] = xor(ar[i], ar[i + 1]), xor(br[i], br[i + 1])\nend\nas[n], bs[n] = xor(ar[n], ar[1]), xor(br[n], br[1])\nlocal idx = {}\nlocal v = {}\nfor i = 1, n do\n idx[i] = i\n v[i] = as[i]\nend\n-- stage 1\ntable.sort(idx, function(a, b) return v[a] < v[b] end)\ndo\n local cur = 1\n local v_nxt = {}\n for i = 1, n do v_nxt[i] = 0 end\n v_nxt[idx[1]] = 1\n for i = 2, n do\n if v[idx[i]] ~= v[idx[i - 1]] then\n cur = cur + 1\n end\n v_nxt[idx[i]] = cur\n end\n for i = 1, n do v[i] = v_nxt[i] end\nend\nlocal step = 1\nlocal vd = {}\nwhile step < n do\n local stepdst = {}\n for i = 1, n do\n local dst = i + step\n if n < dst then dst = dst - n end\n stepdst[i] = dst\n end\n local left, major = 1, v[idx[1]]\n local minor_min = v[stepdst[idx[1]]]\n local minor_max = minor_min\n local cur = 0\n for i = 1, n do\n local minor = v[stepdst[idx[i]]]\n minor_min, minor_max = mmi(minor_min, minor), mma(minor_max, minor)\n local isend = i == n or major ~= v[idx[i + 1]]\n if isend then\n local right = i\n if minor_min ~= minor_max then\n local t = {}\n for j = left, right do\n t[j - left + 1] = idx[j]\n end\n -- R-L=A, Max-Min=B: O(A+B) or O(AlogA)\n if minor_max - minor_min < 100000 then\n local box = {}\n for b = 1, minor_max - minor_min + 1 do box[b] = {} end\n for ti = 1, right - left + 1 do\n local tminor = v[stepdst[t[ti]]]\n table.insert(box[tminor - minor_min + 1], t[ti])\n end\n local tcur = 1\n for b = 1, minor_max - minor_min + 1 do\n for bb = 1, #box[b] do\n t[tcur] = box[b][bb]\n tcur = tcur + 1\n end\n end\n else\n table.sort(t, function(x, y) return v[stepdst[x]] < v[stepdst[y]] end)\n end\n local v_prv = 0\n for j = left, right do\n idx[j] = t[j - left + 1]\n local v_nxt = v[stepdst[idx[j]]]\n if j == left or v_nxt ~= v_prv then\n cur = cur + 1\n end\n vd[idx[j]] = cur\n v_prv = v_nxt\n end\n else\n cur = cur + 1\n for j = left, right do\n vd[idx[j]] = cur\n end\n end\n if i < n then\n left, major = i + 1, v[idx[i + 1]]\n minor_min = v[stepdst[idx[i + 1]]]\n minor_max = minor_min\n end\n else\n -- local minor = v[stepdst[idx[i]]]\n -- minor_min, minor_max = mmi(minor_min, minor), mma(minor_max, minor)\n end\n end\n for i = 1, n do v[i] = vd[i] end\n step = step * 2\nend\n\nlocal function comp_l(offset)\n for i = 1, n do\n local ai = offset - 1 + i\n if n < ai then ai = ai - n end\n if as[ai] < bs[i] then return true\n elseif bs[i] < as[ai] then return false\n end\n end\n return false\nend\n\nlocal function comp_u(offset)\n for i = 1, n do\n local ai = offset - 1 + i\n if n < ai then ai = ai - n end\n if bs[i] < as[ai] then return true\n elseif as[ai] < bs[i] then return false\n end\n end\n return false\nend\n\nlocal function lower_bound(ary)\n local num = #ary\n if num == 0 then return 1 end\n if not comp_l(ary[1]) then return 1 end\n if comp_l(ary[num]) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if comp_l(ary[mid]) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal function upper_bound(ary)\n local num = #ary\n if num == 0 then return 1 end\n if comp_u(ary[1]) then return 1 end\n if not comp_u(ary[num]) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if not comp_u(ary[mid]) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\nlocal lb = lower_bound(idx)\nlocal ub = upper_bound(idx)\nlocal t = {}\nfor i = lb, ub - 1 do\n table.insert(t, idx[i])\nend\ntable.sort(t)\nfor i = 1, #t do\n local k = t[i] - 1\n local v = xor(ar[t[i]], br[1])\n print(k .. \" \" .. v)\nend\n-- print(os.clock())\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven are two sequences a=\\{a_0,\\ldots,a_{N-1}\\} and b=\\{b_0,\\ldots,b_{N-1}\\} of N non-negative integers each.\n\nSnuke will choose an integer k such that 0 \\leq k < N and an integer x not less than 0, to make a new sequence of length N, a'=\\{a_0',\\ldots,a_{N-1}'\\}, as follows:\n\na_i'= a_{i+k \\mod N}\\ XOR \\ x\n\nFind all pairs (k,x) such that a' will be equal to b.\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\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq a_i,b_i < 2^{30}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_0 a_1 ... a_{N-1}\nb_0 b_1 ... b_{N-1}\n\nOutput\n\nPrint all pairs (k, x) such that a' and b will be equal, using one line for each pair, in ascending order of k (ascending order of x for pairs with the same k).\n\nIf there are no such pairs, the output should be empty.\n\nSample Input 1\n\n3\n0 2 1\n1 2 3\n\nSample Output 1\n\n1 3\n\nIf (k,x)=(1,3),\n\na_0'=(a_1\\ XOR \\ 3)=1\n\na_1'=(a_2\\ XOR \\ 3)=2\n\na_2'=(a_0\\ XOR \\ 3)=3\n\nand we have a' = b.\n\nSample Input 2\n\n5\n0 0 0 0 0\n2 2 2 2 2\n\nSample Output 2\n\n0 2\n1 2\n2 2\n3 2\n4 2\n\nSample Input 3\n\n6\n0 1 3 7 6 4\n1 5 4 6 2 3\n\nSample Output 3\n\n2 2\n5 5\n\nSample Input 4\n\n2\n1 2\n0 0\n\nSample Output 4\n\nNo pairs may satisfy the condition.", "sample_input": "3\n0 2 1\n1 2 3\n"}, "reference_outputs": ["1 3\n"], "source_document_id": "p02816", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven are two sequences a=\\{a_0,\\ldots,a_{N-1}\\} and b=\\{b_0,\\ldots,b_{N-1}\\} of N non-negative integers each.\n\nSnuke will choose an integer k such that 0 \\leq k < N and an integer x not less than 0, to make a new sequence of length N, a'=\\{a_0',\\ldots,a_{N-1}'\\}, as follows:\n\na_i'= a_{i+k \\mod N}\\ XOR \\ x\n\nFind all pairs (k,x) such that a' will be equal to b.\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\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq a_i,b_i < 2^{30}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_0 a_1 ... a_{N-1}\nb_0 b_1 ... b_{N-1}\n\nOutput\n\nPrint all pairs (k, x) such that a' and b will be equal, using one line for each pair, in ascending order of k (ascending order of x for pairs with the same k).\n\nIf there are no such pairs, the output should be empty.\n\nSample Input 1\n\n3\n0 2 1\n1 2 3\n\nSample Output 1\n\n1 3\n\nIf (k,x)=(1,3),\n\na_0'=(a_1\\ XOR \\ 3)=1\n\na_1'=(a_2\\ XOR \\ 3)=2\n\na_2'=(a_0\\ XOR \\ 3)=3\n\nand we have a' = b.\n\nSample Input 2\n\n5\n0 0 0 0 0\n2 2 2 2 2\n\nSample Output 2\n\n0 2\n1 2\n2 2\n3 2\n4 2\n\nSample Input 3\n\n6\n0 1 3 7 6 4\n1 5 4 6 2 3\n\nSample Output 3\n\n2 2\n5 5\n\nSample Input 4\n\n2\n1 2\n0 0\n\nSample Output 4\n\nNo pairs may satisfy the condition.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4297, "cpu_time_ms": 897, "memory_kb": 64512}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s462580383", "group_id": "codeNet:p02816", "input_text": "local mmi, mma = math.min, math.max\nlocal mfl = math.floor\nlocal xor = bit.bxor\n-- local function xor(x, y) return x end\n\nlocal n = io.read(\"*n\")\nlocal ar, br = {}, {}\nfor i = 1, n do\n ar[i] = io.read(\"*n\")\nend\nfor i = 1, n do\n br[i] = io.read(\"*n\")\nend\nlocal as, bs = {}, {}\nfor i = 1, n - 1 do\n as[i], bs[i] = xor(ar[i], ar[i + 1]), xor(br[i], br[i + 1])\nend\nas[n], bs[n] = xor(ar[n], ar[1]), xor(br[n], br[1])\nlocal idx = {}\nlocal v = {}\nfor i = 1, n do\n idx[i] = i\n v[i] = as[i]\nend\n-- stage 1\ntable.sort(idx, function(a, b) return v[a] < v[b] end)\ndo\n local cur = 1\n local v_nxt = {}\n for i = 1, n do v_nxt[i] = 0 end\n v_nxt[idx[1]] = 1\n for i = 2, n do\n if v[idx[i]] ~= v[idx[i - 1]] then\n cur = cur + 1\n end\n v_nxt[idx[i]] = cur\n end\n for i = 1, n do v[i] = v_nxt[i] end\nend\nlocal step = 1\nlocal vd = {}\nwhile step < n do\n local stepdst = {}\n for i = 1, n do\n local dst = i + step\n if n < dst then dst = dst - n end\n stepdst[i] = dst\n end\n local left, major = 1, v[idx[1]]\n local minor_min = v[stepdst[idx[1]]]\n local minor_max = minor_min\n local cur = 0\n for i = 1, n do\n local isend = i == n or major ~= v[idx[i + 1]]\n if isend then\n local right = i\n if minor_min ~= minor_max then\n local t = {}\n for j = left, right do\n t[j - left + 1] = idx[j]\n end\n table.sort(t, function(x, y) return v[stepdst[x]] < v[stepdst[y]] end)\n local v_prv = 0\n for j = left, right do\n idx[j] = t[j - left + 1]\n local v_nxt = v[stepdst[idx[j]]]\n if j == left or v_nxt ~= v_prv then\n cur = cur + 1\n end\n vd[idx[j]] = cur\n v_prv = v_nxt\n end\n else\n cur = cur + 1\n for j = left, right do\n vd[idx[j]] = cur\n end\n end\n if i < n then\n left, major = i + 1, v[idx[i + 1]]\n minor_min = v[stepdst[idx[i + 1]]]\n minor_max = minor_min\n end\n else\n local minor = v[stepdst[idx[i]]]\n minor_min, minor_max = mmi(minor_min, minor), mma(minor_max, minor)\n end\n end\n for i = 1, n do v[i] = vd[i] end\n step = step * 2\nend\n\nlocal function comp_l(offset)\n for i = 1, n do\n local ai = offset - 1 + i\n if n < ai then ai = ai - n end\n if as[ai] < bs[i] then return true\n elseif bs[i] < as[ai] then return false\n end\n end\n return false\nend\n\nlocal function comp_u(offset)\n for i = 1, n do\n local ai = offset - 1 + i\n if n < ai then ai = ai - n end\n if bs[i] < as[ai] then return true\n elseif as[ai] < bs[i] then return false\n end\n end\n return false\nend\n\nlocal function lower_bound(ary)\n local num = #ary\n if num == 0 then return 1 end\n if not comp_l(ary[1]) then return 1 end\n if comp_l(ary[num]) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if comp_l(ary[mid]) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal function upper_bound(ary)\n local num = #ary\n if num == 0 then return 1 end\n if comp_u(ary[1]) then return 1 end\n if not comp_u(ary[num]) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if not comp_u(ary[mid]) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\nlocal lb = lower_bound(idx)\nlocal ub = upper_bound(idx)\nlocal t = {}\nfor i = lb, ub - 1 do\n table.insert(t, idx[i])\nend\ntable.sort(t)\nfor i = 1, #t do\n local k = t[i] - 1\n local v = xor(ar[t[i]], br[1])\n print(k .. \" \" .. v)\nend\n-- print(os.clock())\n", "language": "Lua", "metadata": {"date": 1580864563, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02816.html", "problem_id": "p02816", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02816/input.txt", "sample_output_relpath": "derived/input_output/data/p02816/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02816/Lua/s462580383.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s462580383", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1 3\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal mfl = math.floor\nlocal xor = bit.bxor\n-- local function xor(x, y) return x end\n\nlocal n = io.read(\"*n\")\nlocal ar, br = {}, {}\nfor i = 1, n do\n ar[i] = io.read(\"*n\")\nend\nfor i = 1, n do\n br[i] = io.read(\"*n\")\nend\nlocal as, bs = {}, {}\nfor i = 1, n - 1 do\n as[i], bs[i] = xor(ar[i], ar[i + 1]), xor(br[i], br[i + 1])\nend\nas[n], bs[n] = xor(ar[n], ar[1]), xor(br[n], br[1])\nlocal idx = {}\nlocal v = {}\nfor i = 1, n do\n idx[i] = i\n v[i] = as[i]\nend\n-- stage 1\ntable.sort(idx, function(a, b) return v[a] < v[b] end)\ndo\n local cur = 1\n local v_nxt = {}\n for i = 1, n do v_nxt[i] = 0 end\n v_nxt[idx[1]] = 1\n for i = 2, n do\n if v[idx[i]] ~= v[idx[i - 1]] then\n cur = cur + 1\n end\n v_nxt[idx[i]] = cur\n end\n for i = 1, n do v[i] = v_nxt[i] end\nend\nlocal step = 1\nlocal vd = {}\nwhile step < n do\n local stepdst = {}\n for i = 1, n do\n local dst = i + step\n if n < dst then dst = dst - n end\n stepdst[i] = dst\n end\n local left, major = 1, v[idx[1]]\n local minor_min = v[stepdst[idx[1]]]\n local minor_max = minor_min\n local cur = 0\n for i = 1, n do\n local isend = i == n or major ~= v[idx[i + 1]]\n if isend then\n local right = i\n if minor_min ~= minor_max then\n local t = {}\n for j = left, right do\n t[j - left + 1] = idx[j]\n end\n table.sort(t, function(x, y) return v[stepdst[x]] < v[stepdst[y]] end)\n local v_prv = 0\n for j = left, right do\n idx[j] = t[j - left + 1]\n local v_nxt = v[stepdst[idx[j]]]\n if j == left or v_nxt ~= v_prv then\n cur = cur + 1\n end\n vd[idx[j]] = cur\n v_prv = v_nxt\n end\n else\n cur = cur + 1\n for j = left, right do\n vd[idx[j]] = cur\n end\n end\n if i < n then\n left, major = i + 1, v[idx[i + 1]]\n minor_min = v[stepdst[idx[i + 1]]]\n minor_max = minor_min\n end\n else\n local minor = v[stepdst[idx[i]]]\n minor_min, minor_max = mmi(minor_min, minor), mma(minor_max, minor)\n end\n end\n for i = 1, n do v[i] = vd[i] end\n step = step * 2\nend\n\nlocal function comp_l(offset)\n for i = 1, n do\n local ai = offset - 1 + i\n if n < ai then ai = ai - n end\n if as[ai] < bs[i] then return true\n elseif bs[i] < as[ai] then return false\n end\n end\n return false\nend\n\nlocal function comp_u(offset)\n for i = 1, n do\n local ai = offset - 1 + i\n if n < ai then ai = ai - n end\n if bs[i] < as[ai] then return true\n elseif as[ai] < bs[i] then return false\n end\n end\n return false\nend\n\nlocal function lower_bound(ary)\n local num = #ary\n if num == 0 then return 1 end\n if not comp_l(ary[1]) then return 1 end\n if comp_l(ary[num]) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if comp_l(ary[mid]) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal function upper_bound(ary)\n local num = #ary\n if num == 0 then return 1 end\n if comp_u(ary[1]) then return 1 end\n if not comp_u(ary[num]) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if not comp_u(ary[mid]) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\nlocal lb = lower_bound(idx)\nlocal ub = upper_bound(idx)\nlocal t = {}\nfor i = lb, ub - 1 do\n table.insert(t, idx[i])\nend\ntable.sort(t)\nfor i = 1, #t do\n local k = t[i] - 1\n local v = xor(ar[t[i]], br[1])\n print(k .. \" \" .. v)\nend\n-- print(os.clock())\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven are two sequences a=\\{a_0,\\ldots,a_{N-1}\\} and b=\\{b_0,\\ldots,b_{N-1}\\} of N non-negative integers each.\n\nSnuke will choose an integer k such that 0 \\leq k < N and an integer x not less than 0, to make a new sequence of length N, a'=\\{a_0',\\ldots,a_{N-1}'\\}, as follows:\n\na_i'= a_{i+k \\mod N}\\ XOR \\ x\n\nFind all pairs (k,x) such that a' will be equal to b.\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\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq a_i,b_i < 2^{30}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_0 a_1 ... a_{N-1}\nb_0 b_1 ... b_{N-1}\n\nOutput\n\nPrint all pairs (k, x) such that a' and b will be equal, using one line for each pair, in ascending order of k (ascending order of x for pairs with the same k).\n\nIf there are no such pairs, the output should be empty.\n\nSample Input 1\n\n3\n0 2 1\n1 2 3\n\nSample Output 1\n\n1 3\n\nIf (k,x)=(1,3),\n\na_0'=(a_1\\ XOR \\ 3)=1\n\na_1'=(a_2\\ XOR \\ 3)=2\n\na_2'=(a_0\\ XOR \\ 3)=3\n\nand we have a' = b.\n\nSample Input 2\n\n5\n0 0 0 0 0\n2 2 2 2 2\n\nSample Output 2\n\n0 2\n1 2\n2 2\n3 2\n4 2\n\nSample Input 3\n\n6\n0 1 3 7 6 4\n1 5 4 6 2 3\n\nSample Output 3\n\n2 2\n5 5\n\nSample Input 4\n\n2\n1 2\n0 0\n\nSample Output 4\n\nNo pairs may satisfy the condition.", "sample_input": "3\n0 2 1\n1 2 3\n"}, "reference_outputs": ["1 3\n"], "source_document_id": "p02816", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven are two sequences a=\\{a_0,\\ldots,a_{N-1}\\} and b=\\{b_0,\\ldots,b_{N-1}\\} of N non-negative integers each.\n\nSnuke will choose an integer k such that 0 \\leq k < N and an integer x not less than 0, to make a new sequence of length N, a'=\\{a_0',\\ldots,a_{N-1}'\\}, as follows:\n\na_i'= a_{i+k \\mod N}\\ XOR \\ x\n\nFind all pairs (k,x) such that a' will be equal to b.\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\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq a_i,b_i < 2^{30}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_0 a_1 ... a_{N-1}\nb_0 b_1 ... b_{N-1}\n\nOutput\n\nPrint all pairs (k, x) such that a' and b will be equal, using one line for each pair, in ascending order of k (ascending order of x for pairs with the same k).\n\nIf there are no such pairs, the output should be empty.\n\nSample Input 1\n\n3\n0 2 1\n1 2 3\n\nSample Output 1\n\n1 3\n\nIf (k,x)=(1,3),\n\na_0'=(a_1\\ XOR \\ 3)=1\n\na_1'=(a_2\\ XOR \\ 3)=2\n\na_2'=(a_0\\ XOR \\ 3)=3\n\nand we have a' = b.\n\nSample Input 2\n\n5\n0 0 0 0 0\n2 2 2 2 2\n\nSample Output 2\n\n0 2\n1 2\n2 2\n3 2\n4 2\n\nSample Input 3\n\n6\n0 1 3 7 6 4\n1 5 4 6 2 3\n\nSample Output 3\n\n2 2\n5 5\n\nSample Input 4\n\n2\n1 2\n0 0\n\nSample Output 4\n\nNo pairs may satisfy the condition.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3602, "cpu_time_ms": 2106, "memory_kb": 47736}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s080726436", "group_id": "codeNet:p02816", "input_text": "local mmi, mma = math.min, math.max\nlocal mfl = math.floor\nlocal xor = bit.bxor\n-- local function xor(x, y) return x end\n\nlocal n = io.read(\"*n\")\nlocal ar, br = {}, {}\nfor i = 1, n do\n ar[i] = io.read(\"*n\")\nend\nfor i = 1, n do\n br[i] = io.read(\"*n\")\nend\nlocal as, bs = {}, {}\nfor i = 1, n - 1 do\n as[i], bs[i] = xor(ar[i], ar[i + 1]), xor(br[i], br[i + 1])\nend\nas[n], bs[n] = xor(ar[n], ar[1]), xor(br[n], br[1])\nlocal idx = {}\nlocal v = {}\nfor i = 1, n do\n idx[i] = i\n v[i] = as[i]\nend\n-- stage 1\ntable.sort(idx, function(a, b) return v[a] < v[b] end)\ndo\n local cur = 1\n local v_nxt = {}\n for i = 1, n do v_nxt[i] = 0 end\n v_nxt[idx[1]] = 1\n for i = 2, n do\n if v[idx[i]] ~= v[idx[i - 1]] then\n cur = cur + 1\n end\n v_nxt[idx[i]] = cur\n end\n for i = 1, n do v[i] = v_nxt[i] end\nend\nlocal step = 1\nwhile step < n do\n local vd = {}\n local left, major = 1, v[idx[1]]\n local minor_min = v[idx[1 + step]]\n local minor_max = minor_min\n for i = 1, n do\n local isend = i == n or major ~= v[idx[i + 1]]\n if isend then\n if minor_min ~= minor_max then\n local right = i\n local t = {}\n for j = left, right do\n t[j - left + 1] = idx[j]\n end\n table.sort(t, function(x, y)\n x, y = x + step, y + step\n if n < x then x = x - n end\n if n < y then y = y - n end\n return v[x] < v[y] end)\n for j = left, right do\n idx[j] = t[j - left + 1]\n end\n end\n if i < n then\n left, major = i + 1, v[idx[i + 1]]\n local tmp = idx[i + 1] + step\n if n < tmp then tmp = tmp - n end\n minor_min = v[tmp]\n minor_max = minor_min\n end\n else\n local j = idx[i] + step\n if n < j then j = j - n end\n local minor = v[j]\n minor_min, minor_max = mmi(minor_min, minor), mma(minor_max, minor)\n end\n end\n vd[idx[1]] = 1\n local cur = 1\n for i = 2, n do\n local idx_prv, idx_nxt = idx[i - 1], idx[i]\n local idx_prv_i, idx_nxt_i = idx_prv + step, idx_nxt + step\n if n < idx_prv_i then idx_prv_i = idx_prv_i - n end\n if n < idx_nxt_i then idx_nxt_i = idx_nxt_i - n end\n if v[idx_prv] ~= v[idx_nxt] or v[idx_prv_i] ~= v[idx_nxt_i] then\n cur = cur + 1\n end\n vd[idx_nxt] = cur\n end\n for i = 1, n do v[i] = vd[i] end\n step = step * 2\nend\n\nlocal function comp_l(offset)\n for i = 1, n do\n local ai = offset - 1 + i\n if n < ai then ai = ai - n end\n if as[ai] < bs[i] then return true\n elseif bs[i] < as[ai] then return false\n end\n end\n return false\nend\n\nlocal function comp_u(offset)\n for i = 1, n do\n local ai = offset - 1 + i\n if n < ai then ai = ai - n end\n if bs[i] < as[ai] then return true\n elseif as[ai] < bs[i] then return false\n end\n end\n return false\nend\n\nlocal function lower_bound(ary)\n local num = #ary\n if num == 0 then return 1 end\n if not comp_l(ary[1]) then return 1 end\n if comp_l(ary[num]) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if comp_l(ary[mid]) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal function upper_bound(ary)\n local num = #ary\n if num == 0 then return 1 end\n if comp_u(ary[1]) then return 1 end\n if not comp_u(ary[num]) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if not comp_u(ary[mid]) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\nlocal lb = lower_bound(idx)\nlocal ub = upper_bound(idx)\nlocal t = {}\nfor i = lb, ub - 1 do\n table.insert(t, idx[i])\nend\ntable.sort(t)\nfor i = 1, #t do\n local k = t[i] - 1\n local v = xor(ar[t[i]], br[1])\n print(k .. \" \" .. v)\nend\n-- print(os.clock())\n", "language": "Lua", "metadata": {"date": 1580859417, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02816.html", "problem_id": "p02816", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02816/input.txt", "sample_output_relpath": "derived/input_output/data/p02816/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02816/Lua/s080726436.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s080726436", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1 3\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal mfl = math.floor\nlocal xor = bit.bxor\n-- local function xor(x, y) return x end\n\nlocal n = io.read(\"*n\")\nlocal ar, br = {}, {}\nfor i = 1, n do\n ar[i] = io.read(\"*n\")\nend\nfor i = 1, n do\n br[i] = io.read(\"*n\")\nend\nlocal as, bs = {}, {}\nfor i = 1, n - 1 do\n as[i], bs[i] = xor(ar[i], ar[i + 1]), xor(br[i], br[i + 1])\nend\nas[n], bs[n] = xor(ar[n], ar[1]), xor(br[n], br[1])\nlocal idx = {}\nlocal v = {}\nfor i = 1, n do\n idx[i] = i\n v[i] = as[i]\nend\n-- stage 1\ntable.sort(idx, function(a, b) return v[a] < v[b] end)\ndo\n local cur = 1\n local v_nxt = {}\n for i = 1, n do v_nxt[i] = 0 end\n v_nxt[idx[1]] = 1\n for i = 2, n do\n if v[idx[i]] ~= v[idx[i - 1]] then\n cur = cur + 1\n end\n v_nxt[idx[i]] = cur\n end\n for i = 1, n do v[i] = v_nxt[i] end\nend\nlocal step = 1\nwhile step < n do\n local vd = {}\n local left, major = 1, v[idx[1]]\n local minor_min = v[idx[1 + step]]\n local minor_max = minor_min\n for i = 1, n do\n local isend = i == n or major ~= v[idx[i + 1]]\n if isend then\n if minor_min ~= minor_max then\n local right = i\n local t = {}\n for j = left, right do\n t[j - left + 1] = idx[j]\n end\n table.sort(t, function(x, y)\n x, y = x + step, y + step\n if n < x then x = x - n end\n if n < y then y = y - n end\n return v[x] < v[y] end)\n for j = left, right do\n idx[j] = t[j - left + 1]\n end\n end\n if i < n then\n left, major = i + 1, v[idx[i + 1]]\n local tmp = idx[i + 1] + step\n if n < tmp then tmp = tmp - n end\n minor_min = v[tmp]\n minor_max = minor_min\n end\n else\n local j = idx[i] + step\n if n < j then j = j - n end\n local minor = v[j]\n minor_min, minor_max = mmi(minor_min, minor), mma(minor_max, minor)\n end\n end\n vd[idx[1]] = 1\n local cur = 1\n for i = 2, n do\n local idx_prv, idx_nxt = idx[i - 1], idx[i]\n local idx_prv_i, idx_nxt_i = idx_prv + step, idx_nxt + step\n if n < idx_prv_i then idx_prv_i = idx_prv_i - n end\n if n < idx_nxt_i then idx_nxt_i = idx_nxt_i - n end\n if v[idx_prv] ~= v[idx_nxt] or v[idx_prv_i] ~= v[idx_nxt_i] then\n cur = cur + 1\n end\n vd[idx_nxt] = cur\n end\n for i = 1, n do v[i] = vd[i] end\n step = step * 2\nend\n\nlocal function comp_l(offset)\n for i = 1, n do\n local ai = offset - 1 + i\n if n < ai then ai = ai - n end\n if as[ai] < bs[i] then return true\n elseif bs[i] < as[ai] then return false\n end\n end\n return false\nend\n\nlocal function comp_u(offset)\n for i = 1, n do\n local ai = offset - 1 + i\n if n < ai then ai = ai - n end\n if bs[i] < as[ai] then return true\n elseif as[ai] < bs[i] then return false\n end\n end\n return false\nend\n\nlocal function lower_bound(ary)\n local num = #ary\n if num == 0 then return 1 end\n if not comp_l(ary[1]) then return 1 end\n if comp_l(ary[num]) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if comp_l(ary[mid]) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal function upper_bound(ary)\n local num = #ary\n if num == 0 then return 1 end\n if comp_u(ary[1]) then return 1 end\n if not comp_u(ary[num]) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if not comp_u(ary[mid]) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\nlocal lb = lower_bound(idx)\nlocal ub = upper_bound(idx)\nlocal t = {}\nfor i = lb, ub - 1 do\n table.insert(t, idx[i])\nend\ntable.sort(t)\nfor i = 1, #t do\n local k = t[i] - 1\n local v = xor(ar[t[i]], br[1])\n print(k .. \" \" .. v)\nend\n-- print(os.clock())\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven are two sequences a=\\{a_0,\\ldots,a_{N-1}\\} and b=\\{b_0,\\ldots,b_{N-1}\\} of N non-negative integers each.\n\nSnuke will choose an integer k such that 0 \\leq k < N and an integer x not less than 0, to make a new sequence of length N, a'=\\{a_0',\\ldots,a_{N-1}'\\}, as follows:\n\na_i'= a_{i+k \\mod N}\\ XOR \\ x\n\nFind all pairs (k,x) such that a' will be equal to b.\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\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq a_i,b_i < 2^{30}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_0 a_1 ... a_{N-1}\nb_0 b_1 ... b_{N-1}\n\nOutput\n\nPrint all pairs (k, x) such that a' and b will be equal, using one line for each pair, in ascending order of k (ascending order of x for pairs with the same k).\n\nIf there are no such pairs, the output should be empty.\n\nSample Input 1\n\n3\n0 2 1\n1 2 3\n\nSample Output 1\n\n1 3\n\nIf (k,x)=(1,3),\n\na_0'=(a_1\\ XOR \\ 3)=1\n\na_1'=(a_2\\ XOR \\ 3)=2\n\na_2'=(a_0\\ XOR \\ 3)=3\n\nand we have a' = b.\n\nSample Input 2\n\n5\n0 0 0 0 0\n2 2 2 2 2\n\nSample Output 2\n\n0 2\n1 2\n2 2\n3 2\n4 2\n\nSample Input 3\n\n6\n0 1 3 7 6 4\n1 5 4 6 2 3\n\nSample Output 3\n\n2 2\n5 5\n\nSample Input 4\n\n2\n1 2\n0 0\n\nSample Output 4\n\nNo pairs may satisfy the condition.", "sample_input": "3\n0 2 1\n1 2 3\n"}, "reference_outputs": ["1 3\n"], "source_document_id": "p02816", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven are two sequences a=\\{a_0,\\ldots,a_{N-1}\\} and b=\\{b_0,\\ldots,b_{N-1}\\} of N non-negative integers each.\n\nSnuke will choose an integer k such that 0 \\leq k < N and an integer x not less than 0, to make a new sequence of length N, a'=\\{a_0',\\ldots,a_{N-1}'\\}, as follows:\n\na_i'= a_{i+k \\mod N}\\ XOR \\ x\n\nFind all pairs (k,x) such that a' will be equal to b.\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\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq a_i,b_i < 2^{30}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_0 a_1 ... a_{N-1}\nb_0 b_1 ... b_{N-1}\n\nOutput\n\nPrint all pairs (k, x) such that a' and b will be equal, using one line for each pair, in ascending order of k (ascending order of x for pairs with the same k).\n\nIf there are no such pairs, the output should be empty.\n\nSample Input 1\n\n3\n0 2 1\n1 2 3\n\nSample Output 1\n\n1 3\n\nIf (k,x)=(1,3),\n\na_0'=(a_1\\ XOR \\ 3)=1\n\na_1'=(a_2\\ XOR \\ 3)=2\n\na_2'=(a_0\\ XOR \\ 3)=3\n\nand we have a' = b.\n\nSample Input 2\n\n5\n0 0 0 0 0\n2 2 2 2 2\n\nSample Output 2\n\n0 2\n1 2\n2 2\n3 2\n4 2\n\nSample Input 3\n\n6\n0 1 3 7 6 4\n1 5 4 6 2 3\n\nSample Output 3\n\n2 2\n5 5\n\nSample Input 4\n\n2\n1 2\n0 0\n\nSample Output 4\n\nNo pairs may satisfy the condition.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3770, "cpu_time_ms": 2106, "memory_kb": 45212}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s389603637", "group_id": "codeNet:p02817", "input_text": "print((io.read():gsub(\"(%S+)%s+(%S+)\",\"%2%1\")))", "language": "Lua", "metadata": {"date": 1587698001, "filename_ext": "lua", "original_language": "LuaJIT (2.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/Lua/s389603637.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s389603637", "user_id": "u726173718"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "print((io.read():gsub(\"(%S+)%s+(%S+)\",\"%2%1\")))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 47, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s915836493", "group_id": "codeNet:p02818", "input_text": "local a, b, k = io.read(\"*n\", \"*n\", \"*n\")\nif k <= a then\n print(a - k .. \" \" .. b)\nelse\n print(0 .. \" \" .. math.max(0, b - (k - a)))\nend\n", "language": "Lua", "metadata": {"date": 1577669631, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s915836493.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s915836493", "user_id": "u120582723"}, "prompt_components": {"gold_output": "0 2\n", "input_to_evaluate": "local a, b, k = io.read(\"*n\", \"*n\", \"*n\")\nif k <= a then\n print(a - k .. \" \" .. b)\nelse\n print(0 .. \" \" .. math.max(0, b - (k - a)))\nend\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s706736553", "group_id": "codeNet:p02819", "input_text": "x = io.read(\"*n\")\n\nnot_prime = {true}\n\nfor i = 2, 10 ^ 6 do\n if not_prime[i] == nil then\n if i >= x then\n print(i)\n break\n end\n cur = i * 2\n while cur < 10 ^ 6 do\n not_prime[cur] = true\n cur = cur + i\n end\n end\nend\n", "language": "Lua", "metadata": {"date": 1600001414, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s706736553.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s706736553", "user_id": "u878654696"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "x = io.read(\"*n\")\n\nnot_prime = {true}\n\nfor i = 2, 10 ^ 6 do\n if not_prime[i] == nil then\n if i >= x then\n print(i)\n break\n end\n cur = i * 2\n while cur < 10 ^ 6 do\n not_prime[cur] = true\n cur = cur + i\n end\n end\nend\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nFind the minimum prime number greater than or equal to X.\n\nNotes\n\nA prime number is an integer greater than 1 that cannot be evenly divided by any positive integer except 1 and itself.\n\nFor example, 2, 3, and 5 are prime numbers, while 4 and 6 are not.\n\nConstraints\n\n2 \\le X \\le 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the minimum prime number greater than or equal to X.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n23\n\nThe minimum prime number greater than or equal to 20 is 23.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n2\n\nX itself can be a prime number.\n\nSample Input 3\n\n99992\n\nSample Output 3\n\n100003", "sample_input": "20\n"}, "reference_outputs": ["23\n"], "source_document_id": "p02819", "source_text": "Score: 300 points\n\nProblem Statement\n\nFind the minimum prime number greater than or equal to X.\n\nNotes\n\nA prime number is an integer greater than 1 that cannot be evenly divided by any positive integer except 1 and itself.\n\nFor example, 2, 3, and 5 are prime numbers, while 4 and 6 are not.\n\nConstraints\n\n2 \\le X \\le 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the minimum prime number greater than or equal to X.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n23\n\nThe minimum prime number greater than or equal to 20 is 23.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n2\n\nX itself can be a prime number.\n\nSample Input 3\n\n99992\n\nSample Output 3\n\n100003", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 32, "memory_kb": 10868}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s968521815", "group_id": "codeNet:p02819", "input_text": "local X = io.read(\"*n\")\n\nfor i = 2, math.ceil(math.sqrt(X)) do\n if X%i==0 then\n X = X+1\n elseif X%i~=0 and i==math.ceil(math.sqrt(X)) then\n print(X)\n end\nend", "language": "Lua", "metadata": {"date": 1586931939, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "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/Lua/s968521815.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s968521815", "user_id": "u045238009"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "local X = io.read(\"*n\")\n\nfor i = 2, math.ceil(math.sqrt(X)) do\n if X%i==0 then\n X = X+1\n elseif X%i~=0 and i==math.ceil(math.sqrt(X)) then\n print(X)\n end\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 180, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s493432148", "group_id": "codeNet:p02819", "input_text": "local x = io.read(\"*n\")\nwhile true do\n local lim = math.ceil(math.sqrt(x))\n local f = true\n for i = 2, lim do\n if x ~= i and x % i == 0 then\n f = false\n break\n end\n end\n if f then print(x) break else x = x + 1 end\nend\n", "language": "Lua", "metadata": {"date": 1584281725, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "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/Lua/s493432148.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s493432148", "user_id": "u120582723"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "local x = io.read(\"*n\")\nwhile true do\n local lim = math.ceil(math.sqrt(x))\n local f = true\n for i = 2, lim do\n if x ~= i and x % i == 0 then\n f = false\n break\n end\n end\n if f then print(x) break else x = x + 1 end\nend\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nFind the minimum prime number greater than or equal to X.\n\nNotes\n\nA prime number is an integer greater than 1 that cannot be evenly divided by any positive integer except 1 and itself.\n\nFor example, 2, 3, and 5 are prime numbers, while 4 and 6 are not.\n\nConstraints\n\n2 \\le X \\le 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the minimum prime number greater than or equal to X.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n23\n\nThe minimum prime number greater than or equal to 20 is 23.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n2\n\nX itself can be a prime number.\n\nSample Input 3\n\n99992\n\nSample Output 3\n\n100003", "sample_input": "20\n"}, "reference_outputs": ["23\n"], "source_document_id": "p02819", "source_text": "Score: 300 points\n\nProblem Statement\n\nFind the minimum prime number greater than or equal to X.\n\nNotes\n\nA prime number is an integer greater than 1 that cannot be evenly divided by any positive integer except 1 and itself.\n\nFor example, 2, 3, and 5 are prime numbers, while 4 and 6 are not.\n\nConstraints\n\n2 \\le X \\le 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the minimum prime number greater than or equal to X.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n23\n\nThe minimum prime number greater than or equal to 20 is 23.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n2\n\nX itself can be a prime number.\n\nSample Input 3\n\n99992\n\nSample Output 3\n\n100003", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 508}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s319926899", "group_id": "codeNet:p02819", "input_text": "local x = io.read(\"*n\")\nwhile true do\n local lim = math.ceil(math.sqrt(x))\n local f = true\n for i = 2, lim do\n if x % i == 0 then\n f = false\n break\n end\n end\n if f then print(x) break else x = x + 1 end\nend\n", "language": "Lua", "metadata": {"date": 1584281636, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "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/Lua/s319926899.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s319926899", "user_id": "u120582723"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "local x = io.read(\"*n\")\nwhile true do\n local lim = math.ceil(math.sqrt(x))\n local f = true\n for i = 2, lim do\n if x % i == 0 then\n f = false\n break\n end\n end\n if f then print(x) break else x = x + 1 end\nend\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nFind the minimum prime number greater than or equal to X.\n\nNotes\n\nA prime number is an integer greater than 1 that cannot be evenly divided by any positive integer except 1 and itself.\n\nFor example, 2, 3, and 5 are prime numbers, while 4 and 6 are not.\n\nConstraints\n\n2 \\le X \\le 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the minimum prime number greater than or equal to X.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n23\n\nThe minimum prime number greater than or equal to 20 is 23.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n2\n\nX itself can be a prime number.\n\nSample Input 3\n\n99992\n\nSample Output 3\n\n100003", "sample_input": "20\n"}, "reference_outputs": ["23\n"], "source_document_id": "p02819", "source_text": "Score: 300 points\n\nProblem Statement\n\nFind the minimum prime number greater than or equal to X.\n\nNotes\n\nA prime number is an integer greater than 1 that cannot be evenly divided by any positive integer except 1 and itself.\n\nFor example, 2, 3, and 5 are prime numbers, while 4 and 6 are not.\n\nConstraints\n\n2 \\le X \\le 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the minimum prime number greater than or equal to X.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n23\n\nThe minimum prime number greater than or equal to 20 is 23.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n2\n\nX itself can be a prime number.\n\nSample Input 3\n\n99992\n\nSample Output 3\n\n100003", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 508}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s074697538", "group_id": "codeNet:p02820", "input_text": "local n,k=io.read(\"n\",\"n\")\nlocal R,S,P=io.read(\"n\",\"n\",\"n\",\"l\")\nlocal t=io.read()\nlocal a={}\nlocal point=0\n\nfor i=1,n do\n if t:sub(i,i)==\"r\" then\n a[i]=\"p\"\n point=point+P\n end\n if t:sub(i,i)==\"s\" then\n a[i]=\"r\"\n point=point+R\n end\n if t:sub(i,i)==\"p\" then\n a[i]=\"s\"\n point=point+S\n end\nend\n\nfor i=1,n do\n if a[i]==a[i+k] and i+k<=n then\n if a[i]==\"p\" then\n point=point-P\n a[i+k]=\"r\"\n end\n if a[i]==\"r\" then\n point=point-R\n a[i+k]=\"s\"\n end\n if a[i]==\"s\" then\n point=point-S\n a[i+k]=\"p\"\n end\n end\nend\n\nprint(point)", "language": "Lua", "metadata": {"date": 1590464607, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s074697538.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s074697538", "user_id": "u045238009"}, "prompt_components": {"gold_output": "27\n", "input_to_evaluate": "local n,k=io.read(\"n\",\"n\")\nlocal R,S,P=io.read(\"n\",\"n\",\"n\",\"l\")\nlocal t=io.read()\nlocal a={}\nlocal point=0\n\nfor i=1,n do\n if t:sub(i,i)==\"r\" then\n a[i]=\"p\"\n point=point+P\n end\n if t:sub(i,i)==\"s\" then\n a[i]=\"r\"\n point=point+R\n end\n if t:sub(i,i)==\"p\" then\n a[i]=\"s\"\n point=point+S\n end\nend\n\nfor i=1,n do\n if a[i]==a[i+k] and i+k<=n then\n if a[i]==\"p\" then\n point=point-P\n a[i+k]=\"r\"\n end\n if a[i]==\"r\" then\n point=point-R\n a[i+k]=\"s\"\n end\n if a[i]==\"s\" then\n point=point-S\n a[i+k]=\"p\"\n end\n end\nend\n\nprint(point)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 686, "cpu_time_ms": 48, "memory_kb": 2588}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s103527900", "group_id": "codeNet:p02829", "input_text": "a, b = io.read\"*n\", io.read\"*n\"\nprint(6-a-b)", "language": "Lua", "metadata": {"date": 1587783642, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02829.html", "problem_id": "p02829", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02829/input.txt", "sample_output_relpath": "derived/input_output/data/p02829/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02829/Lua/s103527900.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s103527900", "user_id": "u373047809"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "a, b = io.read\"*n\", io.read\"*n\"\nprint(6-a-b)", "problem_context": "Score: 100 points\n\nProblem Statement\n\nTakahashi is solving quizzes. He has easily solved all but the last one.\n\nThe last quiz has three choices: 1, 2, and 3.\n\nWith his supernatural power, Takahashi has found out that the choices A and B are both wrong.\n\nPrint the correct choice for this problem.\n\nConstraints\n\nEach of the numbers A and B is 1, 2, or 3.\n\nA and B are different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\n\nOutput\n\nPrint the correct choice.\n\nSample Input 1\n\n3\n1\n\nSample Output 1\n\n2\n\nWhen we know 3 and 1 are both wrong, the correct choice is 2.\n\nSample Input 2\n\n1\n2\n\nSample Output 2\n\n3", "sample_input": "3\n1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02829", "source_text": "Score: 100 points\n\nProblem Statement\n\nTakahashi is solving quizzes. He has easily solved all but the last one.\n\nThe last quiz has three choices: 1, 2, and 3.\n\nWith his supernatural power, Takahashi has found out that the choices A and B are both wrong.\n\nPrint the correct choice for this problem.\n\nConstraints\n\nEach of the numbers A and B is 1, 2, or 3.\n\nA and B are different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\n\nOutput\n\nPrint the correct choice.\n\nSample Input 1\n\n3\n1\n\nSample Output 1\n\n2\n\nWhen we know 3 and 1 are both wrong, the correct choice is 2.\n\nSample Input 2\n\n1\n2\n\nSample Output 2\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 44, "cpu_time_ms": 7, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s459126022", "group_id": "codeNet:p02832", "input_text": "local n = io.read(\"*n\")\nlocal cur = 1\nfor i = 1, n do\n local a = io.read(\"*n\")\n if a == cur then\n cur = cur + 1\n end\nend\nlocal used = cur - 1\nif used == 0 then\n print(-1)\nelse\n print(n - used)\nend\n", "language": "Lua", "metadata": {"date": 1577068567, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s459126022.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s459126022", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal cur = 1\nfor i = 1, n do\n local a = io.read(\"*n\")\n if a == cur then\n cur = cur + 1\n end\nend\nlocal used = cur - 1\nif used == 0 then\n print(-1)\nelse\n print(n - used)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 42, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s367975810", "group_id": "codeNet:p02833", "input_text": "N=io.read\"*n\"\nif(N%2==1)then print(0)return end\ns=0\ni=10\nwhile(i<=N)do\n\ts=s+math.floor(N/i)\n\ti=i*5\nend\nprint(s)", "language": "Lua", "metadata": {"date": 1587688500, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s367975810.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s367975810", "user_id": "u726173718"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "N=io.read\"*n\"\nif(N%2==1)then print(0)return end\ns=0\ni=10\nwhile(i<=N)do\n\ts=s+math.floor(N/i)\n\ti=i*5\nend\nprint(s)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 111, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s087332332", "group_id": "codeNet:p02833", "input_text": "local n=io.read(\"*n\")\nif n%2==1 then\n print(0)\nelse\n local f,ans=1,0\n n=n//2\n while n>1 do\n ans=ans+n//5\n n=n//5\n end\n print(ans)\nend", "language": "Lua", "metadata": {"date": 1577125149, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s087332332.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s087332332", "user_id": "u373958718"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local n=io.read(\"*n\")\nif n%2==1 then\n print(0)\nelse\n local f,ans=1,0\n n=n//2\n while n>1 do\n ans=ans+n//5\n n=n//5\n end\n print(ans)\nend", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s561224227", "group_id": "codeNet:p02835", "input_text": "a,b,c=io.read(\"*n\",\"*n\",\"*n\")\nif 210 then\n odd=odd+1\n else\n even=even+1\n end\n end\n local add=(odd*even)%mod*two%mod\n total=(total+add)%mod\n two=(two*2)%mod\nend\nprint(total)", "language": "Lua", "metadata": {"date": 1596504343, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s579440978.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s579440978", "user_id": "u045238009"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal a={}\nfor i=1,n do\n a[i]=io.read(\"n\")\nend\n\nlocal mod=1000000007\nlocal total=0\nlocal two=1\nfor i=0,59 do\n local odd,even=0,0\n for j=1,n do\n if a[j]&(1<0 then\n odd=odd+1\n else\n even=even+1\n end\n end\n local add=(odd*even)%mod*two%mod\n total=(total+add)%mod\n two=(two*2)%mod\nend\nprint(total)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 381, "cpu_time_ms": 694, "memory_kb": 10412}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s991744629", "group_id": "codeNet:p02838", "input_text": "local mod = 1000000007\nlocal mfl = math.floor\nlocal function bmul(x, y)\n local x0, y0 = x % 31623, y % 31623\n local x1, y1 = mfl(x / 31623), mfl(y / 31623)\n return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod\nend\nlocal function badd(x, y) return (x + y) % mod end\nlocal function lltonumber(str)\n local ret = 0LL\n local sign = str:sub(1, 1) ~= \"-\"\n local begin = sign and 1 or 2\n for i = begin, #str do\n ret = ret * 10LL\n ret = ret + tonumber(str:sub(i, i))\n end\n if not sign then ret = ret * -1LL end\n return ret\nend\n\nlocal n = io.read(\"*n\", \"*l\")\nlocal box = {0}\nlocal mul = {1}\nfor i = 2, 61 do\n box[i] = 0\n mul[i] = bmul(mul[i - 1], 2)\nend\nlocal ret = 0\nlocal s = io.read()\nlocal str = {}\nfor z in s:gmatch(\"%d+\") do\n table.insert(str, z)\nend\nfor i = 1, n do\n local a = lltonumber(str[i])\n for j = 1, 61 do\n local p = a % 2\n if p == 1LL then\n ret = badd(ret, bmul(mul[j], i - 1 - box[j]))\n box[j] = box[j] + 1\n else\n ret = badd(ret, bmul(mul[j], box[j]))\n end\n a = a / 2\n end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1575901773, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s991744629.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s991744629", "user_id": "u120582723"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "local mod = 1000000007\nlocal mfl = math.floor\nlocal function bmul(x, y)\n local x0, y0 = x % 31623, y % 31623\n local x1, y1 = mfl(x / 31623), mfl(y / 31623)\n return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod\nend\nlocal function badd(x, y) return (x + y) % mod end\nlocal function lltonumber(str)\n local ret = 0LL\n local sign = str:sub(1, 1) ~= \"-\"\n local begin = sign and 1 or 2\n for i = begin, #str do\n ret = ret * 10LL\n ret = ret + tonumber(str:sub(i, i))\n end\n if not sign then ret = ret * -1LL end\n return ret\nend\n\nlocal n = io.read(\"*n\", \"*l\")\nlocal box = {0}\nlocal mul = {1}\nfor i = 2, 61 do\n box[i] = 0\n mul[i] = bmul(mul[i - 1], 2)\nend\nlocal ret = 0\nlocal s = io.read()\nlocal str = {}\nfor z in s:gmatch(\"%d+\") do\n table.insert(str, z)\nend\nfor i = 1, n do\n local a = lltonumber(str[i])\n for j = 1, 61 do\n local p = a % 2\n if p == 1LL then\n ret = badd(ret, bmul(mul[j], i - 1 - box[j]))\n box[j] = box[j] + 1\n else\n ret = badd(ret, bmul(mul[j], box[j]))\n end\n a = a / 2\n end\nend\nprint(ret)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N integers. The i-th integer is A_i.\n\nFind \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nWhat is \\mbox{ XOR }?\n\nThe XOR of integers A and B, A \\mbox{ XOR } B, is defined as follows:\n\nWhen A \\mbox{ XOR } B is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if either A or B, but not both, has 1 in the 2^k's place, and 0 otherwise.\n\nFor example, 3 \\mbox{ XOR } 5 = 6. (In base two: 011 \\mbox{ XOR } 101 = 110.)\n\nConstraints\n\n2 \\leq N \\leq 3 \\times 10^5\n\n0 \\leq A_i < 2^{60}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the value \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n6\n\nWe have (1\\mbox{ XOR } 2)+(1\\mbox{ XOR } 3)+(2\\mbox{ XOR } 3)=3+2+1=6.\n\nSample Input 2\n\n10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 2\n\n237\n\nSample Input 3\n\n10\n3 14 159 2653 58979 323846 2643383 27950288 419716939 9375105820\n\nSample Output 3\n\n103715602\n\nPrint the sum modulo (10^9+7).", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02838", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N integers. The i-th integer is A_i.\n\nFind \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nWhat is \\mbox{ XOR }?\n\nThe XOR of integers A and B, A \\mbox{ XOR } B, is defined as follows:\n\nWhen A \\mbox{ XOR } B is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if either A or B, but not both, has 1 in the 2^k's place, and 0 otherwise.\n\nFor example, 3 \\mbox{ XOR } 5 = 6. (In base two: 011 \\mbox{ XOR } 101 = 110.)\n\nConstraints\n\n2 \\leq N \\leq 3 \\times 10^5\n\n0 \\leq A_i < 2^{60}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the value \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n6\n\nWe have (1\\mbox{ XOR } 2)+(1\\mbox{ XOR } 3)+(2\\mbox{ XOR } 3)=3+2+1=6.\n\nSample Input 2\n\n10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 2\n\n237\n\nSample Input 3\n\n10\n3 14 159 2653 58979 323846 2643383 27950288 419716939 9375105820\n\nSample Output 3\n\n103715602\n\nPrint the sum modulo (10^9+7).", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1065, "cpu_time_ms": 2108, "memory_kb": 91436}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s514422970", "group_id": "codeNet:p02841", "input_text": "m1, d1 = io.read(\"*n\", \"*n\")\nm2, d2 = io.read(\"*n\", \"*n\")\nprint(d2 == 1 and 1 or 0)\n", "language": "Lua", "metadata": {"date": 1575253200, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02841.html", "problem_id": "p02841", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02841/input.txt", "sample_output_relpath": "derived/input_output/data/p02841/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02841/Lua/s514422970.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s514422970", "user_id": "u120582723"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "m1, d1 = io.read(\"*n\", \"*n\")\nm2, d2 = io.read(\"*n\", \"*n\")\nprint(d2 == 1 and 1 or 0)\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nIn this problem, a date is written as Y-M-D. For example, 2019-11-30 means November 30, 2019.\n\nIntegers M_1, D_1, M_2, and D_2 will be given as input.\n\nIt is known that the date 2019-M_2-D_2 follows 2019-M_1-D_1.\n\nDetermine whether the date 2019-M_1-D_1 is the last day of a month.\n\nConstraints\n\nBoth 2019-M_1-D_1 and 2019-M_2-D_2 are valid dates in the Gregorian calendar.\n\nThe date 2019-M_2-D_2 follows 2019-M_1-D_1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM_1 D_1\nM_2 D_2\n\nOutput\n\nIf the date 2019-M_1-D_1 is the last day of a month, print 1; otherwise, print 0.\n\nSample Input 1\n\n11 16\n11 17\n\nSample Output 1\n\n0\n\nNovember 16 is not the last day of a month.\n\nSample Input 2\n\n11 30\n12 1\n\nSample Output 2\n\n1\n\nNovember 30 is the last day of November.", "sample_input": "11 16\n11 17\n"}, "reference_outputs": ["0\n"], "source_document_id": "p02841", "source_text": "Score: 100 points\n\nProblem Statement\n\nIn this problem, a date is written as Y-M-D. For example, 2019-11-30 means November 30, 2019.\n\nIntegers M_1, D_1, M_2, and D_2 will be given as input.\n\nIt is known that the date 2019-M_2-D_2 follows 2019-M_1-D_1.\n\nDetermine whether the date 2019-M_1-D_1 is the last day of a month.\n\nConstraints\n\nBoth 2019-M_1-D_1 and 2019-M_2-D_2 are valid dates in the Gregorian calendar.\n\nThe date 2019-M_2-D_2 follows 2019-M_1-D_1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM_1 D_1\nM_2 D_2\n\nOutput\n\nIf the date 2019-M_1-D_1 is the last day of a month, print 1; otherwise, print 0.\n\nSample Input 1\n\n11 16\n11 17\n\nSample Output 1\n\n0\n\nNovember 16 is not the last day of a month.\n\nSample Input 2\n\n11 30\n12 1\n\nSample Output 2\n\n1\n\nNovember 30 is the last day of November.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 84, "cpu_time_ms": 80, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s199291047", "group_id": "codeNet:p02844", "input_text": "local function comp(a, b)\n return a < b\nend\n\nlocal function lower_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if not comp(ary[1], x) then return 1 end\n if comp(ary[num], x) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = (min + max) // 2\n if comp(ary[mid], x) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\n\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal t = {}\nfor i = 1, 10 do\n t[i] = {}\nend\nfor i = 1, n do\n local v = s:sub(i, i):byte() - 48\n if v == 0 then v = 10 end\n table.insert(t[v], i)\nend\nlocal ret = 0\nfor i = 1, 10 do\n local lb1 = lower_bound(t[i], 1)\n if lb1 <= #t[i] then\n local p1 = t[i][lb1]\n for j = 1, 10 do\n local lb2 = lower_bound(t[j], p1 + 1)\n if lb2 <= #t[j] then\n local p2 = t[j][lb2]\n for k = 1, 10 do\n local lb3 = lower_bound(t[k], p2 + 1)\n if lb3 <= #t[k] then\n ret = ret + 1\n end\n end\n end\n end\n end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1589861267, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s199291047.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s199291047", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local function comp(a, b)\n return a < b\nend\n\nlocal function lower_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if not comp(ary[1], x) then return 1 end\n if comp(ary[num], x) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = (min + max) // 2\n if comp(ary[mid], x) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\n\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal t = {}\nfor i = 1, 10 do\n t[i] = {}\nend\nfor i = 1, n do\n local v = s:sub(i, i):byte() - 48\n if v == 0 then v = 10 end\n table.insert(t[v], i)\nend\nlocal ret = 0\nfor i = 1, 10 do\n local lb1 = lower_bound(t[i], 1)\n if lb1 <= #t[i] then\n local p1 = t[i][lb1]\n for j = 1, 10 do\n local lb2 = lower_bound(t[j], p1 + 1)\n if lb2 <= #t[j] then\n local p2 = t[j][lb2]\n for k = 1, 10 do\n local lb3 = lower_bound(t[k], p2 + 1)\n if lb3 <= #t[k] then\n ret = ret + 1\n end\n end\n end\n end\n end\nend\nprint(ret)\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nAtCoder Inc. has decided to lock the door of its office with a 3-digit PIN code.\n\nThe company has an N-digit lucky number, S. Takahashi, the president, will erase N-3 digits from S and concatenate the remaining 3 digits without changing the order to set the PIN code.\n\nHow many different PIN codes can he set this way?\n\nBoth the lucky number and the PIN code may begin with a 0.\n\nConstraints\n\n4 \\leq N \\leq 30000\n\nS is a string of length N consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of different PIN codes Takahashi can set.\n\nSample Input 1\n\n4\n0224\n\nSample Output 1\n\n3\n\nTakahashi has the following options:\n\nErase the first digit of S and set 224.\n\nErase the second digit of S and set 024.\n\nErase the third digit of S and set 024.\n\nErase the fourth digit of S and set 022.\n\nThus, he can set three different PIN codes: 022, 024, and 224.\n\nSample Input 2\n\n6\n123123\n\nSample Output 2\n\n17\n\nSample Input 3\n\n19\n3141592653589793238\n\nSample Output 3\n\n329", "sample_input": "4\n0224\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02844", "source_text": "Score: 400 points\n\nProblem Statement\n\nAtCoder Inc. has decided to lock the door of its office with a 3-digit PIN code.\n\nThe company has an N-digit lucky number, S. Takahashi, the president, will erase N-3 digits from S and concatenate the remaining 3 digits without changing the order to set the PIN code.\n\nHow many different PIN codes can he set this way?\n\nBoth the lucky number and the PIN code may begin with a 0.\n\nConstraints\n\n4 \\leq N \\leq 30000\n\nS is a string of length N consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of different PIN codes Takahashi can set.\n\nSample Input 1\n\n4\n0224\n\nSample Output 1\n\n3\n\nTakahashi has the following options:\n\nErase the first digit of S and set 224.\n\nErase the second digit of S and set 024.\n\nErase the third digit of S and set 024.\n\nErase the fourth digit of S and set 022.\n\nThus, he can set three different PIN codes: 022, 024, and 224.\n\nSample Input 2\n\n6\n123123\n\nSample Output 2\n\n17\n\nSample Input 3\n\n19\n3141592653589793238\n\nSample Output 3\n\n329", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1044, "cpu_time_ms": 14, "memory_kb": 1400}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s864679037", "group_id": "codeNet:p02845", "input_text": "local n = io.read(\"*n\")\nlocal v1, v2, v3 = 0, 0, 0\nlocal ret = 1\nfor i = 1, n do\n local a = io.read(\"*n\")\n local c = 0\n if v1 == a then\n c = c + 1\n end\n if v2 == a then\n c = c + 1\n end\n if v3 == a then\n c = c + 1\n end\n ret = (ret * c) % 1000000007\n if v3 == a then\n v3 = v3 + 1\n elseif v2 == a then\n v2 = v2 + 1\n elseif v1 == a then\n v1 = v1 + 1\n end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1589861436, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02845.html", "problem_id": "p02845", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02845/input.txt", "sample_output_relpath": "derived/input_output/data/p02845/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02845/Lua/s864679037.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s864679037", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal v1, v2, v3 = 0, 0, 0\nlocal ret = 1\nfor i = 1, n do\n local a = io.read(\"*n\")\n local c = 0\n if v1 == a then\n c = c + 1\n end\n if v2 == a then\n c = c + 1\n end\n if v3 == a then\n c = c + 1\n end\n ret = (ret * c) % 1000000007\n if v3 == a then\n v3 = v3 + 1\n elseif v2 == a then\n v2 = v2 + 1\n elseif v1 == a then\n v1 = v1 + 1\n end\nend\nprint(ret)\n", "problem_context": "Score: 500 points\n\nProblem Statement\n\nN people are standing in a queue, numbered 1, 2, 3, ..., N from front to back. Each person wears a hat, which is red, blue, or green.\n\nThe person numbered i says:\n\n\"In front of me, exactly A_i people are wearing hats with the same color as mine.\"\n\nAssuming that all these statements are correct, find the number of possible combinations of colors of the N people's hats.\n\nSince the count can be enormous, compute it modulo 1000000007.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\n0 \\leq A_i \\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\nA_1 A_2 A_3 ... A_N\n\nOutput\n\nPrint the number of possible combinations of colors of the N people's hats, modulo 1000000007.\n\nSample Input 1\n\n6\n0 1 2 3 4 5\n\nSample Output 1\n\n3\n\nWe have three possible combinations, as follows:\n\nRed, Red, Red, Red, Red, Red\n\nBlue, Blue, Blue, Blue, Blue, Blue\n\nGreen, Green, Green, Green, Green, Green\n\nSample Input 2\n\n3\n0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n54\n0 0 1 0 1 2 1 2 3 2 3 3 4 4 5 4 6 5 7 8 5 6 6 7 7 8 8 9 9 10 10 11 9 12 10 13 14 11 11 12 12 13 13 14 14 15 15 15 16 16 16 17 17 17\n\nSample Output 3\n\n115295190", "sample_input": "6\n0 1 2 3 4 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02845", "source_text": "Score: 500 points\n\nProblem Statement\n\nN people are standing in a queue, numbered 1, 2, 3, ..., N from front to back. Each person wears a hat, which is red, blue, or green.\n\nThe person numbered i says:\n\n\"In front of me, exactly A_i people are wearing hats with the same color as mine.\"\n\nAssuming that all these statements are correct, find the number of possible combinations of colors of the N people's hats.\n\nSince the count can be enormous, compute it modulo 1000000007.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\n0 \\leq A_i \\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\nA_1 A_2 A_3 ... A_N\n\nOutput\n\nPrint the number of possible combinations of colors of the N people's hats, modulo 1000000007.\n\nSample Input 1\n\n6\n0 1 2 3 4 5\n\nSample Output 1\n\n3\n\nWe have three possible combinations, as follows:\n\nRed, Red, Red, Red, Red, Red\n\nBlue, Blue, Blue, Blue, Blue, Blue\n\nGreen, Green, Green, Green, Green, Green\n\nSample Input 2\n\n3\n0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n54\n0 0 1 0 1 2 1 2 3 2 3 3 4 4 5 4 6 5 7 8 5 6 6 7 7 8 8 9 9 10 10 11 9 12 10 13 14 11 11 12 12 13 13 14 14 15 15 15 16 16 16 17 17 17\n\nSample Output 3\n\n115295190", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 39, "memory_kb": 376}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s498432018", "group_id": "codeNet:p02847", "input_text": "t={SUN=7\n,MON=6\n,TUE=5\n,WED=4\n,THU=3\n,FRI=2\n,SAT=1\n}\nS=io.read()\nprint(t[S])", "language": "Lua", "metadata": {"date": 1587768080, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02847.html", "problem_id": "p02847", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02847/input.txt", "sample_output_relpath": "derived/input_output/data/p02847/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02847/Lua/s498432018.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s498432018", "user_id": "u726173718"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "t={SUN=7\n,MON=6\n,TUE=5\n,WED=4\n,THU=3\n,FRI=2\n,SAT=1\n}\nS=io.read()\nprint(t[S])", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a string S representing the day of the week today.\n\nS is SUN, MON, TUE, WED, THU, FRI, or SAT, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, respectively.\n\nAfter how many days is the next Sunday (tomorrow or later)?\n\nConstraints\n\nS is SUN, MON, TUE, WED, THU, FRI, or SAT.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of days before the next Sunday.\n\nSample Input 1\n\nSAT\n\nSample Output 1\n\n1\n\nIt is Saturday today, and tomorrow will be Sunday.\n\nSample Input 2\n\nSUN\n\nSample Output 2\n\n7\n\nIt is Sunday today, and seven days later, it will be Sunday again.", "sample_input": "SAT\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02847", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a string S representing the day of the week today.\n\nS is SUN, MON, TUE, WED, THU, FRI, or SAT, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, respectively.\n\nAfter how many days is the next Sunday (tomorrow or later)?\n\nConstraints\n\nS is SUN, MON, TUE, WED, THU, FRI, or SAT.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of days before the next Sunday.\n\nSample Input 1\n\nSAT\n\nSample Output 1\n\n1\n\nIt is Saturday today, and tomorrow will be Sunday.\n\nSample Input 2\n\nSUN\n\nSample Output 2\n\n7\n\nIt is Sunday today, and seven days later, it will be Sunday again.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s745656768", "group_id": "codeNet:p02848", "input_text": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nfor i = 1, #s do\n io.write(string.char((s:sub(i, i):byte() - 65 + n) % 26 + 65))\nend\nio.write(\"\\n\")\n", "language": "Lua", "metadata": {"date": 1575004106, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s745656768.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s745656768", "user_id": "u120582723"}, "prompt_components": {"gold_output": "CDEZAB\n", "input_to_evaluate": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nfor i = 1, #s do\n io.write(string.char((s:sub(i, i):byte() - 65 + n) % 26 + 65))\nend\nio.write(\"\\n\")\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a string S consisting of uppercase English letters. Additionally, an integer N will be given.\n\nShift each character of S by N in alphabetical order (see below), and print the resulting string.\n\nWe assume that A follows Z. For example, shifting A by 2 results in C (A \\to B \\to C), and shifting Y by 3 results in B (Y \\to Z \\to A \\to B).\n\nConstraints\n\n0 \\leq N \\leq 26\n\n1 \\leq |S| \\leq 10^4\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the string resulting from shifting each character of S by N in alphabetical order.\n\nSample Input 1\n\n2\nABCXYZ\n\nSample Output 1\n\nCDEZAB\n\nNote that A follows Z.\n\nSample Input 2\n\n0\nABCXYZ\n\nSample Output 2\n\nABCXYZ\n\nSample Input 3\n\n13\nABCDEFGHIJKLMNOPQRSTUVWXYZ\n\nSample Output 3\n\nNOPQRSTUVWXYZABCDEFGHIJKLM", "sample_input": "2\nABCXYZ\n"}, "reference_outputs": ["CDEZAB\n"], "source_document_id": "p02848", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a string S consisting of uppercase English letters. Additionally, an integer N will be given.\n\nShift each character of S by N in alphabetical order (see below), and print the resulting string.\n\nWe assume that A follows Z. For example, shifting A by 2 results in C (A \\to B \\to C), and shifting Y by 3 results in B (Y \\to Z \\to A \\to B).\n\nConstraints\n\n0 \\leq N \\leq 26\n\n1 \\leq |S| \\leq 10^4\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the string resulting from shifting each character of S by N in alphabetical order.\n\nSample Input 1\n\n2\nABCXYZ\n\nSample Output 1\n\nCDEZAB\n\nNote that A follows Z.\n\nSample Input 2\n\n0\nABCXYZ\n\nSample Output 2\n\nABCXYZ\n\nSample Input 3\n\n13\nABCDEFGHIJKLMNOPQRSTUVWXYZ\n\nSample Output 3\n\nNOPQRSTUVWXYZABCDEFGHIJKLM", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 151, "cpu_time_ms": 10, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s446159663", "group_id": "codeNet:p02850", "input_text": "local n = io.read(\"*n\")\nlocal nodecol = {}\nlocal edgecol = {}\nlocal edge = {}\nfor i = 1, n do\n nodecol[i] = 0\n edge[i] = {}\nend\nfor i = 1, n - 1 do\n edgecol[i] = 0\n local a, b = io.read(\"*n\", \"*n\")\n edge[a][b] = i\n edge[b][a] = i\nend\nlocal snode = 0\nfor i = 1, n do\n local edgecnt = 0\n for k, v in pairs(edge[i]) do\n edgecnt = edgecnt + 1\n end\n if edgecnt == 1 then\n snode = i\n break\n end\nend\nnodecol[snode] = 1\nlocal tasknode = {}\nfor dstnode, edgeid in pairs(edge[snode]) do\n nodecol[dstnode] = 1\n edgecol[edgeid] = 1\n table.insert(tasknode, dstnode)\nend\nlocal maxcol = 1\nlocal mma = math.max\nfor i = 1, n - 1 do\n local srcnode = tasknode[i]\n local srccol = nodecol[srcnode]\n local curcol = 1\n for dstnode, edgeid in pairs(edge[srcnode]) do\n if nodecol[dstnode] == 0 then\n if curcol == srccol then curcol = curcol + 1 end\n nodecol[dstnode] = curcol\n edgecol[edgeid] = curcol\n maxcol = mma(maxcol, curcol)\n table.insert(tasknode, dstnode)\n curcol = curcol + 1\n end\n end\nend\nprint(maxcol)\nfor i = 1, n - 1 do\n print(edgecol[i])\nend\n", "language": "Lua", "metadata": {"date": 1574811752, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02850.html", "problem_id": "p02850", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02850/input.txt", "sample_output_relpath": "derived/input_output/data/p02850/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02850/Lua/s446159663.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s446159663", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n1\n2\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal nodecol = {}\nlocal edgecol = {}\nlocal edge = {}\nfor i = 1, n do\n nodecol[i] = 0\n edge[i] = {}\nend\nfor i = 1, n - 1 do\n edgecol[i] = 0\n local a, b = io.read(\"*n\", \"*n\")\n edge[a][b] = i\n edge[b][a] = i\nend\nlocal snode = 0\nfor i = 1, n do\n local edgecnt = 0\n for k, v in pairs(edge[i]) do\n edgecnt = edgecnt + 1\n end\n if edgecnt == 1 then\n snode = i\n break\n end\nend\nnodecol[snode] = 1\nlocal tasknode = {}\nfor dstnode, edgeid in pairs(edge[snode]) do\n nodecol[dstnode] = 1\n edgecol[edgeid] = 1\n table.insert(tasknode, dstnode)\nend\nlocal maxcol = 1\nlocal mma = math.max\nfor i = 1, n - 1 do\n local srcnode = tasknode[i]\n local srccol = nodecol[srcnode]\n local curcol = 1\n for dstnode, edgeid in pairs(edge[srcnode]) do\n if nodecol[dstnode] == 0 then\n if curcol == srccol then curcol = curcol + 1 end\n nodecol[dstnode] = curcol\n edgecol[edgeid] = curcol\n maxcol = mma(maxcol, curcol)\n table.insert(tasknode, dstnode)\n curcol = curcol + 1\n end\n end\nend\nprint(maxcol)\nfor i = 1, n - 1 do\n print(edgecol[i])\nend\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a tree G with N vertices.\nThe vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i.\n\nConsider painting the edges in G with some number of colors.\nWe want to paint them so that, for each vertex, the colors of the edges incident to that vertex are all different.\n\nAmong the colorings satisfying the condition above, construct one that uses the minimum number of colors.\n\nConstraints\n\n2 \\le N \\le 10^5\n\n1 \\le a_i \\lt b_i \\le N\n\nAll values in input are integers.\n\nThe given graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\na_2 b_2\n\\vdots\na_{N-1} b_{N-1}\n\nOutput\n\nPrint N lines.\n\nThe first line should contain K, the number of colors used.\n\nThe (i+1)-th line (1 \\le i \\le N-1) should contain c_i, the integer representing the color of the i-th edge, where 1 \\le c_i \\le K must hold.\n\nIf there are multiple colorings with the minimum number of colors that satisfy the condition, printing any of them will be accepted.\n\nSample Input 1\n\n3\n1 2\n2 3\n\nSample Output 1\n\n2\n1\n2\n\nSample Input 2\n\n8\n1 2\n2 3\n2 4\n2 5\n4 7\n5 6\n6 8\n\nSample Output 2\n\n4\n1\n2\n3\n4\n1\n1\n2\n\nSample Input 3\n\n6\n1 2\n1 3\n1 4\n1 5\n1 6\n\nSample Output 3\n\n5\n1\n2\n3\n4\n5", "sample_input": "3\n1 2\n2 3\n"}, "reference_outputs": ["2\n1\n2\n"], "source_document_id": "p02850", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a tree G with N vertices.\nThe vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i.\n\nConsider painting the edges in G with some number of colors.\nWe want to paint them so that, for each vertex, the colors of the edges incident to that vertex are all different.\n\nAmong the colorings satisfying the condition above, construct one that uses the minimum number of colors.\n\nConstraints\n\n2 \\le N \\le 10^5\n\n1 \\le a_i \\lt b_i \\le N\n\nAll values in input are integers.\n\nThe given graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\na_2 b_2\n\\vdots\na_{N-1} b_{N-1}\n\nOutput\n\nPrint N lines.\n\nThe first line should contain K, the number of colors used.\n\nThe (i+1)-th line (1 \\le i \\le N-1) should contain c_i, the integer representing the color of the i-th edge, where 1 \\le c_i \\le K must hold.\n\nIf there are multiple colorings with the minimum number of colors that satisfy the condition, printing any of them will be accepted.\n\nSample Input 1\n\n3\n1 2\n2 3\n\nSample Output 1\n\n2\n1\n2\n\nSample Input 2\n\n8\n1 2\n2 3\n2 4\n2 5\n4 7\n5 6\n6 8\n\nSample Output 2\n\n4\n1\n2\n3\n4\n1\n1\n2\n\nSample Input 3\n\n6\n1 2\n1 3\n1 4\n1 5\n1 6\n\nSample Output 3\n\n5\n1\n2\n3\n4\n5", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1097, "cpu_time_ms": 187, "memory_kb": 15984}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s441343410", "group_id": "codeNet:p02851", "input_text": "local n, k = io.read(\"*n\", \"*n\")\nlocal function modsub(a, b)\n if a < b then return a + k - b\n else return a - b\n end\nend\n\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\") % k\nend\nlocal sum = {a[1]}\nfor i = 2, n do\n sum[i] = (sum[i - 1] + a[i]) % k\nend\nfor i = 1, n do\n sum[i] = modsub(sum[i], i)\nend\nlocal remlist, remlist_uniq = {0}, {}\nremlist_uniq[0] = true\nfor i = 1, n do\n if not remlist_uniq[sum[i]] then\n remlist_uniq[sum[i]] = true\n table.insert(remlist, sum[i])\n end\nend\nlocal remlist_inv = {}\nlocal remcnt = {}\nfor i = 1, #remlist do\n remlist_inv[remlist[i]] = i\n remcnt[i] = 0\nend\nremcnt[remlist_inv[0]] = 1\nlocal ret = 0\nfor i = 1, n do\n local reminv = remlist_inv[sum[i]]\n ret = ret + remcnt[reminv]\n remcnt[reminv] = remcnt[reminv] + 1\n if i == k then\n remcnt[remlist_inv[0]] = remcnt[remlist_inv[0]] - 1\n elseif k < i then\n remcnt[remlist_inv[sum[i - k]]] = remcnt[remlist_inv[sum[i - k]]] - 1\n end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1574721523, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s441343410.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s441343410", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local n, k = io.read(\"*n\", \"*n\")\nlocal function modsub(a, b)\n if a < b then return a + k - b\n else return a - b\n end\nend\n\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\") % k\nend\nlocal sum = {a[1]}\nfor i = 2, n do\n sum[i] = (sum[i - 1] + a[i]) % k\nend\nfor i = 1, n do\n sum[i] = modsub(sum[i], i)\nend\nlocal remlist, remlist_uniq = {0}, {}\nremlist_uniq[0] = true\nfor i = 1, n do\n if not remlist_uniq[sum[i]] then\n remlist_uniq[sum[i]] = true\n table.insert(remlist, sum[i])\n end\nend\nlocal remlist_inv = {}\nlocal remcnt = {}\nfor i = 1, #remlist do\n remlist_inv[remlist[i]] = i\n remcnt[i] = 0\nend\nremcnt[remlist_inv[0]] = 1\nlocal ret = 0\nfor i = 1, n do\n local reminv = remlist_inv[sum[i]]\n ret = ret + remcnt[reminv]\n remcnt[reminv] = remcnt[reminv] + 1\n if i == k then\n remcnt[remlist_inv[0]] = remcnt[remlist_inv[0]] - 1\n elseif k < i then\n remcnt[remlist_inv[sum[i - k]]] = remcnt[remlist_inv[sum[i - k]]] - 1\n end\nend\nprint(ret)\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 960, "cpu_time_ms": 163, "memory_kb": 24028}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s947086461", "group_id": "codeNet:p02854", "input_text": "n=io.read(\"*n\",\"*l\")\na={0}\nfor i=1,n do\n a[i]=io.read(\"*n\")\nend\n\nb={a[1]}\nfor i=2,n do\n b[i]=b[i-1]+a[i]\nend\nc={b[n]}\nfor i=2,n do\n c[i]=c[i-1]-a[i-1]\nend\n\nminyen=2020202020\nfor i=1,n-1 do\n minyen=math.min(minyen,math.abs(b[i]-c[i+1]))\nend\nprint(minyen)", "language": "Lua", "metadata": {"date": 1588388118, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s947086461.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s947086461", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "n=io.read(\"*n\",\"*l\")\na={0}\nfor i=1,n do\n a[i]=io.read(\"*n\")\nend\n\nb={a[1]}\nfor i=2,n do\n b[i]=b[i-1]+a[i]\nend\nc={b[n]}\nfor i=2,n do\n c[i]=c[i-1]-a[i-1]\nend\n\nminyen=2020202020\nfor i=1,n-1 do\n minyen=math.min(minyen,math.abs(b[i]-c[i+1]))\nend\nprint(minyen)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 265, "cpu_time_ms": 53, "memory_kb": 6528}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s247101436", "group_id": "codeNet:p02859", "input_text": "print(r^2)", "language": "Lua", "metadata": {"date": 1588569372, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02859.html", "problem_id": "p02859", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02859/input.txt", "sample_output_relpath": "derived/input_output/data/p02859/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02859/Lua/s247101436.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s247101436", "user_id": "u540534068"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "print(r^2)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer r.\n\nHow many times is the area of a circle of radius r larger than the area of a circle of radius 1?\n\nIt can be proved that the answer is always an integer under the constraints given.\n\nConstraints\n\n1 \\leq r \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr\n\nOutput\n\nPrint the area of a circle of radius r, divided by the area of a circle of radius 1, as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n4\n\nThe area of a circle of radius 2 is 4 times larger than the area of a circle of radius 1.\n\nNote that output must be an integer - for example, 4.0 will not be accepted.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n10000", "sample_input": "2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02859", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer r.\n\nHow many times is the area of a circle of radius r larger than the area of a circle of radius 1?\n\nIt can be proved that the answer is always an integer under the constraints given.\n\nConstraints\n\n1 \\leq r \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr\n\nOutput\n\nPrint the area of a circle of radius r, divided by the area of a circle of radius 1, as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n4\n\nThe area of a circle of radius 2 is 4 times larger than the area of a circle of radius 1.\n\nNote that output must be an integer - for example, 4.0 will not be accepted.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n10000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 10, "cpu_time_ms": 7, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s343604170", "group_id": "codeNet:p02859", "input_text": "x = io.read\"*n\"\nprint(x*x)", "language": "Lua", "metadata": {"date": 1587783228, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02859.html", "problem_id": "p02859", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02859/input.txt", "sample_output_relpath": "derived/input_output/data/p02859/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02859/Lua/s343604170.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s343604170", "user_id": "u373047809"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "x = io.read\"*n\"\nprint(x*x)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer r.\n\nHow many times is the area of a circle of radius r larger than the area of a circle of radius 1?\n\nIt can be proved that the answer is always an integer under the constraints given.\n\nConstraints\n\n1 \\leq r \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr\n\nOutput\n\nPrint the area of a circle of radius r, divided by the area of a circle of radius 1, as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n4\n\nThe area of a circle of radius 2 is 4 times larger than the area of a circle of radius 1.\n\nNote that output must be an integer - for example, 4.0 will not be accepted.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n10000", "sample_input": "2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02859", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer r.\n\nHow many times is the area of a circle of radius r larger than the area of a circle of radius 1?\n\nIt can be proved that the answer is always an integer under the constraints given.\n\nConstraints\n\n1 \\leq r \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr\n\nOutput\n\nPrint the area of a circle of radius r, divided by the area of a circle of radius 1, as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n4\n\nThe area of a circle of radius 2 is 4 times larger than the area of a circle of radius 1.\n\nNote that output must be an integer - for example, 4.0 will not be accepted.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n10000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 26, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s472613187", "group_id": "codeNet:p02859", "input_text": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\n----\n-- A\nlocal A = read.nn()\nlocal ans = A*A\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1573956040, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02859.html", "problem_id": "p02859", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02859/input.txt", "sample_output_relpath": "derived/input_output/data/p02859/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02859/Lua/s472613187.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s472613187", "user_id": "u162773977"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\n----\n-- A\nlocal A = read.nn()\nlocal ans = A*A\nprint(ans)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer r.\n\nHow many times is the area of a circle of radius r larger than the area of a circle of radius 1?\n\nIt can be proved that the answer is always an integer under the constraints given.\n\nConstraints\n\n1 \\leq r \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr\n\nOutput\n\nPrint the area of a circle of radius r, divided by the area of a circle of radius 1, as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n4\n\nThe area of a circle of radius 2 is 4 times larger than the area of a circle of radius 1.\n\nNote that output must be an integer - for example, 4.0 will not be accepted.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n10000", "sample_input": "2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02859", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer r.\n\nHow many times is the area of a circle of radius r larger than the area of a circle of radius 1?\n\nIt can be proved that the answer is always an integer under the constraints given.\n\nConstraints\n\n1 \\leq r \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr\n\nOutput\n\nPrint the area of a circle of radius r, divided by the area of a circle of radius 1, as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n4\n\nThe area of a circle of radius 2 is 4 times larger than the area of a circle of radius 1.\n\nNote that output must be an integer - for example, 4.0 will not be accepted.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n10000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 603, "cpu_time_ms": 40, "memory_kb": 1132}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s413650025", "group_id": "codeNet:p02860", "input_text": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\n----\n-- B\nlocal N = read.nl()\nlocal S = read.l()\nlocal h = S:sub(1, N//2)\nif S == h..h then\n print(\"Yes\")\nelse\n print(\"No\")\nend", "language": "Lua", "metadata": {"date": 1573956131, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s413650025.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s413650025", "user_id": "u162773977"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\n----\n-- B\nlocal N = read.nl()\nlocal S = read.l()\nlocal h = S:sub(1, N//2)\nif S == h..h then\n print(\"Yes\")\nelse\n print(\"No\")\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s116886420", "group_id": "codeNet:p02861", "input_text": "local msq = math.sqrt\nlocal n = io.read(\"*n\")\nlocal x, y = {}, {}\nfor i = 1, n do\n x[i], y[i] = io.read(\"*n\", \"*n\")\nend\nlocal function getlen(i, j)\n return msq((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]))\nend\nlocal tot = 1\nfor i = 2, n do\n tot = tot * i\nend\nlocal function getpattern(n, patall, idx)\n local used = {}\n local retary = {}\n local div = patall\n for i = 1, n do used[i] = false end\n for i = n, 1, -1 do\n div = div // i\n local v_idx = idx // div\n idx = idx % div\n local tmp_idx = 0\n for j = 1, n do\n if not used[j] then\n if tmp_idx == v_idx then\n table.insert(retary, j)\n used[j] = true\n break\n else\n tmp_idx = tmp_idx + 1\n end\n end\n end\n end\n return retary\nend\nlocal ans = 0\nfor i = 0, tot - 1 do\n local ary = getpattern(n, tot, i)\n for j = 1, n - 1 do\n ans = ans + getlen(ary[j], ary[j + 1])\n end\nend\nprint(ans / tot)\n", "language": "Lua", "metadata": {"date": 1600543065, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s116886420.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s116886420", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2.2761423749\n", "input_to_evaluate": "local msq = math.sqrt\nlocal n = io.read(\"*n\")\nlocal x, y = {}, {}\nfor i = 1, n do\n x[i], y[i] = io.read(\"*n\", \"*n\")\nend\nlocal function getlen(i, j)\n return msq((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]))\nend\nlocal tot = 1\nfor i = 2, n do\n tot = tot * i\nend\nlocal function getpattern(n, patall, idx)\n local used = {}\n local retary = {}\n local div = patall\n for i = 1, n do used[i] = false end\n for i = n, 1, -1 do\n div = div // i\n local v_idx = idx // div\n idx = idx % div\n local tmp_idx = 0\n for j = 1, n do\n if not used[j] then\n if tmp_idx == v_idx then\n table.insert(retary, j)\n used[j] = true\n break\n else\n tmp_idx = tmp_idx + 1\n end\n end\n end\n end\n return retary\nend\nlocal ans = 0\nfor i = 0, tot - 1 do\n local ary = getpattern(n, tot, i)\n for j = 1, n - 1 do\n ans = ans + getlen(ary[j], ary[j + 1])\n end\nend\nprint(ans / tot)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 949, "cpu_time_ms": 185, "memory_kb": 2956}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s212187760", "group_id": "codeNet:p02861", "input_text": "local function reada(n,m)m=m or 1 r={}for i=1,m do r[i]={}end for i=1,n do for j=1,m do r[j][i]=io.read\"*n\"end end return unpack(r)end\nN=io.read\"*n\"\nx,y=reada(N,2)\nfunction d(x1,y1,x2,y2)return math.sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))end\n\ns=0\nfor i=1,N do\nfor j=1,i-1 do\ns=s+d(x[i],y[i],x[j],y[j])\nend\nend\nprint(s/N*2)", "language": "Lua", "metadata": {"date": 1587769109, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s212187760.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s212187760", "user_id": "u726173718"}, "prompt_components": {"gold_output": "2.2761423749\n", "input_to_evaluate": "local function reada(n,m)m=m or 1 r={}for i=1,m do r[i]={}end for i=1,n do for j=1,m do r[j][i]=io.read\"*n\"end end return unpack(r)end\nN=io.read\"*n\"\nx,y=reada(N,2)\nfunction d(x1,y1,x2,y2)return math.sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))end\n\ns=0\nfor i=1,N do\nfor j=1,i-1 do\ns=s+d(x[i],y[i],x[j],y[j])\nend\nend\nprint(s/N*2)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Lua:s420217443", "group_id": "codeNet:p02861", "input_text": "local mfl = math.floor\n\nlocal function get_ary_from_idx(idx, n)\n idx = idx - 1\n local box = {}\n for i = 1, n do box[i] = true end\n local rettbl = {}\n for i = n, 1, -1 do\n local pos = idx % i + 1\n idx = mfl(idx / i)\n local cnt = 0\n for j = 1, n do\n if box[j] then\n cnt = cnt + 1\n if cnt == pos then\n box[j] = false\n table.insert(rettbl, j)\n break\n end\n end\n end\n end\n return rettbl\nend\n\nlocal function get_idx_from_ary(ary)\n local retidx = 0\n local n = #ary\n local cpy = {}\n for i = 1, n do cpy[i] = ary[i] end\n for i = 1, n - 1 do\n for j = i + 1, n do\n if cpy[i] < cpy[j] then cpy[j] = cpy[j] - 1 end\n end\n end\n for i = n, 1, -1 do\n retidx = retidx * (n + 1 - i) + cpy[i] - 1\n end\n return retidx + 1\nend\n\nlocal n = io.read(\"*n\")\nlocal x, y = {}, {}\nfor i = 1, n do\n x[i], y[i] = io.read(\"*n\", \"*n\")\nend\n\nlocal allpat = 1\nfor i = 1, n do\n allpat = allpat * i\nend\n\nlocal msq = math.sqrt\nlocal function getlen(p, q)\n return msq((x[p] - x[q]) * (x[p] - x[q]) + (y[p] - y[q]) * (y[p] - y[q]))\nend\nlocal len = 0\nfor i = 1, allpat do\n local a = get_ary_from_idx(i, n)\n for j = 1, #a - 1 do\n len = len + getlen(a[j], a[j + 1])\n end\nend\nprint(string.format(\"%.10f\", len / allpat))\n", "language": "Lua", "metadata": {"date": 1573958474, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s420217443.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s420217443", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2.2761423749\n", "input_to_evaluate": "local mfl = math.floor\n\nlocal function get_ary_from_idx(idx, n)\n idx = idx - 1\n local box = {}\n for i = 1, n do box[i] = true end\n local rettbl = {}\n for i = n, 1, -1 do\n local pos = idx % i + 1\n idx = mfl(idx / i)\n local cnt = 0\n for j = 1, n do\n if box[j] then\n cnt = cnt + 1\n if cnt == pos then\n box[j] = false\n table.insert(rettbl, j)\n break\n end\n end\n end\n end\n return rettbl\nend\n\nlocal function get_idx_from_ary(ary)\n local retidx = 0\n local n = #ary\n local cpy = {}\n for i = 1, n do cpy[i] = ary[i] end\n for i = 1, n - 1 do\n for j = i + 1, n do\n if cpy[i] < cpy[j] then cpy[j] = cpy[j] - 1 end\n end\n end\n for i = n, 1, -1 do\n retidx = retidx * (n + 1 - i) + cpy[i] - 1\n end\n return retidx + 1\nend\n\nlocal n = io.read(\"*n\")\nlocal x, y = {}, {}\nfor i = 1, n do\n x[i], y[i] = io.read(\"*n\", \"*n\")\nend\n\nlocal allpat = 1\nfor i = 1, n do\n allpat = allpat * i\nend\n\nlocal msq = math.sqrt\nlocal function getlen(p, q)\n return msq((x[p] - x[q]) * (x[p] - x[q]) + (y[p] - y[q]) * (y[p] - y[q]))\nend\nlocal len = 0\nfor i = 1, allpat do\n local a = get_ary_from_idx(i, n)\n for j = 1, #a - 1 do\n len = len + getlen(a[j], a[j + 1])\n end\nend\nprint(string.format(\"%.10f\", len / allpat))\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1284, "cpu_time_ms": 47, "memory_kb": 384}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s173056468", "group_id": "codeNet:p02862", "input_text": "local mfl = math.floor\nlocal mod = 1000000007\nlocal function bmul(x, y)\n local x0, y0 = x % 31623, y % 31623\n local x1, y1 = mfl(x / 31623), mfl(y / 31623)\n return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\n\nlocal function getComb(n, k)\n local ret = 1\n for i = 1, k do\n ret = bmul(ret, n + 1 - i)\n ret = bmul(ret, modinv(i))\n end\n return ret\nend\n\nlocal x, y = io.read(\"*n\", \"*n\")\nif (x + y) % 3 ~= 0 then\n print(0)\nelse\n local n = mfl((x + y) / 3)\n if x < n or y < n then\n print(0)\n else\n x = x - n\n y = y - n\n print(getComb(n, y))\n end\nend\n", "language": "Lua", "metadata": {"date": 1573958693, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02862.html", "problem_id": "p02862", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02862/input.txt", "sample_output_relpath": "derived/input_output/data/p02862/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02862/Lua/s173056468.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s173056468", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local mfl = math.floor\nlocal mod = 1000000007\nlocal function bmul(x, y)\n local x0, y0 = x % 31623, y % 31623\n local x1, y1 = mfl(x / 31623), mfl(y / 31623)\n return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\n\nlocal function getComb(n, k)\n local ret = 1\n for i = 1, k do\n ret = bmul(ret, n + 1 - i)\n ret = bmul(ret, modinv(i))\n end\n return ret\nend\n\nlocal x, y = io.read(\"*n\", \"*n\")\nif (x + y) % 3 ~= 0 then\n print(0)\nelse\n local n = mfl((x + y) / 3)\n if x < n or y < n then\n print(0)\n else\n x = x - n\n y = y - n\n print(getComb(n, y))\n end\nend\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a knight - the chess piece - at the origin (0, 0) of a two-dimensional grid.\n\nWhen the knight is at the square (i, j), it can be moved to either (i+1,j+2) or (i+2, j+1).\n\nIn how many ways can the knight reach the square (X, Y)?\n\nFind the number of ways modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq X \\leq 10^6\n\n1 \\leq Y \\leq 10^6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the number of ways for the knight to reach (X, Y) from (0, 0), modulo 10^9 + 7.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\n2\n\nThere are two ways: (0,0) \\to (1,2) \\to (3,3) and (0,0) \\to (2,1) \\to (3,3).\n\nSample Input 2\n\n2 2\n\nSample Output 2\n\n0\n\nThe knight cannot reach (2,2).\n\nSample Input 3\n\n999999 999999\n\nSample Output 3\n\n151840682\n\nPrint the number of ways modulo 10^9 + 7.", "sample_input": "3 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02862", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere is a knight - the chess piece - at the origin (0, 0) of a two-dimensional grid.\n\nWhen the knight is at the square (i, j), it can be moved to either (i+1,j+2) or (i+2, j+1).\n\nIn how many ways can the knight reach the square (X, Y)?\n\nFind the number of ways modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq X \\leq 10^6\n\n1 \\leq Y \\leq 10^6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the number of ways for the knight to reach (X, Y) from (0, 0), modulo 10^9 + 7.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\n2\n\nThere are two ways: (0,0) \\to (1,2) \\to (3,3) and (0,0) \\to (2,1) \\to (3,3).\n\nSample Input 2\n\n2 2\n\nSample Output 2\n\n0\n\nThe knight cannot reach (2,2).\n\nSample Input 3\n\n999999 999999\n\nSample Output 3\n\n151840682\n\nPrint the number of ways modulo 10^9 + 7.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 877, "cpu_time_ms": 390, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s352377520", "group_id": "codeNet:p02863", "input_text": "local mma = math.max\nlocal n, t = io.read(\"*n\", \"*n\")\nlocal a, b = {}, {}\nfor i = 1, n do\n a[i], b[i] = io.read(\"*n\", \"*n\")\nend\n\nlocal function solve()\n if t == 1 then\n local t1ret = b[1]\n for i = 2, n do\n t1ret = mma(t1ret, b[i])\n end\n return t1ret\n end\n local totret = 0\n local tail = {}\n for i = 1, n do\n tail[i] = {}\n for j = 1, t - 1 do\n tail[i][j] = 0\n end\n end\n local curmax = 0\n for i = n, 1, -1 do\n for j = 1, curmax do\n tail[i][j] = mma(tail[i][j], tail[i + 1][j])\n if j + a[i] < t then\n tail[i][j + a[i]] = mma(tail[i][j + a[i]], tail[i + 1][j] + b[i])\n curmax = mma(curmax, j + a[i])\n end\n end\n if a[i] < t then\n tail[i][a[i]] = mma(tail[i][a[i]], b[i])\n curmax = mma(curmax, a[i])\n end\n end\n local head = {}\n for i = 1, t - 1 do\n head[i] = 0\n end\n curmax = 0\n for i = 1, n - 1 do\n local headmax = {}\n headmax[1] = head[1]\n for j = 2, t - 1 do\n headmax[j] = mma(head[j], headmax[j - 1])\n end\n local tailmax = {}\n tailmax[1] = tail[i + 1][1]\n for j = 2, t - 1 do\n tailmax[j] = mma(tail[i + 1][j], tailmax[j - 1])\n end\n local iret = 0\n if 1 < t then iret = mma(headmax[t - 1], tailmax[t - 1]) end\n for j = 1, t - 2 do\n iret = mma(iret, headmax[j] + tailmax[t - 1 - j])\n end\n iret = iret + b[i]\n totret = mma(totret, iret)\n for j = t - 1 - a[i], 1, -1 do\n head[j + a[i]] = mma(head[j + a[i]], head[j] + b[i])\n end\n end\n do -- i == n\n local headmax = {}\n headmax[1] = head[1]\n for j = 2, t - 1 do\n headmax[j] = mma(head[j], headmax[j - 1])\n end\n local iret = 1 < t and headmax[t - 1] or 0\n iret = iret + b[n]\n totret = mma(totret, iret)\n end\n return totret\nend\nprint(solve())\n", "language": "Lua", "metadata": {"date": 1573959139, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02863.html", "problem_id": "p02863", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02863/input.txt", "sample_output_relpath": "derived/input_output/data/p02863/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02863/Lua/s352377520.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s352377520", "user_id": "u120582723"}, "prompt_components": {"gold_output": "110\n", "input_to_evaluate": "local mma = math.max\nlocal n, t = io.read(\"*n\", \"*n\")\nlocal a, b = {}, {}\nfor i = 1, n do\n a[i], b[i] = io.read(\"*n\", \"*n\")\nend\n\nlocal function solve()\n if t == 1 then\n local t1ret = b[1]\n for i = 2, n do\n t1ret = mma(t1ret, b[i])\n end\n return t1ret\n end\n local totret = 0\n local tail = {}\n for i = 1, n do\n tail[i] = {}\n for j = 1, t - 1 do\n tail[i][j] = 0\n end\n end\n local curmax = 0\n for i = n, 1, -1 do\n for j = 1, curmax do\n tail[i][j] = mma(tail[i][j], tail[i + 1][j])\n if j + a[i] < t then\n tail[i][j + a[i]] = mma(tail[i][j + a[i]], tail[i + 1][j] + b[i])\n curmax = mma(curmax, j + a[i])\n end\n end\n if a[i] < t then\n tail[i][a[i]] = mma(tail[i][a[i]], b[i])\n curmax = mma(curmax, a[i])\n end\n end\n local head = {}\n for i = 1, t - 1 do\n head[i] = 0\n end\n curmax = 0\n for i = 1, n - 1 do\n local headmax = {}\n headmax[1] = head[1]\n for j = 2, t - 1 do\n headmax[j] = mma(head[j], headmax[j - 1])\n end\n local tailmax = {}\n tailmax[1] = tail[i + 1][1]\n for j = 2, t - 1 do\n tailmax[j] = mma(tail[i + 1][j], tailmax[j - 1])\n end\n local iret = 0\n if 1 < t then iret = mma(headmax[t - 1], tailmax[t - 1]) end\n for j = 1, t - 2 do\n iret = mma(iret, headmax[j] + tailmax[t - 1 - j])\n end\n iret = iret + b[i]\n totret = mma(totret, iret)\n for j = t - 1 - a[i], 1, -1 do\n head[j + a[i]] = mma(head[j + a[i]], head[j] + b[i])\n end\n end\n do -- i == n\n local headmax = {}\n headmax[1] = head[1]\n for j = 2, t - 1 do\n headmax[j] = mma(head[j], headmax[j - 1])\n end\n local iret = 1 < t and headmax[t - 1] or 0\n iret = iret + b[n]\n totret = mma(totret, iret)\n end\n return totret\nend\nprint(solve())\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nTakahashi is at an all-you-can-eat restaurant.\n\nThe restaurant offers N kinds of dishes. It takes A_i minutes to eat the i-th dish, whose deliciousness is B_i.\n\nThe restaurant has the following rules:\n\nYou can only order one dish at a time. The dish ordered will be immediately served and ready to eat.\n\nYou cannot order the same kind of dish more than once.\n\nUntil you finish eating the dish already served, you cannot order a new dish.\n\nAfter T-0.5 minutes from the first order, you can no longer place a new order, but you can continue eating the dish already served.\n\nLet Takahashi's happiness be the sum of the deliciousness of the dishes he eats in this restaurant.\n\nWhat is the maximum possible happiness achieved by making optimal choices?\n\nConstraints\n\n2 \\leq N \\leq 3000\n\n1 \\leq T \\leq 3000\n\n1 \\leq A_i \\leq 3000\n\n1 \\leq B_i \\leq 3000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the maximum possible happiness Takahashi can achieve.\n\nSample Input 1\n\n2 60\n10 10\n100 100\n\nSample Output 1\n\n110\n\nBy ordering the first and second dishes in this order, Takahashi's happiness will be 110.\n\nNote that, if we manage to order a dish in time, we can spend any amount of time to eat it.\n\nSample Input 2\n\n3 60\n10 10\n10 20\n10 30\n\nSample Output 2\n\n60\n\nTakahashi can eat all the dishes within 60 minutes.\n\nSample Input 3\n\n3 60\n30 10\n30 20\n30 30\n\nSample Output 3\n\n50\n\nBy ordering the second and third dishes in this order, Takahashi's happiness will be 50.\n\nWe cannot order three dishes, in whatever order we place them.\n\nSample Input 4\n\n10 100\n15 23\n20 18\n13 17\n24 12\n18 29\n19 27\n23 21\n18 20\n27 15\n22 25\n\nSample Output 4\n\n145", "sample_input": "2 60\n10 10\n100 100\n"}, "reference_outputs": ["110\n"], "source_document_id": "p02863", "source_text": "Score : 500 points\n\nProblem Statement\n\nTakahashi is at an all-you-can-eat restaurant.\n\nThe restaurant offers N kinds of dishes. It takes A_i minutes to eat the i-th dish, whose deliciousness is B_i.\n\nThe restaurant has the following rules:\n\nYou can only order one dish at a time. The dish ordered will be immediately served and ready to eat.\n\nYou cannot order the same kind of dish more than once.\n\nUntil you finish eating the dish already served, you cannot order a new dish.\n\nAfter T-0.5 minutes from the first order, you can no longer place a new order, but you can continue eating the dish already served.\n\nLet Takahashi's happiness be the sum of the deliciousness of the dishes he eats in this restaurant.\n\nWhat is the maximum possible happiness achieved by making optimal choices?\n\nConstraints\n\n2 \\leq N \\leq 3000\n\n1 \\leq T \\leq 3000\n\n1 \\leq A_i \\leq 3000\n\n1 \\leq B_i \\leq 3000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the maximum possible happiness Takahashi can achieve.\n\nSample Input 1\n\n2 60\n10 10\n100 100\n\nSample Output 1\n\n110\n\nBy ordering the first and second dishes in this order, Takahashi's happiness will be 110.\n\nNote that, if we manage to order a dish in time, we can spend any amount of time to eat it.\n\nSample Input 2\n\n3 60\n10 10\n10 20\n10 30\n\nSample Output 2\n\n60\n\nTakahashi can eat all the dishes within 60 minutes.\n\nSample Input 3\n\n3 60\n30 10\n30 20\n30 30\n\nSample Output 3\n\n50\n\nBy ordering the second and third dishes in this order, Takahashi's happiness will be 50.\n\nWe cannot order three dishes, in whatever order we place them.\n\nSample Input 4\n\n10 100\n15 23\n20 18\n13 17\n24 12\n18 29\n19 27\n23 21\n18 20\n27 15\n22 25\n\nSample Output 4\n\n145", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1782, "cpu_time_ms": 359, "memory_kb": 243712}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s675345442", "group_id": "codeNet:p02864", "input_text": "local mmi, mma = math.min, math.max\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal h = {0}\nfor i = 1, n do\n h[i + 1] = io.read(\"*n\")\nend\nh[n + 2] = 0\nlocal t = {}\nfor i = 1, n + 2 do\n t[i] = {}\n for j = 1, k + 1 do\n t[i][j] = 0\n end\nend\nfor i = 2, n + 1 do\n t[i] = {}\n for j = 1, k + 1 do\n t[i][j] = t[i - 1][j]\n end\n for j = i, n + 1 do\n local score = 0\n local tgt = mma(h[i - 1], h[j + 1])\n for z = i, j do\n score = score + mma(0, h[z] - tgt)\n end\n local len = j + 1 - i\n for z = len + 1, k + 1 do\n t[j][z] = mma(t[j][z], t[i - 1][z - len] + score)\n end\n end\nend\nlocal ret = -t[n + 1][1]\nfor i = 2, k + 1 do\n ret = mmi(ret, -t[n + 1][i])\nend\nfor i = 2, n + 1 do\n ret = ret + mma(0, h[i] - h[i - 1])\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1589030385, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02864.html", "problem_id": "p02864", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02864/input.txt", "sample_output_relpath": "derived/input_output/data/p02864/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02864/Lua/s675345442.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s675345442", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal h = {0}\nfor i = 1, n do\n h[i + 1] = io.read(\"*n\")\nend\nh[n + 2] = 0\nlocal t = {}\nfor i = 1, n + 2 do\n t[i] = {}\n for j = 1, k + 1 do\n t[i][j] = 0\n end\nend\nfor i = 2, n + 1 do\n t[i] = {}\n for j = 1, k + 1 do\n t[i][j] = t[i - 1][j]\n end\n for j = i, n + 1 do\n local score = 0\n local tgt = mma(h[i - 1], h[j + 1])\n for z = i, j do\n score = score + mma(0, h[z] - tgt)\n end\n local len = j + 1 - i\n for z = len + 1, k + 1 do\n t[j][z] = mma(t[j][z], t[i - 1][z - len] + score)\n end\n end\nend\nlocal ret = -t[n + 1][1]\nfor i = 2, k + 1 do\n ret = mmi(ret, -t[n + 1][i])\nend\nfor i = 2, n + 1 do\n ret = ret + mma(0, h[i] - h[i - 1])\nend\nprint(ret)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe will create an artwork by painting black some squares in a white square grid with 10^9 rows and N columns.\n\nThe current plan is as follows: for the i-th column from the left, we will paint the H_i bottommost squares and will not paint the other squares in that column.\n\nBefore starting to work, you can choose at most K columns (possibly zero) and change the values of H_i for these columns to any integers of your choice between 0 and 10^9 (inclusive).\n\nDifferent values can be chosen for different columns.\n\nThen, you will create the modified artwork by repeating the following operation:\n\nChoose one or more consecutive squares in one row and paint them black. (Squares already painted black can be painted again, but squares not to be painted according to the modified plan should not be painted.)\n\nFind the minimum number of times you need to perform this operation.\n\nConstraints\n\n1 \\leq N \\leq 300\n\n0 \\leq K \\leq N\n\n0 \\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_2 ... H_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4 1\n2 3 4 1\n\nSample Output 1\n\n3\n\nFor example, by changing the value of H_3 to 2, you can create the modified artwork by the following three operations:\n\nPaint black the 1-st through 4-th squares from the left in the 1-st row from the bottom.\n\nPaint black the 1-st through 3-rd squares from the left in the 2-nd row from the bottom.\n\nPaint black the 2-nd square from the left in the 3-rd row from the bottom.\n\nSample Input 2\n\n6 2\n8 6 9 1 2 1\n\nSample Output 2\n\n7\n\nSample Input 3\n\n10 0\n1 1000000000 1 1000000000 1 1000000000 1 1000000000 1 1000000000\n\nSample Output 3\n\n4999999996", "sample_input": "4 1\n2 3 4 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02864", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe will create an artwork by painting black some squares in a white square grid with 10^9 rows and N columns.\n\nThe current plan is as follows: for the i-th column from the left, we will paint the H_i bottommost squares and will not paint the other squares in that column.\n\nBefore starting to work, you can choose at most K columns (possibly zero) and change the values of H_i for these columns to any integers of your choice between 0 and 10^9 (inclusive).\n\nDifferent values can be chosen for different columns.\n\nThen, you will create the modified artwork by repeating the following operation:\n\nChoose one or more consecutive squares in one row and paint them black. (Squares already painted black can be painted again, but squares not to be painted according to the modified plan should not be painted.)\n\nFind the minimum number of times you need to perform this operation.\n\nConstraints\n\n1 \\leq N \\leq 300\n\n0 \\leq K \\leq N\n\n0 \\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_2 ... H_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4 1\n2 3 4 1\n\nSample Output 1\n\n3\n\nFor example, by changing the value of H_3 to 2, you can create the modified artwork by the following three operations:\n\nPaint black the 1-st through 4-th squares from the left in the 1-st row from the bottom.\n\nPaint black the 1-st through 3-rd squares from the left in the 2-nd row from the bottom.\n\nPaint black the 2-nd square from the left in the 3-rd row from the bottom.\n\nSample Input 2\n\n6 2\n8 6 9 1 2 1\n\nSample Output 2\n\n7\n\nSample Input 3\n\n10 0\n1 1000000000 1 1000000000 1 1000000000 1 1000000000 1 1000000000\n\nSample Output 3\n\n4999999996", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 756, "cpu_time_ms": 40, "memory_kb": 2688}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s549231322", "group_id": "codeNet:p02865", "input_text": "local n = io.read(\"*n\")\nif n % 2 == 0 then\n print(n // 2 - 1)\nelse\n print(n // 2)\nend\n", "language": "Lua", "metadata": {"date": 1573355699, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "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/Lua/s549231322.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s549231322", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local n = io.read(\"*n\")\nif n % 2 == 0 then\n print(n // 2 - 1)\nelse\n print(n // 2)\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHow many ways are there to choose two distinct positive integers totaling N, disregarding the order?\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n1\n\nThere is only one way to choose two distinct integers totaling 4: to choose 1 and 3. (Choosing 3 and 1 is not considered different from this.)\n\nSample Input 2\n\n999999\n\nSample Output 2\n\n499999", "sample_input": "4\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02865", "source_text": "Score : 100 points\n\nProblem Statement\n\nHow many ways are there to choose two distinct positive integers totaling N, disregarding the order?\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n1\n\nThere is only one way to choose two distinct integers totaling 4: to choose 1 and 3. (Choosing 3 and 1 is not considered different from this.)\n\nSample Input 2\n\n999999\n\nSample Output 2\n\n499999", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s726066559", "group_id": "codeNet:p02866", "input_text": "local n=io.read(\"*n\")\nlocal verte={}\nlocal flag=true\nfor i=1,n do\n local x=io.read(\"*n\")\n if (i==1 and x>0) or (i>1 and x==0) then\n flag=false\n end\n verte[x]=(verte[x] or 0)+1\nend\n\nif not flag then\n print(0)\nelse\n local tree=1\n local mod=998244353\n for x,_ in pairs(verte) do\n if x+1<=#verte then\n if not verte[x] or not verte[x+1] then\n print(0)\n return\n end\n for i=1,verte[x+1] do\n tree=tree*verte[x]%mod\n end\n end\n end\n print(tree)\nend", "language": "Lua", "metadata": {"date": 1591556350, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s726066559.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s726066559", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n=io.read(\"*n\")\nlocal verte={}\nlocal flag=true\nfor i=1,n do\n local x=io.read(\"*n\")\n if (i==1 and x>0) or (i>1 and x==0) then\n flag=false\n end\n verte[x]=(verte[x] or 0)+1\nend\n\nif not flag then\n print(0)\nelse\n local tree=1\n local mod=998244353\n for x,_ in pairs(verte) do\n if x+1<=#verte then\n if not verte[x] or not verte[x+1] then\n print(0)\n return\n end\n for i=1,verte[x+1] do\n tree=tree*verte[x]%mod\n end\n end\n end\n print(tree)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 578, "cpu_time_ms": 43, "memory_kb": 2228}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s548380817", "group_id": "codeNet:p02866", "input_text": "local n=io.read(\"n\")\nlocal verte={}\nlocal flag=true\nfor i=1,n do\n local x=io.read(\"n\")\n if (i==1 and x>0) or (i>1 and x==0) then\n flag=false\n end\n verte[x]=(verte[x] or 0)+1\nend\n\nif not flag then\n print(0)\nelse\n local tree=1\n local mod=998244353\n for x,_ in pairs(verte) do\n if x+1<=#verte then\n if not verte[x] or not verte[x+1] then\n print(0)\n return\n end\n for i=1,verte[x+1] do\n tree=tree*verte[x]%mod\n end\n end\n end\n print(string.format(\"%d\",tree))\nend", "language": "Lua", "metadata": {"date": 1591556188, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s548380817.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s548380817", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal verte={}\nlocal flag=true\nfor i=1,n do\n local x=io.read(\"n\")\n if (i==1 and x>0) or (i>1 and x==0) then\n flag=false\n end\n verte[x]=(verte[x] or 0)+1\nend\n\nif not flag then\n print(0)\nelse\n local tree=1\n local mod=998244353\n for x,_ in pairs(verte) do\n if x+1<=#verte then\n if not verte[x] or not verte[x+1] then\n print(0)\n return\n end\n for i=1,verte[x+1] do\n tree=tree*verte[x]%mod\n end\n end\n end\n print(string.format(\"%d\",tree))\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 596, "cpu_time_ms": 77, "memory_kb": 4964}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s397545662", "group_id": "codeNet:p02866", "input_text": "local n=io.read(\"n\")\nlocal verte={}\nlocal flag=true\nfor i=1,n do\n local x=io.read(\"n\")\n if (i==1 and x>0) or (i>1 and x==0) then\n flag=false\n end\n verte[x]=(verte[x] or 0)+1\nend\n\nif not flag then\n print(0)\nelse\n local tree=1\n local mod=998244353\n for x,_ in pairs(verte) do\n if x+1<=#verte then\n if not verte[x] or not verte[x+1] then\n print(0)\n return\n end\n tree=tree*(verte[x]^verte[x+1])%mod\n end\n end\n print(string.format(\"%d\",tree))\nend", "language": "Lua", "metadata": {"date": 1591555868, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s397545662.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s397545662", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal verte={}\nlocal flag=true\nfor i=1,n do\n local x=io.read(\"n\")\n if (i==1 and x>0) or (i>1 and x==0) then\n flag=false\n end\n verte[x]=(verte[x] or 0)+1\nend\n\nif not flag then\n print(0)\nelse\n local tree=1\n local mod=998244353\n for x,_ in pairs(verte) do\n if x+1<=#verte then\n if not verte[x] or not verte[x+1] then\n print(0)\n return\n end\n tree=tree*(verte[x]^verte[x+1])%mod\n end\n end\n print(string.format(\"%d\",tree))\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 78, "memory_kb": 4836}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s666406440", "group_id": "codeNet:p02866", "input_text": "local mod = 998244353\nlocal function bmul(x, y) return (x * y) % mod end\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = pow // 2\n end\n return res\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\n\nlocal n = io.read(\"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = 0\nend\nlocal tmp = true\nlocal maxlen = 0\nfor i = 1, n do\n local a = io.read(\"*n\")\n if i == 1 then\n tmp = a == 0\n end\n maxlen = math.max(maxlen, a + 1)\n t[a + 1] = t[a + 1] + 1\nend\nif not tmp then print(0) os.exit() end\nfor i = 1, maxlen do\n if t[i] == 0 then\n print(0)\n os.exit()\n end\nend\nif t[1] ~= 1 then\n print(0)\n os.exit()\nend\nlocal ret = 1\nfor i = 2, maxlen do\n ret = bmul(ret, modpow(t[i - 1], t[i]))\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1589901504, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s666406440.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s666406440", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local mod = 998244353\nlocal function bmul(x, y) return (x * y) % mod end\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = pow // 2\n end\n return res\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\n\nlocal n = io.read(\"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = 0\nend\nlocal tmp = true\nlocal maxlen = 0\nfor i = 1, n do\n local a = io.read(\"*n\")\n if i == 1 then\n tmp = a == 0\n end\n maxlen = math.max(maxlen, a + 1)\n t[a + 1] = t[a + 1] + 1\nend\nif not tmp then print(0) os.exit() end\nfor i = 1, maxlen do\n if t[i] == 0 then\n print(0)\n os.exit()\n end\nend\nif t[1] ~= 1 then\n print(0)\n os.exit()\nend\nlocal ret = 1\nfor i = 2, maxlen do\n ret = bmul(ret, modpow(t[i - 1], t[i]))\nend\nprint(ret)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is an integer sequence D_1,...,D_N of N elements. Find the number, modulo 998244353, of trees with N vertices numbered 1 to N that satisfy the following condition:\n\nFor every integer i from 1 to N, the distance between Vertex 1 and Vertex i is D_i.\n\nNotes\n\nA tree of N vertices is a connected undirected graph with N vertices and N-1 edges, and the distance between two vertices are the number of edges in the shortest path between them.\n\nTwo trees are considered different if and only if there are two vertices x and y such that there is an edge between x and y in one of those trees and not in the other.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq D_i \\leq N-1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nD_1 D_2 ... D_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4\n0 1 1 2\n\nSample Output 1\n\n2\n\nFor example, a tree with edges (1,2), (1,3), and (2,4) satisfies the condition.\n\nSample Input 2\n\n4\n1 1 1 1\n\nSample Output 2\n\n0\n\nSample Input 3\n\n7\n0 3 2 1 2 2 1\n\nSample Output 3\n\n24", "sample_input": "4\n0 1 1 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02866", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is an integer sequence D_1,...,D_N of N elements. Find the number, modulo 998244353, of trees with N vertices numbered 1 to N that satisfy the following condition:\n\nFor every integer i from 1 to N, the distance between Vertex 1 and Vertex i is D_i.\n\nNotes\n\nA tree of N vertices is a connected undirected graph with N vertices and N-1 edges, and the distance between two vertices are the number of edges in the shortest path between them.\n\nTwo trees are considered different if and only if there are two vertices x and y such that there is an edge between x and y in one of those trees and not in the other.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq D_i \\leq N-1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nD_1 D_2 ... D_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4\n0 1 1 2\n\nSample Output 1\n\n2\n\nFor example, a tree with edges (1,2), (1,3), and (2,4) satisfies the condition.\n\nSample Input 2\n\n4\n1 1 1 1\n\nSample Output 2\n\n0\n\nSample Input 3\n\n7\n0 3 2 1 2 2 1\n\nSample Output 3\n\n24", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 853, "cpu_time_ms": 94, "memory_kb": 2424}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s715442038", "group_id": "codeNet:p02866", "input_text": "local mod = 998244353\nlocal mfl = math.floor\nlocal function bmul(x, y)\n local x0, y0 = x % 31596, y % 31596\n local x1, y1 = mfl(x / 31596), mfl(y / 31596)\n return (x1 * y1 * 62863 + (x1 * y0 + x0 * y1) * 31596 + x0 * y0) % mod\nend\n\nlocal function badd(x, y)\n return (x + y) % mod\nend\n\nlocal function bsub(x, y)\n return x < y and x - y + mod or x - y\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal n = io.read(\"*n\")\nlocal d = {}\nlocal mlen = 0\nlocal mma = math.max\nfor i = 1, n do\n d[i] = io.read(\"*n\")\n mlen = mma(mlen, d[i])\nend\nlocal valid = true\nif d[1] ~= 0 then\n valid = false\nend\nfor i = 2, n do\n if d[i] == 0 then\n valid = false\n end\nend\nlocal t = {}\nfor i = 1, mlen do\n t[i] = 0\nend\nif valid then\n for i = 2, n do\n t[d[i]] = t[d[i]] + 1\n end\nend\nfor i = 1, mlen do\n if t[i] == 0 then\n valid = false\n end\nend\nif not valid then\n print(0)\nelse\n local ret = 1\n for i = 2, mlen do\n local v = modpow(t[i - 1], t[i])\n ret = bmul(ret, v)\n end\n print(ret)\nend\n", "language": "Lua", "metadata": {"date": 1573356394, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s715442038.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s715442038", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local mod = 998244353\nlocal mfl = math.floor\nlocal function bmul(x, y)\n local x0, y0 = x % 31596, y % 31596\n local x1, y1 = mfl(x / 31596), mfl(y / 31596)\n return (x1 * y1 * 62863 + (x1 * y0 + x0 * y1) * 31596 + x0 * y0) % mod\nend\n\nlocal function badd(x, y)\n return (x + y) % mod\nend\n\nlocal function bsub(x, y)\n return x < y and x - y + mod or x - y\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal n = io.read(\"*n\")\nlocal d = {}\nlocal mlen = 0\nlocal mma = math.max\nfor i = 1, n do\n d[i] = io.read(\"*n\")\n mlen = mma(mlen, d[i])\nend\nlocal valid = true\nif d[1] ~= 0 then\n valid = false\nend\nfor i = 2, n do\n if d[i] == 0 then\n valid = false\n end\nend\nlocal t = {}\nfor i = 1, mlen do\n t[i] = 0\nend\nif valid then\n for i = 2, n do\n t[d[i]] = t[d[i]] + 1\n end\nend\nfor i = 1, mlen do\n if t[i] == 0 then\n valid = false\n end\nend\nif not valid then\n print(0)\nelse\n local ret = 1\n for i = 2, mlen do\n local v = modpow(t[i - 1], t[i])\n ret = bmul(ret, v)\n end\n print(ret)\nend\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is an integer sequence D_1,...,D_N of N elements. Find the number, modulo 998244353, of trees with N vertices numbered 1 to N that satisfy the following condition:\n\nFor every integer i from 1 to N, the distance between Vertex 1 and Vertex i is D_i.\n\nNotes\n\nA tree of N vertices is a connected undirected graph with N vertices and N-1 edges, and the distance between two vertices are the number of edges in the shortest path between them.\n\nTwo trees are considered different if and only if there are two vertices x and y such that there is an edge between x and y in one of those trees and not in the other.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq D_i \\leq N-1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nD_1 D_2 ... D_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4\n0 1 1 2\n\nSample Output 1\n\n2\n\nFor example, a tree with edges (1,2), (1,3), and (2,4) satisfies the condition.\n\nSample Input 2\n\n4\n1 1 1 1\n\nSample Output 2\n\n0\n\nSample Input 3\n\n7\n0 3 2 1 2 2 1\n\nSample Output 3\n\n24", "sample_input": "4\n0 1 1 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02866", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is an integer sequence D_1,...,D_N of N elements. Find the number, modulo 998244353, of trees with N vertices numbered 1 to N that satisfy the following condition:\n\nFor every integer i from 1 to N, the distance between Vertex 1 and Vertex i is D_i.\n\nNotes\n\nA tree of N vertices is a connected undirected graph with N vertices and N-1 edges, and the distance between two vertices are the number of edges in the shortest path between them.\n\nTwo trees are considered different if and only if there are two vertices x and y such that there is an edge between x and y in one of those trees and not in the other.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq D_i \\leq N-1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nD_1 D_2 ... D_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4\n0 1 1 2\n\nSample Output 1\n\n2\n\nFor example, a tree with edges (1,2), (1,3), and (2,4) satisfies the condition.\n\nSample Input 2\n\n4\n1 1 1 1\n\nSample Output 2\n\n0\n\nSample Input 3\n\n7\n0 3 2 1 2 2 1\n\nSample Output 3\n\n24", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1177, "cpu_time_ms": 28, "memory_kb": 2304}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s660782440", "group_id": "codeNet:p02867", "input_text": "local mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n -- for i = 1, #ary do self.stage[stagenum][i] = ary[i] end\n -- for i = #ary + 1, mul do self.stage[stagenum][i] = emptyvalue end\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mmi(r, mce((l - 1) / sz) * sz)\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)\n l = newr + 1\n end\n if sz <= r + 1 - l then\n ret = self.func(ret, self.stage[stage][mce(l / sz)])\n l = l + sz\n end\n if l <= r then\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n end\n end\n return ret\nend\nSegTree.setValue = function(self, idx, value, silent)\n self.stage[self.stagenum][idx] = value\n if not silent then\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n end\nend\n\nSegTree.right_bound = function(self, val, left, right)\n local ret, retpos = self.emptyvalue, left - 1\n local t1, t2, t3 = {1}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n while (l - 1) % sz ~= 0 or r + 1 - l < sz do\n stage = stage + 1\n sz = self.size[stage]\n end\n local tmp = self.func(ret, self.stage[stage][mce(l / sz)])\n if tmp > val then\n ret, retpos = tmp, l + sz - 1\n if retpos == right then break end\n if l + sz <= r then table.insert(t1, 1) table.insert(t2, l + sz) table.insert(t3, r) end\n else\n if sz ~= 1 then table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, l + sz - 2) end\n end\n end\n return retpos + 1\nend\nSegTree.left_bound = function(self, val, left, right)\n local ret, retpos = self.emptyvalue, right + 1\n local t1, t2, t3 = {1}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n while r % sz ~= 0 or r + 1 - l < sz do\n stage = stage + 1\n sz = self.size[stage]\n end\n local tmp = self.func(ret, self.stage[stage][mfl(r / sz)])\n if tmp > val then\n ret, retpos = tmp, r - sz + 1\n if l + sz <= r then table.insert(t1, 1) table.insert(t2, l) table.insert(t3, r - sz) end\n else\n if sz ~= 1 then table.insert(t1, stage + 1) table.insert(t2, r - sz + 2) table.insert(t3, r) end\n end\n end\n return retpos - 1\nend\n\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\n\nlocal function comp(a, b)\n return a < b\nend\n\nlocal function lower_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if not comp(ary[1], x) then return 1 end\n if comp(ary[num], x) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if comp(ary[mid], x) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal function upper_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if comp(x, ary[1]) then return 1 end\n if not comp(x, ary[num]) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if not comp(x, ary[mid]) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal n = io.read(\"*n\")\nlocal ab = {}\nfor i = 1, n do\n ab[i] = {io.read(\"*n\")}\nend\nfor i = 1, n do\n ab[i][2] = io.read(\"*n\")\nend\ntable.sort(ab, function(x, y)\n if x[2] ~= y[2] then\n return x[2] < y[2]\n else\n return x[1] < y[1]\n end\nend)\nlocal a = {}\nlocal b = {}\n\nfor i = 1, n do\n a[i] = ab[i][1]\n b[i] = ab[i][2]\nend\nlocal alim = {}\nlocal st = SegTree.new(n, mmi, 1000000007)\n-- print(table.concat(a, \" \"))\n-- print(table.concat(b, \" \"))\nfor i = 1, n do\n alim[i] = lower_bound(b, a[i])\n st:setValue(i, alim[i], true)\nend\nst:updateAll()\nlocal cnt = 0\nfor i = 1, n do\n if i < alim[i] then\n if i == n then\n cnt = n\n break\n end\n local pos = st:left_bound(i, i + 1, n)\n if pos < i then\n cnt = n\n break\n else\n cnt = cnt + 1\n st:setValue(i, alim[pos])\n st:setValue(pos, alim[i])\n alim[i], alim[pos] = alim[pos], alim[i]\n end\n end\nend\nprint(cnt <= n - 2 and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1573357156, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02867.html", "problem_id": "p02867", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02867/input.txt", "sample_output_relpath": "derived/input_output/data/p02867/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02867/Lua/s660782440.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s660782440", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n -- for i = 1, #ary do self.stage[stagenum][i] = ary[i] end\n -- for i = #ary + 1, mul do self.stage[stagenum][i] = emptyvalue end\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mmi(r, mce((l - 1) / sz) * sz)\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)\n l = newr + 1\n end\n if sz <= r + 1 - l then\n ret = self.func(ret, self.stage[stage][mce(l / sz)])\n l = l + sz\n end\n if l <= r then\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n end\n end\n return ret\nend\nSegTree.setValue = function(self, idx, value, silent)\n self.stage[self.stagenum][idx] = value\n if not silent then\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n end\nend\n\nSegTree.right_bound = function(self, val, left, right)\n local ret, retpos = self.emptyvalue, left - 1\n local t1, t2, t3 = {1}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n while (l - 1) % sz ~= 0 or r + 1 - l < sz do\n stage = stage + 1\n sz = self.size[stage]\n end\n local tmp = self.func(ret, self.stage[stage][mce(l / sz)])\n if tmp > val then\n ret, retpos = tmp, l + sz - 1\n if retpos == right then break end\n if l + sz <= r then table.insert(t1, 1) table.insert(t2, l + sz) table.insert(t3, r) end\n else\n if sz ~= 1 then table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, l + sz - 2) end\n end\n end\n return retpos + 1\nend\nSegTree.left_bound = function(self, val, left, right)\n local ret, retpos = self.emptyvalue, right + 1\n local t1, t2, t3 = {1}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n while r % sz ~= 0 or r + 1 - l < sz do\n stage = stage + 1\n sz = self.size[stage]\n end\n local tmp = self.func(ret, self.stage[stage][mfl(r / sz)])\n if tmp > val then\n ret, retpos = tmp, r - sz + 1\n if l + sz <= r then table.insert(t1, 1) table.insert(t2, l) table.insert(t3, r - sz) end\n else\n if sz ~= 1 then table.insert(t1, stage + 1) table.insert(t2, r - sz + 2) table.insert(t3, r) end\n end\n end\n return retpos - 1\nend\n\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\n\nlocal function comp(a, b)\n return a < b\nend\n\nlocal function lower_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if not comp(ary[1], x) then return 1 end\n if comp(ary[num], x) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if comp(ary[mid], x) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal function upper_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if comp(x, ary[1]) then return 1 end\n if not comp(x, ary[num]) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if not comp(x, ary[mid]) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal n = io.read(\"*n\")\nlocal ab = {}\nfor i = 1, n do\n ab[i] = {io.read(\"*n\")}\nend\nfor i = 1, n do\n ab[i][2] = io.read(\"*n\")\nend\ntable.sort(ab, function(x, y)\n if x[2] ~= y[2] then\n return x[2] < y[2]\n else\n return x[1] < y[1]\n end\nend)\nlocal a = {}\nlocal b = {}\n\nfor i = 1, n do\n a[i] = ab[i][1]\n b[i] = ab[i][2]\nend\nlocal alim = {}\nlocal st = SegTree.new(n, mmi, 1000000007)\n-- print(table.concat(a, \" \"))\n-- print(table.concat(b, \" \"))\nfor i = 1, n do\n alim[i] = lower_bound(b, a[i])\n st:setValue(i, alim[i], true)\nend\nst:updateAll()\nlocal cnt = 0\nfor i = 1, n do\n if i < alim[i] then\n if i == n then\n cnt = n\n break\n end\n local pos = st:left_bound(i, i + 1, n)\n if pos < i then\n cnt = n\n break\n else\n cnt = cnt + 1\n st:setValue(i, alim[pos])\n st:setValue(pos, alim[i])\n alim[i], alim[pos] = alim[pos], alim[i]\n end\n end\nend\nprint(cnt <= n - 2 and \"Yes\" or \"No\")\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven are two integer sequences of N elements each: A_1,...,A_N and B_1,...,B_N.\nDetermine if it is possible to do the following operation at most N-2 times (possibly zero) so that, for every integer i from 1 to N, A_i \\leq B_i holds:\n\nChoose two distinct integers x and y between 1 and N (inclusive), and swap the values of A_x and A_y.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i,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\nB_1 B_2 ... B_N\n\nOutput\n\nIf the objective is achievable, print Yes; if it is not, print No.\n\nSample Input 1\n\n3\n1 3 2\n1 2 3\n\nSample Output 1\n\nYes\n\nWe should swap the values of A_2 and A_3.\n\nSample Input 2\n\n3\n1 2 3\n2 2 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n6\n3 1 2 6 3 4\n2 2 8 3 4 3\n\nSample Output 3\n\nYes", "sample_input": "3\n1 3 2\n1 2 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02867", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven are two integer sequences of N elements each: A_1,...,A_N and B_1,...,B_N.\nDetermine if it is possible to do the following operation at most N-2 times (possibly zero) so that, for every integer i from 1 to N, A_i \\leq B_i holds:\n\nChoose two distinct integers x and y between 1 and N (inclusive), and swap the values of A_x and A_y.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i,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\nB_1 B_2 ... B_N\n\nOutput\n\nIf the objective is achievable, print Yes; if it is not, print No.\n\nSample Input 1\n\n3\n1 3 2\n1 2 3\n\nSample Output 1\n\nYes\n\nWe should swap the values of A_2 and A_3.\n\nSample Input 2\n\n3\n1 2 3\n2 2 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n6\n3 1 2 6 3 4\n2 2 8 3 4 3\n\nSample Output 3\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5600, "cpu_time_ms": 499, "memory_kb": 30572}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s617547308", "group_id": "codeNet:p02867", "input_text": "local mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n -- for i = 1, #ary do self.stage[stagenum][i] = ary[i] end\n -- for i = #ary + 1, mul do self.stage[stagenum][i] = emptyvalue end\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mmi(r, mce((l - 1) / sz) * sz)\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)\n l = newr + 1\n end\n if sz <= r + 1 - l then\n ret = self.func(ret, self.stage[stage][mce(l / sz)])\n l = l + sz\n end\n if l <= r then\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n end\n end\n return ret\nend\nSegTree.setValue = function(self, idx, value, silent)\n self.stage[self.stagenum][idx] = value\n if not silent then\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n end\nend\n\nSegTree.right_bound = function(self, val, left, right)\n local ret, retpos = self.emptyvalue, left - 1\n local t1, t2, t3 = {1}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n while (l - 1) % sz ~= 0 or r + 1 - l < sz do\n stage = stage + 1\n sz = self.size[stage]\n end\n local tmp = self.func(ret, self.stage[stage][mce(l / sz)])\n if tmp > val then\n ret, retpos = tmp, l + sz - 1\n if retpos == right then break end\n if l + sz <= r then table.insert(t1, 1) table.insert(t2, l + sz) table.insert(t3, r) end\n else\n if sz ~= 1 then table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, l + sz - 2) end\n end\n end\n return retpos + 1\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\n\nlocal function comp(a, b)\n return a < b\nend\n\nlocal function lower_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if not comp(ary[1], x) then return 1 end\n if comp(ary[num], x) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if comp(ary[mid], x) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal function upper_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if comp(x, ary[1]) then return 1 end\n if not comp(x, ary[num]) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if not comp(x, ary[mid]) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal n = io.read(\"*n\")\nlocal ab = {}\nfor i = 1, n do\n ab[i] = {io.read(\"*n\")}\nend\nfor i = 1, n do\n ab[i][2] = io.read(\"*n\")\nend\ntable.sort(ab, function(x, y)\n if x[2] ~= y[2] then\n return x[2] < y[2]\n else\n return x[1] < y[1]\n end\nend)\nlocal a = {}\nlocal b = {}\n\nfor i = 1, n do\n a[i] = ab[i][1]\n b[i] = ab[i][2]\nend\nlocal alim = {}\nlocal st = SegTree.new(n, mmi, 1000000007)\n-- print(table.concat(a, \" \"))\n-- print(table.concat(b, \" \"))\nfor i = 1, n do\n alim[i] = lower_bound(b, a[i])\n st:setValue(i, alim[i], true)\nend\nst:updateAll()\nlocal cnt = 0\nfor i = 1, n do\n if i < alim[i] then\n if i == n then\n cnt = n\n break\n end\n local pos = st:right_bound(i, i + 1, n)\n if n < pos then\n cnt = n\n break\n else\n cnt = cnt + 1\n st:setValue(i, alim[pos])\n st:setValue(pos, alim[i])\n alim[i], alim[pos] = alim[pos], alim[i]\n end\n end\nend\nprint(cnt <= n - 2 and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1573355297, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02867.html", "problem_id": "p02867", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02867/input.txt", "sample_output_relpath": "derived/input_output/data/p02867/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02867/Lua/s617547308.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s617547308", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n -- for i = 1, #ary do self.stage[stagenum][i] = ary[i] end\n -- for i = #ary + 1, mul do self.stage[stagenum][i] = emptyvalue end\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mmi(r, mce((l - 1) / sz) * sz)\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)\n l = newr + 1\n end\n if sz <= r + 1 - l then\n ret = self.func(ret, self.stage[stage][mce(l / sz)])\n l = l + sz\n end\n if l <= r then\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n end\n end\n return ret\nend\nSegTree.setValue = function(self, idx, value, silent)\n self.stage[self.stagenum][idx] = value\n if not silent then\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n end\nend\n\nSegTree.right_bound = function(self, val, left, right)\n local ret, retpos = self.emptyvalue, left - 1\n local t1, t2, t3 = {1}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n while (l - 1) % sz ~= 0 or r + 1 - l < sz do\n stage = stage + 1\n sz = self.size[stage]\n end\n local tmp = self.func(ret, self.stage[stage][mce(l / sz)])\n if tmp > val then\n ret, retpos = tmp, l + sz - 1\n if retpos == right then break end\n if l + sz <= r then table.insert(t1, 1) table.insert(t2, l + sz) table.insert(t3, r) end\n else\n if sz ~= 1 then table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, l + sz - 2) end\n end\n end\n return retpos + 1\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\n\nlocal function comp(a, b)\n return a < b\nend\n\nlocal function lower_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if not comp(ary[1], x) then return 1 end\n if comp(ary[num], x) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if comp(ary[mid], x) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal function upper_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if comp(x, ary[1]) then return 1 end\n if not comp(x, ary[num]) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if not comp(x, ary[mid]) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal n = io.read(\"*n\")\nlocal ab = {}\nfor i = 1, n do\n ab[i] = {io.read(\"*n\")}\nend\nfor i = 1, n do\n ab[i][2] = io.read(\"*n\")\nend\ntable.sort(ab, function(x, y)\n if x[2] ~= y[2] then\n return x[2] < y[2]\n else\n return x[1] < y[1]\n end\nend)\nlocal a = {}\nlocal b = {}\n\nfor i = 1, n do\n a[i] = ab[i][1]\n b[i] = ab[i][2]\nend\nlocal alim = {}\nlocal st = SegTree.new(n, mmi, 1000000007)\n-- print(table.concat(a, \" \"))\n-- print(table.concat(b, \" \"))\nfor i = 1, n do\n alim[i] = lower_bound(b, a[i])\n st:setValue(i, alim[i], true)\nend\nst:updateAll()\nlocal cnt = 0\nfor i = 1, n do\n if i < alim[i] then\n if i == n then\n cnt = n\n break\n end\n local pos = st:right_bound(i, i + 1, n)\n if n < pos then\n cnt = n\n break\n else\n cnt = cnt + 1\n st:setValue(i, alim[pos])\n st:setValue(pos, alim[i])\n alim[i], alim[pos] = alim[pos], alim[i]\n end\n end\nend\nprint(cnt <= n - 2 and \"Yes\" or \"No\")\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven are two integer sequences of N elements each: A_1,...,A_N and B_1,...,B_N.\nDetermine if it is possible to do the following operation at most N-2 times (possibly zero) so that, for every integer i from 1 to N, A_i \\leq B_i holds:\n\nChoose two distinct integers x and y between 1 and N (inclusive), and swap the values of A_x and A_y.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i,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\nB_1 B_2 ... B_N\n\nOutput\n\nIf the objective is achievable, print Yes; if it is not, print No.\n\nSample Input 1\n\n3\n1 3 2\n1 2 3\n\nSample Output 1\n\nYes\n\nWe should swap the values of A_2 and A_3.\n\nSample Input 2\n\n3\n1 2 3\n2 2 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n6\n3 1 2 6 3 4\n2 2 8 3 4 3\n\nSample Output 3\n\nYes", "sample_input": "3\n1 3 2\n1 2 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02867", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven are two integer sequences of N elements each: A_1,...,A_N and B_1,...,B_N.\nDetermine if it is possible to do the following operation at most N-2 times (possibly zero) so that, for every integer i from 1 to N, A_i \\leq B_i holds:\n\nChoose two distinct integers x and y between 1 and N (inclusive), and swap the values of A_x and A_y.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i,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\nB_1 B_2 ... B_N\n\nOutput\n\nIf the objective is achievable, print Yes; if it is not, print No.\n\nSample Input 1\n\n3\n1 3 2\n1 2 3\n\nSample Output 1\n\nYes\n\nWe should swap the values of A_2 and A_3.\n\nSample Input 2\n\n3\n1 2 3\n2 2 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n6\n3 1 2 6 3 4\n2 2 8 3 4 3\n\nSample Output 3\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4830, "cpu_time_ms": 470, "memory_kb": 31344}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s688374851", "group_id": "codeNet:p02874", "input_text": "local mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n -- for i = 1, #ary do self.stage[stagenum][i] = ary[i] end\n -- for i = #ary + 1, mul do self.stage[stagenum][i] = emptyvalue end\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mmi(r, mce((l - 1) / sz) * sz)\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)\n l = newr + 1\n end\n if sz <= r + 1 - l then\n ret = self.func(ret, self.stage[stage][mce(l / sz)])\n l = l + sz\n end\n if l <= r then\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n end\n end\n return ret\nend\nSegTree.setValue = function(self, idx, value, silent)\n self.stage[self.stagenum][idx] = value\n if not silent then\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n end\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal mma, mmi = math.max, math.min\nlocal n = io.read(\"*n\")\nlocal l, r = {}, {}\nlocal s_idx = {}\nfor i = 1, n do\n l[i], r[i] = io.read(\"*n\", \"*n\")\n s_idx[i] = i\nend\ntable.sort(s_idx, function(x, y)\n if l[x] == l[y] then\n return r[x] < r[y]\n else\n return l[x] < l[y]\n end\nend)\nlocal lmin_idx = s_idx[1]\ntable.sort(s_idx, function(x, y)\n if r[x] == r[y] then\n return l[x] < l[y]\n else\n return r[x] < r[y]\n end\nend)\nlocal rmax_idx = s_idx[n] == lmin_idx and s_idx[n - 1] or s_idx[n]\nlocal lpoint, rpoint = r[lmin_idx] - l[lmin_idx] + 1, r[rmax_idx] - l[rmax_idx] + 1\nlocal lp, rp = {}, {}\nfor i = 1, n do\n if i ~= rmax_idx and i ~= lmin_idx then\n table.insert(lp, mma(0, mmi(r[i], r[lmin_idx]) - l[i] + 1))\n table.insert(rp, mma(0, r[i] - mma(l[i], l[rmax_idx]) + 1))\n end\nend\n-- table.insert(lp, lpoint)\n-- table.insert(rp, 0)\ntable.insert(lp, -1)\ntable.insert(rp, rpoint)\nlocal t_idx = {}\nfor i = 1, n - 1 do\n t_idx[i] = i\nend\ntable.sort(t_idx, function(x, y)\n return lp[x] < lp[y]\nend)\nlocal inf = 1000000007\nlocal st = SegTree.new(n - 1, function(x, y) return mmi(x, y) end, inf)\nlocal ans = 0\nfor i = 1, n - 1 do\n st:setValue(i, rp[t_idx[i]])\n local lv = i == n - 1 and lpoint or lp[t_idx[i + 1]]\n local ret = mma(0, lv) + st.stage[1][1]\n -- print(mma(0, lv), st.stage[1][1])\n ans = mma(ans, ret)\nend\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1572847452, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02874.html", "problem_id": "p02874", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02874/input.txt", "sample_output_relpath": "derived/input_output/data/p02874/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02874/Lua/s688374851.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s688374851", "user_id": "u120582723"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "local mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n -- for i = 1, #ary do self.stage[stagenum][i] = ary[i] end\n -- for i = #ary + 1, mul do self.stage[stagenum][i] = emptyvalue end\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mmi(r, mce((l - 1) / sz) * sz)\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)\n l = newr + 1\n end\n if sz <= r + 1 - l then\n ret = self.func(ret, self.stage[stage][mce(l / sz)])\n l = l + sz\n end\n if l <= r then\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n end\n end\n return ret\nend\nSegTree.setValue = function(self, idx, value, silent)\n self.stage[self.stagenum][idx] = value\n if not silent then\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n end\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal mma, mmi = math.max, math.min\nlocal n = io.read(\"*n\")\nlocal l, r = {}, {}\nlocal s_idx = {}\nfor i = 1, n do\n l[i], r[i] = io.read(\"*n\", \"*n\")\n s_idx[i] = i\nend\ntable.sort(s_idx, function(x, y)\n if l[x] == l[y] then\n return r[x] < r[y]\n else\n return l[x] < l[y]\n end\nend)\nlocal lmin_idx = s_idx[1]\ntable.sort(s_idx, function(x, y)\n if r[x] == r[y] then\n return l[x] < l[y]\n else\n return r[x] < r[y]\n end\nend)\nlocal rmax_idx = s_idx[n] == lmin_idx and s_idx[n - 1] or s_idx[n]\nlocal lpoint, rpoint = r[lmin_idx] - l[lmin_idx] + 1, r[rmax_idx] - l[rmax_idx] + 1\nlocal lp, rp = {}, {}\nfor i = 1, n do\n if i ~= rmax_idx and i ~= lmin_idx then\n table.insert(lp, mma(0, mmi(r[i], r[lmin_idx]) - l[i] + 1))\n table.insert(rp, mma(0, r[i] - mma(l[i], l[rmax_idx]) + 1))\n end\nend\n-- table.insert(lp, lpoint)\n-- table.insert(rp, 0)\ntable.insert(lp, -1)\ntable.insert(rp, rpoint)\nlocal t_idx = {}\nfor i = 1, n - 1 do\n t_idx[i] = i\nend\ntable.sort(t_idx, function(x, y)\n return lp[x] < lp[y]\nend)\nlocal inf = 1000000007\nlocal st = SegTree.new(n - 1, function(x, y) return mmi(x, y) end, inf)\nlocal ans = 0\nfor i = 1, n - 1 do\n st:setValue(i, rp[t_idx[i]])\n local lv = i == n - 1 and lpoint or lp[t_idx[i + 1]]\n local ret = mma(0, lv) + st.stage[1][1]\n -- print(mma(0, lv), st.stage[1][1])\n ans = mma(ans, ret)\nend\nprint(ans)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\n10^9 contestants, numbered 1 to 10^9, will compete in a competition.\nThere will be two contests in this competition.\n\nThe organizer prepared N problems, numbered 1 to N, to use in these contests.\nWhen Problem i is presented in a contest, it will be solved by all contestants from Contestant L_i to Contestant R_i (inclusive), and will not be solved by any other contestants.\n\nThe organizer will use these N problems in the two contests.\nEach problem must be used in exactly one of the contests, and each contest must have at least one problem.\n\nThe joyfulness of each contest is the number of contestants who will solve all the problems in the contest.\nFind the maximum possible total joyfulness of the two contests.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 R_1\nL_2 R_2\n\\vdots\nL_N R_N\n\nOutput\n\nPrint the maximum possible total joyfulness of the two contests.\n\nSample Input 1\n\n4\n4 7\n1 4\n5 8\n2 5\n\nSample Output 1\n\n6\n\nThe optimal choice is:\n\nUse Problem 1 and 3 in the first contest. Contestant 5, 6, and 7 will solve both of them, so the joyfulness of this contest is 3.\n\nUse Problem 2 and 4 in the second contest. Contestant 2, 3, and 4 will solve both of them, so the joyfulness of this contest is 3.\n\nThe total joyfulness of these two contests is 6. We cannot make the total joyfulness greater than 6.\n\nSample Input 2\n\n4\n1 20\n2 19\n3 18\n4 17\n\nSample Output 2\n\n34\n\nSample Input 3\n\n10\n457835016 996058008\n456475528 529149798\n455108441 512701454\n455817105 523506955\n457368248 814532746\n455073228 459494089\n456651538 774276744\n457667152 974637457\n457293701 800549465\n456580262 636471526\n\nSample Output 3\n\n540049931", "sample_input": "4\n4 7\n1 4\n5 8\n2 5\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02874", "source_text": "Score : 600 points\n\nProblem Statement\n\n10^9 contestants, numbered 1 to 10^9, will compete in a competition.\nThere will be two contests in this competition.\n\nThe organizer prepared N problems, numbered 1 to N, to use in these contests.\nWhen Problem i is presented in a contest, it will be solved by all contestants from Contestant L_i to Contestant R_i (inclusive), and will not be solved by any other contestants.\n\nThe organizer will use these N problems in the two contests.\nEach problem must be used in exactly one of the contests, and each contest must have at least one problem.\n\nThe joyfulness of each contest is the number of contestants who will solve all the problems in the contest.\nFind the maximum possible total joyfulness of the two contests.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 R_1\nL_2 R_2\n\\vdots\nL_N R_N\n\nOutput\n\nPrint the maximum possible total joyfulness of the two contests.\n\nSample Input 1\n\n4\n4 7\n1 4\n5 8\n2 5\n\nSample Output 1\n\n6\n\nThe optimal choice is:\n\nUse Problem 1 and 3 in the first contest. Contestant 5, 6, and 7 will solve both of them, so the joyfulness of this contest is 3.\n\nUse Problem 2 and 4 in the second contest. Contestant 2, 3, and 4 will solve both of them, so the joyfulness of this contest is 3.\n\nThe total joyfulness of these two contests is 6. We cannot make the total joyfulness greater than 6.\n\nSample Input 2\n\n4\n1 20\n2 19\n3 18\n4 17\n\nSample Output 2\n\n34\n\nSample Input 3\n\n10\n457835016 996058008\n456475528 529149798\n455108441 512701454\n455817105 523506955\n457368248 814532746\n455073228 459494089\n456651538 774276744\n457667152 974637457\n457293701 800549465\n456580262 636471526\n\nSample Output 3\n\n540049931", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3635, "cpu_time_ms": 414, "memory_kb": 8704}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s763250001", "group_id": "codeNet:p02880", "input_text": " n=io.read(\"*n\")\n \tcnt=0\n for i=1, 9 do\n if (n%i)==0 and (n/i)<10 then\n print(\"Yes\")\n \t\tos.exit(0)\n \tcnt=1\n end\n end\n if cnt==0 then\n print(\"No\")\n end", "language": "Lua", "metadata": {"date": 1572225769, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s763250001.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s763250001", "user_id": "u535423069"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": " n=io.read(\"*n\")\n \tcnt=0\n for i=1, 9 do\n if (n%i)==0 and (n/i)<10 then\n print(\"Yes\")\n \t\tos.exit(0)\n \tcnt=1\n end\n end\n if cnt==0 then\n print(\"No\")\n end", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Lua:s325427717", "group_id": "codeNet:p02880", "input_text": "n=io.read(\"*n\")\n\nfor i=1, 9 do\n if n%i==0 and n/i<10 then\n print(\"Yes\")\n else\n print(\"No\")\n end\nend", "language": "Lua", "metadata": {"date": 1572225294, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s325427717.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s325427717", "user_id": "u535423069"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "n=io.read(\"*n\")\n\nfor i=1, 9 do\n if n%i==0 and n/i<10 then\n print(\"Yes\")\n else\n print(\"No\")\n end\nend", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s787343561", "group_id": "codeNet:p02881", "input_text": "local n = io.read(\"*n\")\nfor i = math.floor(math.sqrt(n)), 1, -1 do\n\tlocal dev = n / i\n\tif dev % 1 == 0 then\n\t\tprint(string.format(\"%d\", dev + i - 2))\n\t\tos.exit()\n\tend\nend", "language": "Lua", "metadata": {"date": 1572995932, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s787343561.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s787343561", "user_id": "u413686817"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local n = io.read(\"*n\")\nfor i = math.floor(math.sqrt(n)), 1, -1 do\n\tlocal dev = n / i\n\tif dev % 1 == 0 then\n\t\tprint(string.format(\"%d\", dev + i - 2))\n\t\tos.exit()\n\tend\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 170, "cpu_time_ms": 106, "memory_kb": 508}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s304795305", "group_id": "codeNet:p02881", "input_text": "n=io.read(\"*n\")\n\nans=n-1\nfor i=2, n do\n if n%i==0 then\n ans=(n/i)+i-2\n end\n if n <= i*i then\n break\n end\nend\n\nprint(ans)", "language": "Lua", "metadata": {"date": 1572234216, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s304795305.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s304795305", "user_id": "u535423069"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "n=io.read(\"*n\")\n\nans=n-1\nfor i=2, n do\n if n%i==0 then\n ans=(n/i)+i-2\n end\n if n <= i*i then\n break\n end\nend\n\nprint(ans)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s356906880", "group_id": "codeNet:p02881", "input_text": "n=io.read(\"*n\")\n\nans=n-1\nfor i=2, 9 do\n if n%i==0 then\n ans=(n/i)+i-2\n break\n end\nend\n\nprint(ans)", "language": "Lua", "metadata": {"date": 1572233849, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s356906880.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s356906880", "user_id": "u535423069"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "n=io.read(\"*n\")\n\nans=n-1\nfor i=2, 9 do\n if n%i==0 then\n ans=(n/i)+i-2\n break\n end\nend\n\nprint(ans)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 105, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s805470013", "group_id": "codeNet:p02881", "input_text": "n=io.read(\"*n\")\n\t\nans=n-1\n \nfor i=2, 9 do\n if n%i==0 then\n ans=(n/i)+i-2\n end\nend", "language": "Lua", "metadata": {"date": 1572232282, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s805470013.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s805470013", "user_id": "u535423069"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "n=io.read(\"*n\")\n\t\nans=n-1\n \nfor i=2, 9 do\n if n%i==0 then\n ans=(n/i)+i-2\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 90, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s796878861", "group_id": "codeNet:p02881", "input_text": "n=io.read(\"*n\")\n\np=n\nl=1\n\nfor i=2, 9 do\n if n/i

1 do\n local m = left + math.floor((right - left) / 2)\n if f(m) then\n right = m -- keep f(right) == true\n else\n left = m -- keep f(left) == false\n end\n end\n return right\nend\n---\nlocal N, K = read.nn()\nlocal A = read.N(N)\nlocal F = read.N(N)\ntable.sort(A)\ntable.sort(F, function(x,y)return x>y end)\nlocal upper_lim = A[N] * F[1]\n\nlocal function possible(max_time)\n local kk = K\n for i=1, N do\n local time = A[i] * F[i]\n if time > max_time then\n local train_cost = math.ceil((A[i] * F[i] - max_time) / F[i])\n kk = kk - train_cost\n if kk < 0 then\n return false\n end\n end\n end\n return true\nend\nprint(find_min_true(upper_lim, possible))\n", "language": "Lua", "metadata": {"date": 1572409782, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02883.html", "problem_id": "p02883", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02883/input.txt", "sample_output_relpath": "derived/input_output/data/p02883/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02883/Lua/s069756734.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s069756734", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\n--\nlocal function find_min_true(n, f)\n -- Define f(-1) == false, f(n) == true\n -- Invariant: f(left) == false and f(right) == true\n local left = -1\n local right = n\n while right - left > 1 do\n local m = left + math.floor((right - left) / 2)\n if f(m) then\n right = m -- keep f(right) == true\n else\n left = m -- keep f(left) == false\n end\n end\n return right\nend\n---\nlocal N, K = read.nn()\nlocal A = read.N(N)\nlocal F = read.N(N)\ntable.sort(A)\ntable.sort(F, function(x,y)return x>y end)\nlocal upper_lim = A[N] * F[1]\n\nlocal function possible(max_time)\n local kk = K\n for i=1, N do\n local time = A[i] * F[i]\n if time > max_time then\n local train_cost = math.ceil((A[i] * F[i] - max_time) / F[i])\n kk = kk - train_cost\n if kk < 0 then\n return false\n end\n end\n end\n return true\nend\nprint(find_min_true(upper_lim, possible))\n", "problem_context": "Score: 500 points\n\nProblem Statement\n\nTakahashi will take part in an eating contest. Teams of N members will compete in this contest, and Takahashi's team consists of N players numbered 1 through N from youngest to oldest. The consumption coefficient of Member i is A_i.\n\nIn the contest, N foods numbered 1 through N will be presented, and the difficulty of Food i is F_i. The details of the contest are as follows:\n\nA team should assign one member to each food, and should not assign the same member to multiple foods.\n\nIt will take x \\times y seconds for a member to finish the food, where x is the consumption coefficient of the member and y is the difficulty of the dish.\n\nThe score of a team is the longest time it takes for an individual member to finish the food.\n\nBefore the contest, Takahashi's team decided to do some training. In one set of training, a member can reduce his/her consumption coefficient by 1, as long as it does not go below 0. However, for financial reasons, the N members can do at most K sets of training in total.\n\nWhat is the minimum possible score of the team, achieved by choosing the amounts of members' training and allocating the dishes optimally?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 10^{18}\n\n1 \\leq A_i \\leq 10^6\\ (1 \\leq i \\leq N)\n\n1 \\leq F_i \\leq 10^6\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\nF_1 F_2 ... F_N\n\nOutput\n\nPrint the minimum possible score of the team.\n\nSample Input 1\n\n3 5\n4 2 1\n2 3 1\n\nSample Output 1\n\n2\n\nThey can achieve the score of 2, as follows:\n\nMember 1 does 4 sets of training and eats Food 2 in (4-4) \\times 3 = 0 seconds.\n\nMember 2 does 1 set of training and eats Food 3 in (2-1) \\times 1 = 1 second.\n\nMember 3 does 0 sets of training and eats Food 1 in (1-0) \\times 2 = 2 seconds.\n\nThey cannot achieve a score of less than 2, so the answer is 2.\n\nSample Input 2\n\n3 8\n4 2 1\n2 3 1\n\nSample Output 2\n\n0\n\nThey can choose not to do exactly K sets of training.\n\nSample Input 3\n\n11 14\n3 1 4 1 5 9 2 6 5 3 5\n8 9 7 9 3 2 3 8 4 6 2\n\nSample Output 3\n\n12", "sample_input": "3 5\n4 2 1\n2 3 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02883", "source_text": "Score: 500 points\n\nProblem Statement\n\nTakahashi will take part in an eating contest. Teams of N members will compete in this contest, and Takahashi's team consists of N players numbered 1 through N from youngest to oldest. The consumption coefficient of Member i is A_i.\n\nIn the contest, N foods numbered 1 through N will be presented, and the difficulty of Food i is F_i. The details of the contest are as follows:\n\nA team should assign one member to each food, and should not assign the same member to multiple foods.\n\nIt will take x \\times y seconds for a member to finish the food, where x is the consumption coefficient of the member and y is the difficulty of the dish.\n\nThe score of a team is the longest time it takes for an individual member to finish the food.\n\nBefore the contest, Takahashi's team decided to do some training. In one set of training, a member can reduce his/her consumption coefficient by 1, as long as it does not go below 0. However, for financial reasons, the N members can do at most K sets of training in total.\n\nWhat is the minimum possible score of the team, achieved by choosing the amounts of members' training and allocating the dishes optimally?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 10^{18}\n\n1 \\leq A_i \\leq 10^6\\ (1 \\leq i \\leq N)\n\n1 \\leq F_i \\leq 10^6\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\nF_1 F_2 ... F_N\n\nOutput\n\nPrint the minimum possible score of the team.\n\nSample Input 1\n\n3 5\n4 2 1\n2 3 1\n\nSample Output 1\n\n2\n\nThey can achieve the score of 2, as follows:\n\nMember 1 does 4 sets of training and eats Food 2 in (4-4) \\times 3 = 0 seconds.\n\nMember 2 does 1 set of training and eats Food 3 in (2-1) \\times 1 = 1 second.\n\nMember 3 does 0 sets of training and eats Food 1 in (1-0) \\times 2 = 2 seconds.\n\nThey cannot achieve a score of less than 2, so the answer is 2.\n\nSample Input 2\n\n3 8\n4 2 1\n2 3 1\n\nSample Output 2\n\n0\n\nThey can choose not to do exactly K sets of training.\n\nSample Input 3\n\n11 14\n3 1 4 1 5 9 2 6 5 3 5\n8 9 7 9 3 2 3 8 4 6 2\n\nSample Output 3\n\n12", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1527, "cpu_time_ms": 764, "memory_kb": 9724}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s967268482", "group_id": "codeNet:p02883", "input_text": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\n---\nlocal N, K = read.nn()\nlocal A = read.N(N)\nlocal F = read.N(N)\ntable.sort(A)\ntable.sort(F, function(x,y)return x>y end)\nlocal upper_lim = A[N] * F[1]\n\nlocal time = {}\nfor i=1,N do\n time[i] = A[i] * F[i]\nend\n\nlocal function find_min_true()\n local ceil = math.ceil\n local max = math.max\n local function possible(max_time)\n local kk = K\n for i=1, N do\n kk = kk - max(ceil((time[i] - max_time) / F[i]), 0)\n if kk < 0 then\n return false\n end\n end\n return true\n end\n local left = -1\n local right = upper_lim\n while right - left > 1 do\n local m = left + (right - left) // 2\n if possible(m) then\n right = m\n else\n left = m\n end\n end\n return right\nend\n\nprint(find_min_true())\n", "language": "Lua", "metadata": {"date": 1572409688, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02883.html", "problem_id": "p02883", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02883/input.txt", "sample_output_relpath": "derived/input_output/data/p02883/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02883/Lua/s967268482.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s967268482", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\n---\nlocal N, K = read.nn()\nlocal A = read.N(N)\nlocal F = read.N(N)\ntable.sort(A)\ntable.sort(F, function(x,y)return x>y end)\nlocal upper_lim = A[N] * F[1]\n\nlocal time = {}\nfor i=1,N do\n time[i] = A[i] * F[i]\nend\n\nlocal function find_min_true()\n local ceil = math.ceil\n local max = math.max\n local function possible(max_time)\n local kk = K\n for i=1, N do\n kk = kk - max(ceil((time[i] - max_time) / F[i]), 0)\n if kk < 0 then\n return false\n end\n end\n return true\n end\n local left = -1\n local right = upper_lim\n while right - left > 1 do\n local m = left + (right - left) // 2\n if possible(m) then\n right = m\n else\n left = m\n end\n end\n return right\nend\n\nprint(find_min_true())\n", "problem_context": "Score: 500 points\n\nProblem Statement\n\nTakahashi will take part in an eating contest. Teams of N members will compete in this contest, and Takahashi's team consists of N players numbered 1 through N from youngest to oldest. The consumption coefficient of Member i is A_i.\n\nIn the contest, N foods numbered 1 through N will be presented, and the difficulty of Food i is F_i. The details of the contest are as follows:\n\nA team should assign one member to each food, and should not assign the same member to multiple foods.\n\nIt will take x \\times y seconds for a member to finish the food, where x is the consumption coefficient of the member and y is the difficulty of the dish.\n\nThe score of a team is the longest time it takes for an individual member to finish the food.\n\nBefore the contest, Takahashi's team decided to do some training. In one set of training, a member can reduce his/her consumption coefficient by 1, as long as it does not go below 0. However, for financial reasons, the N members can do at most K sets of training in total.\n\nWhat is the minimum possible score of the team, achieved by choosing the amounts of members' training and allocating the dishes optimally?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 10^{18}\n\n1 \\leq A_i \\leq 10^6\\ (1 \\leq i \\leq N)\n\n1 \\leq F_i \\leq 10^6\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\nF_1 F_2 ... F_N\n\nOutput\n\nPrint the minimum possible score of the team.\n\nSample Input 1\n\n3 5\n4 2 1\n2 3 1\n\nSample Output 1\n\n2\n\nThey can achieve the score of 2, as follows:\n\nMember 1 does 4 sets of training and eats Food 2 in (4-4) \\times 3 = 0 seconds.\n\nMember 2 does 1 set of training and eats Food 3 in (2-1) \\times 1 = 1 second.\n\nMember 3 does 0 sets of training and eats Food 1 in (1-0) \\times 2 = 2 seconds.\n\nThey cannot achieve a score of less than 2, so the answer is 2.\n\nSample Input 2\n\n3 8\n4 2 1\n2 3 1\n\nSample Output 2\n\n0\n\nThey can choose not to do exactly K sets of training.\n\nSample Input 3\n\n11 14\n3 1 4 1 5 9 2 6 5 3 5\n8 9 7 9 3 2 3 8 4 6 2\n\nSample Output 3\n\n12", "sample_input": "3 5\n4 2 1\n2 3 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02883", "source_text": "Score: 500 points\n\nProblem Statement\n\nTakahashi will take part in an eating contest. Teams of N members will compete in this contest, and Takahashi's team consists of N players numbered 1 through N from youngest to oldest. The consumption coefficient of Member i is A_i.\n\nIn the contest, N foods numbered 1 through N will be presented, and the difficulty of Food i is F_i. The details of the contest are as follows:\n\nA team should assign one member to each food, and should not assign the same member to multiple foods.\n\nIt will take x \\times y seconds for a member to finish the food, where x is the consumption coefficient of the member and y is the difficulty of the dish.\n\nThe score of a team is the longest time it takes for an individual member to finish the food.\n\nBefore the contest, Takahashi's team decided to do some training. In one set of training, a member can reduce his/her consumption coefficient by 1, as long as it does not go below 0. However, for financial reasons, the N members can do at most K sets of training in total.\n\nWhat is the minimum possible score of the team, achieved by choosing the amounts of members' training and allocating the dishes optimally?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 10^{18}\n\n1 \\leq A_i \\leq 10^6\\ (1 \\leq i \\leq N)\n\n1 \\leq F_i \\leq 10^6\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\nF_1 F_2 ... F_N\n\nOutput\n\nPrint the minimum possible score of the team.\n\nSample Input 1\n\n3 5\n4 2 1\n2 3 1\n\nSample Output 1\n\n2\n\nThey can achieve the score of 2, as follows:\n\nMember 1 does 4 sets of training and eats Food 2 in (4-4) \\times 3 = 0 seconds.\n\nMember 2 does 1 set of training and eats Food 3 in (2-1) \\times 1 = 1 second.\n\nMember 3 does 0 sets of training and eats Food 1 in (1-0) \\times 2 = 2 seconds.\n\nThey cannot achieve a score of less than 2, so the answer is 2.\n\nSample Input 2\n\n3 8\n4 2 1\n2 3 1\n\nSample Output 2\n\n0\n\nThey can choose not to do exactly K sets of training.\n\nSample Input 3\n\n11 14\n3 1 4 1 5 9 2 6 5 3 5\n8 9 7 9 3 2 3 8 4 6 2\n\nSample Output 3\n\n12", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1126, "cpu_time_ms": 2106, "memory_kb": 39800}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s673503810", "group_id": "codeNet:p02885", "input_text": "local a, b = io.read(\"*n\", \"*n\")\nlocal rest = a - b * 2\nif rest >= 0 then\n print(rest)\nelse\n print(0)\nend", "language": "Lua", "metadata": {"date": 1573004736, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02885.html", "problem_id": "p02885", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02885/input.txt", "sample_output_relpath": "derived/input_output/data/p02885/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02885/Lua/s673503810.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s673503810", "user_id": "u413686817"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local a, b = io.read(\"*n\", \"*n\")\nlocal rest = a - b * 2\nif rest >= 0 then\n print(rest)\nelse\n print(0)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThe window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the whole window.)\n\nWe will close the window so as to minimize the total horizontal length of the uncovered part of the window.\nFind the total horizontal length of the uncovered parts of the window then.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the total horizontal length of the uncovered parts of the window.\n\nSample Input 1\n\n12 4\n\nSample Output 1\n\n4\n\nWe have a window with a horizontal length of 12, and two curtains, each of length 4, that cover both ends of the window, for example. The uncovered part has a horizontal length of 4.\n\nSample Input 2\n\n20 15\n\nSample Output 2\n\n0\n\nIf the window is completely covered, print 0.\n\nSample Input 3\n\n20 30\n\nSample Output 3\n\n0\n\nEach curtain may be longer than the window.", "sample_input": "12 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02885", "source_text": "Score : 100 points\n\nProblem Statement\n\nThe window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the whole window.)\n\nWe will close the window so as to minimize the total horizontal length of the uncovered part of the window.\nFind the total horizontal length of the uncovered parts of the window then.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the total horizontal length of the uncovered parts of the window.\n\nSample Input 1\n\n12 4\n\nSample Output 1\n\n4\n\nWe have a window with a horizontal length of 12, and two curtains, each of length 4, that cover both ends of the window, for example. The uncovered part has a horizontal length of 4.\n\nSample Input 2\n\n20 15\n\nSample Output 2\n\n0\n\nIf the window is completely covered, print 0.\n\nSample Input 3\n\n20 30\n\nSample Output 3\n\n0\n\nEach curtain may be longer than the window.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 10, "memory_kb": 756}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s746715178", "group_id": "codeNet:p02885", "input_text": "a=io.read(\"*n\")\nb=io.read(\"*n\")\n\nans=a-(b*2)\nif ans <= 0 then\n print(0)\nelse\n print(ans)\nend", "language": "Lua", "metadata": {"date": 1572590048, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02885.html", "problem_id": "p02885", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02885/input.txt", "sample_output_relpath": "derived/input_output/data/p02885/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02885/Lua/s746715178.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s746715178", "user_id": "u535423069"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "a=io.read(\"*n\")\nb=io.read(\"*n\")\n\nans=a-(b*2)\nif ans <= 0 then\n print(0)\nelse\n print(ans)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThe window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the whole window.)\n\nWe will close the window so as to minimize the total horizontal length of the uncovered part of the window.\nFind the total horizontal length of the uncovered parts of the window then.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the total horizontal length of the uncovered parts of the window.\n\nSample Input 1\n\n12 4\n\nSample Output 1\n\n4\n\nWe have a window with a horizontal length of 12, and two curtains, each of length 4, that cover both ends of the window, for example. The uncovered part has a horizontal length of 4.\n\nSample Input 2\n\n20 15\n\nSample Output 2\n\n0\n\nIf the window is completely covered, print 0.\n\nSample Input 3\n\n20 30\n\nSample Output 3\n\n0\n\nEach curtain may be longer than the window.", "sample_input": "12 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02885", "source_text": "Score : 100 points\n\nProblem Statement\n\nThe window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the whole window.)\n\nWe will close the window so as to minimize the total horizontal length of the uncovered part of the window.\nFind the total horizontal length of the uncovered parts of the window then.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the total horizontal length of the uncovered parts of the window.\n\nSample Input 1\n\n12 4\n\nSample Output 1\n\n4\n\nWe have a window with a horizontal length of 12, and two curtains, each of length 4, that cover both ends of the window, for example. The uncovered part has a horizontal length of 4.\n\nSample Input 2\n\n20 15\n\nSample Output 2\n\n0\n\nIf the window is completely covered, print 0.\n\nSample Input 3\n\n20 30\n\nSample Output 3\n\n0\n\nEach curtain may be longer than the window.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s324690079", "group_id": "codeNet:p02886", "input_text": "n=io.read(\"*n\")\nd={}\nfor i=1,n do\n table.insert(d,io.read(\"*n\"))\nend\n\nv={}\nfor i=1,n-1 do\n l=0\n for j=i+1,n do\n l=l+d[j]\n end\n table.insert(v,l)\nend\n\nans=0\nfor i=1,n-1 do\n ans=ans+(d[i]*v[i])\nend\n\nprint(ans)", "language": "Lua", "metadata": {"date": 1572592224, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02886.html", "problem_id": "p02886", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02886/input.txt", "sample_output_relpath": "derived/input_output/data/p02886/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02886/Lua/s324690079.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s324690079", "user_id": "u535423069"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "n=io.read(\"*n\")\nd={}\nfor i=1,n do\n table.insert(d,io.read(\"*n\"))\nend\n\nv={}\nfor i=1,n-1 do\n l=0\n for j=i+1,n do\n l=l+d[j]\n end\n table.insert(v,l)\nend\n\nans=0\nfor i=1,n-1 do\n ans=ans+(d[i]*v[i])\nend\n\nprint(ans)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIt's now the season of TAKOYAKI FESTIVAL!\n\nThis year, N takoyaki (a ball-shaped food with a piece of octopus inside) will be served. The deliciousness of the i-th takoyaki is d_i.\n\nAs is commonly known, when you eat two takoyaki of deliciousness x and y together, you restore x \\times y health points.\n\nThere are \\frac{N \\times (N - 1)}{2} ways to choose two from the N takoyaki served in the festival. For each of these choices, find the health points restored from eating the two takoyaki, then compute the sum of these \\frac{N \\times (N - 1)}{2} values.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 50\n\n0 \\leq d_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1 d_2 ... d_N\n\nOutput\n\nPrint the sum of the health points restored from eating two takoyaki over all possible choices of two takoyaki from the N takoyaki served.\n\nSample Input 1\n\n3\n3 1 2\n\nSample Output 1\n\n11\n\nThere are three possible choices:\n\nEat the first and second takoyaki. You will restore 3 health points.\n\nEat the second and third takoyaki. You will restore 2 health points.\n\nEat the first and third takoyaki. You will restore 6 health points.\n\nThe sum of these values is 11.\n\nSample Input 2\n\n7\n5 0 7 8 3 3 2\n\nSample Output 2\n\n312", "sample_input": "3\n3 1 2\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02886", "source_text": "Score : 200 points\n\nProblem Statement\n\nIt's now the season of TAKOYAKI FESTIVAL!\n\nThis year, N takoyaki (a ball-shaped food with a piece of octopus inside) will be served. The deliciousness of the i-th takoyaki is d_i.\n\nAs is commonly known, when you eat two takoyaki of deliciousness x and y together, you restore x \\times y health points.\n\nThere are \\frac{N \\times (N - 1)}{2} ways to choose two from the N takoyaki served in the festival. For each of these choices, find the health points restored from eating the two takoyaki, then compute the sum of these \\frac{N \\times (N - 1)}{2} values.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 50\n\n0 \\leq d_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1 d_2 ... d_N\n\nOutput\n\nPrint the sum of the health points restored from eating two takoyaki over all possible choices of two takoyaki from the N takoyaki served.\n\nSample Input 1\n\n3\n3 1 2\n\nSample Output 1\n\n11\n\nThere are three possible choices:\n\nEat the first and second takoyaki. You will restore 3 health points.\n\nEat the second and third takoyaki. You will restore 2 health points.\n\nEat the first and third takoyaki. You will restore 6 health points.\n\nThe sum of these values is 11.\n\nSample Input 2\n\n7\n5 0 7 8 3 3 2\n\nSample Output 2\n\n312", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 216, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s536319785", "group_id": "codeNet:p02886", "input_text": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\n--\nlocal N = read.n()\nlocal D = read.N(N)\nlocal sum = 0\nfor i=1,N-1 do\n for j=i+1,N do\n sum = sum + D[i] * D[j]\n end\nend\nprint(sum)", "language": "Lua", "metadata": {"date": 1571533361, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02886.html", "problem_id": "p02886", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02886/input.txt", "sample_output_relpath": "derived/input_output/data/p02886/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02886/Lua/s536319785.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s536319785", "user_id": "u162773977"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\n--\nlocal N = read.n()\nlocal D = read.N(N)\nlocal sum = 0\nfor i=1,N-1 do\n for j=i+1,N do\n sum = sum + D[i] * D[j]\n end\nend\nprint(sum)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIt's now the season of TAKOYAKI FESTIVAL!\n\nThis year, N takoyaki (a ball-shaped food with a piece of octopus inside) will be served. The deliciousness of the i-th takoyaki is d_i.\n\nAs is commonly known, when you eat two takoyaki of deliciousness x and y together, you restore x \\times y health points.\n\nThere are \\frac{N \\times (N - 1)}{2} ways to choose two from the N takoyaki served in the festival. For each of these choices, find the health points restored from eating the two takoyaki, then compute the sum of these \\frac{N \\times (N - 1)}{2} values.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 50\n\n0 \\leq d_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1 d_2 ... d_N\n\nOutput\n\nPrint the sum of the health points restored from eating two takoyaki over all possible choices of two takoyaki from the N takoyaki served.\n\nSample Input 1\n\n3\n3 1 2\n\nSample Output 1\n\n11\n\nThere are three possible choices:\n\nEat the first and second takoyaki. You will restore 3 health points.\n\nEat the second and third takoyaki. You will restore 2 health points.\n\nEat the first and third takoyaki. You will restore 6 health points.\n\nThe sum of these values is 11.\n\nSample Input 2\n\n7\n5 0 7 8 3 3 2\n\nSample Output 2\n\n312", "sample_input": "3\n3 1 2\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02886", "source_text": "Score : 200 points\n\nProblem Statement\n\nIt's now the season of TAKOYAKI FESTIVAL!\n\nThis year, N takoyaki (a ball-shaped food with a piece of octopus inside) will be served. The deliciousness of the i-th takoyaki is d_i.\n\nAs is commonly known, when you eat two takoyaki of deliciousness x and y together, you restore x \\times y health points.\n\nThere are \\frac{N \\times (N - 1)}{2} ways to choose two from the N takoyaki served in the festival. For each of these choices, find the health points restored from eating the two takoyaki, then compute the sum of these \\frac{N \\times (N - 1)}{2} values.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 50\n\n0 \\leq d_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1 d_2 ... d_N\n\nOutput\n\nPrint the sum of the health points restored from eating two takoyaki over all possible choices of two takoyaki from the N takoyaki served.\n\nSample Input 1\n\n3\n3 1 2\n\nSample Output 1\n\n11\n\nThere are three possible choices:\n\nEat the first and second takoyaki. You will restore 3 health points.\n\nEat the second and third takoyaki. You will restore 2 health points.\n\nEat the first and third takoyaki. You will restore 6 health points.\n\nThe sum of these values is 11.\n\nSample Input 2\n\n7\n5 0 7 8 3 3 2\n\nSample Output 2\n\n312", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 690, "cpu_time_ms": 10, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s183493861", "group_id": "codeNet:p02887", "input_text": "N=io.read\"*n\"\nio.read()\nS=io.read()\na=S:sub(1,1)\ns=1\nfor i=2,N do\n\tif(a~=S:sub(i,i))then s=s+1 a=S:sub(i,i)end\nend\nprint(s)", "language": "Lua", "metadata": {"date": 1587861862, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s183493861.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s183493861", "user_id": "u726173718"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "N=io.read\"*n\"\nio.read()\nS=io.read()\na=S:sub(1,1)\ns=1\nfor i=2,N do\n\tif(a~=S:sub(i,i))then s=s+1 a=S:sub(i,i)end\nend\nprint(s)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 512}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s252311402", "group_id": "codeNet:p02887", "input_text": "N=io.read\"*n\"\nio.read()\nS=io.read()\na=S[1]\ns=0\nfor i=2,N do\n\tif(a~=S:sub(i,i))then s=s+1 a=S:sub(i,i)end\nend\nprint(s)", "language": "Lua", "metadata": {"date": 1587861824, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s252311402.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s252311402", "user_id": "u726173718"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "N=io.read\"*n\"\nio.read()\nS=io.read()\na=S[1]\ns=0\nfor i=2,N do\n\tif(a~=S:sub(i,i))then s=s+1 a=S:sub(i,i)end\nend\nprint(s)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 512}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s053569167", "group_id": "codeNet:p02887", "input_text": "function char(s, n)\n return s:sub(n, n)\nend\n\nn=io.read(\"*n\", \"*l\")\ns=io.read(n)\n\nans=1\nfor i=1,n-1 do\n if char(s,i)~=char(s,i+1) then\n ans=ans+1\n end\nend\n\nprint(ans)", "language": "Lua", "metadata": {"date": 1572611922, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s053569167.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s053569167", "user_id": "u535423069"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "function char(s, n)\n return s:sub(n, n)\nend\n\nn=io.read(\"*n\", \"*l\")\ns=io.read(n)\n\nans=1\nfor i=1,n-1 do\n if char(s,i)~=char(s,i+1) then\n ans=ans+1\n end\nend\n\nprint(ans)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 512}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s839567393", "group_id": "codeNet:p02887", "input_text": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\n--\nlocal N = read.nl()\nlocal S = (read.l()):totable()\nlocal t = {S[1]}\nfor i=2,N do\n local last = t[#t]\n if S[i] ~= last then\n table.insert(t, S[i])\n end\nend\nprint(#t)\n", "language": "Lua", "metadata": {"date": 1571533555, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s839567393.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s839567393", "user_id": "u162773977"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\n--\nlocal N = read.nl()\nlocal S = (read.l()):totable()\nlocal t = {S[1]}\nfor i=2,N do\n local last = t[#t]\n if S[i] ~= last then\n table.insert(t, S[i])\n end\nend\nprint(#t)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N slimes lining up from left to right. The colors of these slimes will be given as a string S of length N consisting of lowercase English letters. The i-th slime from the left has the color that corresponds to the i-th character of S.\n\nAdjacent slimes with the same color will fuse into one larger slime without changing the color. If there were a slime adjacent to this group of slimes before fusion, that slime is now adjacent to the new larger slime.\n\nUltimately, how many slimes will be there?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the final number of slimes.\n\nSample Input 1\n\n10\naabbbbaaca\n\nSample Output 1\n\n5\n\nUltimately, these slimes will fuse into abaca.\n\nSample Input 2\n\n5\naaaaa\n\nSample Output 2\n\n1\n\nAll the slimes will fuse into one.\n\nSample Input 3\n\n20\nxxzaffeeeeddfkkkkllq\n\nSample Output 3\n\n10", "sample_input": "10\naabbbbaaca\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02887", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N slimes lining up from left to right. The colors of these slimes will be given as a string S of length N consisting of lowercase English letters. The i-th slime from the left has the color that corresponds to the i-th character of S.\n\nAdjacent slimes with the same color will fuse into one larger slime without changing the color. If there were a slime adjacent to this group of slimes before fusion, that slime is now adjacent to the new larger slime.\n\nUltimately, how many slimes will be there?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the final number of slimes.\n\nSample Input 1\n\n10\naabbbbaaca\n\nSample Output 1\n\n5\n\nUltimately, these slimes will fuse into abaca.\n\nSample Input 2\n\n5\naaaaa\n\nSample Output 2\n\n1\n\nAll the slimes will fuse into one.\n\nSample Input 3\n\n20\nxxzaffeeeeddfkkkkllq\n\nSample Output 3\n\n10", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 730, "cpu_time_ms": 83, "memory_kb": 4628}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s538081409", "group_id": "codeNet:p02888", "input_text": "local mfl = math.floor\n\nlocal function comp(a, b)\n return a < b\nend\n\nlocal function lower_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if not comp(ary[1], x) then return 1 end\n if comp(ary[num], x) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if comp(ary[mid], x) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal n = io.read(\"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = io.read(\"*n\")\nend\ntable.sort(t)\nlocal ret = 0\nfor i = 1, n - 2 do\n for j = i + 1, n - 1 do\n local lb = lower_bound(t, t[i] + t[j]) - 1\n ret = ret + lb - j\n end\nend\nprint(ret)", "language": "Lua", "metadata": {"date": 1597757791, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s538081409.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s538081409", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local mfl = math.floor\n\nlocal function comp(a, b)\n return a < b\nend\n\nlocal function lower_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if not comp(ary[1], x) then return 1 end\n if comp(ary[num], x) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if comp(ary[mid], x) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal n = io.read(\"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = io.read(\"*n\")\nend\ntable.sort(t)\nlocal ret = 0\nfor i = 1, n - 2 do\n for j = i + 1, n - 1 do\n local lb = lower_bound(t, t[i] + t[j]) - 1\n ret = ret + lb - j\n end\nend\nprint(ret)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 681, "cpu_time_ms": 1458, "memory_kb": 2748}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s135476488", "group_id": "codeNet:p02888", "input_text": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\n--\n-- 1 <= input to f <= n\nlocal function find_min_true(n, f)\n local function loop(i, j)\n if i == j then\n --assert(i >= 1 and i <= n + 1)\n return i\n end\n local h = math.floor((i + j) / 2)\n --assert(h >= 1 and h <= n)\n if f(h) then\n return loop(i, h)\n else\n return loop(h + 1, j)\n end\n end\n return loop(1, n + 1)\nend\n--\nlocal N = read.n()\nlocal L = read.N(N)\ntable.sort(L)\nlocal ans = 0\nfor i=1,N-2 do\n local a = L[i]\n for j=i+1,N-1 do\n local b = L[j]\n local function count()\n local function f(x)\n x = x + j -- [1,N-j] --> [j+1,N]\n local c = L[x]\n return c >= a + b\n end\n return find_min_true(N-j, f) - 1\n end\n ans = ans + count()\n end\nend\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1571537093, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s135476488.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s135476488", "user_id": "u162773977"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\n--\n-- 1 <= input to f <= n\nlocal function find_min_true(n, f)\n local function loop(i, j)\n if i == j then\n --assert(i >= 1 and i <= n + 1)\n return i\n end\n local h = math.floor((i + j) / 2)\n --assert(h >= 1 and h <= n)\n if f(h) then\n return loop(i, h)\n else\n return loop(h + 1, j)\n end\n end\n return loop(1, n + 1)\nend\n--\nlocal N = read.n()\nlocal L = read.N(N)\ntable.sort(L)\nlocal ans = 0\nfor i=1,N-2 do\n local a = L[i]\n for j=i+1,N-1 do\n local b = L[j]\n local function count()\n local function f(x)\n x = x + j -- [1,N-j] --> [j+1,N]\n local c = L[x]\n return c >= a + b\n end\n return find_min_true(N-j, f) - 1\n end\n ans = ans + count()\n end\nend\nprint(ans)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi has N sticks that are distinguishable from each other. The length of the i-th stick is L_i.\n\nHe is going to form a triangle using three of these sticks. Let a, b, and c be the lengths of the three sticks used. Here, all of the following conditions must be satisfied:\n\na < b + c\n\nb < c + a\n\nc < a + b\n\nHow many different triangles can be formed? Two triangles are considered different when there is a stick used in only one of them.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 2 \\times 10^3\n\n1 \\leq L_i \\leq 10^3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nConstraints\n\nPrint the number of different triangles that can be formed.\n\nSample Input 1\n\n4\n3 4 2 1\n\nSample Output 1\n\n1\n\nOnly one triangle can be formed: the triangle formed by the first, second, and third sticks.\n\nSample Input 2\n\n3\n1 1000 1\n\nSample Output 2\n\n0\n\nNo triangles can be formed.\n\nSample Input 3\n\n7\n218 786 704 233 645 728 389\n\nSample Output 3\n\n23", "sample_input": "4\n3 4 2 1\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02888", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi has N sticks that are distinguishable from each other. The length of the i-th stick is L_i.\n\nHe is going to form a triangle using three of these sticks. Let a, b, and c be the lengths of the three sticks used. Here, all of the following conditions must be satisfied:\n\na < b + c\n\nb < c + a\n\nc < a + b\n\nHow many different triangles can be formed? Two triangles are considered different when there is a stick used in only one of them.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 2 \\times 10^3\n\n1 \\leq L_i \\leq 10^3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nConstraints\n\nPrint the number of different triangles that can be formed.\n\nSample Input 1\n\n4\n3 4 2 1\n\nSample Output 1\n\n1\n\nOnly one triangle can be formed: the triangle formed by the first, second, and third sticks.\n\nSample Input 2\n\n3\n1 1000 1\n\nSample Output 2\n\n0\n\nNo triangles can be formed.\n\nSample Input 3\n\n7\n218 786 704 233 645 728 389\n\nSample Output 3\n\n23", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1413, "cpu_time_ms": 1268, "memory_kb": 512}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s569010221", "group_id": "codeNet:p02889", "input_text": "local mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n -- for i = 1, #ary do self.stage[stagenum][i] = ary[i] end\n -- for i = #ary + 1, mul do self.stage[stagenum][i] = emptyvalue end\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mmi(r, mce((l - 1) / sz) * sz)\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)\n l = newr + 1\n end\n if sz <= r + 1 - l then\n ret = self.func(ret, self.stage[stage][mce(l / sz)])\n l = l + sz\n end\n if l <= r then\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n end\n end\n return ret\nend\nSegTree.setValue = function(self, idx, value, silent)\n self.stage[self.stagenum][idx] = value\n if not silent then\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n end\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal n, m, l = io.read(\"*n\", \"*n\", \"*n\")\nlocal edge = {}\nfor i = 1, n do\n edge[i] = {}\nend\nfor i = 1, m do\n local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n if c <= l then\n edge[a][b] = c\n edge[b][a] = c\n end\nend\nlocal len = {}\nlocal inf = 301 * 1000000000\nfor i = 1, n do\n len[i] = inf\nend\nlocal function lessthan(x, y, cost)\n return len[x] + cost < len[y]\nend\nlocal function merge(x, y)\n if n < x then return y end\n if n < y then return x end\n return lessthan(x, y, 0) and x or y\nend\nlocal st = SegTree.new(n, merge, n + 1)\nfor i = 1, n do st:setValue(i, i) end\nlocal alllen = {}\n\nlocal function solve(start_pos)\n alllen[start_pos] = {}\n for i = 1, n do\n len[i] = inf\n alllen[start_pos][i] = 301\n end\n len[start_pos] = 0\n st:updateAll()\n for tankuse = 0, n - 2 do\n local asked = {}\n for i = 1, n do\n asked[i] = false\n end\n for _u = 1, n do\n local src = st.stage[1][1]\n if inf <= len[src] then break end\n asked[src] = true\n if alllen[start_pos][src] == 301 then\n alllen[start_pos][src] = tankuse\n end\n for dst, cost in pairs(edge[src]) do\n if not asked[dst] and len[src] + cost <= l and lessthan(src, dst, cost) then\n len[dst] = len[src] + cost\n st:setValue(dst, dst)\n end\n end\n len[src] = inf\n st:setValue(src, src)\n end\n for i = 1, n do\n if asked[i] then\n len[i] = 0\n end\n end\n st:updateAll()\n end\nend\n\nfor i = 1, n do\n solve(i)\nend\n\nlocal q = io.read(\"*n\")\nfor i = 1, q do\n local s, t = io.read(\"*n\", \"*n\")\n print(alllen[s][t] < 301 and alllen[s][t] or -1)\nend\n", "language": "Lua", "metadata": {"date": 1571538512, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02889.html", "problem_id": "p02889", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02889/input.txt", "sample_output_relpath": "derived/input_output/data/p02889/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02889/Lua/s569010221.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s569010221", "user_id": "u120582723"}, "prompt_components": {"gold_output": "0\n1\n", "input_to_evaluate": "local mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n -- for i = 1, #ary do self.stage[stagenum][i] = ary[i] end\n -- for i = #ary + 1, mul do self.stage[stagenum][i] = emptyvalue end\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mmi(r, mce((l - 1) / sz) * sz)\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)\n l = newr + 1\n end\n if sz <= r + 1 - l then\n ret = self.func(ret, self.stage[stage][mce(l / sz)])\n l = l + sz\n end\n if l <= r then\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n end\n end\n return ret\nend\nSegTree.setValue = function(self, idx, value, silent)\n self.stage[self.stagenum][idx] = value\n if not silent then\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n end\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal n, m, l = io.read(\"*n\", \"*n\", \"*n\")\nlocal edge = {}\nfor i = 1, n do\n edge[i] = {}\nend\nfor i = 1, m do\n local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n if c <= l then\n edge[a][b] = c\n edge[b][a] = c\n end\nend\nlocal len = {}\nlocal inf = 301 * 1000000000\nfor i = 1, n do\n len[i] = inf\nend\nlocal function lessthan(x, y, cost)\n return len[x] + cost < len[y]\nend\nlocal function merge(x, y)\n if n < x then return y end\n if n < y then return x end\n return lessthan(x, y, 0) and x or y\nend\nlocal st = SegTree.new(n, merge, n + 1)\nfor i = 1, n do st:setValue(i, i) end\nlocal alllen = {}\n\nlocal function solve(start_pos)\n alllen[start_pos] = {}\n for i = 1, n do\n len[i] = inf\n alllen[start_pos][i] = 301\n end\n len[start_pos] = 0\n st:updateAll()\n for tankuse = 0, n - 2 do\n local asked = {}\n for i = 1, n do\n asked[i] = false\n end\n for _u = 1, n do\n local src = st.stage[1][1]\n if inf <= len[src] then break end\n asked[src] = true\n if alllen[start_pos][src] == 301 then\n alllen[start_pos][src] = tankuse\n end\n for dst, cost in pairs(edge[src]) do\n if not asked[dst] and len[src] + cost <= l and lessthan(src, dst, cost) then\n len[dst] = len[src] + cost\n st:setValue(dst, dst)\n end\n end\n len[src] = inf\n st:setValue(src, src)\n end\n for i = 1, n do\n if asked[i] then\n len[i] = 0\n end\n end\n st:updateAll()\n end\nend\n\nfor i = 1, n do\n solve(i)\nend\n\nlocal q = io.read(\"*n\")\nfor i = 1, q do\n local s, t = io.read(\"*n\", \"*n\")\n print(alllen[s][t] < 301 and alllen[s][t] or -1)\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N towns numbered 1 to N and M roads. The i-th road connects Town A_i and Town B_i bidirectionally and has a length of C_i.\n\nTakahashi will travel between these towns by car, passing through these roads. The fuel tank of his car can contain at most L liters of fuel, and one liter of fuel is consumed for each unit distance traveled. When visiting a town while traveling, he can full the tank (or choose not to do so). Travel that results in the tank becoming empty halfway on the road cannot be done.\n\nProcess the following Q queries:\n\nThe tank is now full. Find the minimum number of times he needs to full his tank while traveling from Town s_i to Town t_i. If Town t_i is unreachable, print -1.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 300\n\n0 \\leq M \\leq \\frac{N(N-1)}{2}\n\n1 \\leq L \\leq 10^9\n\n1 \\leq A_i, B_i \\leq N\n\nA_i \\neq B_i\n\n\\left(A_i, B_i\\right) \\neq \\left(A_j, B_j\\right) (if i \\neq j)\n\n\\left(A_i, B_i\\right) \\neq \\left(B_j, A_j\\right) (if i \\neq j)\n\n1 \\leq C_i \\leq 10^9\n\n1 \\leq Q \\leq N\\left(N-1\\right)\n\n1 \\leq s_i, t_i \\leq N\n\ns_i \\neq t_i\n\n\\left(s_i, t_i\\right) \\neq \\left(s_j, t_j\\right) (if i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M L\nA_1 B_1 C_1\n:\nA_M B_M C_M\nQ\ns_1 t_1\n:\ns_Q t_Q\n\nOutput\n\nPrint Q lines.\n\nThe i-th line should contain the minimum number of times the tank needs to be fulled while traveling from Town s_i to Town t_i. If Town t_i is unreachable, the line should contain -1 instead.\n\nSample Input 1\n\n3 2 5\n1 2 3\n2 3 3\n2\n3 2\n1 3\n\nSample Output 1\n\n0\n1\n\nTo travel from Town 3 to Town 2, we can use the second road to reach Town 2 without fueling the tank on the way.\n\nTo travel from Town 1 to Town 3, we can first use the first road to get to Town 2, full the tank, and use the second road to reach Town 3.\n\nSample Input 2\n\n4 0 1\n1\n2 1\n\nSample Output 2\n\n-1\n\nThere may be no road at all.\n\nSample Input 3\n\n5 4 4\n1 2 2\n2 3 2\n3 4 3\n4 5 2\n20\n2 1\n3 1\n4 1\n5 1\n1 2\n3 2\n4 2\n5 2\n1 3\n2 3\n4 3\n5 3\n1 4\n2 4\n3 4\n5 4\n1 5\n2 5\n3 5\n4 5\n\nSample Output 3\n\n0\n0\n1\n2\n0\n0\n1\n2\n0\n0\n0\n1\n1\n1\n0\n0\n2\n2\n1\n0", "sample_input": "3 2 5\n1 2 3\n2 3 3\n2\n3 2\n1 3\n"}, "reference_outputs": ["0\n1\n"], "source_document_id": "p02889", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N towns numbered 1 to N and M roads. The i-th road connects Town A_i and Town B_i bidirectionally and has a length of C_i.\n\nTakahashi will travel between these towns by car, passing through these roads. The fuel tank of his car can contain at most L liters of fuel, and one liter of fuel is consumed for each unit distance traveled. When visiting a town while traveling, he can full the tank (or choose not to do so). Travel that results in the tank becoming empty halfway on the road cannot be done.\n\nProcess the following Q queries:\n\nThe tank is now full. Find the minimum number of times he needs to full his tank while traveling from Town s_i to Town t_i. If Town t_i is unreachable, print -1.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 300\n\n0 \\leq M \\leq \\frac{N(N-1)}{2}\n\n1 \\leq L \\leq 10^9\n\n1 \\leq A_i, B_i \\leq N\n\nA_i \\neq B_i\n\n\\left(A_i, B_i\\right) \\neq \\left(A_j, B_j\\right) (if i \\neq j)\n\n\\left(A_i, B_i\\right) \\neq \\left(B_j, A_j\\right) (if i \\neq j)\n\n1 \\leq C_i \\leq 10^9\n\n1 \\leq Q \\leq N\\left(N-1\\right)\n\n1 \\leq s_i, t_i \\leq N\n\ns_i \\neq t_i\n\n\\left(s_i, t_i\\right) \\neq \\left(s_j, t_j\\right) (if i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M L\nA_1 B_1 C_1\n:\nA_M B_M C_M\nQ\ns_1 t_1\n:\ns_Q t_Q\n\nOutput\n\nPrint Q lines.\n\nThe i-th line should contain the minimum number of times the tank needs to be fulled while traveling from Town s_i to Town t_i. If Town t_i is unreachable, the line should contain -1 instead.\n\nSample Input 1\n\n3 2 5\n1 2 3\n2 3 3\n2\n3 2\n1 3\n\nSample Output 1\n\n0\n1\n\nTo travel from Town 3 to Town 2, we can use the second road to reach Town 2 without fueling the tank on the way.\n\nTo travel from Town 1 to Town 3, we can first use the first road to get to Town 2, full the tank, and use the second road to reach Town 3.\n\nSample Input 2\n\n4 0 1\n1\n2 1\n\nSample Output 2\n\n-1\n\nThere may be no road at all.\n\nSample Input 3\n\n5 4 4\n1 2 2\n2 3 2\n3 4 3\n4 5 2\n20\n2 1\n3 1\n4 1\n5 1\n1 2\n3 2\n4 2\n5 2\n1 3\n2 3\n4 3\n5 3\n1 4\n2 4\n3 4\n5 4\n1 5\n2 5\n3 5\n4 5\n\nSample Output 3\n\n0\n0\n1\n2\n0\n0\n1\n2\n0\n0\n0\n1\n1\n1\n0\n0\n2\n2\n1\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3907, "cpu_time_ms": 2103, "memory_kb": 4608}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s726588284", "group_id": "codeNet:p02897", "input_text": "local n=io.read(\"n\")\nprint(string.format(\"%0.12f\",math.ceil(n/2)/n))", "language": "Lua", "metadata": {"date": 1592141914, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s726588284.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s726588284", "user_id": "u045238009"}, "prompt_components": {"gold_output": "0.5000000000\n", "input_to_evaluate": "local n=io.read(\"n\")\nprint(string.format(\"%0.12f\",math.ceil(n/2)/n))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer N.\n\nTakahashi chooses an integer a from the positive integers not greater than N with equal probability.\n\nFind the probability that a is odd.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the probability that a is odd.\nYour output will be considered correct when its absolute or relative error from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n0.5000000000\n\nThere are four positive integers not greater than 4: 1, 2, 3, and 4. Among them, we have two odd numbers: 1 and 3. Thus, the answer is \\frac{2}{4} = 0.5.\n\nSample Input 2\n\n5\n\nSample Output 2\n\n0.6000000000\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1.0000000000", "sample_input": "4\n"}, "reference_outputs": ["0.5000000000\n"], "source_document_id": "p02897", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer N.\n\nTakahashi chooses an integer a from the positive integers not greater than N with equal probability.\n\nFind the probability that a is odd.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the probability that a is odd.\nYour output will be considered correct when its absolute or relative error from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n0.5000000000\n\nThere are four positive integers not greater than 4: 1, 2, 3, and 4. Among them, we have two odd numbers: 1 and 3. Thus, the answer is \\frac{2}{4} = 0.5.\n\nSample Input 2\n\n5\n\nSample Output 2\n\n0.6000000000\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1.0000000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 68, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s502775665", "group_id": "codeNet:p02897", "input_text": "local a=io.read(\"*n\")\nprint((a+a%2)/2/a)", "language": "Lua", "metadata": {"date": 1576556130, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s502775665.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s502775665", "user_id": "u373958718"}, "prompt_components": {"gold_output": "0.5000000000\n", "input_to_evaluate": "local a=io.read(\"*n\")\nprint((a+a%2)/2/a)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 40, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s203111721", "group_id": "codeNet:p02897", "input_text": "local a=io.read(\"*n\")\nprint((a+1)//2/a)", "language": "Lua", "metadata": {"date": 1576556057, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s203111721.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s203111721", "user_id": "u373958718"}, "prompt_components": {"gold_output": "0.5000000000\n", "input_to_evaluate": "local a=io.read(\"*n\")\nprint((a+1)//2/a)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 39, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s439077084", "group_id": "codeNet:p02898", "input_text": "n=io.read(\"*n\")\nk=io.read(\"*n\")\nh={}\nfor i=1,n do\n table.insert(h,io.read(\"*n\"))\nend\n\nans=0\nfor i=1,n do\n if h[i]>=k then\n ans=ans+1\n end\nend\n\nprint(ans)", "language": "Lua", "metadata": {"date": 1572640312, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s439077084.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s439077084", "user_id": "u535423069"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "n=io.read(\"*n\")\nk=io.read(\"*n\")\nh={}\nfor i=1,n do\n table.insert(h,io.read(\"*n\"))\nend\n\nans=0\nfor i=1,n do\n if h[i]>=k then\n ans=ans+1\n end\nend\n\nprint(ans)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 34, "memory_kb": 1280}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s651070939", "group_id": "codeNet:p02898", "input_text": "local n, k = io.read(\"*n\", \"*n\")\nlocal cnt = 0\nfor i = 1, n do\n local h = io.read(\"*n\")\n if k <= h then cnt = cnt + 1 end\nend\nprint(cnt)\n", "language": "Lua", "metadata": {"date": 1569718929, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s651070939.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s651070939", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n, k = io.read(\"*n\", \"*n\")\nlocal cnt = 0\nfor i = 1, n do\n local h = io.read(\"*n\")\n if k <= h then cnt = cnt + 1 end\nend\nprint(cnt)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nN friends of Takahashi has come to a theme park.\n\nTo ride the most popular roller coaster in the park, you must be at least K centimeters tall.\n\nThe i-th friend is h_i centimeters tall.\n\nHow many of the Takahashi's friends can ride the roller coaster?\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le K \\le 500\n\n1 \\le h_i \\le 500\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the number of people among the Takahashi's friends who can ride the roller coaster.\n\nSample Input 1\n\n4 150\n150 140 100 200\n\nSample Output 1\n\n2\n\nTwo of them can ride the roller coaster: the first and fourth friends.\n\nSample Input 2\n\n1 500\n499\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5 1\n100 200 300 400 500\n\nSample Output 3\n\n5", "sample_input": "4 150\n150 140 100 200\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02898", "source_text": "Score : 200 points\n\nProblem Statement\n\nN friends of Takahashi has come to a theme park.\n\nTo ride the most popular roller coaster in the park, you must be at least K centimeters tall.\n\nThe i-th friend is h_i centimeters tall.\n\nHow many of the Takahashi's friends can ride the roller coaster?\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le K \\le 500\n\n1 \\le h_i \\le 500\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the number of people among the Takahashi's friends who can ride the roller coaster.\n\nSample Input 1\n\n4 150\n150 140 100 200\n\nSample Output 1\n\n2\n\nTwo of them can ride the roller coaster: the first and fourth friends.\n\nSample Input 2\n\n1 500\n499\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5 1\n100 200 300 400 500\n\nSample Output 3\n\n5", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 25, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s540659015", "group_id": "codeNet:p02900", "input_text": "local DBG = true\nlocal function dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nlocal function dbgpr_t(tbl, use_pairs)\n if DBG then\n local enum = ipairs\n if use_pairs then\n enum = pairs\n end\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in enum(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\nlocal function factorize(n)\n local nn = n\n local lst = {}\n for i = 2, math.floor(n ^ 0.5) do\n k = 0\n while nn % i == 0 do\n k = k + 1\n nn = nn // i\n table.insert(lst, i)\n end\n end\n if nn ~= 1 then\n table.insert(lst, nn)\n end\n return lst\nend\n\nlocal A, B = io.read(\"n\",\"n\")\nlocal f1 = factorize(A)\nlocal f2 = factorize(B)\nlocal s1 = {}\nfor _,v in ipairs(f1) do\n s1[v] = true\nend\nlocal s2 = {}\nfor _,v in ipairs(f2) do\n s2[v] = true\nend\nlocal smul = {1}\nfor k,_ in pairs(s1) do\n if s2[k] then\n table.insert(smul, k)\n end\nend\nprint(#smul)\n", "language": "Lua", "metadata": {"date": 1569719901, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02900.html", "problem_id": "p02900", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02900/input.txt", "sample_output_relpath": "derived/input_output/data/p02900/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02900/Lua/s540659015.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s540659015", "user_id": "u162773977"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local DBG = true\nlocal function dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nlocal function dbgpr_t(tbl, use_pairs)\n if DBG then\n local enum = ipairs\n if use_pairs then\n enum = pairs\n end\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in enum(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\nlocal function factorize(n)\n local nn = n\n local lst = {}\n for i = 2, math.floor(n ^ 0.5) do\n k = 0\n while nn % i == 0 do\n k = k + 1\n nn = nn // i\n table.insert(lst, i)\n end\n end\n if nn ~= 1 then\n table.insert(lst, nn)\n end\n return lst\nend\n\nlocal A, B = io.read(\"n\",\"n\")\nlocal f1 = factorize(A)\nlocal f2 = factorize(B)\nlocal s1 = {}\nfor _,v in ipairs(f1) do\n s1[v] = true\nend\nlocal s2 = {}\nfor _,v in ipairs(f2) do\n s2[v] = true\nend\nlocal smul = {1}\nfor k,_ in pairs(s1) do\n if s2[k] then\n table.insert(smul, k)\n end\nend\nprint(#smul)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are positive integers A and B.\n\nLet us choose some number of positive common divisors of A and B.\n\nHere, any two of the chosen divisors must be coprime.\n\nAt most, how many divisors can we choose?\n\nDefinition of common divisor\n\nAn integer d is said to be a common divisor of integers x and y when d divides both x and y.\n\nDefinition of being coprime\n\nIntegers x and y are said to be coprime when x and y have no positive common divisors other than 1.\n\nDefinition of dividing\n\nAn integer x is said to divide another integer y when there exists an integer \\alpha such that y = \\alpha x.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of divisors that can be chosen to satisfy the condition.\n\nSample Input 1\n\n12 18\n\nSample Output 1\n\n3\n\n12 and 18 have the following positive common divisors: 1, 2, 3, and 6.\n\n1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can choose 1, 2, and 3, which achieve the maximum result.\n\nSample Input 2\n\n420 660\n\nSample Output 2\n\n4\n\nSample Input 3\n\n1 2019\n\nSample Output 3\n\n1\n\n1 and 2019 have no positive common divisors other than 1.", "sample_input": "12 18\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02900", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are positive integers A and B.\n\nLet us choose some number of positive common divisors of A and B.\n\nHere, any two of the chosen divisors must be coprime.\n\nAt most, how many divisors can we choose?\n\nDefinition of common divisor\n\nAn integer d is said to be a common divisor of integers x and y when d divides both x and y.\n\nDefinition of being coprime\n\nIntegers x and y are said to be coprime when x and y have no positive common divisors other than 1.\n\nDefinition of dividing\n\nAn integer x is said to divide another integer y when there exists an integer \\alpha such that y = \\alpha x.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of divisors that can be chosen to satisfy the condition.\n\nSample Input 1\n\n12 18\n\nSample Output 1\n\n3\n\n12 and 18 have the following positive common divisors: 1, 2, 3, and 6.\n\n1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can choose 1, 2, and 3, which achieve the maximum result.\n\nSample Input 2\n\n420 660\n\nSample Output 2\n\n4\n\nSample Input 3\n\n1 2019\n\nSample Output 3\n\n1\n\n1 and 2019 have no positive common divisors other than 1.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1127, "cpu_time_ms": 90, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s958929696", "group_id": "codeNet:p02901", "input_text": "local mfl = math.floor\nlocal function getor(x, y)\n local ret = 0\n local mul = 1\n while(0 < x or 0 < y) do\n if((x % 2) + (y % 2) ~= 0) then\n ret = ret + mul\n end\n x, y, mul = mfl(x / 2), mfl(y / 2), mul * 2\n end\n return ret\nend\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal tot = 1\nfor i = 1, n do\n tot = tot * 2\nend\nlocal t = {}\nfor i = 1, tot do\n t[i] = -1\nend\nt[1] = 0\nfor i = 1, m do\n local a, b = io.read(\"*n\", \"*n\")\n local c = {}\n for j = 1, b do\n c[io.read(\"*n\")] = true\n end\n local val = 0\n local v = 1\n for j = 1, n do\n if c[j] then\n val = val + v\n end\n v = v * 2\n end\n for src = tot, 1, -1 do\n if 0 <= t[src] then\n local dst = 1 + getor(src - 1, val)\n if t[dst] == -1 or t[src] + a < t[dst] then\n t[dst] = t[src] + a\n end\n end\n end\nend\nprint(t[tot])\n", "language": "Lua", "metadata": {"date": 1569719942, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02901.html", "problem_id": "p02901", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02901/input.txt", "sample_output_relpath": "derived/input_output/data/p02901/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02901/Lua/s958929696.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s958929696", "user_id": "u120582723"}, "prompt_components": {"gold_output": "25\n", "input_to_evaluate": "local mfl = math.floor\nlocal function getor(x, y)\n local ret = 0\n local mul = 1\n while(0 < x or 0 < y) do\n if((x % 2) + (y % 2) ~= 0) then\n ret = ret + mul\n end\n x, y, mul = mfl(x / 2), mfl(y / 2), mul * 2\n end\n return ret\nend\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal tot = 1\nfor i = 1, n do\n tot = tot * 2\nend\nlocal t = {}\nfor i = 1, tot do\n t[i] = -1\nend\nt[1] = 0\nfor i = 1, m do\n local a, b = io.read(\"*n\", \"*n\")\n local c = {}\n for j = 1, b do\n c[io.read(\"*n\")] = true\n end\n local val = 0\n local v = 1\n for j = 1, n do\n if c[j] then\n val = val + v\n end\n v = v * 2\n end\n for src = tot, 1, -1 do\n if 0 <= t[src] then\n local dst = 1 + getor(src - 1, val)\n if t[dst] == -1 or t[src] + a < t[dst] then\n t[dst] = t[src] + a\n end\n end\n end\nend\nprint(t[tot])\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N locked treasure boxes, numbered 1 to N.\n\nA shop sells M keys. The i-th key is sold for a_i yen (the currency of Japan), and it can unlock b_i of the boxes: Box c_{i1}, c_{i2}, ..., c_{i{b_i}}. Each key purchased can be used any number of times.\n\nFind the minimum cost required to unlock all the treasure boxes. If it is impossible to unlock all of them, print -1.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 12\n\n1 \\leq M \\leq 10^3\n\n1 \\leq a_i \\leq 10^5\n\n1 \\leq b_i \\leq N\n\n1 \\leq c_{i1} < c_{i2} < ... < c_{i{b_i}} \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\nc_{11} c_{12} ... c_{1{b_1}}\n:\na_M b_M\nc_{M1} c_{M2} ... c_{M{b_M}}\n\nOutput\n\nPrint the minimum cost required to unlock all the treasure boxes.\nIf it is impossible to unlock all of them, print -1.\n\nSample Input 1\n\n2 3\n10 1\n1\n15 1\n2\n30 2\n1 2\n\nSample Output 1\n\n25\n\nWe can unlock all the boxes by purchasing the first and second keys, at the cost of 25 yen, which is the minimum cost required.\n\nSample Input 2\n\n12 1\n100000 1\n2\n\nSample Output 2\n\n-1\n\nWe cannot unlock all the boxes.\n\nSample Input 3\n\n4 6\n67786 3\n1 3 4\n3497 1\n2\n44908 3\n2 3 4\n2156 3\n2 3 4\n26230 1\n2\n86918 1\n3\n\nSample Output 3\n\n69942", "sample_input": "2 3\n10 1\n1\n15 1\n2\n30 2\n1 2\n"}, "reference_outputs": ["25\n"], "source_document_id": "p02901", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N locked treasure boxes, numbered 1 to N.\n\nA shop sells M keys. The i-th key is sold for a_i yen (the currency of Japan), and it can unlock b_i of the boxes: Box c_{i1}, c_{i2}, ..., c_{i{b_i}}. Each key purchased can be used any number of times.\n\nFind the minimum cost required to unlock all the treasure boxes. If it is impossible to unlock all of them, print -1.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 12\n\n1 \\leq M \\leq 10^3\n\n1 \\leq a_i \\leq 10^5\n\n1 \\leq b_i \\leq N\n\n1 \\leq c_{i1} < c_{i2} < ... < c_{i{b_i}} \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\nc_{11} c_{12} ... c_{1{b_1}}\n:\na_M b_M\nc_{M1} c_{M2} ... c_{M{b_M}}\n\nOutput\n\nPrint the minimum cost required to unlock all the treasure boxes.\nIf it is impossible to unlock all of them, print -1.\n\nSample Input 1\n\n2 3\n10 1\n1\n15 1\n2\n30 2\n1 2\n\nSample Output 1\n\n25\n\nWe can unlock all the boxes by purchasing the first and second keys, at the cost of 25 yen, which is the minimum cost required.\n\nSample Input 2\n\n12 1\n100000 1\n2\n\nSample Output 2\n\n-1\n\nWe cannot unlock all the boxes.\n\nSample Input 3\n\n4 6\n67786 3\n1 3 4\n3497 1\n2\n44908 3\n2 3 4\n2156 3\n2 3 4\n26230 1\n2\n86918 1\n3\n\nSample Output 3\n\n69942", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 829, "cpu_time_ms": 263, "memory_kb": 384}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s858367562", "group_id": "codeNet:p02902", "input_text": "local mfl, mce = math.floor, math.ceil\nlocal mmi, mma = math.min, math.max\nlocal bls, brs = bit.lshift, bit.rshift\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n local cnt = bls(1, i - 1)\n for j = 1, cnt do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.stage = {{}}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.stage[stagenum] = {}\n end\n self.stagenum = stagenum\n for i = 1, n do self.stage[stagenum][i] = i end\n for i = n + 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local stagenum = self.stagenum\n local ret = self.emptyvalue\n while left <= right do\n local stage, sz = 1, bls(1, stagenum - 1)\n local len = right - left + 1\n while (left - 1) % sz ~= 0 or len < sz do\n stage, sz = stage + 1, brs(sz, 1)\n end\n ret = self.func(ret, self.stage[stage][1 + brs(left - 1, stagenum - stage)])\n left = left + sz\n end\n return ret\nend\nSegTree.update = function(self, idx)\n for i = self.stagenum - 1, 1, -1 do\n local dst = brs(idx + 1, 1)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\nend\nSegTree.top = function(self) return self.stage[1][1] end\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal longest_len = {}\nlocal edge = {}\nlocal invedge = {}\nlocal updated = {}\nlocal startcand = {}\nlocal shortest_len = {}\nfor i = 1, n + 1 do\n longest_len[i] = -1\n shortest_len[i] = -1\n edge[i] = {}\n invedge[i] = {}\n updated[i] = false\n startcand[i] = true\nend\nfor i = 1, m do\n local a, b = io.read(\"*n\", \"*n\")\n edge[a][b] = true\n invedge[b][a] = true\n startcand[b] = false\nend\nlocal function getmin(a, b)\n if updated[a] and updated[b] then\n return shortest_len[a] < shortest_len[b] and a or b\n elseif updated[a] then return a\n elseif updated[b] then return b\n else return n + 1\n end\nend\nlocal function getmax(a, b)\n if updated[a] and updated[b] then\n return longest_len[a] < longest_len[b] and b or a\n elseif updated[a] then return a\n elseif updated[b] then return b\n else return n + 1\n end\nend\n-- find shortest path\nlocal st = SegTree.new(n, getmin, n + 1)\nlocal looptasks = {}\nfor i = 1, n do\n if startcand[i] then\n shortest_len[i] = 0\n updated[i] = true\n st:update(i)\n table.insert(looptasks, i)\n end\nend\nif #looptasks == 0 then looptasks[1] = 1 end\n\nwhile true do\n local src = st:top()\n if src == n + 1 then break end\n for dst, _u in pairs(edge[src]) do\n if shortest_len[dst] < 0 or shortest_len[src] + 1 < shortest_len[dst] then\n shortest_len[dst] = shortest_len[src] + 1\n updated[dst] = true\n st:update(dst)\n end\n end\n updated[src] = false\n st:update(src)\nend\n\n-- find loop candidate\nst.func = getmax\nfor i = 1, #looptasks do\n longest_len[looptasks[i]] = 0\n updated[looptasks[i]] = true\nend\nst:updateAll()\nwhile true do\n local src = st:top()\n if src == n + 1 then break end\n for dst, _u in pairs(edge[src]) do\n if longest_len[dst] < 0 or longest_len[dst] < longest_len[src] + 1 then\n if longest_len[dst] < n then\n longest_len[dst] = longest_len[src] + 1\n updated[dst] = true\n st:update(dst)\n end\n end\n end\n updated[src] = false\n st:update(src)\nend\n\nlocal loopCandidates = {}\nfor i = 1, n do\n if n <= longest_len[i] then\n loopCandidates[i] = true\n end\nend\n-- remove no-loop points from loop candidate points\nwhile true do\n local removed = false\n for src, _u in pairs(loopCandidates) do\n local f = false\n for dst, _u2 in pairs(edge[src]) do\n if loopCandidates[dst] then\n f = true\n break\n end\n end\n if not f then loopCandidates[src], removed = nil, true break end\n end\n if not removed then break end\nend\n\n-- remove all no-loop edges\nfor src, _u in pairs(loopCandidates) do\n for dst, _u2 in pairs(edge[src]) do\n if not loopCandidates[dst] then edge[src][dst] = nil end\n end\n for dst, _u2 in pairs(invedge[src]) do\n if not loopCandidates[dst] then invedge[src][dst] = nil end\n end\nend\n\n-- find first length and second length from certain point\nlocal loop_len = {}\nlocal loop_started = {}\nfor src, _u in pairs(loopCandidates) do\n loop_len[src] = {-1, -1}\n loop_started[src] = false\nend\nif next(loopCandidates) then\n local src = next(loopCandidates)\n loop_len[src][1] = 0\n updated[src] = true\nend\n\nlocal function getlooptask(a, b)\n if updated[a] and updated[b] then\n if loop_len[a][2] < 0 and loop_len[b][2] < 0 then\n return loop_len[a][1] < loop_len[b][1] and a or b\n elseif loop_len[a][2] < 0 then return a\n elseif loop_len[b][2] < 0 then return b\n else\n return loop_len[a][2] < loop_len[b][2] and a or b\n end\n elseif updated[a] then return a\n elseif updated[b] then return b\n else return n + 1\n end\nend\n\nst.func = getlooptask\nst:updateAll()\n\nwhile true do\n local src = st:top()\n if src == n + 1 then break end\n for dst, _u in pairs(edge[src]) do\n if loop_started[dst] then\n if loop_started[src] then\n if loop_len[dst][2] < 0 or loop_len[src][2] + 1 < loop_len[dst][2] then\n loop_len[dst][2] = loop_len[src][2] + 1\n updated[dst] = true\n st:update(dst)\n end\n else\n if loop_len[dst][2] < 0 or loop_len[src][1] + 1 < loop_len[dst][2] then\n loop_len[dst][2] = loop_len[src][1] + 1\n updated[dst] = true\n st:update(dst)\n end\n end\n else\n if loop_len[dst][1] < 0 or loop_len[src][1] + 1 < loop_len[dst][1] then\n loop_len[dst][1] = loop_len[src][1] + 1\n updated[dst] = true\n st:update(dst)\n end\n end\n end\n loop_started[src] = true\n updated[src] = false\n st:update(src)\nend\n\n-- get start of shortest loop\nlocal short_loop_start = false\nlocal short_loop_len = false\nfor src, v in pairs(loop_len) do\n local len = v[2] - v[1]\n if not short_loop_len or len < short_loop_len then\n short_loop_start, short_loop_len = src, len\n end\nend\nif short_loop_start then\n local ans = {short_loop_start}\n while true do\n local dst = ans[#ans]\n local dstlen = #ans == 1 and loop_len[dst][2] or loop_len[dst][1]\n local f = false\n for src, _u in pairs(invedge[dst]) do\n local srclen = loop_len[src][1]\n if loop_len[src][2] - srclen == short_loop_len and srclen + 1 == dstlen then\n table.insert(ans, src)\n f = true\n break\n end\n end\n if not f then break end\n end\n table.remove(ans)\n print(#ans)\n print(table.concat(ans, \"\\n\"))\nelse\n print(-1)\nend\n", "language": "Lua", "metadata": {"date": 1583297729, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02902.html", "problem_id": "p02902", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02902/input.txt", "sample_output_relpath": "derived/input_output/data/p02902/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02902/Lua/s858367562.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s858367562", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n1\n2\n4\n", "input_to_evaluate": "local mfl, mce = math.floor, math.ceil\nlocal mmi, mma = math.min, math.max\nlocal bls, brs = bit.lshift, bit.rshift\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n local cnt = bls(1, i - 1)\n for j = 1, cnt do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.stage = {{}}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.stage[stagenum] = {}\n end\n self.stagenum = stagenum\n for i = 1, n do self.stage[stagenum][i] = i end\n for i = n + 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local stagenum = self.stagenum\n local ret = self.emptyvalue\n while left <= right do\n local stage, sz = 1, bls(1, stagenum - 1)\n local len = right - left + 1\n while (left - 1) % sz ~= 0 or len < sz do\n stage, sz = stage + 1, brs(sz, 1)\n end\n ret = self.func(ret, self.stage[stage][1 + brs(left - 1, stagenum - stage)])\n left = left + sz\n end\n return ret\nend\nSegTree.update = function(self, idx)\n for i = self.stagenum - 1, 1, -1 do\n local dst = brs(idx + 1, 1)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\nend\nSegTree.top = function(self) return self.stage[1][1] end\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal longest_len = {}\nlocal edge = {}\nlocal invedge = {}\nlocal updated = {}\nlocal startcand = {}\nlocal shortest_len = {}\nfor i = 1, n + 1 do\n longest_len[i] = -1\n shortest_len[i] = -1\n edge[i] = {}\n invedge[i] = {}\n updated[i] = false\n startcand[i] = true\nend\nfor i = 1, m do\n local a, b = io.read(\"*n\", \"*n\")\n edge[a][b] = true\n invedge[b][a] = true\n startcand[b] = false\nend\nlocal function getmin(a, b)\n if updated[a] and updated[b] then\n return shortest_len[a] < shortest_len[b] and a or b\n elseif updated[a] then return a\n elseif updated[b] then return b\n else return n + 1\n end\nend\nlocal function getmax(a, b)\n if updated[a] and updated[b] then\n return longest_len[a] < longest_len[b] and b or a\n elseif updated[a] then return a\n elseif updated[b] then return b\n else return n + 1\n end\nend\n-- find shortest path\nlocal st = SegTree.new(n, getmin, n + 1)\nlocal looptasks = {}\nfor i = 1, n do\n if startcand[i] then\n shortest_len[i] = 0\n updated[i] = true\n st:update(i)\n table.insert(looptasks, i)\n end\nend\nif #looptasks == 0 then looptasks[1] = 1 end\n\nwhile true do\n local src = st:top()\n if src == n + 1 then break end\n for dst, _u in pairs(edge[src]) do\n if shortest_len[dst] < 0 or shortest_len[src] + 1 < shortest_len[dst] then\n shortest_len[dst] = shortest_len[src] + 1\n updated[dst] = true\n st:update(dst)\n end\n end\n updated[src] = false\n st:update(src)\nend\n\n-- find loop candidate\nst.func = getmax\nfor i = 1, #looptasks do\n longest_len[looptasks[i]] = 0\n updated[looptasks[i]] = true\nend\nst:updateAll()\nwhile true do\n local src = st:top()\n if src == n + 1 then break end\n for dst, _u in pairs(edge[src]) do\n if longest_len[dst] < 0 or longest_len[dst] < longest_len[src] + 1 then\n if longest_len[dst] < n then\n longest_len[dst] = longest_len[src] + 1\n updated[dst] = true\n st:update(dst)\n end\n end\n end\n updated[src] = false\n st:update(src)\nend\n\nlocal loopCandidates = {}\nfor i = 1, n do\n if n <= longest_len[i] then\n loopCandidates[i] = true\n end\nend\n-- remove no-loop points from loop candidate points\nwhile true do\n local removed = false\n for src, _u in pairs(loopCandidates) do\n local f = false\n for dst, _u2 in pairs(edge[src]) do\n if loopCandidates[dst] then\n f = true\n break\n end\n end\n if not f then loopCandidates[src], removed = nil, true break end\n end\n if not removed then break end\nend\n\n-- remove all no-loop edges\nfor src, _u in pairs(loopCandidates) do\n for dst, _u2 in pairs(edge[src]) do\n if not loopCandidates[dst] then edge[src][dst] = nil end\n end\n for dst, _u2 in pairs(invedge[src]) do\n if not loopCandidates[dst] then invedge[src][dst] = nil end\n end\nend\n\n-- find first length and second length from certain point\nlocal loop_len = {}\nlocal loop_started = {}\nfor src, _u in pairs(loopCandidates) do\n loop_len[src] = {-1, -1}\n loop_started[src] = false\nend\nif next(loopCandidates) then\n local src = next(loopCandidates)\n loop_len[src][1] = 0\n updated[src] = true\nend\n\nlocal function getlooptask(a, b)\n if updated[a] and updated[b] then\n if loop_len[a][2] < 0 and loop_len[b][2] < 0 then\n return loop_len[a][1] < loop_len[b][1] and a or b\n elseif loop_len[a][2] < 0 then return a\n elseif loop_len[b][2] < 0 then return b\n else\n return loop_len[a][2] < loop_len[b][2] and a or b\n end\n elseif updated[a] then return a\n elseif updated[b] then return b\n else return n + 1\n end\nend\n\nst.func = getlooptask\nst:updateAll()\n\nwhile true do\n local src = st:top()\n if src == n + 1 then break end\n for dst, _u in pairs(edge[src]) do\n if loop_started[dst] then\n if loop_started[src] then\n if loop_len[dst][2] < 0 or loop_len[src][2] + 1 < loop_len[dst][2] then\n loop_len[dst][2] = loop_len[src][2] + 1\n updated[dst] = true\n st:update(dst)\n end\n else\n if loop_len[dst][2] < 0 or loop_len[src][1] + 1 < loop_len[dst][2] then\n loop_len[dst][2] = loop_len[src][1] + 1\n updated[dst] = true\n st:update(dst)\n end\n end\n else\n if loop_len[dst][1] < 0 or loop_len[src][1] + 1 < loop_len[dst][1] then\n loop_len[dst][1] = loop_len[src][1] + 1\n updated[dst] = true\n st:update(dst)\n end\n end\n end\n loop_started[src] = true\n updated[src] = false\n st:update(src)\nend\n\n-- get start of shortest loop\nlocal short_loop_start = false\nlocal short_loop_len = false\nfor src, v in pairs(loop_len) do\n local len = v[2] - v[1]\n if not short_loop_len or len < short_loop_len then\n short_loop_start, short_loop_len = src, len\n end\nend\nif short_loop_start then\n local ans = {short_loop_start}\n while true do\n local dst = ans[#ans]\n local dstlen = #ans == 1 and loop_len[dst][2] or loop_len[dst][1]\n local f = false\n for src, _u in pairs(invedge[dst]) do\n local srclen = loop_len[src][1]\n if loop_len[src][2] - srclen == short_loop_len and srclen + 1 == dstlen then\n table.insert(ans, src)\n f = true\n break\n end\n end\n if not f then break end\n end\n table.remove(ans)\n print(#ans)\n print(table.concat(ans, \"\\n\"))\nelse\n print(-1)\nend\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven is a directed graph G with N vertices and M edges.\n\nThe vertices are numbered 1 to N, and the i-th edge is directed from Vertex A_i to Vertex B_i.\n\nIt is guaranteed that the graph contains no self-loops or multiple edges.\n\nDetermine whether there exists an induced subgraph (see Notes) of G such that the in-degree and out-degree of every vertex are both 1. If the answer is yes, show one such subgraph.\n\nHere the null graph is not considered as a subgraph.\n\nNotes\n\nFor a directed graph G = (V, E), we call a directed graph G' = (V', E') satisfying the following conditions an induced subgraph of G:\n\nV' is a (non-empty) subset of V.\n\nE' is the set of all the edges in E that have both endpoints in V'.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\n0 \\leq M \\leq 2000\n\n1 \\leq A_i,B_i \\leq N\n\nA_i \\neq B_i\n\nAll pairs (A_i, B_i) are distinct.\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 B_1\nA_2 B_2\n:\nA_M B_M\n\nOutput\n\nIf there is no induced subgraph of G that satisfies the condition, print -1.\nOtherwise, print an induced subgraph of G that satisfies the condition, in the following format:\n\nK\nv_1\nv_2\n:\nv_K\n\nThis represents the induced subgraph of G with K vertices whose vertex set is \\{v_1, v_2, \\ldots, v_K\\}. (The order of v_1, v_2, \\ldots, v_K does not matter.)\nIf there are multiple subgraphs of G that satisfy the condition, printing any of them is accepted.\n\nSample Input 1\n\n4 5\n1 2\n2 3\n2 4\n4 1\n4 3\n\nSample Output 1\n\n3\n1\n2\n4\n\nThe induced subgraph of G whose vertex set is \\{1, 2, 4\\} has the edge set \\{(1, 2), (2, 4), (4, 1)\\}. The in-degree and out-degree of every vertex in this graph are both 1.\n\nSample Input 2\n\n4 5\n1 2\n2 3\n2 4\n1 4\n4 3\n\nSample Output 2\n\n-1\n\nThere is no induced subgraph of G that satisfies the condition.\n\nSample Input 3\n\n6 9\n1 2\n2 3\n3 4\n4 5\n5 6\n5 1\n5 2\n6 1\n6 2\n\nSample Output 3\n\n4\n2\n3\n4\n5", "sample_input": "4 5\n1 2\n2 3\n2 4\n4 1\n4 3\n"}, "reference_outputs": ["3\n1\n2\n4\n"], "source_document_id": "p02902", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven is a directed graph G with N vertices and M edges.\n\nThe vertices are numbered 1 to N, and the i-th edge is directed from Vertex A_i to Vertex B_i.\n\nIt is guaranteed that the graph contains no self-loops or multiple edges.\n\nDetermine whether there exists an induced subgraph (see Notes) of G such that the in-degree and out-degree of every vertex are both 1. If the answer is yes, show one such subgraph.\n\nHere the null graph is not considered as a subgraph.\n\nNotes\n\nFor a directed graph G = (V, E), we call a directed graph G' = (V', E') satisfying the following conditions an induced subgraph of G:\n\nV' is a (non-empty) subset of V.\n\nE' is the set of all the edges in E that have both endpoints in V'.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\n0 \\leq M \\leq 2000\n\n1 \\leq A_i,B_i \\leq N\n\nA_i \\neq B_i\n\nAll pairs (A_i, B_i) are distinct.\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 B_1\nA_2 B_2\n:\nA_M B_M\n\nOutput\n\nIf there is no induced subgraph of G that satisfies the condition, print -1.\nOtherwise, print an induced subgraph of G that satisfies the condition, in the following format:\n\nK\nv_1\nv_2\n:\nv_K\n\nThis represents the induced subgraph of G with K vertices whose vertex set is \\{v_1, v_2, \\ldots, v_K\\}. (The order of v_1, v_2, \\ldots, v_K does not matter.)\nIf there are multiple subgraphs of G that satisfy the condition, printing any of them is accepted.\n\nSample Input 1\n\n4 5\n1 2\n2 3\n2 4\n4 1\n4 3\n\nSample Output 1\n\n3\n1\n2\n4\n\nThe induced subgraph of G whose vertex set is \\{1, 2, 4\\} has the edge set \\{(1, 2), (2, 4), (4, 1)\\}. The in-degree and out-degree of every vertex in this graph are both 1.\n\nSample Input 2\n\n4 5\n1 2\n2 3\n2 4\n1 4\n4 3\n\nSample Output 2\n\n-1\n\nThere is no induced subgraph of G that satisfies the condition.\n\nSample Input 3\n\n6 9\n1 2\n2 3\n3 4\n4 5\n5 6\n5 1\n5 2\n6 1\n6 2\n\nSample Output 3\n\n4\n2\n3\n4\n5", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7000, "cpu_time_ms": 17, "memory_kb": 768}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s397638717", "group_id": "codeNet:p02903", "input_text": "local h,w,a,b=io.read(\"n\",\"n\",\"n\",\"n\")\nfor i=1,b do\n print(string.rep(\"0\",a)..string.rep(\"1\",w-a))\nend\nfor i=1,h-b do\n print(string.rep(\"1\",a)..string.rep(\"0\",w-a))\nend", "language": "Lua", "metadata": {"date": 1594946185, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02903.html", "problem_id": "p02903", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02903/input.txt", "sample_output_relpath": "derived/input_output/data/p02903/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02903/Lua/s397638717.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s397638717", "user_id": "u045238009"}, "prompt_components": {"gold_output": "100\n010\n001\n", "input_to_evaluate": "local h,w,a,b=io.read(\"n\",\"n\",\"n\",\"n\")\nfor i=1,b do\n print(string.rep(\"0\",a)..string.rep(\"1\",w-a))\nend\nfor i=1,h-b do\n print(string.rep(\"1\",a)..string.rep(\"0\",w-a))\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have a square grid with H rows and W columns.\nSnuke wants to write 0 or 1 in each of the squares.\nHere, all of the following conditions have to be satisfied:\n\nFor every row, the smaller of the following is A: the number of 0s contained in the row, and the number of 1s contained in the row. (If these two numbers are equal, “the smaller” should be read as “either”.)\n\nFor every column, the smaller of the following is B: the number of 0s contained in the column, and the number of 1s contained in the column.\n\nDetermine if these conditions can be satisfied by writing 0 or 1 in each of the squares. If the answer is yes, show one way to fill the squares so that the conditions are satisfied.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\n0 \\leq A\n\n2 \\times A \\leq W\n\n0 \\leq B\n\n2 \\times B \\leq H\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W A B\n\nOutput\n\nIf the conditions cannot be satisfied by writing 0 or 1 in each of the squares, print -1.\n\nIf the conditions can be satisfied, print one way to fill the squares so that the conditions are satisfied, in the following format:\n\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_{ij} is the digit written in the square at the i-th row from the top and the j-th column from the left in the grid.\n\nIf multiple solutions exist, printing any of them will be accepted.\n\nSample Input 1\n\n3 3 1 1\n\nSample Output 1\n\n100\n010\n001\n\nEvery row contains two 0s and one 1, so the first condition is satisfied.\nAlso, every column contains two 0s and one 1, so the second condition is satisfied.\n\nSample Input 2\n\n1 5 2 0\n\nSample Output 2\n\n01010", "sample_input": "3 3 1 1\n"}, "reference_outputs": ["100\n010\n001\n"], "source_document_id": "p02903", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have a square grid with H rows and W columns.\nSnuke wants to write 0 or 1 in each of the squares.\nHere, all of the following conditions have to be satisfied:\n\nFor every row, the smaller of the following is A: the number of 0s contained in the row, and the number of 1s contained in the row. (If these two numbers are equal, “the smaller” should be read as “either”.)\n\nFor every column, the smaller of the following is B: the number of 0s contained in the column, and the number of 1s contained in the column.\n\nDetermine if these conditions can be satisfied by writing 0 or 1 in each of the squares. If the answer is yes, show one way to fill the squares so that the conditions are satisfied.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\n0 \\leq A\n\n2 \\times A \\leq W\n\n0 \\leq B\n\n2 \\times B \\leq H\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W A B\n\nOutput\n\nIf the conditions cannot be satisfied by writing 0 or 1 in each of the squares, print -1.\n\nIf the conditions can be satisfied, print one way to fill the squares so that the conditions are satisfied, in the following format:\n\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_{ij} is the digit written in the square at the i-th row from the top and the j-th column from the left in the grid.\n\nIf multiple solutions exist, printing any of them will be accepted.\n\nSample Input 1\n\n3 3 1 1\n\nSample Output 1\n\n100\n010\n001\n\nEvery row contains two 0s and one 1, so the first condition is satisfied.\nAlso, every column contains two 0s and one 1, so the second condition is satisfied.\n\nSample Input 2\n\n1 5 2 0\n\nSample Output 2\n\n01010", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 15, "memory_kb": 2672}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s479769728", "group_id": "codeNet:p02904", "input_text": "local n, k = io.read(\"*n\",\"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = 1 + io.read(\"*n\")\nend\n\nlocal mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mmi(r, mce((l - 1) / sz) * sz)\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)\n l = newr + 1\n end\n if sz <= r + 1 - l then\n ret = self.func(ret, self.stage[stage][mce(l / sz)])\n l = l + sz\n end\n if l <= r then\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n end\n end\n return ret\nend\nSegTree.setValue = function(self, idx, set, silent)\n if set then\n self.stage[self.stagenum][idx] = idx\n else\n self.stage[self.stagenum][idx] = self.emptyvalue\n end\n if not silent then\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n end\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal mma, mmi = math.max, math.min\nlocal stmin = SegTree.new(n, mmi, n + 1)\nlocal stmax = SegTree.new(n, mma, 0)\nfor i = 1, k do\n stmin:setValue(t[i], true, true)\n stmax:setValue(t[i], true, true)\nend\nstmin:updateAll()\nstmax:updateAll()\n\nlocal sortedCnt = 0\nlocal cnt = 1\nlocal curlen = 1\nfor i = 1, k - 1 do\n if t[i] < t[i + 1] then\n curlen = curlen + 1\n else\n curlen = 1\n end\nend\nif k <= curlen then\n sortedCnt = sortedCnt + 1\nend\n\nfor i = k + 1, n do\n local sorted = false\n if t[i - 1] < t[i] then\n curlen = curlen + 1\n else\n curlen = 1\n end\n if k <= curlen then\n sorted = true\n end\n\n local prv, nxt = t[i - k], t[i]\n local curmin, curmax = stmin.stage[1][1], stmax.stage[1][1]\n if curmin == prv and curmax < nxt then\n else\n if sorted then\n sortedCnt = sortedCnt + 1\n end\n cnt = cnt + 1\n end\n stmin:setValue(t[i - k], false)\n stmin:setValue(t[i], true)\n stmax:setValue(t[i - k], false)\n stmax:setValue(t[i], true)\nend\nif 1 < sortedCnt then\n cnt = cnt - sortedCnt + 1\nend\nprint(cnt)\n", "language": "Lua", "metadata": {"date": 1569190467, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02904.html", "problem_id": "p02904", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02904/input.txt", "sample_output_relpath": "derived/input_output/data/p02904/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02904/Lua/s479769728.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s479769728", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n, k = io.read(\"*n\",\"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = 1 + io.read(\"*n\")\nend\n\nlocal mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mmi(r, mce((l - 1) / sz) * sz)\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)\n l = newr + 1\n end\n if sz <= r + 1 - l then\n ret = self.func(ret, self.stage[stage][mce(l / sz)])\n l = l + sz\n end\n if l <= r then\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n end\n end\n return ret\nend\nSegTree.setValue = function(self, idx, set, silent)\n if set then\n self.stage[self.stagenum][idx] = idx\n else\n self.stage[self.stagenum][idx] = self.emptyvalue\n end\n if not silent then\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n end\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal mma, mmi = math.max, math.min\nlocal stmin = SegTree.new(n, mmi, n + 1)\nlocal stmax = SegTree.new(n, mma, 0)\nfor i = 1, k do\n stmin:setValue(t[i], true, true)\n stmax:setValue(t[i], true, true)\nend\nstmin:updateAll()\nstmax:updateAll()\n\nlocal sortedCnt = 0\nlocal cnt = 1\nlocal curlen = 1\nfor i = 1, k - 1 do\n if t[i] < t[i + 1] then\n curlen = curlen + 1\n else\n curlen = 1\n end\nend\nif k <= curlen then\n sortedCnt = sortedCnt + 1\nend\n\nfor i = k + 1, n do\n local sorted = false\n if t[i - 1] < t[i] then\n curlen = curlen + 1\n else\n curlen = 1\n end\n if k <= curlen then\n sorted = true\n end\n\n local prv, nxt = t[i - k], t[i]\n local curmin, curmax = stmin.stage[1][1], stmax.stage[1][1]\n if curmin == prv and curmax < nxt then\n else\n if sorted then\n sortedCnt = sortedCnt + 1\n end\n cnt = cnt + 1\n end\n stmin:setValue(t[i - k], false)\n stmin:setValue(t[i], true)\n stmax:setValue(t[i - k], false)\n stmax:setValue(t[i], true)\nend\nif 1 < sortedCnt then\n cnt = cnt - sortedCnt + 1\nend\nprint(cnt)\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nSnuke has a permutation (P_0,P_1,\\cdots,P_{N-1}) of (0,1,\\cdots,N-1).\n\nNow, he will perform the following operation exactly once:\n\nChoose K consecutive elements in P and sort them in ascending order.\n\nFind the number of permutations that can be produced as P after the operation.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n2 \\leq K \\leq N\n\n0 \\leq P_i \\leq N-1\n\nP_0,P_1,\\cdots,P_{N-1} 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 K\nP_0 P_1 \\cdots P_{N-1}\n\nOutput\n\nPrint the number of permutations that can be produced as P after the operation.\n\nSample Input 1\n\n5 3\n0 2 1 4 3\n\nSample Output 1\n\n2\n\nTwo permutations can be produced as P after the operation: (0,1,2,4,3) and (0,2,1,3,4).\n\nSample Input 2\n\n4 4\n0 1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10 4\n2 0 1 3 7 5 4 6 8 9\n\nSample Output 3\n\n6", "sample_input": "5 3\n0 2 1 4 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02904", "source_text": "Score : 700 points\n\nProblem Statement\n\nSnuke has a permutation (P_0,P_1,\\cdots,P_{N-1}) of (0,1,\\cdots,N-1).\n\nNow, he will perform the following operation exactly once:\n\nChoose K consecutive elements in P and sort them in ascending order.\n\nFind the number of permutations that can be produced as P after the operation.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n2 \\leq K \\leq N\n\n0 \\leq P_i \\leq N-1\n\nP_0,P_1,\\cdots,P_{N-1} 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 K\nP_0 P_1 \\cdots P_{N-1}\n\nOutput\n\nPrint the number of permutations that can be produced as P after the operation.\n\nSample Input 1\n\n5 3\n0 2 1 4 3\n\nSample Output 1\n\n2\n\nTwo permutations can be produced as P after the operation: (0,1,2,4,3) and (0,2,1,3,4).\n\nSample Input 2\n\n4 4\n0 1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10 4\n2 0 1 3 7 5 4 6 8 9\n\nSample Output 3\n\n6", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3362, "cpu_time_ms": 212, "memory_kb": 10624}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s322541855", "group_id": "codeNet:p02904", "input_text": "local n, k = io.read(\"*n\",\"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = 1 + io.read(\"*n\")\nend\n\nlocal mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mmi(r, mce((l - 1) / sz) * sz)\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)\n l = newr + 1\n end\n if sz <= r + 1 - l then\n ret = self.func(ret, self.stage[stage][mce(l / sz)])\n l = l + sz\n end\n if l <= r then\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n end\n end\n return ret\nend\nSegTree.setValue = function(self, idx, set, silent)\n if set then\n self.stage[self.stagenum][idx] = idx\n else\n self.stage[self.stagenum][idx] = self.emptyvalue\n end\n if not silent then\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n end\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal mma, mmi = math.max, math.min\nlocal stmin = SegTree.new(n, mmi, n + 1)\nlocal stmax = SegTree.new(n, mma, 0)\nfor i = 1, k do\n stmin:setValue(t[i], true, true)\n stmax:setValue(t[i], true, true)\nend\nstmin:updateAll()\nstmax:updateAll()\nlocal cnt = 1\nfor i = k + 1, n do\n local prv, nxt = t[i - k], t[i]\n local curmin, curmax = stmin.stage[1][1], stmax.stage[1][1]\n if curmin == prv and curmax < nxt then\n else\n cnt = cnt + 1\n end\n stmin:setValue(t[i - k], false)\n stmin:setValue(t[i], true)\n stmax:setValue(t[i - k], false)\n stmax:setValue(t[i], true)\nend\nlocal sortedCnt = 0\nlocal curlen = 1\nfor i = 1, n - 1 do\n if t[i] < t[i + 1] then\n curlen = curlen + 1\n if k <= curlen then\n sortedCnt = sortedCnt + 1\n end\n else\n curlen = 1\n end\nend\nif 1 < sortedCnt then\n cnt = cnt - (sortedCnt - 1)\nend\nprint(cnt)\n", "language": "Lua", "metadata": {"date": 1569189471, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02904.html", "problem_id": "p02904", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02904/input.txt", "sample_output_relpath": "derived/input_output/data/p02904/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02904/Lua/s322541855.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s322541855", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n, k = io.read(\"*n\",\"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = 1 + io.read(\"*n\")\nend\n\nlocal mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mmi(r, mce((l - 1) / sz) * sz)\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)\n l = newr + 1\n end\n if sz <= r + 1 - l then\n ret = self.func(ret, self.stage[stage][mce(l / sz)])\n l = l + sz\n end\n if l <= r then\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n end\n end\n return ret\nend\nSegTree.setValue = function(self, idx, set, silent)\n if set then\n self.stage[self.stagenum][idx] = idx\n else\n self.stage[self.stagenum][idx] = self.emptyvalue\n end\n if not silent then\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n end\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal mma, mmi = math.max, math.min\nlocal stmin = SegTree.new(n, mmi, n + 1)\nlocal stmax = SegTree.new(n, mma, 0)\nfor i = 1, k do\n stmin:setValue(t[i], true, true)\n stmax:setValue(t[i], true, true)\nend\nstmin:updateAll()\nstmax:updateAll()\nlocal cnt = 1\nfor i = k + 1, n do\n local prv, nxt = t[i - k], t[i]\n local curmin, curmax = stmin.stage[1][1], stmax.stage[1][1]\n if curmin == prv and curmax < nxt then\n else\n cnt = cnt + 1\n end\n stmin:setValue(t[i - k], false)\n stmin:setValue(t[i], true)\n stmax:setValue(t[i - k], false)\n stmax:setValue(t[i], true)\nend\nlocal sortedCnt = 0\nlocal curlen = 1\nfor i = 1, n - 1 do\n if t[i] < t[i + 1] then\n curlen = curlen + 1\n if k <= curlen then\n sortedCnt = sortedCnt + 1\n end\n else\n curlen = 1\n end\nend\nif 1 < sortedCnt then\n cnt = cnt - (sortedCnt - 1)\nend\nprint(cnt)\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nSnuke has a permutation (P_0,P_1,\\cdots,P_{N-1}) of (0,1,\\cdots,N-1).\n\nNow, he will perform the following operation exactly once:\n\nChoose K consecutive elements in P and sort them in ascending order.\n\nFind the number of permutations that can be produced as P after the operation.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n2 \\leq K \\leq N\n\n0 \\leq P_i \\leq N-1\n\nP_0,P_1,\\cdots,P_{N-1} 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 K\nP_0 P_1 \\cdots P_{N-1}\n\nOutput\n\nPrint the number of permutations that can be produced as P after the operation.\n\nSample Input 1\n\n5 3\n0 2 1 4 3\n\nSample Output 1\n\n2\n\nTwo permutations can be produced as P after the operation: (0,1,2,4,3) and (0,2,1,3,4).\n\nSample Input 2\n\n4 4\n0 1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10 4\n2 0 1 3 7 5 4 6 8 9\n\nSample Output 3\n\n6", "sample_input": "5 3\n0 2 1 4 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02904", "source_text": "Score : 700 points\n\nProblem Statement\n\nSnuke has a permutation (P_0,P_1,\\cdots,P_{N-1}) of (0,1,\\cdots,N-1).\n\nNow, he will perform the following operation exactly once:\n\nChoose K consecutive elements in P and sort them in ascending order.\n\nFind the number of permutations that can be produced as P after the operation.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n2 \\leq K \\leq N\n\n0 \\leq P_i \\leq N-1\n\nP_0,P_1,\\cdots,P_{N-1} 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 K\nP_0 P_1 \\cdots P_{N-1}\n\nOutput\n\nPrint the number of permutations that can be produced as P after the operation.\n\nSample Input 1\n\n5 3\n0 2 1 4 3\n\nSample Output 1\n\n2\n\nTwo permutations can be produced as P after the operation: (0,1,2,4,3) and (0,2,1,3,4).\n\nSample Input 2\n\n4 4\n0 1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10 4\n2 0 1 3 7 5 4 6 8 9\n\nSample Output 3\n\n6", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3167, "cpu_time_ms": 197, "memory_kb": 10624}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s055870023", "group_id": "codeNet:p02909", "input_text": "local s = io.read()\nif s == \"Sunny\" then\n print(\"Cloudy\")\nelseif s == \"Cloudy\" then\n print(\"Rainy\")\nelse\n print(\"Sunny\")\nend\n", "language": "Lua", "metadata": {"date": 1568595649, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02909.html", "problem_id": "p02909", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02909/input.txt", "sample_output_relpath": "derived/input_output/data/p02909/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02909/Lua/s055870023.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s055870023", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Cloudy\n", "input_to_evaluate": "local s = io.read()\nif s == \"Sunny\" then\n print(\"Cloudy\")\nelseif s == \"Cloudy\" then\n print(\"Rainy\")\nelse\n print(\"Sunny\")\nend\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nThe weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...\n\nGiven is a string S representing the weather in the town today. Predict the weather tomorrow.\n\nConstraints\n\nS is Sunny, Cloudy, or Rainy.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint a string representing the expected weather tomorrow, in the same format in which input is given.\n\nSample Input 1\n\nSunny\n\nSample Output 1\n\nCloudy\n\nIn Takahashi's town, a sunny day is followed by a cloudy day.\n\nSample Input 2\n\nRainy\n\nSample Output 2\n\nSunny", "sample_input": "Sunny\n"}, "reference_outputs": ["Cloudy\n"], "source_document_id": "p02909", "source_text": "Score: 100 points\n\nProblem Statement\n\nThe weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...\n\nGiven is a string S representing the weather in the town today. Predict the weather tomorrow.\n\nConstraints\n\nS is Sunny, Cloudy, or Rainy.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint a string representing the expected weather tomorrow, in the same format in which input is given.\n\nSample Input 1\n\nSunny\n\nSample Output 1\n\nCloudy\n\nIn Takahashi's town, a sunny day is followed by a cloudy day.\n\nSample Input 2\n\nRainy\n\nSample Output 2\n\nSunny", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 128, "cpu_time_ms": 12, "memory_kb": 1008}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s522854190", "group_id": "codeNet:p02910", "input_text": "local s = io.read()\nlocal n = #s\nlocal ret = true\nfor i = 1, n do\n if i % 2 == 0 then\n if s:sub(i, i) == \"R\" then\n ret = false\n break\n end\n else\n if s:sub(i, i) == \"L\" then\n ret = false\n break\n end\n end\nend\nprint(ret and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1568595776, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02910.html", "problem_id": "p02910", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02910/input.txt", "sample_output_relpath": "derived/input_output/data/p02910/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02910/Lua/s522854190.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s522854190", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local s = io.read()\nlocal n = #s\nlocal ret = true\nfor i = 1, n do\n if i % 2 == 0 then\n if s:sub(i, i) == \"R\" then\n ret = false\n break\n end\n else\n if s:sub(i, i) == \"L\" then\n ret = false\n break\n end\n end\nend\nprint(ret and \"Yes\" or \"No\")\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nTakahashi will do a tap dance. The dance is described by a string S where each character is L, R, U, or D. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.\n\nS is said to be easily playable if and only if it satisfies both of the following conditions:\n\nEvery character in an odd position (1-st, 3-rd, 5-th, \\ldots) is R, U, or D.\n\nEvery character in an even position (2-nd, 4-th, 6-th, \\ldots) is L, U, or D.\n\nYour task is to print Yes if S is easily playable, and No otherwise.\n\nConstraints\n\nS is a string of length between 1 and 100 (inclusive).\n\nEach character of S is L, R, U, or D.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Yes if S is easily playable, and No otherwise.\n\nSample Input 1\n\nRUDLUDR\n\nSample Output 1\n\nYes\n\nEvery character in an odd position (1-st, 3-rd, 5-th, 7-th) is R, U, or D.\n\nEvery character in an even position (2-nd, 4-th, 6-th) is L, U, or D.\n\nThus, S is easily playable.\n\nSample Input 2\n\nDULL\n\nSample Output 2\n\nNo\n\nThe 3-rd character is not R, U, nor D, so S is not easily playable.\n\nSample Input 3\n\nUUUUUUUUUUUUUUU\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nULURU\n\nSample Output 4\n\nNo\n\nSample Input 5\n\nRDULULDURURLRDULRLR\n\nSample Output 5\n\nYes", "sample_input": "RUDLUDR\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02910", "source_text": "Score: 200 points\n\nProblem Statement\n\nTakahashi will do a tap dance. The dance is described by a string S where each character is L, R, U, or D. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.\n\nS is said to be easily playable if and only if it satisfies both of the following conditions:\n\nEvery character in an odd position (1-st, 3-rd, 5-th, \\ldots) is R, U, or D.\n\nEvery character in an even position (2-nd, 4-th, 6-th, \\ldots) is L, U, or D.\n\nYour task is to print Yes if S is easily playable, and No otherwise.\n\nConstraints\n\nS is a string of length between 1 and 100 (inclusive).\n\nEach character of S is L, R, U, or D.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Yes if S is easily playable, and No otherwise.\n\nSample Input 1\n\nRUDLUDR\n\nSample Output 1\n\nYes\n\nEvery character in an odd position (1-st, 3-rd, 5-th, 7-th) is R, U, or D.\n\nEvery character in an even position (2-nd, 4-th, 6-th) is L, U, or D.\n\nThus, S is easily playable.\n\nSample Input 2\n\nDULL\n\nSample Output 2\n\nNo\n\nThe 3-rd character is not R, U, nor D, so S is not easily playable.\n\nSample Input 3\n\nUUUUUUUUUUUUUUU\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nULURU\n\nSample Output 4\n\nNo\n\nSample Input 5\n\nRDULULDURURLRDULRLR\n\nSample Output 5\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 271, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s474471501", "group_id": "codeNet:p02911", "input_text": "local function reada(n,m)m=m or 1 r={}for i=1,m do r[i]={}end for i=1,n do for j=1,m do r[j][i]=io.read\"*n\"end end return unpack(r)end\nN=io.read\"*n\"\nK=io.read\"*n\"\nQ=io.read\"*n\"\nc={}\nfor i=1,Q do\n\tlocal a=io.read\"*n\"\n\tif(c[a])then c[a]=c[a]+1\n\telse c[a]=1 end\nend\nfor i=1,N do\n\tprint(((c[i]or 0)>Q-K) and\"Yes\"or\"No\")\nend", "language": "Lua", "metadata": {"date": 1587865415, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02911.html", "problem_id": "p02911", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02911/input.txt", "sample_output_relpath": "derived/input_output/data/p02911/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02911/Lua/s474471501.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s474471501", "user_id": "u726173718"}, "prompt_components": {"gold_output": "No\nNo\nYes\nNo\nNo\nNo\n", "input_to_evaluate": "local function reada(n,m)m=m or 1 r={}for i=1,m do r[i]={}end for i=1,n do for j=1,m do r[j][i]=io.read\"*n\"end end return unpack(r)end\nN=io.read\"*n\"\nK=io.read\"*n\"\nQ=io.read\"*n\"\nc={}\nfor i=1,Q do\n\tlocal a=io.read\"*n\"\n\tif(c[a])then c[a]=c[a]+1\n\telse c[a]=1 end\nend\nfor i=1,N do\n\tprint(((c[i]or 0)>Q-K) and\"Yes\"or\"No\")\nend", "problem_context": "Score: 300 points\n\nProblem Statement\n\nTakahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.\n\nA game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.\n\nWhen a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.\n\nAt the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.\n\nIn the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i.\nFor Kizahashi, write a program that determines whether each of the N players survived this game.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 10^9\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq A_i \\leq N\\ (1 \\leq i \\leq Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K Q\nA_1\nA_2\n.\n.\n.\nA_Q\n\nOutput\n\nPrint N lines. The i-th line should contain Yes if Player i survived the game, and No otherwise.\n\nSample Input 1\n\n6 3 4\n3\n1\n3\n2\n\nSample Output 1\n\nNo\nNo\nYes\nNo\nNo\nNo\n\nIn the beginning, the players' scores are (3, 3, 3, 3, 3, 3).\n\nPlayer 3 correctly answers a question. The players' scores are now (2, 2, 3, 2, 2, 2).\n\nPlayer 1 correctly answers a question. The players' scores are now (2, 1, 2, 1, 1, 1).\n\nPlayer 3 correctly answers a question. The players' scores are now (1, 0, 2, 0, 0, 0).\n\nPlayer 2 correctly answers a question. The players' scores are now (0, 0, 1, -1, -1, -1).\n\nPlayers 1, 2, 4, 5 and 6, who have 0 points or lower, are eliminated, and Player 3 survives this game.\n\nSample Input 2\n\n6 5 4\n3\n1\n3\n2\n\nSample Output 2\n\nYes\nYes\nYes\nYes\nYes\nYes\n\nSample Input 3\n\n10 13 15\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n\nSample Output 3\n\nNo\nNo\nNo\nNo\nYes\nNo\nNo\nNo\nYes\nNo", "sample_input": "6 3 4\n3\n1\n3\n2\n"}, "reference_outputs": ["No\nNo\nYes\nNo\nNo\nNo\n"], "source_document_id": "p02911", "source_text": "Score: 300 points\n\nProblem Statement\n\nTakahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.\n\nA game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.\n\nWhen a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.\n\nAt the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.\n\nIn the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i.\nFor Kizahashi, write a program that determines whether each of the N players survived this game.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 10^9\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq A_i \\leq N\\ (1 \\leq i \\leq Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K Q\nA_1\nA_2\n.\n.\n.\nA_Q\n\nOutput\n\nPrint N lines. The i-th line should contain Yes if Player i survived the game, and No otherwise.\n\nSample Input 1\n\n6 3 4\n3\n1\n3\n2\n\nSample Output 1\n\nNo\nNo\nYes\nNo\nNo\nNo\n\nIn the beginning, the players' scores are (3, 3, 3, 3, 3, 3).\n\nPlayer 3 correctly answers a question. The players' scores are now (2, 2, 3, 2, 2, 2).\n\nPlayer 1 correctly answers a question. The players' scores are now (2, 1, 2, 1, 1, 1).\n\nPlayer 3 correctly answers a question. The players' scores are now (1, 0, 2, 0, 0, 0).\n\nPlayer 2 correctly answers a question. The players' scores are now (0, 0, 1, -1, -1, -1).\n\nPlayers 1, 2, 4, 5 and 6, who have 0 points or lower, are eliminated, and Player 3 survives this game.\n\nSample Input 2\n\n6 5 4\n3\n1\n3\n2\n\nSample Output 2\n\nYes\nYes\nYes\nYes\nYes\nYes\n\nSample Input 3\n\n10 13 15\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n\nSample Output 3\n\nNo\nNo\nNo\nNo\nYes\nNo\nNo\nNo\nYes\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 44, "memory_kb": 2356}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s101189456", "group_id": "codeNet:p02917", "input_text": "local function reada(n,m)m=m or 1 r={}for i=1,m do r[i]={}end for i=1,n do for j=1,m do r[j][i]=io.read\"*n\"end end return unpack(r)end\nN=io.read\"*n\"\nB=reada(N-1)\ns=0\nb=B[N-1]\nfor i=N-1,1,-1 do\n\tb=math.min(b,B[i])\n\ts=s+b\nend\nprint(s+B[1])", "language": "Lua", "metadata": {"date": 1587865641, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02917.html", "problem_id": "p02917", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02917/input.txt", "sample_output_relpath": "derived/input_output/data/p02917/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02917/Lua/s101189456.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s101189456", "user_id": "u726173718"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "local function reada(n,m)m=m or 1 r={}for i=1,m do r[i]={}end for i=1,n do for j=1,m do r[j][i]=io.read\"*n\"end end return unpack(r)end\nN=io.read\"*n\"\nB=reada(N-1)\ns=0\nb=B[N-1]\nfor i=N-1,1,-1 do\n\tb=math.min(b,B[i])\n\ts=s+b\nend\nprint(s+B[1])", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is an integer sequence A of length N whose values are unknown.\n\nGiven is an integer sequence B of length N-1 which is known to satisfy the following:\n\nB_i \\geq \\max(A_i, A_{i+1})\n\nFind the maximum possible sum of the elements of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n0 \\leq B_i \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nB_1 B_2 ... B_{N-1}\n\nOutput\n\nPrint the maximum possible sum of the elements of A.\n\nSample Input 1\n\n3\n2 5\n\nSample Output 1\n\n9\n\nA can be, for example, ( 2 , 1 , 5 ), ( -1 , -2 , -3 ), or ( 2 , 2 , 5 ). Among those candidates, A = ( 2 , 2 , 5 ) has the maximum possible sum.\n\nSample Input 2\n\n2\n3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n6\n0 153 10 10 23\n\nSample Output 3\n\n53", "sample_input": "3\n2 5\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02917", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is an integer sequence A of length N whose values are unknown.\n\nGiven is an integer sequence B of length N-1 which is known to satisfy the following:\n\nB_i \\geq \\max(A_i, A_{i+1})\n\nFind the maximum possible sum of the elements of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n0 \\leq B_i \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nB_1 B_2 ... B_{N-1}\n\nOutput\n\nPrint the maximum possible sum of the elements of A.\n\nSample Input 1\n\n3\n2 5\n\nSample Output 1\n\n9\n\nA can be, for example, ( 2 , 1 , 5 ), ( -1 , -2 , -3 ), or ( 2 , 2 , 5 ). Among those candidates, A = ( 2 , 2 , 5 ) has the maximum possible sum.\n\nSample Input 2\n\n2\n3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n6\n0 153 10 10 23\n\nSample Output 3\n\n53", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s715510913", "group_id": "codeNet:p02917", "input_text": "n=io.read(\"*n\")\nb={}\n\nfor i=1, n-1 do\n table.insert(b, i, io.read(\"*n\"))\nend\n\nans=0\n\na1=0\na2=0\n\nfor i=1, n-1 do\n a1=a2\n if i == 1 then\n a1=b[i]\n a2=b[i]\n end\n a2=b[i]\n if b[i+1] == nil then\n a2=b[i]\n elseif b[i] > b[i+1] then\n a2=b[i+1]\n end\n\n ans = ans + a1\nend\n\nans = ans + a2\n\nprint(ans)", "language": "Lua", "metadata": {"date": 1568383183, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02917.html", "problem_id": "p02917", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02917/input.txt", "sample_output_relpath": "derived/input_output/data/p02917/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02917/Lua/s715510913.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s715510913", "user_id": "u535423069"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "n=io.read(\"*n\")\nb={}\n\nfor i=1, n-1 do\n table.insert(b, i, io.read(\"*n\"))\nend\n\nans=0\n\na1=0\na2=0\n\nfor i=1, n-1 do\n a1=a2\n if i == 1 then\n a1=b[i]\n a2=b[i]\n end\n a2=b[i]\n if b[i+1] == nil then\n a2=b[i]\n elseif b[i] > b[i+1] then\n a2=b[i+1]\n end\n\n ans = ans + a1\nend\n\nans = ans + a2\n\nprint(ans)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is an integer sequence A of length N whose values are unknown.\n\nGiven is an integer sequence B of length N-1 which is known to satisfy the following:\n\nB_i \\geq \\max(A_i, A_{i+1})\n\nFind the maximum possible sum of the elements of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n0 \\leq B_i \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nB_1 B_2 ... B_{N-1}\n\nOutput\n\nPrint the maximum possible sum of the elements of A.\n\nSample Input 1\n\n3\n2 5\n\nSample Output 1\n\n9\n\nA can be, for example, ( 2 , 1 , 5 ), ( -1 , -2 , -3 ), or ( 2 , 2 , 5 ). Among those candidates, A = ( 2 , 2 , 5 ) has the maximum possible sum.\n\nSample Input 2\n\n2\n3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n6\n0 153 10 10 23\n\nSample Output 3\n\n53", "sample_input": "3\n2 5\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02917", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is an integer sequence A of length N whose values are unknown.\n\nGiven is an integer sequence B of length N-1 which is known to satisfy the following:\n\nB_i \\geq \\max(A_i, A_{i+1})\n\nFind the maximum possible sum of the elements of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n0 \\leq B_i \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nB_1 B_2 ... B_{N-1}\n\nOutput\n\nPrint the maximum possible sum of the elements of A.\n\nSample Input 1\n\n3\n2 5\n\nSample Output 1\n\n9\n\nA can be, for example, ( 2 , 1 , 5 ), ( -1 , -2 , -3 ), or ( 2 , 2 , 5 ). Among those candidates, A = ( 2 , 2 , 5 ) has the maximum possible sum.\n\nSample Input 2\n\n2\n3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n6\n0 153 10 10 23\n\nSample Output 3\n\n53", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s705522636", "group_id": "codeNet:p02917", "input_text": "local n = io.read(\"*n\")\nlocal sum = io.read(\"*n\")\nlocal prv = sum\nlocal mmi = math.min\nfor i = 2, n - 1 do\n local nxt = io.read(\"*n\")\n sum = sum + mmi(prv, nxt)\n prv = nxt\nend\nsum = sum + prv\nprint(sum)\n", "language": "Lua", "metadata": {"date": 1567910709, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02917.html", "problem_id": "p02917", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02917/input.txt", "sample_output_relpath": "derived/input_output/data/p02917/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02917/Lua/s705522636.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s705522636", "user_id": "u120582723"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal sum = io.read(\"*n\")\nlocal prv = sum\nlocal mmi = math.min\nfor i = 2, n - 1 do\n local nxt = io.read(\"*n\")\n sum = sum + mmi(prv, nxt)\n prv = nxt\nend\nsum = sum + prv\nprint(sum)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is an integer sequence A of length N whose values are unknown.\n\nGiven is an integer sequence B of length N-1 which is known to satisfy the following:\n\nB_i \\geq \\max(A_i, A_{i+1})\n\nFind the maximum possible sum of the elements of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n0 \\leq B_i \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nB_1 B_2 ... B_{N-1}\n\nOutput\n\nPrint the maximum possible sum of the elements of A.\n\nSample Input 1\n\n3\n2 5\n\nSample Output 1\n\n9\n\nA can be, for example, ( 2 , 1 , 5 ), ( -1 , -2 , -3 ), or ( 2 , 2 , 5 ). Among those candidates, A = ( 2 , 2 , 5 ) has the maximum possible sum.\n\nSample Input 2\n\n2\n3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n6\n0 153 10 10 23\n\nSample Output 3\n\n53", "sample_input": "3\n2 5\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02917", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is an integer sequence A of length N whose values are unknown.\n\nGiven is an integer sequence B of length N-1 which is known to satisfy the following:\n\nB_i \\geq \\max(A_i, A_{i+1})\n\nFind the maximum possible sum of the elements of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n0 \\leq B_i \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nB_1 B_2 ... B_{N-1}\n\nOutput\n\nPrint the maximum possible sum of the elements of A.\n\nSample Input 1\n\n3\n2 5\n\nSample Output 1\n\n9\n\nA can be, for example, ( 2 , 1 , 5 ), ( -1 , -2 , -3 ), or ( 2 , 2 , 5 ). Among those candidates, A = ( 2 , 2 , 5 ) has the maximum possible sum.\n\nSample Input 2\n\n2\n3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n6\n0 153 10 10 23\n\nSample Output 3\n\n53", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s458682642", "group_id": "codeNet:p02917", "input_text": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, string.sub(k, i, i)) end local r = io.read local u = table.unpack return function() return r(u(a)) end end})\nlocal N = read.n()\nlocal B = {}\nfor i=1,N-1 do B[i] = read.n() end\n\nlocal A = {}\nA[N] = B[N-1]\nlocal ans = A[N]\nfor i=N-1,2,-1 do\n A[i] = math.min(B[i-1], B[i])\n ans = ans + A[i]\nend\nA[1] = B[1]\nans = ans + A[1]\n--print(table.concat(A, \"\\t\"))\n--print(table.concat(B, \"\\t\"))\nprint(ans)", "language": "Lua", "metadata": {"date": 1567906167, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02917.html", "problem_id": "p02917", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02917/input.txt", "sample_output_relpath": "derived/input_output/data/p02917/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02917/Lua/s458682642.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s458682642", "user_id": "u162773977"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, string.sub(k, i, i)) end local r = io.read local u = table.unpack return function() return r(u(a)) end end})\nlocal N = read.n()\nlocal B = {}\nfor i=1,N-1 do B[i] = read.n() end\n\nlocal A = {}\nA[N] = B[N-1]\nlocal ans = A[N]\nfor i=N-1,2,-1 do\n A[i] = math.min(B[i-1], B[i])\n ans = ans + A[i]\nend\nA[1] = B[1]\nans = ans + A[1]\n--print(table.concat(A, \"\\t\"))\n--print(table.concat(B, \"\\t\"))\nprint(ans)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is an integer sequence A of length N whose values are unknown.\n\nGiven is an integer sequence B of length N-1 which is known to satisfy the following:\n\nB_i \\geq \\max(A_i, A_{i+1})\n\nFind the maximum possible sum of the elements of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n0 \\leq B_i \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nB_1 B_2 ... B_{N-1}\n\nOutput\n\nPrint the maximum possible sum of the elements of A.\n\nSample Input 1\n\n3\n2 5\n\nSample Output 1\n\n9\n\nA can be, for example, ( 2 , 1 , 5 ), ( -1 , -2 , -3 ), or ( 2 , 2 , 5 ). Among those candidates, A = ( 2 , 2 , 5 ) has the maximum possible sum.\n\nSample Input 2\n\n2\n3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n6\n0 153 10 10 23\n\nSample Output 3\n\n53", "sample_input": "3\n2 5\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02917", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is an integer sequence A of length N whose values are unknown.\n\nGiven is an integer sequence B of length N-1 which is known to satisfy the following:\n\nB_i \\geq \\max(A_i, A_{i+1})\n\nFind the maximum possible sum of the elements of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n0 \\leq B_i \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nB_1 B_2 ... B_{N-1}\n\nOutput\n\nPrint the maximum possible sum of the elements of A.\n\nSample Input 1\n\n3\n2 5\n\nSample Output 1\n\n9\n\nA can be, for example, ( 2 , 1 , 5 ), ( -1 , -2 , -3 ), or ( 2 , 2 , 5 ). Among those candidates, A = ( 2 , 2 , 5 ) has the maximum possible sum.\n\nSample Input 2\n\n2\n3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n6\n0 153 10 10 23\n\nSample Output 3\n\n53", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 498, "cpu_time_ms": 7, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s005340816", "group_id": "codeNet:p02918", "input_text": "local n,k=io.read(\"n\",\"n\",\"l\")\nlocal s=io.read()\nlocal counter=0\nfor i=1,n-1 do\n if s:byte(i)~=s:byte(i+1) then\n counter=counter+1\n end\nend\nprint(n-1-(counter-2*k>0 and counter-2*k or 0))", "language": "Lua", "metadata": {"date": 1594779520, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02918.html", "problem_id": "p02918", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02918/input.txt", "sample_output_relpath": "derived/input_output/data/p02918/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02918/Lua/s005340816.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s005340816", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local n,k=io.read(\"n\",\"n\",\"l\")\nlocal s=io.read()\nlocal counter=0\nfor i=1,n-1 do\n if s:byte(i)~=s:byte(i+1) then\n counter=counter+1\n end\nend\nprint(n-1-(counter-2*k>0 and counter-2*k or 0))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N people standing in a queue from west to east.\n\nGiven is a string S of length N representing the directions of the people.\nThe i-th person from the west is facing west if the i-th character of S is L, and east if that character of S is R.\n\nA person is happy if the person in front of him/her is facing the same direction.\nIf no person is standing in front of a person, however, he/she is not happy.\n\nYou can perform the following operation any number of times between 0 and K (inclusive):\n\nOperation: Choose integers l and r such that 1 \\leq l \\leq r \\leq N, and rotate by 180 degrees the part of the queue: the l-th, (l+1)-th, ..., r-th persons. That is, for each i = 0, 1, ..., r-l, the (l + i)-th person from the west will stand the (r - i)-th from the west after the operation, facing east if he/she is facing west now, and vice versa.\n\nWhat is the maximum possible number of happy people you can have?\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^5.\n\nK is an integer satisfying 1 \\leq K \\leq 10^5.\n\n|S| = N\n\nEach character of S is L or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the maximum possible number of happy people after at most K operations.\n\nSample Input 1\n\n6 1\nLRLRRL\n\nSample Output 1\n\n3\n\nIf we choose (l, r) = (2, 5), we have LLLRLL, where the 2-nd, 3-rd, and 6-th persons from the west are happy.\n\nSample Input 2\n\n13 3\nLRRLRLRRLRLLR\n\nSample Output 2\n\n9\n\nSample Input 3\n\n10 1\nLLLLLRRRRR\n\nSample Output 3\n\n9\n\nSample Input 4\n\n9 2\nRRRLRLRLL\n\nSample Output 4\n\n7", "sample_input": "6 1\nLRLRRL\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02918", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N people standing in a queue from west to east.\n\nGiven is a string S of length N representing the directions of the people.\nThe i-th person from the west is facing west if the i-th character of S is L, and east if that character of S is R.\n\nA person is happy if the person in front of him/her is facing the same direction.\nIf no person is standing in front of a person, however, he/she is not happy.\n\nYou can perform the following operation any number of times between 0 and K (inclusive):\n\nOperation: Choose integers l and r such that 1 \\leq l \\leq r \\leq N, and rotate by 180 degrees the part of the queue: the l-th, (l+1)-th, ..., r-th persons. That is, for each i = 0, 1, ..., r-l, the (l + i)-th person from the west will stand the (r - i)-th from the west after the operation, facing east if he/she is facing west now, and vice versa.\n\nWhat is the maximum possible number of happy people you can have?\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^5.\n\nK is an integer satisfying 1 \\leq K \\leq 10^5.\n\n|S| = N\n\nEach character of S is L or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the maximum possible number of happy people after at most K operations.\n\nSample Input 1\n\n6 1\nLRLRRL\n\nSample Output 1\n\n3\n\nIf we choose (l, r) = (2, 5), we have LLLRLL, where the 2-nd, 3-rd, and 6-th persons from the west are happy.\n\nSample Input 2\n\n13 3\nLRRLRLRRLRLLR\n\nSample Output 2\n\n9\n\nSample Input 3\n\n10 1\nLLLLLRRRRR\n\nSample Output 3\n\n9\n\nSample Input 4\n\n9 2\nRRRLRLRLL\n\nSample Output 4\n\n7", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 2888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s938984468", "group_id": "codeNet:p02918", "input_text": "local function str2tbl(s)\n local sub = string.sub\n local t = {}\n for i=1, #s do\n t[i] = sub(s, i, i)\n end\n return t\nend\n\nlocal N, K = io.read(\"n\", \"n\", \"l\")\nlocal S = str2tbl(io.read(\"l\"))\nlocal h = 0\nlocal sw = 0\nfor i=1,N-1 do\n if S[i] == 'L' and S[i+1] == 'L' then\n h = h + 1\n elseif S[i] == 'R' and S[i+1] == 'R' then\n h = h + 1\n else\n sw = sw + 1\n end\nend\nfor k=1,K do\n if sw == 0 then\n break\n elseif sw == 1 then\n h = h + 1\n break\n else\n h = h + 2\n sw = sw - 2\n end\nend\nprint(h)", "language": "Lua", "metadata": {"date": 1567908883, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02918.html", "problem_id": "p02918", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02918/input.txt", "sample_output_relpath": "derived/input_output/data/p02918/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02918/Lua/s938984468.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s938984468", "user_id": "u162773977"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local function str2tbl(s)\n local sub = string.sub\n local t = {}\n for i=1, #s do\n t[i] = sub(s, i, i)\n end\n return t\nend\n\nlocal N, K = io.read(\"n\", \"n\", \"l\")\nlocal S = str2tbl(io.read(\"l\"))\nlocal h = 0\nlocal sw = 0\nfor i=1,N-1 do\n if S[i] == 'L' and S[i+1] == 'L' then\n h = h + 1\n elseif S[i] == 'R' and S[i+1] == 'R' then\n h = h + 1\n else\n sw = sw + 1\n end\nend\nfor k=1,K do\n if sw == 0 then\n break\n elseif sw == 1 then\n h = h + 1\n break\n else\n h = h + 2\n sw = sw - 2\n end\nend\nprint(h)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N people standing in a queue from west to east.\n\nGiven is a string S of length N representing the directions of the people.\nThe i-th person from the west is facing west if the i-th character of S is L, and east if that character of S is R.\n\nA person is happy if the person in front of him/her is facing the same direction.\nIf no person is standing in front of a person, however, he/she is not happy.\n\nYou can perform the following operation any number of times between 0 and K (inclusive):\n\nOperation: Choose integers l and r such that 1 \\leq l \\leq r \\leq N, and rotate by 180 degrees the part of the queue: the l-th, (l+1)-th, ..., r-th persons. That is, for each i = 0, 1, ..., r-l, the (l + i)-th person from the west will stand the (r - i)-th from the west after the operation, facing east if he/she is facing west now, and vice versa.\n\nWhat is the maximum possible number of happy people you can have?\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^5.\n\nK is an integer satisfying 1 \\leq K \\leq 10^5.\n\n|S| = N\n\nEach character of S is L or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the maximum possible number of happy people after at most K operations.\n\nSample Input 1\n\n6 1\nLRLRRL\n\nSample Output 1\n\n3\n\nIf we choose (l, r) = (2, 5), we have LLLRLL, where the 2-nd, 3-rd, and 6-th persons from the west are happy.\n\nSample Input 2\n\n13 3\nLRRLRLRRLRLLR\n\nSample Output 2\n\n9\n\nSample Input 3\n\n10 1\nLLLLLRRRRR\n\nSample Output 3\n\n9\n\nSample Input 4\n\n9 2\nRRRLRLRLL\n\nSample Output 4\n\n7", "sample_input": "6 1\nLRLRRL\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02918", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N people standing in a queue from west to east.\n\nGiven is a string S of length N representing the directions of the people.\nThe i-th person from the west is facing west if the i-th character of S is L, and east if that character of S is R.\n\nA person is happy if the person in front of him/her is facing the same direction.\nIf no person is standing in front of a person, however, he/she is not happy.\n\nYou can perform the following operation any number of times between 0 and K (inclusive):\n\nOperation: Choose integers l and r such that 1 \\leq l \\leq r \\leq N, and rotate by 180 degrees the part of the queue: the l-th, (l+1)-th, ..., r-th persons. That is, for each i = 0, 1, ..., r-l, the (l + i)-th person from the west will stand the (r - i)-th from the west after the operation, facing east if he/she is facing west now, and vice versa.\n\nWhat is the maximum possible number of happy people you can have?\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^5.\n\nK is an integer satisfying 1 \\leq K \\leq 10^5.\n\n|S| = N\n\nEach character of S is L or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the maximum possible number of happy people after at most K operations.\n\nSample Input 1\n\n6 1\nLRLRRL\n\nSample Output 1\n\n3\n\nIf we choose (l, r) = (2, 5), we have LLLRLL, where the 2-nd, 3-rd, and 6-th persons from the west are happy.\n\nSample Input 2\n\n13 3\nLRRLRLRRLRLLR\n\nSample Output 2\n\n9\n\nSample Input 3\n\n10 1\nLLLLLRRRRR\n\nSample Output 3\n\n9\n\nSample Input 4\n\n9 2\nRRRLRLRLL\n\nSample Output 4\n\n7", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 23, "memory_kb": 2584}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s307899740", "group_id": "codeNet:p02920", "input_text": "local mfl, mce = math.floor, math.ceil\nlocal mmi, mma = math.min, math.max\nlocal bls, brs = bit.lshift, bit.rshift\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n local cnt = bls(1, i - 1)\n for j = 1, cnt do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.stage = {{}}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.stage[stagenum] = {}\n end\n self.stagenum = stagenum\n self.left_stage = {}\n for i = 1, n do\n local sp, sz = 1, bls(1, stagenum - 1)\n while(i - 1) % sz ~= 0 do\n sp, sz = sp + 1, brs(sz, 1)\n end\n self.left_stage[i] = sp\n end\n self.sz_stage = {}\n local tmp, sp = 1, stagenum\n for i = 1, n do\n if tmp * 2 == i then tmp, sp = tmp * 2, sp - 1 end\n self.sz_stage[i] = sp\n end\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.lower_bound = function(self, val)\n local ret, retpos = self.emptyvalue, 0\n local stagenum = self.stagenum\n local stage, l, r = 1, 1, bls(1, stagenum - 1)\n while true do\n local sz = bls(1, stagenum - stage)\n local tmp = self.func(ret, self.stage[stage][mce(l / sz)])\n if tmp < val then\n ret, retpos = tmp, l + sz - 1\n if l + sz <= r then stage, l = stage + 1, l + sz\n else break\n end\n else\n if sz ~= 1 then stage, r = stage + 1, l + sz - 2\n else break\n end\n end\n end\n return retpos + 1\nend\nSegTree.setValue = function(self, idx, value)\n self.stage[self.stagenum][idx] = value\n for i = self.stagenum - 1, 1, -1 do\n local dst = brs(idx + 1, 1)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\nlocal inf = 1000000007\nlocal n = io.read(\"*n\")\nlocal tot = bls(1, n)\nlocal t = {}\nlocal idx = {}\nlocal childcnt = {}\nlocal capacity = {}\nfor i = 1, tot do\n t[i] = io.read(\"*n\")\n idx[i] = i\n childcnt[i] = 0\n capacity[i] = -1\nend\ntable.sort(t)\nlocal parent = {0}\nlocal len = {0}\nfor i = 1, n do\n local sn = bls(1, i - 1)\n for j = 1, sn do\n childcnt[j] = childcnt[j] + 1\n parent[j + sn] = j\n len[j + sn] = len[j] + 1\n end\nend\ntable.sort(idx, function(a, b) return len[a] > len[b] end)\nlocal invidx = {}\nfor i = 1, tot do\n invidx[i] = i\nend\nfor i = 1, tot do\n invidx[idx[i]] = i\nend\n-- print(table.concat(parent, \" \"))\n-- print(table.concat(len, \" \"))\n-- print(table.concat(idx, \" \"))\n\nlocal st = SegTree.new(tot, mma, -inf)\nfor i = 1, tot do\n if childcnt[i] == 0 then\n st:setValue(invidx[i], -1)\n end\nend\nlocal valid = true\nfor i = 1, tot do\n local stpos = st:lower_bound(-t[i])\n if tot < stpos then valid = false break end\n st:setValue(stpos, -inf)\n local src = idx[stpos]\n if i ~= tot then\n local p = parent[src]\n -- print(stpos, src, p)\n local stp = invidx[p]\n capacity[p] = mmi(capacity[p], -t[i] - 1)\n childcnt[p] = childcnt[p] - 1\n if childcnt[p] == 0 then\n st:setValue(stp, capacity[p])\n end\n end\nend\nprint(valid and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1589925584, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02920.html", "problem_id": "p02920", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02920/input.txt", "sample_output_relpath": "derived/input_output/data/p02920/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02920/Lua/s307899740.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s307899740", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local mfl, mce = math.floor, math.ceil\nlocal mmi, mma = math.min, math.max\nlocal bls, brs = bit.lshift, bit.rshift\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n local cnt = bls(1, i - 1)\n for j = 1, cnt do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.stage = {{}}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.stage[stagenum] = {}\n end\n self.stagenum = stagenum\n self.left_stage = {}\n for i = 1, n do\n local sp, sz = 1, bls(1, stagenum - 1)\n while(i - 1) % sz ~= 0 do\n sp, sz = sp + 1, brs(sz, 1)\n end\n self.left_stage[i] = sp\n end\n self.sz_stage = {}\n local tmp, sp = 1, stagenum\n for i = 1, n do\n if tmp * 2 == i then tmp, sp = tmp * 2, sp - 1 end\n self.sz_stage[i] = sp\n end\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.lower_bound = function(self, val)\n local ret, retpos = self.emptyvalue, 0\n local stagenum = self.stagenum\n local stage, l, r = 1, 1, bls(1, stagenum - 1)\n while true do\n local sz = bls(1, stagenum - stage)\n local tmp = self.func(ret, self.stage[stage][mce(l / sz)])\n if tmp < val then\n ret, retpos = tmp, l + sz - 1\n if l + sz <= r then stage, l = stage + 1, l + sz\n else break\n end\n else\n if sz ~= 1 then stage, r = stage + 1, l + sz - 2\n else break\n end\n end\n end\n return retpos + 1\nend\nSegTree.setValue = function(self, idx, value)\n self.stage[self.stagenum][idx] = value\n for i = self.stagenum - 1, 1, -1 do\n local dst = brs(idx + 1, 1)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\nlocal inf = 1000000007\nlocal n = io.read(\"*n\")\nlocal tot = bls(1, n)\nlocal t = {}\nlocal idx = {}\nlocal childcnt = {}\nlocal capacity = {}\nfor i = 1, tot do\n t[i] = io.read(\"*n\")\n idx[i] = i\n childcnt[i] = 0\n capacity[i] = -1\nend\ntable.sort(t)\nlocal parent = {0}\nlocal len = {0}\nfor i = 1, n do\n local sn = bls(1, i - 1)\n for j = 1, sn do\n childcnt[j] = childcnt[j] + 1\n parent[j + sn] = j\n len[j + sn] = len[j] + 1\n end\nend\ntable.sort(idx, function(a, b) return len[a] > len[b] end)\nlocal invidx = {}\nfor i = 1, tot do\n invidx[i] = i\nend\nfor i = 1, tot do\n invidx[idx[i]] = i\nend\n-- print(table.concat(parent, \" \"))\n-- print(table.concat(len, \" \"))\n-- print(table.concat(idx, \" \"))\n\nlocal st = SegTree.new(tot, mma, -inf)\nfor i = 1, tot do\n if childcnt[i] == 0 then\n st:setValue(invidx[i], -1)\n end\nend\nlocal valid = true\nfor i = 1, tot do\n local stpos = st:lower_bound(-t[i])\n if tot < stpos then valid = false break end\n st:setValue(stpos, -inf)\n local src = idx[stpos]\n if i ~= tot then\n local p = parent[src]\n -- print(stpos, src, p)\n local stp = invidx[p]\n capacity[p] = mmi(capacity[p], -t[i] - 1)\n childcnt[p] = childcnt[p] - 1\n if childcnt[p] == 0 then\n st:setValue(stp, capacity[p])\n end\n end\nend\nprint(valid and \"Yes\" or \"No\")\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have one slime.\n\nYou can set the health of this slime to any integer value of your choice.\n\nA slime reproduces every second by spawning another slime that has strictly less health. You can freely choose the health of each new slime. The first reproduction of our slime will happen in one second.\n\nDetermine if it is possible to set the healths of our first slime and the subsequent slimes spawn so that the multiset of the healths of the 2^N slimes that will exist in N seconds equals a multiset S.\n\nHere S is a multiset containing 2^N (possibly duplicated) integers: S_1,~S_2,~...,~S_{2^N}.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 18\n\n1 \\leq S_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_{2^N}\n\nOutput\n\nIf it is possible to set the healths of the first slime and the subsequent slimes spawn so that the multiset of the healths of the 2^N slimes that will exist in N seconds equals S, print Yes; otherwise, print No.\n\nSample Input 1\n\n2\n4 2 3 1\n\nSample Output 1\n\nYes\n\nWe will show one way to make the multiset of the healths of the slimes that will exist in 2 seconds equal to S.\n\nFirst, set the health of the first slime to 4.\n\nBy letting the first slime spawn a slime whose health is 3, the healths of the slimes that exist in 1 second can be 4,~3.\n\nThen, by letting the first slime spawn a slime whose health is 2, and letting the second slime spawn a slime whose health is 1, the healths of the slimes that exist in 2 seconds can be 4,~3,~2,~1, which is equal to S as multisets.\n\nSample Input 2\n\n2\n1 2 3 1\n\nSample Output 2\n\nYes\n\nS may contain multiple instances of the same integer.\n\nSample Input 3\n\n1\n1 1\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n5\n4 3 5 3 1 2 7 8 7 4 6 3 7 2 3 6 2 7 3 2 6 7 3 4 6 7 3 4 2 5 2 3\n\nSample Output 4\n\nNo", "sample_input": "2\n4 2 3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02920", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have one slime.\n\nYou can set the health of this slime to any integer value of your choice.\n\nA slime reproduces every second by spawning another slime that has strictly less health. You can freely choose the health of each new slime. The first reproduction of our slime will happen in one second.\n\nDetermine if it is possible to set the healths of our first slime and the subsequent slimes spawn so that the multiset of the healths of the 2^N slimes that will exist in N seconds equals a multiset S.\n\nHere S is a multiset containing 2^N (possibly duplicated) integers: S_1,~S_2,~...,~S_{2^N}.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 18\n\n1 \\leq S_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_{2^N}\n\nOutput\n\nIf it is possible to set the healths of the first slime and the subsequent slimes spawn so that the multiset of the healths of the 2^N slimes that will exist in N seconds equals S, print Yes; otherwise, print No.\n\nSample Input 1\n\n2\n4 2 3 1\n\nSample Output 1\n\nYes\n\nWe will show one way to make the multiset of the healths of the slimes that will exist in 2 seconds equal to S.\n\nFirst, set the health of the first slime to 4.\n\nBy letting the first slime spawn a slime whose health is 3, the healths of the slimes that exist in 1 second can be 4,~3.\n\nThen, by letting the first slime spawn a slime whose health is 2, and letting the second slime spawn a slime whose health is 1, the healths of the slimes that exist in 2 seconds can be 4,~3,~2,~1, which is equal to S as multisets.\n\nSample Input 2\n\n2\n1 2 3 1\n\nSample Output 2\n\nYes\n\nS may contain multiple instances of the same integer.\n\nSample Input 3\n\n1\n1 1\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n5\n4 3 5 3 1 2 7 8 7 4 6 3 7 2 3 6 2 7 3 2 6 7 3 4 6 7 3 4 2 5 2 3\n\nSample Output 4\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3367, "cpu_time_ms": 671, "memory_kb": 23152}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s000433681", "group_id": "codeNet:p02920", "input_text": "local mfl, mce = math.floor, math.ceil\nlocal mmi, mma = math.min, math.max\nlocal bls, brs = bit.lshift, bit.rshift\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n local cnt = bls(1, i - 1)\n for j = 1, cnt do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.stage = {{}}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.stage[stagenum] = {}\n end\n self.stagenum = stagenum\n self.left_stage = {}\n for i = 1, n do\n local sp, sz = 1, bls(1, stagenum - 1)\n while(i - 1) % sz ~= 0 do\n sp, sz = sp + 1, brs(sz, 1)\n end\n self.left_stage[i] = sp\n end\n self.sz_stage = {}\n local tmp, sp = 1, stagenum\n for i = 1, n do\n if tmp * 2 == i then tmp, sp = tmp * 2, sp - 1 end\n self.sz_stage[i] = sp\n end\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.lower_bound = function(self, val)\n local ret, retpos = self.emptyvalue, 0\n local stagenum = self.stagenum\n local stage, l, r = 1, 1, bls(1, stagenum - 1)\n while true do\n local sz = bls(1, stagenum - stage)\n local tmp = self.func(ret, self.stage[stage][mce(l / sz)])\n if tmp < val then\n ret, retpos = tmp, l + sz - 1\n if l + sz <= r then stage, l = stage + 1, l + sz\n else break\n end\n else\n if sz ~= 1 then stage, r = stage + 1, l + sz - 2\n else break\n end\n end\n end\n return retpos + 1\nend\nSegTree.setValue = function(self, idx, value)\n self.stage[self.stagenum][idx] = value\n for i = self.stagenum - 1, 1, -1 do\n local dst = brs(idx + 1, 1)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\nlocal inf = 1000000007\nlocal n = io.read(\"*n\")\nlocal tot = bls(1, n)\nlocal t = {}\nlocal idx = {}\nlocal childcnt = {}\nlocal capacity = {}\nfor i = 1, tot do\n t[i] = io.read(\"*n\")\n idx[i] = i\n childcnt[i] = 0\n capacity[i] = -1\nend\ntable.sort(t)\nlocal parent = {0}\nlocal len = {0}\nfor i = 1, n do\n local sn = bls(1, i - 1)\n for j = 1, sn do\n childcnt[j] = childcnt[j] + 1\n parent[j + sn] = j\n len[j + sn] = len[j] + 1\n end\nend\ntable.sort(idx, function(a, b) return len[a] > len[b] end)\n-- print(table.concat(parent, \" \"))\n-- print(table.concat(len, \" \"))\n-- print(table.concat(idx, \" \"))\n\nlocal st = SegTree.new(tot, mma, -inf)\nfor i = 1, tot do\n if childcnt[i] == 0 then\n st:setValue(i, capacity[i])\n end\nend\nlocal valid = true\nfor i = 1, tot do\n local pos = st:lower_bound(-t[i])\n if tot < pos then valid = false break end\n st:setValue(pos, -inf)\n if i ~= tot then\n local p = parent[pos]\n capacity[p] = mmi(capacity[p], -t[i] - 1)\n childcnt[p] = childcnt[p] - 1\n if childcnt[p] == 0 then\n st:setValue(p, capacity[p])\n end\n end\nend\nprint(valid and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1589925013, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02920.html", "problem_id": "p02920", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02920/input.txt", "sample_output_relpath": "derived/input_output/data/p02920/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02920/Lua/s000433681.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s000433681", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local mfl, mce = math.floor, math.ceil\nlocal mmi, mma = math.min, math.max\nlocal bls, brs = bit.lshift, bit.rshift\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n local cnt = bls(1, i - 1)\n for j = 1, cnt do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.stage = {{}}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.stage[stagenum] = {}\n end\n self.stagenum = stagenum\n self.left_stage = {}\n for i = 1, n do\n local sp, sz = 1, bls(1, stagenum - 1)\n while(i - 1) % sz ~= 0 do\n sp, sz = sp + 1, brs(sz, 1)\n end\n self.left_stage[i] = sp\n end\n self.sz_stage = {}\n local tmp, sp = 1, stagenum\n for i = 1, n do\n if tmp * 2 == i then tmp, sp = tmp * 2, sp - 1 end\n self.sz_stage[i] = sp\n end\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.lower_bound = function(self, val)\n local ret, retpos = self.emptyvalue, 0\n local stagenum = self.stagenum\n local stage, l, r = 1, 1, bls(1, stagenum - 1)\n while true do\n local sz = bls(1, stagenum - stage)\n local tmp = self.func(ret, self.stage[stage][mce(l / sz)])\n if tmp < val then\n ret, retpos = tmp, l + sz - 1\n if l + sz <= r then stage, l = stage + 1, l + sz\n else break\n end\n else\n if sz ~= 1 then stage, r = stage + 1, l + sz - 2\n else break\n end\n end\n end\n return retpos + 1\nend\nSegTree.setValue = function(self, idx, value)\n self.stage[self.stagenum][idx] = value\n for i = self.stagenum - 1, 1, -1 do\n local dst = brs(idx + 1, 1)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\nlocal inf = 1000000007\nlocal n = io.read(\"*n\")\nlocal tot = bls(1, n)\nlocal t = {}\nlocal idx = {}\nlocal childcnt = {}\nlocal capacity = {}\nfor i = 1, tot do\n t[i] = io.read(\"*n\")\n idx[i] = i\n childcnt[i] = 0\n capacity[i] = -1\nend\ntable.sort(t)\nlocal parent = {0}\nlocal len = {0}\nfor i = 1, n do\n local sn = bls(1, i - 1)\n for j = 1, sn do\n childcnt[j] = childcnt[j] + 1\n parent[j + sn] = j\n len[j + sn] = len[j] + 1\n end\nend\ntable.sort(idx, function(a, b) return len[a] > len[b] end)\n-- print(table.concat(parent, \" \"))\n-- print(table.concat(len, \" \"))\n-- print(table.concat(idx, \" \"))\n\nlocal st = SegTree.new(tot, mma, -inf)\nfor i = 1, tot do\n if childcnt[i] == 0 then\n st:setValue(i, capacity[i])\n end\nend\nlocal valid = true\nfor i = 1, tot do\n local pos = st:lower_bound(-t[i])\n if tot < pos then valid = false break end\n st:setValue(pos, -inf)\n if i ~= tot then\n local p = parent[pos]\n capacity[p] = mmi(capacity[p], -t[i] - 1)\n childcnt[p] = childcnt[p] - 1\n if childcnt[p] == 0 then\n st:setValue(p, capacity[p])\n end\n end\nend\nprint(valid and \"Yes\" or \"No\")\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have one slime.\n\nYou can set the health of this slime to any integer value of your choice.\n\nA slime reproduces every second by spawning another slime that has strictly less health. You can freely choose the health of each new slime. The first reproduction of our slime will happen in one second.\n\nDetermine if it is possible to set the healths of our first slime and the subsequent slimes spawn so that the multiset of the healths of the 2^N slimes that will exist in N seconds equals a multiset S.\n\nHere S is a multiset containing 2^N (possibly duplicated) integers: S_1,~S_2,~...,~S_{2^N}.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 18\n\n1 \\leq S_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_{2^N}\n\nOutput\n\nIf it is possible to set the healths of the first slime and the subsequent slimes spawn so that the multiset of the healths of the 2^N slimes that will exist in N seconds equals S, print Yes; otherwise, print No.\n\nSample Input 1\n\n2\n4 2 3 1\n\nSample Output 1\n\nYes\n\nWe will show one way to make the multiset of the healths of the slimes that will exist in 2 seconds equal to S.\n\nFirst, set the health of the first slime to 4.\n\nBy letting the first slime spawn a slime whose health is 3, the healths of the slimes that exist in 1 second can be 4,~3.\n\nThen, by letting the first slime spawn a slime whose health is 2, and letting the second slime spawn a slime whose health is 1, the healths of the slimes that exist in 2 seconds can be 4,~3,~2,~1, which is equal to S as multisets.\n\nSample Input 2\n\n2\n1 2 3 1\n\nSample Output 2\n\nYes\n\nS may contain multiple instances of the same integer.\n\nSample Input 3\n\n1\n1 1\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n5\n4 3 5 3 1 2 7 8 7 4 6 3 7 2 3 6 2 7 3 2 6 7 3 4 6 7 3 4 2 5 2 3\n\nSample Output 4\n\nNo", "sample_input": "2\n4 2 3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02920", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have one slime.\n\nYou can set the health of this slime to any integer value of your choice.\n\nA slime reproduces every second by spawning another slime that has strictly less health. You can freely choose the health of each new slime. The first reproduction of our slime will happen in one second.\n\nDetermine if it is possible to set the healths of our first slime and the subsequent slimes spawn so that the multiset of the healths of the 2^N slimes that will exist in N seconds equals a multiset S.\n\nHere S is a multiset containing 2^N (possibly duplicated) integers: S_1,~S_2,~...,~S_{2^N}.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 18\n\n1 \\leq S_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_{2^N}\n\nOutput\n\nIf it is possible to set the healths of the first slime and the subsequent slimes spawn so that the multiset of the healths of the 2^N slimes that will exist in N seconds equals S, print Yes; otherwise, print No.\n\nSample Input 1\n\n2\n4 2 3 1\n\nSample Output 1\n\nYes\n\nWe will show one way to make the multiset of the healths of the slimes that will exist in 2 seconds equal to S.\n\nFirst, set the health of the first slime to 4.\n\nBy letting the first slime spawn a slime whose health is 3, the healths of the slimes that exist in 1 second can be 4,~3.\n\nThen, by letting the first slime spawn a slime whose health is 2, and letting the second slime spawn a slime whose health is 1, the healths of the slimes that exist in 2 seconds can be 4,~3,~2,~1, which is equal to S as multisets.\n\nSample Input 2\n\n2\n1 2 3 1\n\nSample Output 2\n\nYes\n\nS may contain multiple instances of the same integer.\n\nSample Input 3\n\n1\n1 1\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n5\n4 3 5 3 1 2 7 8 7 4 6 3 7 2 3 6 2 7 3 2 6 7 3 4 6 7 3 4 2 5 2 3\n\nSample Output 4\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3182, "cpu_time_ms": 668, "memory_kb": 21112}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s000250468", "group_id": "codeNet:p02921", "input_text": "local s = io.read()\nlocal t = io.read()\nlocal c = 0\nfor i = 1, 3 do\n if s:sub(i, i) == t:sub(i, i) then c = c + 1 end\nend\nprint(c)\n", "language": "Lua", "metadata": {"date": 1567364532, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02921.html", "problem_id": "p02921", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02921/input.txt", "sample_output_relpath": "derived/input_output/data/p02921/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02921/Lua/s000250468.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s000250468", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local s = io.read()\nlocal t = io.read()\nlocal c = 0\nfor i = 1, 3 do\n if s:sub(i, i) == t:sub(i, i) then c = c + 1 end\nend\nprint(c)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given a string S of length 3 representing the weather forecast for three days in the past.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the forecast for the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nYou will also be given a string T of length 3 representing the actual weather on those three days.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the actual weather on the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nPrint the number of days for which the forecast was correct.\n\nConstraints\n\nS and T are strings of length 3 each.\n\nS and T consist of S, C, and R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the number of days for which the forecast was correct.\n\nSample Input 1\n\nCSS\nCSR\n\nSample Output 1\n\n2\n\nFor the first day, it was forecast to be cloudy, and it was indeed cloudy.\n\nFor the second day, it was forecast to be sunny, and it was indeed sunny.\n\nFor the third day, it was forecast to be sunny, but it was rainy.\n\nThus, the forecast was correct for two days in this case.\n\nSample Input 2\n\nSSR\nSSR\n\nSample Output 2\n\n3\n\nSample Input 3\n\nRRR\nSSS\n\nSample Output 3\n\n0", "sample_input": "CSS\nCSR\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02921", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given a string S of length 3 representing the weather forecast for three days in the past.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the forecast for the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nYou will also be given a string T of length 3 representing the actual weather on those three days.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the actual weather on the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nPrint the number of days for which the forecast was correct.\n\nConstraints\n\nS and T are strings of length 3 each.\n\nS and T consist of S, C, and R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the number of days for which the forecast was correct.\n\nSample Input 1\n\nCSS\nCSR\n\nSample Output 1\n\n2\n\nFor the first day, it was forecast to be cloudy, and it was indeed cloudy.\n\nFor the second day, it was forecast to be sunny, and it was indeed sunny.\n\nFor the third day, it was forecast to be sunny, but it was rainy.\n\nThus, the forecast was correct for two days in this case.\n\nSample Input 2\n\nSSR\nSSR\n\nSample Output 2\n\n3\n\nSample Input 3\n\nRRR\nSSS\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 132, "cpu_time_ms": 14, "memory_kb": 1008}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s499776941", "group_id": "codeNet:p02922", "input_text": "local a,b = io.read(\"a\"):match(\"(%d+).(%d+)\")\na,b = math.tointeger(tonumber(a)) - 1,math.tointeger(tonumber(b))\nlocal count = 0\nlocal loop = true\nwhile loop do\n count = count + 1\n if b <= a * count + 1 then\n loop = false\n end\nend\nprint(count)", "language": "Lua", "metadata": {"date": 1567368560, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02922.html", "problem_id": "p02922", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02922/input.txt", "sample_output_relpath": "derived/input_output/data/p02922/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02922/Lua/s499776941.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s499776941", "user_id": "u959346025"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local a,b = io.read(\"a\"):match(\"(%d+).(%d+)\")\na,b = math.tointeger(tonumber(a)) - 1,math.tointeger(tonumber(b))\nlocal count = 0\nlocal loop = true\nwhile loop do\n count = count + 1\n if b <= a * count + 1 then\n loop = false\n end\nend\nprint(count)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi's house has only one socket.\n\nTakahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.\n\nOne power strip with A sockets can extend one empty socket into A empty sockets.\n\nFind the minimum number of power strips required.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of power strips required.\n\nSample Input 1\n\n4 10\n\nSample Output 1\n\n3\n\n3 power strips, each with 4 sockets, extend the socket into 10 empty sockets.\n\nSample Input 2\n\n8 9\n\nSample Output 2\n\n2\n\n2 power strips, each with 8 sockets, extend the socket into 15 empty sockets.\n\nSample Input 3\n\n8 8\n\nSample Output 3\n\n1", "sample_input": "4 10\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02922", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi's house has only one socket.\n\nTakahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.\n\nOne power strip with A sockets can extend one empty socket into A empty sockets.\n\nFind the minimum number of power strips required.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of power strips required.\n\nSample Input 1\n\n4 10\n\nSample Output 1\n\n3\n\n3 power strips, each with 4 sockets, extend the socket into 10 empty sockets.\n\nSample Input 2\n\n8 9\n\nSample Output 2\n\n2\n\n2 power strips, each with 8 sockets, extend the socket into 15 empty sockets.\n\nSample Input 3\n\n8 8\n\nSample Output 3\n\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s948417568", "group_id": "codeNet:p02922", "input_text": "local a,b = io.read(\"a\"):match(\"(%d+).(%d+)\")\na,b = tonumber(a),tonumber(b)\nlocal count = 0\nlocal loop = true\nwhile loop do\n count = count + 1\n if b <= (a - 1) * count + 1 then\n loop = false\n end\nend\nprint(count)", "language": "Lua", "metadata": {"date": 1567365498, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02922.html", "problem_id": "p02922", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02922/input.txt", "sample_output_relpath": "derived/input_output/data/p02922/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02922/Lua/s948417568.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s948417568", "user_id": "u959346025"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local a,b = io.read(\"a\"):match(\"(%d+).(%d+)\")\na,b = tonumber(a),tonumber(b)\nlocal count = 0\nlocal loop = true\nwhile loop do\n count = count + 1\n if b <= (a - 1) * count + 1 then\n loop = false\n end\nend\nprint(count)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi's house has only one socket.\n\nTakahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.\n\nOne power strip with A sockets can extend one empty socket into A empty sockets.\n\nFind the minimum number of power strips required.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of power strips required.\n\nSample Input 1\n\n4 10\n\nSample Output 1\n\n3\n\n3 power strips, each with 4 sockets, extend the socket into 10 empty sockets.\n\nSample Input 2\n\n8 9\n\nSample Output 2\n\n2\n\n2 power strips, each with 8 sockets, extend the socket into 15 empty sockets.\n\nSample Input 3\n\n8 8\n\nSample Output 3\n\n1", "sample_input": "4 10\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02922", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi's house has only one socket.\n\nTakahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.\n\nOne power strip with A sockets can extend one empty socket into A empty sockets.\n\nFind the minimum number of power strips required.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of power strips required.\n\nSample Input 1\n\n4 10\n\nSample Output 1\n\n3\n\n3 power strips, each with 4 sockets, extend the socket into 10 empty sockets.\n\nSample Input 2\n\n8 9\n\nSample Output 2\n\n2\n\n2 power strips, each with 8 sockets, extend the socket into 15 empty sockets.\n\nSample Input 3\n\n8 8\n\nSample Output 3\n\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s661311536", "group_id": "codeNet:p02923", "input_text": "n=io.read(\"*n\")\nh={}\nfor i=1, n do\n table.insert(h, io.read(\"*n\"))\nend\n\nans=0\ns=0\nfor i=1, n-1 do\n if h[i] < h[i+1] then\n s=0\n else\n s=s+1\n end\n\n if ans < s then\n ans=s\n end\nend\n\nprint(ans)", "language": "Lua", "metadata": {"date": 1568424306, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s661311536.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s661311536", "user_id": "u535423069"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "n=io.read(\"*n\")\nh={}\nfor i=1, n do\n table.insert(h, io.read(\"*n\"))\nend\n\nans=0\ns=0\nfor i=1, n-1 do\n if h[i] < h[i+1] then\n s=0\n else\n s=s+1\n end\n\n if ans < s then\n ans=s\n end\nend\n\nprint(ans)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 46, "memory_kb": 1280}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s768854339", "group_id": "codeNet:p02923", "input_text": "a={}\nn=io.read()\ntemp=0\nnow_max= 0 --最高ジャンプ回数\ncount=0 --カウント\nfor i=1, n,1 do\n temp=io.read(\"*n\")\n a[i]=temp\nend \n\nnow=a[1] --現在の高さ\n\nfor k=2,#a,1 do\n if now >= a[k] then\n now=a[k]\n count=count + 1\n else\n now=a[k]\n count=0\n end\n \n if now_max < count then\n now_max=count\n end\nend\n\nif n== 1 then\nprint(0)\nelse\nprint(now_max)\nend", "language": "Lua", "metadata": {"date": 1567440433, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s768854339.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s768854339", "user_id": "u820341516"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "a={}\nn=io.read()\ntemp=0\nnow_max= 0 --最高ジャンプ回数\ncount=0 --カウント\nfor i=1, n,1 do\n temp=io.read(\"*n\")\n a[i]=temp\nend \n\nnow=a[1] --現在の高さ\n\nfor k=2,#a,1 do\n if now >= a[k] then\n now=a[k]\n count=count + 1\n else\n now=a[k]\n count=0\n end\n \n if now_max < count then\n now_max=count\n end\nend\n\nif n== 1 then\nprint(0)\nelse\nprint(now_max)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 59, "memory_kb": 2424}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s664519984", "group_id": "codeNet:p02923", "input_text": "local l = io.read(\"*l\")\nlocal beforeNum = nil\nlocal count,result = 0,0\nfor _ in io.read(\"*l\"):gmatch(\"%d+\") do\n if beforeNum == nil then\n beforeNum = tonumber(_)\n elseif beforeNum >= tonumber(_) then\n count = count + 1\n elseif count > result then\n result = count\n count = 0\n else\n count = 0\n end\n beforeNum = tonumber(_)\nend\nif count > result then\n result = count\nend\nprint(result)", "language": "Lua", "metadata": {"date": 1567367154, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s664519984.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s664519984", "user_id": "u959346025"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local l = io.read(\"*l\")\nlocal beforeNum = nil\nlocal count,result = 0,0\nfor _ in io.read(\"*l\"):gmatch(\"%d+\") do\n if beforeNum == nil then\n beforeNum = tonumber(_)\n elseif beforeNum >= tonumber(_) then\n count = count + 1\n elseif count > result then\n result = count\n count = 0\n else\n count = 0\n end\n beforeNum = tonumber(_)\nend\nif count > result then\n result = count\nend\nprint(result)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 403, "cpu_time_ms": 60, "memory_kb": 4144}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s575304651", "group_id": "codeNet:p02924", "input_text": "N=io.read(\"n\")\nprint(N*(N-1)//2)", "language": "Lua", "metadata": {"date": 1567380058, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02924.html", "problem_id": "p02924", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02924/input.txt", "sample_output_relpath": "derived/input_output/data/p02924/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02924/Lua/s575304651.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s575304651", "user_id": "u162773977"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "N=io.read(\"n\")\nprint(N*(N-1)//2)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFor an integer N, we will choose a permutation \\{P_1, P_2, ..., P_N\\} of \\{1, 2, ..., N\\}.\n\nThen, for each i=1,2,...,N, let M_i be the remainder when i is divided by P_i.\n\nFind the maximum possible value of M_1 + M_2 + \\cdots + M_N.\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the maximum possible value of M_1 + M_2 + \\cdots + M_N.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n1\n\nWhen the permutation \\{P_1, P_2\\} = \\{2, 1\\} is chosen, M_1 + M_2 = 1 + 0 = 1.\n\nSample Input 2\n\n13\n\nSample Output 2\n\n78\n\nSample Input 3\n\n1\n\nSample Output 3\n\n0", "sample_input": "2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02924", "source_text": "Score : 400 points\n\nProblem Statement\n\nFor an integer N, we will choose a permutation \\{P_1, P_2, ..., P_N\\} of \\{1, 2, ..., N\\}.\n\nThen, for each i=1,2,...,N, let M_i be the remainder when i is divided by P_i.\n\nFind the maximum possible value of M_1 + M_2 + \\cdots + M_N.\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the maximum possible value of M_1 + M_2 + \\cdots + M_N.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n1\n\nWhen the permutation \\{P_1, P_2\\} = \\{2, 1\\} is chosen, M_1 + M_2 = 1 + 0 = 1.\n\nSample Input 2\n\n13\n\nSample Output 2\n\n78\n\nSample Input 3\n\n1\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 32, "cpu_time_ms": 8, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s453909325", "group_id": "codeNet:p02924", "input_text": "local l = io.read(\"*l\")\nl = math.tointeger(tonumber(l))\nlocal result = math.tointeger(0)\nif l == 1 then \n result = 0\nelseif l % 2 == 0 then\n result = (l - 1) * (l // 2)\nelse\n result = (l - 2) * (l // 2) + l - 1\nend\nprint(result)", "language": "Lua", "metadata": {"date": 1567368332, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02924.html", "problem_id": "p02924", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02924/input.txt", "sample_output_relpath": "derived/input_output/data/p02924/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02924/Lua/s453909325.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s453909325", "user_id": "u959346025"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local l = io.read(\"*l\")\nl = math.tointeger(tonumber(l))\nlocal result = math.tointeger(0)\nif l == 1 then \n result = 0\nelseif l % 2 == 0 then\n result = (l - 1) * (l // 2)\nelse\n result = (l - 2) * (l // 2) + l - 1\nend\nprint(result)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFor an integer N, we will choose a permutation \\{P_1, P_2, ..., P_N\\} of \\{1, 2, ..., N\\}.\n\nThen, for each i=1,2,...,N, let M_i be the remainder when i is divided by P_i.\n\nFind the maximum possible value of M_1 + M_2 + \\cdots + M_N.\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the maximum possible value of M_1 + M_2 + \\cdots + M_N.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n1\n\nWhen the permutation \\{P_1, P_2\\} = \\{2, 1\\} is chosen, M_1 + M_2 = 1 + 0 = 1.\n\nSample Input 2\n\n13\n\nSample Output 2\n\n78\n\nSample Input 3\n\n1\n\nSample Output 3\n\n0", "sample_input": "2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02924", "source_text": "Score : 400 points\n\nProblem Statement\n\nFor an integer N, we will choose a permutation \\{P_1, P_2, ..., P_N\\} of \\{1, 2, ..., N\\}.\n\nThen, for each i=1,2,...,N, let M_i be the remainder when i is divided by P_i.\n\nFind the maximum possible value of M_1 + M_2 + \\cdots + M_N.\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the maximum possible value of M_1 + M_2 + \\cdots + M_N.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n1\n\nWhen the permutation \\{P_1, P_2\\} = \\{2, 1\\} is chosen, M_1 + M_2 = 1 + 0 = 1.\n\nSample Input 2\n\n13\n\nSample Output 2\n\n78\n\nSample Input 3\n\n1\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 231, "cpu_time_ms": 7, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s211040946", "group_id": "codeNet:p02925", "input_text": "local n = io.read(\"*n\")\nlocal edge = {}\nlocal srccnt = {}\nfor i = 1, n * n do\n edge[i] = {}\n srccnt[i] = 0\nend\nlocal function getindex(a, b)\n if a < b then\n return (a - 1) * n + b\n else\n return (b - 1) * n + a\n end\nend\nfor i = 1, n do\n local prvidx = getindex(i, io.read(\"*n\"))\n for j = 2, n - 1 do\n local nxtidx = getindex(i, io.read(\"*n\"))\n edge[prvidx][nxtidx] = true\n srccnt[nxtidx] = srccnt[nxtidx] + 1\n prvidx = nxtidx\n end\nend\nlocal tasks = {}\nfor i = 1, n * n do\n if next(edge[i]) and srccnt[i] == 0 then\n table.insert(tasks, i)\n end\nend\nlocal day = 0\nlocal matched = 0\nwhile 0 < #tasks do\n day = day + 1\n local ng = false\n local newtasks = {}\n for i = 1, #tasks do\n local src = tasks[i]\n matched = matched + 1\n for dst, _unused in pairs(edge[src]) do\n srccnt[dst] = srccnt[dst] - 1\n if srccnt[dst] == 0 then\n table.insert(newtasks, dst)\n end\n end\n if ng then break end\n end\n if ng then break end\n tasks = newtasks\nend\nif matched * 2 ~= n * (n - 1) then\n day = -1\nend\nprint(day)\n", "language": "Lua", "metadata": {"date": 1567461652, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02925.html", "problem_id": "p02925", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02925/input.txt", "sample_output_relpath": "derived/input_output/data/p02925/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02925/Lua/s211040946.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s211040946", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal edge = {}\nlocal srccnt = {}\nfor i = 1, n * n do\n edge[i] = {}\n srccnt[i] = 0\nend\nlocal function getindex(a, b)\n if a < b then\n return (a - 1) * n + b\n else\n return (b - 1) * n + a\n end\nend\nfor i = 1, n do\n local prvidx = getindex(i, io.read(\"*n\"))\n for j = 2, n - 1 do\n local nxtidx = getindex(i, io.read(\"*n\"))\n edge[prvidx][nxtidx] = true\n srccnt[nxtidx] = srccnt[nxtidx] + 1\n prvidx = nxtidx\n end\nend\nlocal tasks = {}\nfor i = 1, n * n do\n if next(edge[i]) and srccnt[i] == 0 then\n table.insert(tasks, i)\n end\nend\nlocal day = 0\nlocal matched = 0\nwhile 0 < #tasks do\n day = day + 1\n local ng = false\n local newtasks = {}\n for i = 1, #tasks do\n local src = tasks[i]\n matched = matched + 1\n for dst, _unused in pairs(edge[src]) do\n srccnt[dst] = srccnt[dst] - 1\n if srccnt[dst] == 0 then\n table.insert(newtasks, dst)\n end\n end\n if ng then break end\n end\n if ng then break end\n tasks = newtasks\nend\nif matched * 2 ~= n * (n - 1) then\n day = -1\nend\nprint(day)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nN players will participate in a tennis tournament. We will call them Player 1, Player 2, \\ldots, Player N.\n\nThe tournament is round-robin format, and there will be N(N-1)/2 matches in total.\nIs it possible to schedule these matches so that all of the following conditions are satisfied? If the answer is yes, also find the minimum number of days required.\n\nEach player plays at most one matches in a day.\n\nEach player i (1 \\leq i \\leq N) plays one match against Player A_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} in this order.\n\nConstraints\n\n3 \\leq N \\leq 1000\n\n1 \\leq A_{i, j} \\leq N\n\nA_{i, j} \\neq i\n\nA_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} \\ldots A_{1, N-1}\nA_{2, 1} A_{2, 2} \\ldots A_{2, N-1}\n:\nA_{N, 1} A_{N, 2} \\ldots A_{N, N-1}\n\nOutput\n\nIf it is possible to schedule all the matches so that all of the conditions are satisfied, print the minimum number of days required; if it is impossible, print -1.\n\nSample Input 1\n\n3\n2 3\n1 3\n1 2\n\nSample Output 1\n\n3\n\nAll the conditions can be satisfied if the matches are scheduled for three days as follows:\n\nDay 1: Player 1 vs Player 2\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 2 vs Player 3\n\nThis is the minimum number of days required.\n\nSample Input 2\n\n4\n2 3 4\n1 3 4\n4 1 2\n3 1 2\n\nSample Output 2\n\n4\n\nAll the conditions can be satisfied if the matches are scheduled for four days as follows:\n\nDay 1: Player 1 vs Player 2, Player 3 vs Player 4\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 1 vs Player 4, Player 2 vs Player 3\n\nDay 4: Player 2 vs Player 4\n\nThis is the minimum number of days required.\n\nSample Input 3\n\n3\n2 3\n3 1\n1 2\n\nSample Output 3\n\n-1\n\nAny scheduling of the matches violates some condition.", "sample_input": "3\n2 3\n1 3\n1 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02925", "source_text": "Score : 500 points\n\nProblem Statement\n\nN players will participate in a tennis tournament. We will call them Player 1, Player 2, \\ldots, Player N.\n\nThe tournament is round-robin format, and there will be N(N-1)/2 matches in total.\nIs it possible to schedule these matches so that all of the following conditions are satisfied? If the answer is yes, also find the minimum number of days required.\n\nEach player plays at most one matches in a day.\n\nEach player i (1 \\leq i \\leq N) plays one match against Player A_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} in this order.\n\nConstraints\n\n3 \\leq N \\leq 1000\n\n1 \\leq A_{i, j} \\leq N\n\nA_{i, j} \\neq i\n\nA_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} \\ldots A_{1, N-1}\nA_{2, 1} A_{2, 2} \\ldots A_{2, N-1}\n:\nA_{N, 1} A_{N, 2} \\ldots A_{N, N-1}\n\nOutput\n\nIf it is possible to schedule all the matches so that all of the conditions are satisfied, print the minimum number of days required; if it is impossible, print -1.\n\nSample Input 1\n\n3\n2 3\n1 3\n1 2\n\nSample Output 1\n\n3\n\nAll the conditions can be satisfied if the matches are scheduled for three days as follows:\n\nDay 1: Player 1 vs Player 2\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 2 vs Player 3\n\nThis is the minimum number of days required.\n\nSample Input 2\n\n4\n2 3 4\n1 3 4\n4 1 2\n3 1 2\n\nSample Output 2\n\n4\n\nAll the conditions can be satisfied if the matches are scheduled for four days as follows:\n\nDay 1: Player 1 vs Player 2, Player 3 vs Player 4\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 1 vs Player 4, Player 2 vs Player 3\n\nDay 4: Player 2 vs Player 4\n\nThis is the minimum number of days required.\n\nSample Input 3\n\n3\n2 3\n3 1\n1 2\n\nSample Output 3\n\n-1\n\nAny scheduling of the matches violates some condition.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1063, "cpu_time_ms": 978, "memory_kb": 117100}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s559711203", "group_id": "codeNet:p02925", "input_text": "local n = io.read(\"*n\")\nlocal t = {}\nlocal pos = {}\nlocal waitlist = {}\nfor i = 1, n do\n pos[i] = 1\n t[i] = {}\n for j = 1, n - 1 do\n t[i][j] = io.read(\"*n\")\n end\nend\n\nfor i = 1, n do\n if not waitlist[t[i][1]] then\n waitlist[t[i][1]] = {}\n end\n waitlist[t[i][1]][i] = true\nend\n\nlocal ret = 0\nwhile true do\n ret = ret + 1\n local proceed = false\n local remain = false\n local done = {}\n for i = 1, n do done[i] = false end\n for i, dstlist in pairs(waitlist) do\n if pos[i] < n and not done[i] then\n for nxt, _unused in pairs(dstlist) do\n remain = true\n if waitlist[nxt] and waitlist[nxt][i] and not done[nxt] then\n proceed = true\n waitlist[nxt][i] = nil\n waitlist[i][nxt] = nil\n pos[i] = pos[i] + 1\n pos[nxt] = pos[nxt] + 1\n done[i] = true\n done[nxt] = true\n if pos[i] < n then\n if not waitlist[t[i][pos[i]]] then waitlist[t[i][pos[i]]] = {} end\n waitlist[t[i][pos[i]]][i] = true\n end\n if pos[nxt] < n then\n if not waitlist[t[nxt][pos[nxt]]] then waitlist[t[nxt][pos[nxt]]] = {} end\n waitlist[t[nxt][pos[nxt]]][nxt] = true\n end\n break\n end\n end\n end\n end\n if not remain then\n if not proceed then\n ret = ret - 1\n end\n break\n end\n if not proceed then\n ret = -1\n break\n end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1567372332, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02925.html", "problem_id": "p02925", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02925/input.txt", "sample_output_relpath": "derived/input_output/data/p02925/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02925/Lua/s559711203.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s559711203", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal t = {}\nlocal pos = {}\nlocal waitlist = {}\nfor i = 1, n do\n pos[i] = 1\n t[i] = {}\n for j = 1, n - 1 do\n t[i][j] = io.read(\"*n\")\n end\nend\n\nfor i = 1, n do\n if not waitlist[t[i][1]] then\n waitlist[t[i][1]] = {}\n end\n waitlist[t[i][1]][i] = true\nend\n\nlocal ret = 0\nwhile true do\n ret = ret + 1\n local proceed = false\n local remain = false\n local done = {}\n for i = 1, n do done[i] = false end\n for i, dstlist in pairs(waitlist) do\n if pos[i] < n and not done[i] then\n for nxt, _unused in pairs(dstlist) do\n remain = true\n if waitlist[nxt] and waitlist[nxt][i] and not done[nxt] then\n proceed = true\n waitlist[nxt][i] = nil\n waitlist[i][nxt] = nil\n pos[i] = pos[i] + 1\n pos[nxt] = pos[nxt] + 1\n done[i] = true\n done[nxt] = true\n if pos[i] < n then\n if not waitlist[t[i][pos[i]]] then waitlist[t[i][pos[i]]] = {} end\n waitlist[t[i][pos[i]]][i] = true\n end\n if pos[nxt] < n then\n if not waitlist[t[nxt][pos[nxt]]] then waitlist[t[nxt][pos[nxt]]] = {} end\n waitlist[t[nxt][pos[nxt]]][nxt] = true\n end\n break\n end\n end\n end\n end\n if not remain then\n if not proceed then\n ret = ret - 1\n end\n break\n end\n if not proceed then\n ret = -1\n break\n end\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nN players will participate in a tennis tournament. We will call them Player 1, Player 2, \\ldots, Player N.\n\nThe tournament is round-robin format, and there will be N(N-1)/2 matches in total.\nIs it possible to schedule these matches so that all of the following conditions are satisfied? If the answer is yes, also find the minimum number of days required.\n\nEach player plays at most one matches in a day.\n\nEach player i (1 \\leq i \\leq N) plays one match against Player A_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} in this order.\n\nConstraints\n\n3 \\leq N \\leq 1000\n\n1 \\leq A_{i, j} \\leq N\n\nA_{i, j} \\neq i\n\nA_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} \\ldots A_{1, N-1}\nA_{2, 1} A_{2, 2} \\ldots A_{2, N-1}\n:\nA_{N, 1} A_{N, 2} \\ldots A_{N, N-1}\n\nOutput\n\nIf it is possible to schedule all the matches so that all of the conditions are satisfied, print the minimum number of days required; if it is impossible, print -1.\n\nSample Input 1\n\n3\n2 3\n1 3\n1 2\n\nSample Output 1\n\n3\n\nAll the conditions can be satisfied if the matches are scheduled for three days as follows:\n\nDay 1: Player 1 vs Player 2\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 2 vs Player 3\n\nThis is the minimum number of days required.\n\nSample Input 2\n\n4\n2 3 4\n1 3 4\n4 1 2\n3 1 2\n\nSample Output 2\n\n4\n\nAll the conditions can be satisfied if the matches are scheduled for four days as follows:\n\nDay 1: Player 1 vs Player 2, Player 3 vs Player 4\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 1 vs Player 4, Player 2 vs Player 3\n\nDay 4: Player 2 vs Player 4\n\nThis is the minimum number of days required.\n\nSample Input 3\n\n3\n2 3\n3 1\n1 2\n\nSample Output 3\n\n-1\n\nAny scheduling of the matches violates some condition.", "sample_input": "3\n2 3\n1 3\n1 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02925", "source_text": "Score : 500 points\n\nProblem Statement\n\nN players will participate in a tennis tournament. We will call them Player 1, Player 2, \\ldots, Player N.\n\nThe tournament is round-robin format, and there will be N(N-1)/2 matches in total.\nIs it possible to schedule these matches so that all of the following conditions are satisfied? If the answer is yes, also find the minimum number of days required.\n\nEach player plays at most one matches in a day.\n\nEach player i (1 \\leq i \\leq N) plays one match against Player A_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} in this order.\n\nConstraints\n\n3 \\leq N \\leq 1000\n\n1 \\leq A_{i, j} \\leq N\n\nA_{i, j} \\neq i\n\nA_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} \\ldots A_{1, N-1}\nA_{2, 1} A_{2, 2} \\ldots A_{2, N-1}\n:\nA_{N, 1} A_{N, 2} \\ldots A_{N, N-1}\n\nOutput\n\nIf it is possible to schedule all the matches so that all of the conditions are satisfied, print the minimum number of days required; if it is impossible, print -1.\n\nSample Input 1\n\n3\n2 3\n1 3\n1 2\n\nSample Output 1\n\n3\n\nAll the conditions can be satisfied if the matches are scheduled for three days as follows:\n\nDay 1: Player 1 vs Player 2\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 2 vs Player 3\n\nThis is the minimum number of days required.\n\nSample Input 2\n\n4\n2 3 4\n1 3 4\n4 1 2\n3 1 2\n\nSample Output 2\n\n4\n\nAll the conditions can be satisfied if the matches are scheduled for four days as follows:\n\nDay 1: Player 1 vs Player 2, Player 3 vs Player 4\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 1 vs Player 4, Player 2 vs Player 3\n\nDay 4: Player 2 vs Player 4\n\nThis is the minimum number of days required.\n\nSample Input 3\n\n3\n2 3\n3 1\n1 2\n\nSample Output 3\n\n-1\n\nAny scheduling of the matches violates some condition.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1414, "cpu_time_ms": 2105, "memory_kb": 26808}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s299675394", "group_id": "codeNet:p02925", "input_text": "local n = io.read(\"*n\")\nlocal t = {}\nlocal pos = {}\nlocal waitlist = {}\nfor i = 1, n do\n pos[i] = 1\n t[i] = {}\n for j = 1, n - 1 do\n t[i][j] = io.read(\"*n\")\n end\nend\n\nfor i = 1, n do\n if not waitlist[t[i][1]] then\n waitlist[t[i][1]] = {}\n end\n waitlist[t[i][1]][i] = true\nend\n\nlocal ret = 0\nwhile true do\n ret = ret + 1\n local proceed = false\n local remain = false\n local done = {}\n for i = 1, n do done[i] = false end\n for i, dstlist in pairs(waitlist) do\n if pos[i] < n and not done[i] then\n for nxt, _unused in pairs(dstlist) do\n remain = true\n local nxt = t[i][pos[i]]\n if waitlist[nxt] and waitlist[nxt][i] and waitlist[i][nxt] and not done[nxt] then\n proceed = true\n waitlist[nxt][i] = nil\n waitlist[i][nxt] = nil\n pos[i] = pos[i] + 1\n pos[nxt] = pos[nxt] + 1\n done[i] = true\n done[nxt] = true\n if pos[i] < n then\n if not waitlist[t[i][pos[i]]] then waitlist[t[i][pos[i]]] = {} end\n waitlist[t[i][pos[i]]][i] = true\n end\n if pos[nxt] < n then\n if not waitlist[t[nxt][pos[nxt]]] then waitlist[t[nxt][pos[nxt]]] = {} end\n waitlist[t[nxt][pos[nxt]]][nxt] = true\n end\n break\n end\n end\n end\n end\n if not remain then\n if not proceed then\n ret = ret - 1\n end\n break\n end\n if not proceed then\n ret = -1\n break\n end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1567370374, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02925.html", "problem_id": "p02925", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02925/input.txt", "sample_output_relpath": "derived/input_output/data/p02925/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02925/Lua/s299675394.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s299675394", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal t = {}\nlocal pos = {}\nlocal waitlist = {}\nfor i = 1, n do\n pos[i] = 1\n t[i] = {}\n for j = 1, n - 1 do\n t[i][j] = io.read(\"*n\")\n end\nend\n\nfor i = 1, n do\n if not waitlist[t[i][1]] then\n waitlist[t[i][1]] = {}\n end\n waitlist[t[i][1]][i] = true\nend\n\nlocal ret = 0\nwhile true do\n ret = ret + 1\n local proceed = false\n local remain = false\n local done = {}\n for i = 1, n do done[i] = false end\n for i, dstlist in pairs(waitlist) do\n if pos[i] < n and not done[i] then\n for nxt, _unused in pairs(dstlist) do\n remain = true\n local nxt = t[i][pos[i]]\n if waitlist[nxt] and waitlist[nxt][i] and waitlist[i][nxt] and not done[nxt] then\n proceed = true\n waitlist[nxt][i] = nil\n waitlist[i][nxt] = nil\n pos[i] = pos[i] + 1\n pos[nxt] = pos[nxt] + 1\n done[i] = true\n done[nxt] = true\n if pos[i] < n then\n if not waitlist[t[i][pos[i]]] then waitlist[t[i][pos[i]]] = {} end\n waitlist[t[i][pos[i]]][i] = true\n end\n if pos[nxt] < n then\n if not waitlist[t[nxt][pos[nxt]]] then waitlist[t[nxt][pos[nxt]]] = {} end\n waitlist[t[nxt][pos[nxt]]][nxt] = true\n end\n break\n end\n end\n end\n end\n if not remain then\n if not proceed then\n ret = ret - 1\n end\n break\n end\n if not proceed then\n ret = -1\n break\n end\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nN players will participate in a tennis tournament. We will call them Player 1, Player 2, \\ldots, Player N.\n\nThe tournament is round-robin format, and there will be N(N-1)/2 matches in total.\nIs it possible to schedule these matches so that all of the following conditions are satisfied? If the answer is yes, also find the minimum number of days required.\n\nEach player plays at most one matches in a day.\n\nEach player i (1 \\leq i \\leq N) plays one match against Player A_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} in this order.\n\nConstraints\n\n3 \\leq N \\leq 1000\n\n1 \\leq A_{i, j} \\leq N\n\nA_{i, j} \\neq i\n\nA_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} \\ldots A_{1, N-1}\nA_{2, 1} A_{2, 2} \\ldots A_{2, N-1}\n:\nA_{N, 1} A_{N, 2} \\ldots A_{N, N-1}\n\nOutput\n\nIf it is possible to schedule all the matches so that all of the conditions are satisfied, print the minimum number of days required; if it is impossible, print -1.\n\nSample Input 1\n\n3\n2 3\n1 3\n1 2\n\nSample Output 1\n\n3\n\nAll the conditions can be satisfied if the matches are scheduled for three days as follows:\n\nDay 1: Player 1 vs Player 2\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 2 vs Player 3\n\nThis is the minimum number of days required.\n\nSample Input 2\n\n4\n2 3 4\n1 3 4\n4 1 2\n3 1 2\n\nSample Output 2\n\n4\n\nAll the conditions can be satisfied if the matches are scheduled for four days as follows:\n\nDay 1: Player 1 vs Player 2, Player 3 vs Player 4\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 1 vs Player 4, Player 2 vs Player 3\n\nDay 4: Player 2 vs Player 4\n\nThis is the minimum number of days required.\n\nSample Input 3\n\n3\n2 3\n3 1\n1 2\n\nSample Output 3\n\n-1\n\nAny scheduling of the matches violates some condition.", "sample_input": "3\n2 3\n1 3\n1 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02925", "source_text": "Score : 500 points\n\nProblem Statement\n\nN players will participate in a tennis tournament. We will call them Player 1, Player 2, \\ldots, Player N.\n\nThe tournament is round-robin format, and there will be N(N-1)/2 matches in total.\nIs it possible to schedule these matches so that all of the following conditions are satisfied? If the answer is yes, also find the minimum number of days required.\n\nEach player plays at most one matches in a day.\n\nEach player i (1 \\leq i \\leq N) plays one match against Player A_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} in this order.\n\nConstraints\n\n3 \\leq N \\leq 1000\n\n1 \\leq A_{i, j} \\leq N\n\nA_{i, j} \\neq i\n\nA_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} \\ldots A_{1, N-1}\nA_{2, 1} A_{2, 2} \\ldots A_{2, N-1}\n:\nA_{N, 1} A_{N, 2} \\ldots A_{N, N-1}\n\nOutput\n\nIf it is possible to schedule all the matches so that all of the conditions are satisfied, print the minimum number of days required; if it is impossible, print -1.\n\nSample Input 1\n\n3\n2 3\n1 3\n1 2\n\nSample Output 1\n\n3\n\nAll the conditions can be satisfied if the matches are scheduled for three days as follows:\n\nDay 1: Player 1 vs Player 2\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 2 vs Player 3\n\nThis is the minimum number of days required.\n\nSample Input 2\n\n4\n2 3 4\n1 3 4\n4 1 2\n3 1 2\n\nSample Output 2\n\n4\n\nAll the conditions can be satisfied if the matches are scheduled for four days as follows:\n\nDay 1: Player 1 vs Player 2, Player 3 vs Player 4\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 1 vs Player 4, Player 2 vs Player 3\n\nDay 4: Player 2 vs Player 4\n\nThis is the minimum number of days required.\n\nSample Input 3\n\n3\n2 3\n3 1\n1 2\n\nSample Output 3\n\n-1\n\nAny scheduling of the matches violates some condition.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1468, "cpu_time_ms": 2105, "memory_kb": 26820}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s063119400", "group_id": "codeNet:p02925", "input_text": "local n = io.read(\"*n\")\nlocal t = {}\nlocal pos = {}\nfor i = 1, n do\n pos[i] = 1\n t[i] = {}\n for j = 1, n - 1 do\n t[i][j] = io.read(\"*n\")\n end\nend\n\nlocal ret = 0\nlocal done = {}\nwhile true do\n ret = ret + 1\n local proceed = false\n local remain = false\n for i = 1, n do done[i] = false end\n for i = 1, n do\n if pos[i] < n and not done[i] then\n remain = true\n local nxt = t[i][pos[i]]\n if t[nxt][pos[nxt]] == i and not done[nxt] then\n proceed = true\n pos[i] = pos[i] + 1\n pos[nxt] = pos[nxt] + 1\n done[i] = true\n done[nxt] = true\n end\n end\n end\n if not remain then\n if not proceed then\n ret = ret - 1\n end\n break\n end\n if not proceed then\n ret = -1\n break\n end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1567369151, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02925.html", "problem_id": "p02925", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02925/input.txt", "sample_output_relpath": "derived/input_output/data/p02925/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02925/Lua/s063119400.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s063119400", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal t = {}\nlocal pos = {}\nfor i = 1, n do\n pos[i] = 1\n t[i] = {}\n for j = 1, n - 1 do\n t[i][j] = io.read(\"*n\")\n end\nend\n\nlocal ret = 0\nlocal done = {}\nwhile true do\n ret = ret + 1\n local proceed = false\n local remain = false\n for i = 1, n do done[i] = false end\n for i = 1, n do\n if pos[i] < n and not done[i] then\n remain = true\n local nxt = t[i][pos[i]]\n if t[nxt][pos[nxt]] == i and not done[nxt] then\n proceed = true\n pos[i] = pos[i] + 1\n pos[nxt] = pos[nxt] + 1\n done[i] = true\n done[nxt] = true\n end\n end\n end\n if not remain then\n if not proceed then\n ret = ret - 1\n end\n break\n end\n if not proceed then\n ret = -1\n break\n end\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nN players will participate in a tennis tournament. We will call them Player 1, Player 2, \\ldots, Player N.\n\nThe tournament is round-robin format, and there will be N(N-1)/2 matches in total.\nIs it possible to schedule these matches so that all of the following conditions are satisfied? If the answer is yes, also find the minimum number of days required.\n\nEach player plays at most one matches in a day.\n\nEach player i (1 \\leq i \\leq N) plays one match against Player A_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} in this order.\n\nConstraints\n\n3 \\leq N \\leq 1000\n\n1 \\leq A_{i, j} \\leq N\n\nA_{i, j} \\neq i\n\nA_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} \\ldots A_{1, N-1}\nA_{2, 1} A_{2, 2} \\ldots A_{2, N-1}\n:\nA_{N, 1} A_{N, 2} \\ldots A_{N, N-1}\n\nOutput\n\nIf it is possible to schedule all the matches so that all of the conditions are satisfied, print the minimum number of days required; if it is impossible, print -1.\n\nSample Input 1\n\n3\n2 3\n1 3\n1 2\n\nSample Output 1\n\n3\n\nAll the conditions can be satisfied if the matches are scheduled for three days as follows:\n\nDay 1: Player 1 vs Player 2\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 2 vs Player 3\n\nThis is the minimum number of days required.\n\nSample Input 2\n\n4\n2 3 4\n1 3 4\n4 1 2\n3 1 2\n\nSample Output 2\n\n4\n\nAll the conditions can be satisfied if the matches are scheduled for four days as follows:\n\nDay 1: Player 1 vs Player 2, Player 3 vs Player 4\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 1 vs Player 4, Player 2 vs Player 3\n\nDay 4: Player 2 vs Player 4\n\nThis is the minimum number of days required.\n\nSample Input 3\n\n3\n2 3\n3 1\n1 2\n\nSample Output 3\n\n-1\n\nAny scheduling of the matches violates some condition.", "sample_input": "3\n2 3\n1 3\n1 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02925", "source_text": "Score : 500 points\n\nProblem Statement\n\nN players will participate in a tennis tournament. We will call them Player 1, Player 2, \\ldots, Player N.\n\nThe tournament is round-robin format, and there will be N(N-1)/2 matches in total.\nIs it possible to schedule these matches so that all of the following conditions are satisfied? If the answer is yes, also find the minimum number of days required.\n\nEach player plays at most one matches in a day.\n\nEach player i (1 \\leq i \\leq N) plays one match against Player A_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} in this order.\n\nConstraints\n\n3 \\leq N \\leq 1000\n\n1 \\leq A_{i, j} \\leq N\n\nA_{i, j} \\neq i\n\nA_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} \\ldots A_{1, N-1}\nA_{2, 1} A_{2, 2} \\ldots A_{2, N-1}\n:\nA_{N, 1} A_{N, 2} \\ldots A_{N, N-1}\n\nOutput\n\nIf it is possible to schedule all the matches so that all of the conditions are satisfied, print the minimum number of days required; if it is impossible, print -1.\n\nSample Input 1\n\n3\n2 3\n1 3\n1 2\n\nSample Output 1\n\n3\n\nAll the conditions can be satisfied if the matches are scheduled for three days as follows:\n\nDay 1: Player 1 vs Player 2\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 2 vs Player 3\n\nThis is the minimum number of days required.\n\nSample Input 2\n\n4\n2 3 4\n1 3 4\n4 1 2\n3 1 2\n\nSample Output 2\n\n4\n\nAll the conditions can be satisfied if the matches are scheduled for four days as follows:\n\nDay 1: Player 1 vs Player 2, Player 3 vs Player 4\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 1 vs Player 4, Player 2 vs Player 3\n\nDay 4: Player 2 vs Player 4\n\nThis is the minimum number of days required.\n\nSample Input 3\n\n3\n2 3\n3 1\n1 2\n\nSample Output 3\n\n-1\n\nAny scheduling of the matches violates some condition.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 771, "cpu_time_ms": 2104, "memory_kb": 8832}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s031348559", "group_id": "codeNet:p02925", "input_text": "local n = io.read(\"*n\")\nlocal t = {}\nlocal pos = {}\nlocal waitlist = {}\nfor i = 1, n do\n waitlist[i] = {}\n pos[i] = 1\n t[i] = {}\n for j = 1, n - 1 do\n t[i][j] = io.read(\"*n\")\n end\nend\n\nfor i = 1, n do\n waitlist[t[i][1]][i] = true\nend\n\nlocal ret = 0\nwhile true do\n ret = ret + 1\n local proceed = false\n local remain = false\n local done = {}\n for i = 1, n do done[i] = false end\n for i = 1, n do\n -- print(ret, i, pos[i])\n if pos[i] < n and not done[i] then\n remain = true\n local nxt = t[i][pos[i]]\n if waitlist[i][nxt] and waitlist[nxt][i] and not done[nxt] then\n -- print(\"MATCH\", ret, i, nxt)\n proceed = true\n waitlist[nxt][i] = nil\n waitlist[i][nxt] = nil\n pos[i] = pos[i] + 1\n pos[nxt] = pos[nxt] + 1\n done[i] = true\n done[nxt] = true\n if pos[i] < n then\n waitlist[t[i][pos[i]]][i] = true\n end\n if pos[nxt] < n then\n waitlist[t[nxt][pos[nxt]]][nxt] = true\n end\n end\n end\n end\n if not remain then\n if not proceed then\n ret = ret - 1\n end\n break\n end\n if not proceed then\n ret = -1\n break\n end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1567368983, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02925.html", "problem_id": "p02925", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02925/input.txt", "sample_output_relpath": "derived/input_output/data/p02925/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02925/Lua/s031348559.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s031348559", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal t = {}\nlocal pos = {}\nlocal waitlist = {}\nfor i = 1, n do\n waitlist[i] = {}\n pos[i] = 1\n t[i] = {}\n for j = 1, n - 1 do\n t[i][j] = io.read(\"*n\")\n end\nend\n\nfor i = 1, n do\n waitlist[t[i][1]][i] = true\nend\n\nlocal ret = 0\nwhile true do\n ret = ret + 1\n local proceed = false\n local remain = false\n local done = {}\n for i = 1, n do done[i] = false end\n for i = 1, n do\n -- print(ret, i, pos[i])\n if pos[i] < n and not done[i] then\n remain = true\n local nxt = t[i][pos[i]]\n if waitlist[i][nxt] and waitlist[nxt][i] and not done[nxt] then\n -- print(\"MATCH\", ret, i, nxt)\n proceed = true\n waitlist[nxt][i] = nil\n waitlist[i][nxt] = nil\n pos[i] = pos[i] + 1\n pos[nxt] = pos[nxt] + 1\n done[i] = true\n done[nxt] = true\n if pos[i] < n then\n waitlist[t[i][pos[i]]][i] = true\n end\n if pos[nxt] < n then\n waitlist[t[nxt][pos[nxt]]][nxt] = true\n end\n end\n end\n end\n if not remain then\n if not proceed then\n ret = ret - 1\n end\n break\n end\n if not proceed then\n ret = -1\n break\n end\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nN players will participate in a tennis tournament. We will call them Player 1, Player 2, \\ldots, Player N.\n\nThe tournament is round-robin format, and there will be N(N-1)/2 matches in total.\nIs it possible to schedule these matches so that all of the following conditions are satisfied? If the answer is yes, also find the minimum number of days required.\n\nEach player plays at most one matches in a day.\n\nEach player i (1 \\leq i \\leq N) plays one match against Player A_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} in this order.\n\nConstraints\n\n3 \\leq N \\leq 1000\n\n1 \\leq A_{i, j} \\leq N\n\nA_{i, j} \\neq i\n\nA_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} \\ldots A_{1, N-1}\nA_{2, 1} A_{2, 2} \\ldots A_{2, N-1}\n:\nA_{N, 1} A_{N, 2} \\ldots A_{N, N-1}\n\nOutput\n\nIf it is possible to schedule all the matches so that all of the conditions are satisfied, print the minimum number of days required; if it is impossible, print -1.\n\nSample Input 1\n\n3\n2 3\n1 3\n1 2\n\nSample Output 1\n\n3\n\nAll the conditions can be satisfied if the matches are scheduled for three days as follows:\n\nDay 1: Player 1 vs Player 2\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 2 vs Player 3\n\nThis is the minimum number of days required.\n\nSample Input 2\n\n4\n2 3 4\n1 3 4\n4 1 2\n3 1 2\n\nSample Output 2\n\n4\n\nAll the conditions can be satisfied if the matches are scheduled for four days as follows:\n\nDay 1: Player 1 vs Player 2, Player 3 vs Player 4\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 1 vs Player 4, Player 2 vs Player 3\n\nDay 4: Player 2 vs Player 4\n\nThis is the minimum number of days required.\n\nSample Input 3\n\n3\n2 3\n3 1\n1 2\n\nSample Output 3\n\n-1\n\nAny scheduling of the matches violates some condition.", "sample_input": "3\n2 3\n1 3\n1 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02925", "source_text": "Score : 500 points\n\nProblem Statement\n\nN players will participate in a tennis tournament. We will call them Player 1, Player 2, \\ldots, Player N.\n\nThe tournament is round-robin format, and there will be N(N-1)/2 matches in total.\nIs it possible to schedule these matches so that all of the following conditions are satisfied? If the answer is yes, also find the minimum number of days required.\n\nEach player plays at most one matches in a day.\n\nEach player i (1 \\leq i \\leq N) plays one match against Player A_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} in this order.\n\nConstraints\n\n3 \\leq N \\leq 1000\n\n1 \\leq A_{i, j} \\leq N\n\nA_{i, j} \\neq i\n\nA_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} \\ldots A_{1, N-1}\nA_{2, 1} A_{2, 2} \\ldots A_{2, N-1}\n:\nA_{N, 1} A_{N, 2} \\ldots A_{N, N-1}\n\nOutput\n\nIf it is possible to schedule all the matches so that all of the conditions are satisfied, print the minimum number of days required; if it is impossible, print -1.\n\nSample Input 1\n\n3\n2 3\n1 3\n1 2\n\nSample Output 1\n\n3\n\nAll the conditions can be satisfied if the matches are scheduled for three days as follows:\n\nDay 1: Player 1 vs Player 2\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 2 vs Player 3\n\nThis is the minimum number of days required.\n\nSample Input 2\n\n4\n2 3 4\n1 3 4\n4 1 2\n3 1 2\n\nSample Output 2\n\n4\n\nAll the conditions can be satisfied if the matches are scheduled for four days as follows:\n\nDay 1: Player 1 vs Player 2, Player 3 vs Player 4\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 1 vs Player 4, Player 2 vs Player 3\n\nDay 4: Player 2 vs Player 4\n\nThis is the minimum number of days required.\n\nSample Input 3\n\n3\n2 3\n3 1\n1 2\n\nSample Output 3\n\n-1\n\nAny scheduling of the matches violates some condition.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2105, "memory_kb": 27228}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s074182633", "group_id": "codeNet:p02926", "input_text": "local n = io.read(\"*n\")\nlocal t = {}\nfor i = 1, n do\n local x, y = io.read(\"*n\", \"*n\")\n if x ~= 0 or y ~= 0 then\n table.insert(t, {x, y})\n end\nend\nn = #t\nlocal at2 = math.atan2\ntable.sort(t, function(a, b)\n return at2(a[2], a[1]) < at2(b[2], b[1])\nend\n)\nlocal mma, msq = math.max, math.sqrt\nlocal maxlen = 0\nlocal halfpi = math.pi / 2\nlocal pi2 = math.pi * 2\nfor i_start = 1, n do\n local cur_x, cur_y = t[i_start][1], t[i_start][2]\n local cur_rad = at2(cur_y, cur_x)\n local cur_len = msq(cur_x * cur_x + cur_y * cur_y)\n local used = {}\n for j = 1, n - 1 do\n used[j] = false\n end\n local needreset = true\n while needreset do\n needreset = false\n for j = 1, n - 1 do\n if not used[j] then\n local pos = i_start + j\n local up = false\n if n < pos then\n pos = pos - n\n up = true\n end\n local nxt_x, nxt_y = t[pos][1], t[pos][2]\n local nxt_rad = at2(nxt_y, nxt_x)\n if up then\n nxt_rad = nxt_rad + pi2\n end\n local isok = false\n if nxt_rad - cur_rad <= halfpi then\n cur_x = cur_x + nxt_x\n cur_y = cur_y + nxt_y\n cur_rad = at2(cur_y, cur_x)\n cur_len = msq(cur_x * cur_x + cur_y * cur_y)\n used[j] = true\n else\n local candx = cur_x + nxt_x\n local candy = cur_y + nxt_y\n if cur_len < msq(candx * candx + candy * candy) then\n used[j] = true\n needreset = true\n cur_x = candx\n cur_y = candy\n cur_rad = at2(cur_y, cur_x)\n cur_len = msq(cur_x * cur_x + cur_y * cur_y)\n end\n end\n end\n end\n end\n maxlen = mma(maxlen, cur_len)\nend\nprint(string.format(\"%.13f\", maxlen))\n", "language": "Lua", "metadata": {"date": 1567367719, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02926.html", "problem_id": "p02926", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02926/input.txt", "sample_output_relpath": "derived/input_output/data/p02926/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02926/Lua/s074182633.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s074182633", "user_id": "u120582723"}, "prompt_components": {"gold_output": "10.000000000000000000000000000000000000000000000000\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal t = {}\nfor i = 1, n do\n local x, y = io.read(\"*n\", \"*n\")\n if x ~= 0 or y ~= 0 then\n table.insert(t, {x, y})\n end\nend\nn = #t\nlocal at2 = math.atan2\ntable.sort(t, function(a, b)\n return at2(a[2], a[1]) < at2(b[2], b[1])\nend\n)\nlocal mma, msq = math.max, math.sqrt\nlocal maxlen = 0\nlocal halfpi = math.pi / 2\nlocal pi2 = math.pi * 2\nfor i_start = 1, n do\n local cur_x, cur_y = t[i_start][1], t[i_start][2]\n local cur_rad = at2(cur_y, cur_x)\n local cur_len = msq(cur_x * cur_x + cur_y * cur_y)\n local used = {}\n for j = 1, n - 1 do\n used[j] = false\n end\n local needreset = true\n while needreset do\n needreset = false\n for j = 1, n - 1 do\n if not used[j] then\n local pos = i_start + j\n local up = false\n if n < pos then\n pos = pos - n\n up = true\n end\n local nxt_x, nxt_y = t[pos][1], t[pos][2]\n local nxt_rad = at2(nxt_y, nxt_x)\n if up then\n nxt_rad = nxt_rad + pi2\n end\n local isok = false\n if nxt_rad - cur_rad <= halfpi then\n cur_x = cur_x + nxt_x\n cur_y = cur_y + nxt_y\n cur_rad = at2(cur_y, cur_x)\n cur_len = msq(cur_x * cur_x + cur_y * cur_y)\n used[j] = true\n else\n local candx = cur_x + nxt_x\n local candy = cur_y + nxt_y\n if cur_len < msq(candx * candx + candy * candy) then\n used[j] = true\n needreset = true\n cur_x = candx\n cur_y = candy\n cur_rad = at2(cur_y, cur_x)\n cur_len = msq(cur_x * cur_x + cur_y * cur_y)\n end\n end\n end\n end\n end\n maxlen = mma(maxlen, cur_len)\nend\nprint(string.format(\"%.13f\", maxlen))\n", "problem_context": "Score: 600 points\n\nProblem Statement\n\nE869120 is initially standing at the origin (0, 0) in a two-dimensional plane.\n\nHe has N engines, which can be used as follows:\n\nWhen E869120 uses the i-th engine, his X- and Y-coordinate change by x_i and y_i, respectively. In other words, if E869120 uses the i-th engine from coordinates (X, Y), he will move to the coordinates (X + x_i, Y + y_i).\n\nE869120 can use these engines in any order, but each engine can be used at most once. He may also choose not to use some of the engines.\n\nHe wants to go as far as possible from the origin.\nLet (X, Y) be his final coordinates. Find the maximum possible value of \\sqrt{X^2 + Y^2}, the distance from the origin.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n-1 \\ 000 \\ 000 \\leq x_i \\leq 1 \\ 000 \\ 000\n\n-1 \\ 000 \\ 000 \\leq y_i \\leq 1 \\ 000 \\ 000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n: :\nx_N y_N\n\nOutput\n\nPrint the maximum possible final distance from the origin, as a real value.\nYour output is considered correct when the relative or absolute error from the true answer is at most 10^{-10}.\n\nSample Input 1\n\n3\n0 10\n5 -5\n-5 -5\n\nSample Output 1\n\n10.000000000000000000000000000000000000000000000000\n\nThe final distance from the origin can be 10 if we use the engines in one of the following three ways:\n\nUse Engine 1 to move to (0, 10).\n\nUse Engine 2 to move to (5, -5), and then use Engine 3 to move to (0, -10).\n\nUse Engine 3 to move to (-5, -5), and then use Engine 2 to move to (0, -10).\n\nThe distance cannot be greater than 10, so the maximum possible distance is 10.\n\nSample Input 2\n\n5\n1 1\n1 0\n0 1\n-1 0\n0 -1\n\nSample Output 2\n\n2.828427124746190097603377448419396157139343750753\n\nThe maximum possible final distance is 2 \\sqrt{2} = 2.82842....\nOne of the ways to achieve it is:\n\nUse Engine 1 to move to (1, 1), and then use Engine 2 to move to (2, 1), and finally use Engine 3 to move to (2, 2).\n\nSample Input 3\n\n5\n1 1\n2 2\n3 3\n4 4\n5 5\n\nSample Output 3\n\n21.213203435596425732025330863145471178545078130654\n\nIf we use all the engines in the order 1 \\rightarrow 2 \\rightarrow 3 \\rightarrow 4 \\rightarrow 5, we will end up at (15, 15), with the distance 15 \\sqrt{2} = 21.2132... from the origin.\n\nSample Input 4\n\n3\n0 0\n0 1\n1 0\n\nSample Output 4\n\n1.414213562373095048801688724209698078569671875376\n\nThere can be useless engines with (x_i, y_i) = (0, 0).\n\nSample Input 5\n\n1\n90447 91000\n\nSample Output 5\n\n128303.000000000000000000000000000000000000000000000000\n\nNote that there can be only one engine.\n\nSample Input 6\n\n2\n96000 -72000\n-72000 54000\n\nSample Output 6\n\n120000.000000000000000000000000000000000000000000000000\n\nThere can be only two engines, too.\n\nSample Input 7\n\n10\n1 2\n3 4\n5 6\n7 8\n9 10\n11 12\n13 14\n15 16\n17 18\n19 20\n\nSample Output 7\n\n148.660687473185055226120082139313966514489855137208", "sample_input": "3\n0 10\n5 -5\n-5 -5\n"}, "reference_outputs": ["10.000000000000000000000000000000000000000000000000\n"], "source_document_id": "p02926", "source_text": "Score: 600 points\n\nProblem Statement\n\nE869120 is initially standing at the origin (0, 0) in a two-dimensional plane.\n\nHe has N engines, which can be used as follows:\n\nWhen E869120 uses the i-th engine, his X- and Y-coordinate change by x_i and y_i, respectively. In other words, if E869120 uses the i-th engine from coordinates (X, Y), he will move to the coordinates (X + x_i, Y + y_i).\n\nE869120 can use these engines in any order, but each engine can be used at most once. He may also choose not to use some of the engines.\n\nHe wants to go as far as possible from the origin.\nLet (X, Y) be his final coordinates. Find the maximum possible value of \\sqrt{X^2 + Y^2}, the distance from the origin.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n-1 \\ 000 \\ 000 \\leq x_i \\leq 1 \\ 000 \\ 000\n\n-1 \\ 000 \\ 000 \\leq y_i \\leq 1 \\ 000 \\ 000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n: :\nx_N y_N\n\nOutput\n\nPrint the maximum possible final distance from the origin, as a real value.\nYour output is considered correct when the relative or absolute error from the true answer is at most 10^{-10}.\n\nSample Input 1\n\n3\n0 10\n5 -5\n-5 -5\n\nSample Output 1\n\n10.000000000000000000000000000000000000000000000000\n\nThe final distance from the origin can be 10 if we use the engines in one of the following three ways:\n\nUse Engine 1 to move to (0, 10).\n\nUse Engine 2 to move to (5, -5), and then use Engine 3 to move to (0, -10).\n\nUse Engine 3 to move to (-5, -5), and then use Engine 2 to move to (0, -10).\n\nThe distance cannot be greater than 10, so the maximum possible distance is 10.\n\nSample Input 2\n\n5\n1 1\n1 0\n0 1\n-1 0\n0 -1\n\nSample Output 2\n\n2.828427124746190097603377448419396157139343750753\n\nThe maximum possible final distance is 2 \\sqrt{2} = 2.82842....\nOne of the ways to achieve it is:\n\nUse Engine 1 to move to (1, 1), and then use Engine 2 to move to (2, 1), and finally use Engine 3 to move to (2, 2).\n\nSample Input 3\n\n5\n1 1\n2 2\n3 3\n4 4\n5 5\n\nSample Output 3\n\n21.213203435596425732025330863145471178545078130654\n\nIf we use all the engines in the order 1 \\rightarrow 2 \\rightarrow 3 \\rightarrow 4 \\rightarrow 5, we will end up at (15, 15), with the distance 15 \\sqrt{2} = 21.2132... from the origin.\n\nSample Input 4\n\n3\n0 0\n0 1\n1 0\n\nSample Output 4\n\n1.414213562373095048801688724209698078569671875376\n\nThere can be useless engines with (x_i, y_i) = (0, 0).\n\nSample Input 5\n\n1\n90447 91000\n\nSample Output 5\n\n128303.000000000000000000000000000000000000000000000000\n\nNote that there can be only one engine.\n\nSample Input 6\n\n2\n96000 -72000\n-72000 54000\n\nSample Output 6\n\n120000.000000000000000000000000000000000000000000000000\n\nThere can be only two engines, too.\n\nSample Input 7\n\n10\n1 2\n3 4\n5 6\n7 8\n9 10\n11 12\n13 14\n15 16\n17 18\n19 20\n\nSample Output 7\n\n148.660687473185055226120082139313966514489855137208", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1741, "cpu_time_ms": 3, "memory_kb": 384}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s113378090", "group_id": "codeNet:p02928", "input_text": "local n,k=io.read(\"n\",\"n\")\nlocal a={}\nfor i=1,n do\n a[i]=io.read(\"n\")\nend\n\nlocal mod=1000000007\nlocal A=0\nlocal B=0\nlocal counter=0\nfor i=1,n do\n for j=1,n do\n if a[i]>a[j] and ia[j] then\n B=B+1\n end\n end\nend\nlocal counterA=A*k%mod\nlocal counterB=(k*(k-1)//2%mod)*B%mod\nprint((counterA+counterB)%mod)", "language": "Lua", "metadata": {"date": 1591103075, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02928.html", "problem_id": "p02928", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02928/input.txt", "sample_output_relpath": "derived/input_output/data/p02928/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02928/Lua/s113378090.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s113378090", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local n,k=io.read(\"n\",\"n\")\nlocal a={}\nfor i=1,n do\n a[i]=io.read(\"n\")\nend\n\nlocal mod=1000000007\nlocal A=0\nlocal B=0\nlocal counter=0\nfor i=1,n do\n for j=1,n do\n if a[i]>a[j] and ia[j] then\n B=B+1\n end\n end\nend\nlocal counterA=A*k%mod\nlocal counterB=(k*(k-1)//2%mod)*B%mod\nprint((counterA+counterB)%mod)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have a sequence of N integers A~=~A_0,~A_1,~...,~A_{N - 1}.\n\nLet B be a sequence of K \\times N integers obtained by concatenating K copies of A. For example, if A~=~1,~3,~2 and K~=~2, B~=~1,~3,~2,~1,~3,~2.\n\nFind the inversion number of B, modulo 10^9 + 7.\n\nHere the inversion number of B is defined as the number of ordered pairs of integers (i,~j)~(0 \\leq i < j \\leq K \\times N - 1) such that B_i > B_j.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i \\leq 2000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_0 A_1 ... A_{N - 1}\n\nOutput\n\nPrint the inversion number of B, modulo 10^9 + 7.\n\nSample Input 1\n\n2 2\n2 1\n\nSample Output 1\n\n3\n\nIn this case, B~=~2,~1,~2,~1. We have:\n\nB_0 > B_1\n\nB_0 > B_3\n\nB_2 > B_3\n\nThus, the inversion number of B is 3.\n\nSample Input 2\n\n3 5\n1 1 1\n\nSample Output 2\n\n0\n\nA may contain multiple occurrences of the same number.\n\nSample Input 3\n\n10 998244353\n10 9 8 7 5 6 3 4 2 1\n\nSample Output 3\n\n185297239\n\nBe sure to print the output modulo 10^9 + 7.", "sample_input": "2 2\n2 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02928", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have a sequence of N integers A~=~A_0,~A_1,~...,~A_{N - 1}.\n\nLet B be a sequence of K \\times N integers obtained by concatenating K copies of A. For example, if A~=~1,~3,~2 and K~=~2, B~=~1,~3,~2,~1,~3,~2.\n\nFind the inversion number of B, modulo 10^9 + 7.\n\nHere the inversion number of B is defined as the number of ordered pairs of integers (i,~j)~(0 \\leq i < j \\leq K \\times N - 1) such that B_i > B_j.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i \\leq 2000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_0 A_1 ... A_{N - 1}\n\nOutput\n\nPrint the inversion number of B, modulo 10^9 + 7.\n\nSample Input 1\n\n2 2\n2 1\n\nSample Output 1\n\n3\n\nIn this case, B~=~2,~1,~2,~1. We have:\n\nB_0 > B_1\n\nB_0 > B_3\n\nB_2 > B_3\n\nThus, the inversion number of B is 3.\n\nSample Input 2\n\n3 5\n1 1 1\n\nSample Output 2\n\n0\n\nA may contain multiple occurrences of the same number.\n\nSample Input 3\n\n10 998244353\n10 9 8 7 5 6 3 4 2 1\n\nSample Output 3\n\n185297239\n\nBe sure to print the output modulo 10^9 + 7.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 388, "cpu_time_ms": 551, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s813073972", "group_id": "codeNet:p02935", "input_text": "local n = io.read(\"*n\")\nlocal v = {}\nfor i = 1, n do\n v[i] = io.read(\"*n\")\nend\ntable.sort(v, function(a, b) return a > b end)\n\nlocal sum = 0\nlocal mul = 2\nfor i = 1, n do\n sum = sum + v[i] / mul\n if i ~= n - 1 then mul = mul * 2 end\nend\nprint(string.format(\"%.10f\",sum))\n", "language": "Lua", "metadata": {"date": 1566176704, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s813073972.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s813073972", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3.5\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal v = {}\nfor i = 1, n do\n v[i] = io.read(\"*n\")\nend\ntable.sort(v, function(a, b) return a > b end)\n\nlocal sum = 0\nlocal mul = 2\nfor i = 1, n do\n sum = sum + v[i] / mul\n if i ~= n - 1 then mul = mul * 2 end\nend\nprint(string.format(\"%.10f\",sum))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou have a pot and N ingredients. Each ingredient has a real number parameter called value, and the value of the i-th ingredient (1 \\leq i \\leq N) is v_i.\n\nWhen you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 where x and y are the values of the ingredients consumed, and you can put this ingredient again in the pot.\n\nAfter you compose ingredients in this way N-1 times, you will end up with one ingredient. Find the maximum possible value of this ingredient.\n\nConstraints\n\n2 \\leq N \\leq 50\n\n1 \\leq v_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nv_1 v_2 \\ldots v_N\n\nOutput\n\nPrint a decimal number (or an integer) representing the maximum possible value of the last ingredient remaining.\n\nYour output will be judged correct when its absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n3 4\n\nSample Output 1\n\n3.5\n\nIf you start with two ingredients, the only choice is to put both of them in the pot. The value of the ingredient resulting from the ingredients of values 3 and 4 is (3 + 4) / 2 = 3.5.\n\nPrinting 3.50001, 3.49999, and so on will also be accepted.\n\nSample Input 2\n\n3\n500 300 200\n\nSample Output 2\n\n375\n\nYou start with three ingredients this time, and you can choose what to use in the first composition. There are three possible choices:\n\nUse the ingredients of values 500 and 300 to produce an ingredient of value (500 + 300) / 2 = 400. The next composition will use this ingredient and the ingredient of value 200, resulting in an ingredient of value (400 + 200) / 2 = 300.\n\nUse the ingredients of values 500 and 200 to produce an ingredient of value (500 + 200) / 2 = 350. The next composition will use this ingredient and the ingredient of value 300, resulting in an ingredient of value (350 + 300) / 2 = 325.\n\nUse the ingredients of values 300 and 200 to produce an ingredient of value (300 + 200) / 2 = 250. The next composition will use this ingredient and the ingredient of value 500, resulting in an ingredient of value (250 + 500) / 2 = 375.\n\nThus, the maximum possible value of the last ingredient remaining is 375.\n\nPrinting 375.0 and so on will also be accepted.\n\nSample Input 3\n\n5\n138 138 138 138 138\n\nSample Output 3\n\n138", "sample_input": "2\n3 4\n"}, "reference_outputs": ["3.5\n"], "source_document_id": "p02935", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou have a pot and N ingredients. Each ingredient has a real number parameter called value, and the value of the i-th ingredient (1 \\leq i \\leq N) is v_i.\n\nWhen you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 where x and y are the values of the ingredients consumed, and you can put this ingredient again in the pot.\n\nAfter you compose ingredients in this way N-1 times, you will end up with one ingredient. Find the maximum possible value of this ingredient.\n\nConstraints\n\n2 \\leq N \\leq 50\n\n1 \\leq v_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nv_1 v_2 \\ldots v_N\n\nOutput\n\nPrint a decimal number (or an integer) representing the maximum possible value of the last ingredient remaining.\n\nYour output will be judged correct when its absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n3 4\n\nSample Output 1\n\n3.5\n\nIf you start with two ingredients, the only choice is to put both of them in the pot. The value of the ingredient resulting from the ingredients of values 3 and 4 is (3 + 4) / 2 = 3.5.\n\nPrinting 3.50001, 3.49999, and so on will also be accepted.\n\nSample Input 2\n\n3\n500 300 200\n\nSample Output 2\n\n375\n\nYou start with three ingredients this time, and you can choose what to use in the first composition. There are three possible choices:\n\nUse the ingredients of values 500 and 300 to produce an ingredient of value (500 + 300) / 2 = 400. The next composition will use this ingredient and the ingredient of value 200, resulting in an ingredient of value (400 + 200) / 2 = 300.\n\nUse the ingredients of values 500 and 200 to produce an ingredient of value (500 + 200) / 2 = 350. The next composition will use this ingredient and the ingredient of value 300, resulting in an ingredient of value (350 + 300) / 2 = 325.\n\nUse the ingredients of values 300 and 200 to produce an ingredient of value (300 + 200) / 2 = 250. The next composition will use this ingredient and the ingredient of value 500, resulting in an ingredient of value (250 + 500) / 2 = 375.\n\nThus, the maximum possible value of the last ingredient remaining is 375.\n\nPrinting 375.0 and so on will also be accepted.\n\nSample Input 3\n\n5\n138 138 138 138 138\n\nSample Output 3\n\n138", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 274, "cpu_time_ms": 12, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s649314184", "group_id": "codeNet:p02937", "input_text": "local mfl = math.floor\n\nlocal function comp(a, b)\n return a < b\nend\n\nlocal function lower_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if not comp(ary[1], x) then return 1 end\n if comp(ary[num], x) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if comp(ary[mid], x) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\nlocal function upper_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if comp(x, ary[1]) then return 1 end\n if not comp(x, ary[num]) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if not comp(x, ary[mid]) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal s = io.read()\nlocal t = io.read()\nlocal n = #s\nlocal m = #t\nlocal s_tbl = {}\nlocal sstr = \"\"\nfor i = 1, n do\n sstr = s:sub(i, i)\n if not s_tbl[sstr] then s_tbl[sstr] = {} end\n table.insert(s_tbl[sstr], i)\nend\n\nlocal curpos = 0\nlocal loop = 0\nlocal isok = true\nfor i = 1, m do\n sstr = t:sub(i, i)\n if not s_tbl[sstr] then\n isok = false\n break\n else\n local bnd = upper_bound(s_tbl[sstr], curpos)\n if #s_tbl[sstr] < bnd then\n loop = loop + 1\n curpos= s_tbl[sstr][1]\n else\n curpos = s_tbl[sstr][bnd]\n end\n end\nend\n\nif isok then\nprint(loop * n + curpos)\nelse\n print(-1)\nend\n", "language": "Lua", "metadata": {"date": 1566177796, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02937.html", "problem_id": "p02937", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02937/input.txt", "sample_output_relpath": "derived/input_output/data/p02937/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02937/Lua/s649314184.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s649314184", "user_id": "u120582723"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "local mfl = math.floor\n\nlocal function comp(a, b)\n return a < b\nend\n\nlocal function lower_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if not comp(ary[1], x) then return 1 end\n if comp(ary[num], x) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if comp(ary[mid], x) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\nlocal function upper_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if comp(x, ary[1]) then return 1 end\n if not comp(x, ary[num]) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if not comp(x, ary[mid]) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal s = io.read()\nlocal t = io.read()\nlocal n = #s\nlocal m = #t\nlocal s_tbl = {}\nlocal sstr = \"\"\nfor i = 1, n do\n sstr = s:sub(i, i)\n if not s_tbl[sstr] then s_tbl[sstr] = {} end\n table.insert(s_tbl[sstr], i)\nend\n\nlocal curpos = 0\nlocal loop = 0\nlocal isok = true\nfor i = 1, m do\n sstr = t:sub(i, i)\n if not s_tbl[sstr] then\n isok = false\n break\n else\n local bnd = upper_bound(s_tbl[sstr], curpos)\n if #s_tbl[sstr] < bnd then\n loop = loop + 1\n curpos= s_tbl[sstr][1]\n else\n curpos = s_tbl[sstr][bnd]\n end\n end\nend\n\nif isok then\nprint(loop * n + curpos)\nelse\n print(-1)\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven are two strings s and t consisting of lowercase English letters. Determine if there exists an integer i satisfying the following condition, and find the minimum such i if it exists.\n\nLet s' be the concatenation of 10^{100} copies of s. t is a subsequence of the string {s'}_1{s'}_2\\ldots{s'}_i (the first i characters in s').\n\nNotes\n\nA subsequence of a string a is a string obtained by deleting zero or more characters from a and concatenating the remaining characters without changing the relative order. For example, the subsequences of contest include net, c, and contest.\n\nConstraints\n\n1 \\leq |s| \\leq 10^5\n\n1 \\leq |t| \\leq 10^5\n\ns and t consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nIf there exists an integer i satisfying the following condition, print the minimum such i; otherwise, print -1.\n\nSample Input 1\n\ncontest\nson\n\nSample Output 1\n\n10\n\nt = son is a subsequence of the string contestcon (the first 10 characters in s' = contestcontestcontest...), so i = 10 satisfies the condition.\n\nOn the other hand, t is not a subsequence of the string contestco (the first 9 characters in s'), so i = 9 does not satisfy the condition.\n\nSimilarly, any integer less than 9 does not satisfy the condition, either. Thus, the minimum integer i satisfying the condition is 10.\n\nSample Input 2\n\ncontest\nprogramming\n\nSample Output 2\n\n-1\n\nt = programming is not a substring of s' = contestcontestcontest.... Thus, there is no integer i satisfying the condition.\n\nSample Input 3\n\ncontest\nsentence\n\nSample Output 3\n\n33\n\nNote that the answer may not fit into a 32-bit integer type, though we cannot put such a case here.", "sample_input": "contest\nson\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02937", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven are two strings s and t consisting of lowercase English letters. Determine if there exists an integer i satisfying the following condition, and find the minimum such i if it exists.\n\nLet s' be the concatenation of 10^{100} copies of s. t is a subsequence of the string {s'}_1{s'}_2\\ldots{s'}_i (the first i characters in s').\n\nNotes\n\nA subsequence of a string a is a string obtained by deleting zero or more characters from a and concatenating the remaining characters without changing the relative order. For example, the subsequences of contest include net, c, and contest.\n\nConstraints\n\n1 \\leq |s| \\leq 10^5\n\n1 \\leq |t| \\leq 10^5\n\ns and t consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nIf there exists an integer i satisfying the following condition, print the minimum such i; otherwise, print -1.\n\nSample Input 1\n\ncontest\nson\n\nSample Output 1\n\n10\n\nt = son is a subsequence of the string contestcon (the first 10 characters in s' = contestcontestcontest...), so i = 10 satisfies the condition.\n\nOn the other hand, t is not a subsequence of the string contestco (the first 9 characters in s'), so i = 9 does not satisfy the condition.\n\nSimilarly, any integer less than 9 does not satisfy the condition, either. Thus, the minimum integer i satisfying the condition is 10.\n\nSample Input 2\n\ncontest\nprogramming\n\nSample Output 2\n\n-1\n\nt = programming is not a substring of s' = contestcontestcontest.... Thus, there is no integer i satisfying the condition.\n\nSample Input 3\n\ncontest\nsentence\n\nSample Output 3\n\n33\n\nNote that the answer may not fit into a 32-bit integer type, though we cannot put such a case here.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1423, "cpu_time_ms": 51, "memory_kb": 1884}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s727829885", "group_id": "codeNet:p02939", "input_text": "s=io.read()\ncounter=0\nprevious=\"\"\ncurrent=\"\"\nfor i=1,#s do\n current=current..s:sub(i,i)\n if current~=previous then\n previous=current\n current=\"\"\n counter=counter+1\n end\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1587414655, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s727829885.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s727829885", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "s=io.read()\ncounter=0\nprevious=\"\"\ncurrent=\"\"\nfor i=1,#s do\n current=current..s:sub(i,i)\n if current~=previous then\n previous=current\n current=\"\"\n counter=counter+1\n end\nend\nprint(counter)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 217, "cpu_time_ms": 68, "memory_kb": 1264}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s432395301", "group_id": "codeNet:p02939", "input_text": "s=io.read()\ncounter=0\nprevious=\"\"\ncurrent=\"\"\nfor i=1,#s do\n current=current+s:sub(i,i)\n if current~=previous then\n previous=current\n current=\"\"\n counter=counter+1\n end\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1587414581, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s432395301.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s432395301", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "s=io.read()\ncounter=0\nprevious=\"\"\ncurrent=\"\"\nfor i=1,#s do\n current=current+s:sub(i,i)\n if current~=previous then\n previous=current\n current=\"\"\n counter=counter+1\n end\nend\nprint(counter)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 1264}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s966865761", "group_id": "codeNet:p02939", "input_text": "s=io.read()\ncounter=1\nfor i=2,#s do\n checker=true\n if s:sub(i-1,i-1)~=s:sub(i,i) then\n counter=counter+1\n elseif s:sub(i-1,i-1)==s:sub(i,i) then\n if i>=3 then\n counter=counter+0.5\n end\n end\nend\nprint(string.format(\"%d\",counter))", "language": "Lua", "metadata": {"date": 1587413489, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s966865761.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s966865761", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "s=io.read()\ncounter=1\nfor i=2,#s do\n checker=true\n if s:sub(i-1,i-1)~=s:sub(i,i) then\n counter=counter+1\n elseif s:sub(i-1,i-1)==s:sub(i,i) then\n if i>=3 then\n counter=counter+0.5\n end\n end\nend\nprint(string.format(\"%d\",counter))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 125, "memory_kb": 1392}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s900749324", "group_id": "codeNet:p02939", "input_text": "local function str2tbl(s)\n -- limit of #s is approximately 999959\n local t = {string.byte(s, 1, #s)}\n local char = string.char\n for i=1, #t do\n t[i] = char(t[i])\n end\n return t\nend\nlocal S = str2tbl(io.read(\"l\"))\nlocal function solve()\n if #S == 1 then\n return 1\n elseif #S == 2 then\n return S[1] == S[2] and 1 or 2\n end\n local function strategy1()\n local p = S[1]\n local count = 1\n local i = 2\n while i <= #S do\n if S[i] == p then\n if i + 1 <= #S then\n count = count + 1\n p = p .. S[i]\n i = i + 2\n else\n return count\n end\n else\n count = count + 1\n p = S[i]\n i = i + 1\n end\n end\n return count\n end\n return strategy1()\nend\nprint(solve())", "language": "Lua", "metadata": {"date": 1566139722, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s900749324.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s900749324", "user_id": "u162773977"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local function str2tbl(s)\n -- limit of #s is approximately 999959\n local t = {string.byte(s, 1, #s)}\n local char = string.char\n for i=1, #t do\n t[i] = char(t[i])\n end\n return t\nend\nlocal S = str2tbl(io.read(\"l\"))\nlocal function solve()\n if #S == 1 then\n return 1\n elseif #S == 2 then\n return S[1] == S[2] and 1 or 2\n end\n local function strategy1()\n local p = S[1]\n local count = 1\n local i = 2\n while i <= #S do\n if S[i] == p then\n if i + 1 <= #S then\n count = count + 1\n p = p .. S[i]\n i = i + 2\n else\n return count\n end\n else\n count = count + 1\n p = S[i]\n i = i + 1\n end\n end\n return count\n end\n return strategy1()\nend\nprint(solve())", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 934, "cpu_time_ms": 48, "memory_kb": 7468}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s746290192", "group_id": "codeNet:p02945", "input_text": "a,b=io.read(\"*n\",\"*n\")\nprint(math.max(a+b,a-b,a*b))", "language": "Lua", "metadata": {"date": 1587256250, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02945.html", "problem_id": "p02945", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02945/input.txt", "sample_output_relpath": "derived/input_output/data/p02945/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02945/Lua/s746290192.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s746290192", "user_id": "u045238009"}, "prompt_components": {"gold_output": "-10\n", "input_to_evaluate": "a,b=io.read(\"*n\",\"*n\")\nprint(math.max(a+b,a-b,a*b))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have two integers: A and B.\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nConstraints\n\nAll values in input are integers.\n\n-100 \\leq A,\\ B \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nSample Input 1\n\n-13 3\n\nSample Output 1\n\n-10\n\nThe largest number among A + B = -10, A - B = -16, and A \\times B = -39 is -10.\n\nSample Input 2\n\n1 -33\n\nSample Output 2\n\n34\n\nThe largest number among A + B = -32, A - B = 34, and A \\times B = -33 is 34.\n\nSample Input 3\n\n13 3\n\nSample Output 3\n\n39\n\nThe largest number among A + B = 16, A - B = 10, and A \\times B = 39 is 39.", "sample_input": "-13 3\n"}, "reference_outputs": ["-10\n"], "source_document_id": "p02945", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have two integers: A and B.\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nConstraints\n\nAll values in input are integers.\n\n-100 \\leq A,\\ B \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nSample Input 1\n\n-13 3\n\nSample Output 1\n\n-10\n\nThe largest number among A + B = -10, A - B = -16, and A \\times B = -39 is -10.\n\nSample Input 2\n\n1 -33\n\nSample Output 2\n\n34\n\nThe largest number among A + B = -32, A - B = 34, and A \\times B = -33 is 34.\n\nSample Input 3\n\n13 3\n\nSample Output 3\n\n39\n\nThe largest number among A + B = 16, A - B = 10, and A \\times B = 39 is 39.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s350116419", "group_id": "codeNet:p02945", "input_text": "a,b=io.read(\"*n\",\"*n\")\nprint(math.max(a+b,a-b,a*b))", "language": "Lua", "metadata": {"date": 1579314177, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02945.html", "problem_id": "p02945", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02945/input.txt", "sample_output_relpath": "derived/input_output/data/p02945/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02945/Lua/s350116419.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s350116419", "user_id": "u720483676"}, "prompt_components": {"gold_output": "-10\n", "input_to_evaluate": "a,b=io.read(\"*n\",\"*n\")\nprint(math.max(a+b,a-b,a*b))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have two integers: A and B.\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nConstraints\n\nAll values in input are integers.\n\n-100 \\leq A,\\ B \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nSample Input 1\n\n-13 3\n\nSample Output 1\n\n-10\n\nThe largest number among A + B = -10, A - B = -16, and A \\times B = -39 is -10.\n\nSample Input 2\n\n1 -33\n\nSample Output 2\n\n34\n\nThe largest number among A + B = -32, A - B = 34, and A \\times B = -33 is 34.\n\nSample Input 3\n\n13 3\n\nSample Output 3\n\n39\n\nThe largest number among A + B = 16, A - B = 10, and A \\times B = 39 is 39.", "sample_input": "-13 3\n"}, "reference_outputs": ["-10\n"], "source_document_id": "p02945", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have two integers: A and B.\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nConstraints\n\nAll values in input are integers.\n\n-100 \\leq A,\\ B \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nSample Input 1\n\n-13 3\n\nSample Output 1\n\n-10\n\nThe largest number among A + B = -10, A - B = -16, and A \\times B = -39 is -10.\n\nSample Input 2\n\n1 -33\n\nSample Output 2\n\n34\n\nThe largest number among A + B = -32, A - B = 34, and A \\times B = -33 is 34.\n\nSample Input 3\n\n13 3\n\nSample Output 3\n\n39\n\nThe largest number among A + B = 16, A - B = 10, and A \\times B = 39 is 39.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s007576924", "group_id": "codeNet:p02945", "input_text": "a,b=io.read(\"*n\",\"*n\")\nprint(math.max(a+b,a-b,a*b))", "language": "Lua", "metadata": {"date": 1576477774, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02945.html", "problem_id": "p02945", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02945/input.txt", "sample_output_relpath": "derived/input_output/data/p02945/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02945/Lua/s007576924.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s007576924", "user_id": "u373958718"}, "prompt_components": {"gold_output": "-10\n", "input_to_evaluate": "a,b=io.read(\"*n\",\"*n\")\nprint(math.max(a+b,a-b,a*b))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have two integers: A and B.\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nConstraints\n\nAll values in input are integers.\n\n-100 \\leq A,\\ B \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nSample Input 1\n\n-13 3\n\nSample Output 1\n\n-10\n\nThe largest number among A + B = -10, A - B = -16, and A \\times B = -39 is -10.\n\nSample Input 2\n\n1 -33\n\nSample Output 2\n\n34\n\nThe largest number among A + B = -32, A - B = 34, and A \\times B = -33 is 34.\n\nSample Input 3\n\n13 3\n\nSample Output 3\n\n39\n\nThe largest number among A + B = 16, A - B = 10, and A \\times B = 39 is 39.", "sample_input": "-13 3\n"}, "reference_outputs": ["-10\n"], "source_document_id": "p02945", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have two integers: A and B.\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nConstraints\n\nAll values in input are integers.\n\n-100 \\leq A,\\ B \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nSample Input 1\n\n-13 3\n\nSample Output 1\n\n-10\n\nThe largest number among A + B = -10, A - B = -16, and A \\times B = -39 is -10.\n\nSample Input 2\n\n1 -33\n\nSample Output 2\n\n34\n\nThe largest number among A + B = -32, A - B = 34, and A \\times B = -33 is 34.\n\nSample Input 3\n\n13 3\n\nSample Output 3\n\n39\n\nThe largest number among A + B = 16, A - B = 10, and A \\times B = 39 is 39.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s717045504", "group_id": "codeNet:p02946", "input_text": "local K, X = io.read(\"n\", \"n\")\nlocal left = math.max(-1000000, X-K+1)\nlocal right = math.min(1000000, X+K-1)\nlocal ans = {}\nfor i=left,right do\n table.insert(ans, i)\nend\nprint(table.concat(ans, ' '))", "language": "Lua", "metadata": {"date": 1565485539, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s717045504.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s717045504", "user_id": "u162773977"}, "prompt_components": {"gold_output": "5 6 7 8 9\n", "input_to_evaluate": "local K, X = io.read(\"n\", \"n\")\nlocal left = math.max(-1000000, X-K+1)\nlocal right = math.min(1000000, X+K-1)\nlocal ans = {}\nfor i=left,right do\n table.insert(ans, i)\nend\nprint(table.concat(ans, ' '))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 10, "memory_kb": 1008}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s830783630", "group_id": "codeNet:p02947", "input_text": "local function str2tbl(s)\n -- limit of #s is approximately 999959\n local t = {string.byte(s, 1, #s)}\n local char = string.char\n for i=1, #t do\n t[i] = char(t[i])\n end\n return t\nend\n\nlocal function factorial(n)\n local a = 1\n for i=1, n do\n a = a * i\n end\n return a\nend\n\nlocal function nCr(n, r)\n if r > n then\n return 0\n end\n return factorial(n) // factorial(r) // factorial(n - r)\nend\n---\nlocal N, _ = io.read(\"n\", \"l\")\nlocal sorted_dic = {}\nfor i=1,N do\n local s = io.read(\"l\")\n local s_tbl = str2tbl(s)\n table.sort(s_tbl)\n local s_sorted = table.concat(s_tbl, \"\")\n --print(s_sorted)\n sorted_dic[s_sorted] = (sorted_dic[s_sorted] or 0) + 1\nend\nlocal ans = 0\nfor k,v in pairs(sorted_dic) do\n --print(k,v,factorial(v),factorial(2), factorial(v - 2), nCr(v, 2))\n ans = ans + nCr(v, 2)\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1565486213, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s830783630.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s830783630", "user_id": "u162773977"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local function str2tbl(s)\n -- limit of #s is approximately 999959\n local t = {string.byte(s, 1, #s)}\n local char = string.char\n for i=1, #t do\n t[i] = char(t[i])\n end\n return t\nend\n\nlocal function factorial(n)\n local a = 1\n for i=1, n do\n a = a * i\n end\n return a\nend\n\nlocal function nCr(n, r)\n if r > n then\n return 0\n end\n return factorial(n) // factorial(r) // factorial(n - r)\nend\n---\nlocal N, _ = io.read(\"n\", \"l\")\nlocal sorted_dic = {}\nfor i=1,N do\n local s = io.read(\"l\")\n local s_tbl = str2tbl(s)\n table.sort(s_tbl)\n local s_sorted = table.concat(s_tbl, \"\")\n --print(s_sorted)\n sorted_dic[s_sorted] = (sorted_dic[s_sorted] or 0) + 1\nend\nlocal ans = 0\nfor k,v in pairs(sorted_dic) do\n --print(k,v,factorial(v),factorial(2), factorial(v - 2), nCr(v, 2))\n ans = ans + nCr(v, 2)\nend\nprint(ans)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 569, "memory_kb": 21860}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s287591588", "group_id": "codeNet:p02948", "input_text": "local num, day = string.match(io.read(), \"(%d+) (%d+)\")\nnum, day = tonumber(num), tonumber(day)\nlocal input = {}\nfor i = 1, num do\n local a, b = string.match(io.read(), \"(%d+) (%d+)\")\n table.insert(input, {\n\tday = tonumber(a),\n result = tonumber(b)\n })\nend\n\ntable.sort(input, function (a, b)\n if a.result == b.result then\n return a.day >= b.day\n else\n return a.result >= b.result\n end\n end)\n\nlocal sum = 0\nfor i = 1, #input do\n if day >= input[i].day then\n sum = sum + input[i].result\n day = day - 1\n end\nend\nprint(sum)", "language": "Lua", "metadata": {"date": 1565488833, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s287591588.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s287591588", "user_id": "u061001716"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local num, day = string.match(io.read(), \"(%d+) (%d+)\")\nnum, day = tonumber(num), tonumber(day)\nlocal input = {}\nfor i = 1, num do\n local a, b = string.match(io.read(), \"(%d+) (%d+)\")\n table.insert(input, {\n\tday = tonumber(a),\n result = tonumber(b)\n })\nend\n\ntable.sort(input, function (a, b)\n if a.result == b.result then\n return a.day >= b.day\n else\n return a.result >= b.result\n end\n end)\n\nlocal sum = 0\nfor i = 1, #input do\n if day >= input[i].day then\n sum = sum + input[i].result\n day = day - 1\n end\nend\nprint(sum)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 553, "cpu_time_ms": 193, "memory_kb": 22712}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s247841034", "group_id": "codeNet:p02948", "input_text": "-- heap\nlocal Heap = {}\nfunction Heap.new(upper_func)\n local self = setmetatable({}, {__index = Heap})\n self.a = {}\n self.upper_func = upper_func\n self.upper = function(k1, k2)\n assert(k1 < k2)\n if k1 == 0 then\n return false\n else\n return upper_func(self.a[k1], self.a[k2])\n end\n end\n self.lower = function(k1, k2)\n return not self.upper(k1, k2)\n end\n return self\nend\n\nfunction Heap:count()\n return #self.a\nend\n\nfunction Heap:_swap(k1, k2)\n local old_k1 = self.a[k1]\n self.a[k1] = self.a[k2]\n self.a[k2] = old_k1\nend\n\nfunction Heap:upheap(newk)\n local ku = newk // 2\n local k = newk\n while ku > 0 and self.lower(ku, k) do\n self:_swap(ku, k)\n k = k//2\n ku = ku//2\n end\nend\n\nfunction Heap:insertq(e)\n table.insert(self.a, e)\n self:upheap(#self.a)\nend\n\nfunction Heap:downheap(newk)\n local k = newk\n while k <= #self.a//2 do\n local kdl = k*2\n local kdr = kdl + 1\n local kd\n if kdr <= #self.a and self.lower(kdl, kdr) then\n kd = kdr\n else\n kd = kdl\n end\n if self.upper(k, kd) then\n break\n end\n self:_swap(k, kd)\n k = kd\n end\nend\n\nfunction Heap:top()\n assert(#self.a >= 1)\n return self.a[1]\nend\n\nfunction Heap:remove_top()\n assert(#self.a >= 1)\n local v = self.a[1]\n self:_swap(1, #self.a)\n table.remove(self.a)\n self:downheap(1)\n return v\nend\n\n----\nlocal N, M = io.read(\"n\", \"n\")\nlocal jobs_of_a = {}\nfor i=1, 100000 do\n jobs_of_a[i] = {}\nend\nfor i=1, N do\n local a, b = io.read(\"n\", \"n\")\n table.insert(jobs_of_a[a], b)\nend\nlocal q = Heap.new(function (v1, v2)\n return v1 > v2\nend)\nlocal ans = 0\nfor a=1,M do\n local day = M + 1 - a\n assert(day >= 1)\n for k,v in ipairs(jobs_of_a[a]) do\n q:insertq(v)\n end\n if q:count() > 0 then\n local job = q:remove_top()\n ans = ans + job\n end\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1565488391, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s247841034.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s247841034", "user_id": "u162773977"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "-- heap\nlocal Heap = {}\nfunction Heap.new(upper_func)\n local self = setmetatable({}, {__index = Heap})\n self.a = {}\n self.upper_func = upper_func\n self.upper = function(k1, k2)\n assert(k1 < k2)\n if k1 == 0 then\n return false\n else\n return upper_func(self.a[k1], self.a[k2])\n end\n end\n self.lower = function(k1, k2)\n return not self.upper(k1, k2)\n end\n return self\nend\n\nfunction Heap:count()\n return #self.a\nend\n\nfunction Heap:_swap(k1, k2)\n local old_k1 = self.a[k1]\n self.a[k1] = self.a[k2]\n self.a[k2] = old_k1\nend\n\nfunction Heap:upheap(newk)\n local ku = newk // 2\n local k = newk\n while ku > 0 and self.lower(ku, k) do\n self:_swap(ku, k)\n k = k//2\n ku = ku//2\n end\nend\n\nfunction Heap:insertq(e)\n table.insert(self.a, e)\n self:upheap(#self.a)\nend\n\nfunction Heap:downheap(newk)\n local k = newk\n while k <= #self.a//2 do\n local kdl = k*2\n local kdr = kdl + 1\n local kd\n if kdr <= #self.a and self.lower(kdl, kdr) then\n kd = kdr\n else\n kd = kdl\n end\n if self.upper(k, kd) then\n break\n end\n self:_swap(k, kd)\n k = kd\n end\nend\n\nfunction Heap:top()\n assert(#self.a >= 1)\n return self.a[1]\nend\n\nfunction Heap:remove_top()\n assert(#self.a >= 1)\n local v = self.a[1]\n self:_swap(1, #self.a)\n table.remove(self.a)\n self:downheap(1)\n return v\nend\n\n----\nlocal N, M = io.read(\"n\", \"n\")\nlocal jobs_of_a = {}\nfor i=1, 100000 do\n jobs_of_a[i] = {}\nend\nfor i=1, N do\n local a, b = io.read(\"n\", \"n\")\n table.insert(jobs_of_a[a], b)\nend\nlocal q = Heap.new(function (v1, v2)\n return v1 > v2\nend)\nlocal ans = 0\nfor a=1,M do\n local day = M + 1 - a\n assert(day >= 1)\n for k,v in ipairs(jobs_of_a[a]) do\n q:insertq(v)\n end\n if q:count() > 0 then\n local job = q:remove_top()\n ans = ans + job\n end\nend\nprint(ans)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2006, "cpu_time_ms": 2083, "memory_kb": 15928}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s169626779", "group_id": "codeNet:p02948", "input_text": "local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max\n\nlocal function comp(a, b)\n return a < b\nend\n\nlocal function upper_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if comp(x, ary[1]) then return 1 end\n if not comp(x, ary[num]) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if not comp(x, ary[mid]) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, ary, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < #ary do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n for i = 1, #ary do self.stage[stagenum][i] = ary[i] end\n for i = #ary + 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mmi(r, mce((l - 1) / sz) * sz)\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)\n l = newr + 1\n end\n if sz <= r + 1 - l then\n ret = self.func(ret, self.stage[stage][mce(l / sz)])\n l = l + sz\n end\n if l <= r then\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n end\n end\n return ret\nend\nSegTree.setValue = function(self, idx, value, silent)\n self.stage[self.stagenum][idx] = value\n if not silent then\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n end\nend\nSegTree.new = function(ary, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(ary, func, emptyvalue)\n return obj\nend\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n local a, b = io.read(\"*n\", \"*n\")\n t[i] = {a, b}\nend\ntable.sort(t, function(x, y) return x[1] < y[1] end)\nlocal alist = {}\nfor i = 1, n do\n alist[i] = t[i][1]\nend\nlocal treeary = {}\nfor i = 1, n do\n treeary[i] = {i, t[i][2]}\nend\n\nlocal tree = SegTree.new(treeary, function(x, y)\n if x[2] == y[2] then\n if x[1] < y[1] then\n return y\n else\n return x\n end\n elseif x[2] < y[2] then\n return y\n else\n return x\n end\nend, {0, 0})\n\nlocal ret = 0\nfor i = m, 1, -1 do\n local ub = upper_bound(alist, i)\n if 1 < ub then\n local r = tree:getRange(1, ub - 1)\n local idx, val = r[1], r[2]\n tree:setValue(idx, {idx, 0})\n ret = ret + val\n end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1565487884, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s169626779.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s169626779", "user_id": "u120582723"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max\n\nlocal function comp(a, b)\n return a < b\nend\n\nlocal function upper_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if comp(x, ary[1]) then return 1 end\n if not comp(x, ary[num]) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if not comp(x, ary[mid]) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, ary, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < #ary do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n for i = 1, #ary do self.stage[stagenum][i] = ary[i] end\n for i = #ary + 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mmi(r, mce((l - 1) / sz) * sz)\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)\n l = newr + 1\n end\n if sz <= r + 1 - l then\n ret = self.func(ret, self.stage[stage][mce(l / sz)])\n l = l + sz\n end\n if l <= r then\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n end\n end\n return ret\nend\nSegTree.setValue = function(self, idx, value, silent)\n self.stage[self.stagenum][idx] = value\n if not silent then\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n end\nend\nSegTree.new = function(ary, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(ary, func, emptyvalue)\n return obj\nend\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n local a, b = io.read(\"*n\", \"*n\")\n t[i] = {a, b}\nend\ntable.sort(t, function(x, y) return x[1] < y[1] end)\nlocal alist = {}\nfor i = 1, n do\n alist[i] = t[i][1]\nend\nlocal treeary = {}\nfor i = 1, n do\n treeary[i] = {i, t[i][2]}\nend\n\nlocal tree = SegTree.new(treeary, function(x, y)\n if x[2] == y[2] then\n if x[1] < y[1] then\n return y\n else\n return x\n end\n elseif x[2] < y[2] then\n return y\n else\n return x\n end\nend, {0, 0})\n\nlocal ret = 0\nfor i = m, 1, -1 do\n local ub = upper_bound(alist, i)\n if 1 < ub then\n local r = tree:getRange(1, ub - 1)\n local idx, val = r[1], r[2]\n tree:setValue(idx, {idx, 0})\n ret = ret + val\n end\nend\nprint(ret)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3426, "cpu_time_ms": 435, "memory_kb": 35948}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s870901314", "group_id": "codeNet:p02950", "input_text": "local mfl, mce = math.floor, math.ceil\nlocal p = io.read(\"*n\")\nlocal function badd(x, y) return (x + y) % p end\nlocal function bmul(x, y) return (x * y) % p end\n\nlocal a = {}\nfor i = 1, p do\n a[i] = io.read(\"*n\")\nend\nlocal poldst = {}\nfor i = 1, p do\n poldst[i] = 0\nend\n\nlocal fact = {1}\nlocal invs = {1}\nlocal invfact = {1}\nfor i = 2, p - 1 do\n fact[i] = bmul(fact[i - 1], i)\n invs[i] = bmul(mfl(p / i), p - invs[p % i])\n invfact[i] = bmul(invfact[i - 1], invs[i])\nend\n\nfor i = 0, p - 1 do\n local v = a[i + 1]\n if 0 < i then\n v = bmul(v, invfact[i])\n end\n if i < p - 1 then\n v = bmul(v, invfact[p - 1 - i])\n if (p - 1 - i) % 2 == 1 then\n v = (p - v) % p\n end\n end\n local pol = {}\n pol[1] = 1\n for j = 2, p do pol[j] = 0 end\n for j = 0, p - 1 do\n if i ~= j then\n for k = p, 1, -1 do\n if 1 < k then\n pol[k] = badd(pol[k - 1], bmul(pol[k], p - j))\n else\n pol[1] = bmul(pol[1], p - j)\n end\n end\n end\n end\n for j = 1, p do\n poldst[j] = badd(poldst[j], bmul(v, pol[j]))\n end\nend\nprint(table.concat(poldst, \" \"))\n", "language": "Lua", "metadata": {"date": 1586489952, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02950.html", "problem_id": "p02950", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02950/input.txt", "sample_output_relpath": "derived/input_output/data/p02950/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02950/Lua/s870901314.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s870901314", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1 1\n", "input_to_evaluate": "local mfl, mce = math.floor, math.ceil\nlocal p = io.read(\"*n\")\nlocal function badd(x, y) return (x + y) % p end\nlocal function bmul(x, y) return (x * y) % p end\n\nlocal a = {}\nfor i = 1, p do\n a[i] = io.read(\"*n\")\nend\nlocal poldst = {}\nfor i = 1, p do\n poldst[i] = 0\nend\n\nlocal fact = {1}\nlocal invs = {1}\nlocal invfact = {1}\nfor i = 2, p - 1 do\n fact[i] = bmul(fact[i - 1], i)\n invs[i] = bmul(mfl(p / i), p - invs[p % i])\n invfact[i] = bmul(invfact[i - 1], invs[i])\nend\n\nfor i = 0, p - 1 do\n local v = a[i + 1]\n if 0 < i then\n v = bmul(v, invfact[i])\n end\n if i < p - 1 then\n v = bmul(v, invfact[p - 1 - i])\n if (p - 1 - i) % 2 == 1 then\n v = (p - v) % p\n end\n end\n local pol = {}\n pol[1] = 1\n for j = 2, p do pol[j] = 0 end\n for j = 0, p - 1 do\n if i ~= j then\n for k = p, 1, -1 do\n if 1 < k then\n pol[k] = badd(pol[k - 1], bmul(pol[k], p - j))\n else\n pol[1] = bmul(pol[1], p - j)\n end\n end\n end\n end\n for j = 1, p do\n poldst[j] = badd(poldst[j], bmul(v, pol[j]))\n end\nend\nprint(table.concat(poldst, \" \"))\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven are a prime number p and a sequence of p integers a_0, \\ldots, a_{p-1} consisting of zeros and ones.\n\nFind a polynomial of degree at most p-1, f(x) = b_{p-1} x^{p-1} + b_{p-2} x^{p-2} + \\ldots + b_0, satisfying the following conditions:\n\nFor each i (0 \\leq i \\leq p-1), b_i is an integer such that 0 \\leq b_i \\leq p-1.\n\nFor each i (0 \\leq i \\leq p-1), f(i) \\equiv a_i \\pmod p.\n\nConstraints\n\n2 \\leq p \\leq 2999\n\np is a prime number.\n\n0 \\leq a_i \\leq 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\np\na_0 a_1 \\ldots a_{p-1}\n\nOutput\n\nPrint b_0, b_1, \\ldots, b_{p-1} of a polynomial f(x) satisfying the conditions, in this order, with spaces in between.\n\nIt can be proved that a solution always exists. If multiple solutions exist, any of them will be accepted.\n\nSample Input 1\n\n2\n1 0\n\nSample Output 1\n\n1 1\n\nf(x) = x + 1 satisfies the conditions, as follows:\n\nf(0) = 0 + 1 = 1 \\equiv 1 \\pmod 2\n\nf(1) = 1 + 1 = 2 \\equiv 0 \\pmod 2\n\nSample Input 2\n\n3\n0 0 0\n\nSample Output 2\n\n0 0 0\n\nf(x) = 0 is also valid.\n\nSample Input 3\n\n5\n0 1 0 1 0\n\nSample Output 3\n\n0 2 0 1 3", "sample_input": "2\n1 0\n"}, "reference_outputs": ["1 1\n"], "source_document_id": "p02950", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven are a prime number p and a sequence of p integers a_0, \\ldots, a_{p-1} consisting of zeros and ones.\n\nFind a polynomial of degree at most p-1, f(x) = b_{p-1} x^{p-1} + b_{p-2} x^{p-2} + \\ldots + b_0, satisfying the following conditions:\n\nFor each i (0 \\leq i \\leq p-1), b_i is an integer such that 0 \\leq b_i \\leq p-1.\n\nFor each i (0 \\leq i \\leq p-1), f(i) \\equiv a_i \\pmod p.\n\nConstraints\n\n2 \\leq p \\leq 2999\n\np is a prime number.\n\n0 \\leq a_i \\leq 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\np\na_0 a_1 \\ldots a_{p-1}\n\nOutput\n\nPrint b_0, b_1, \\ldots, b_{p-1} of a polynomial f(x) satisfying the conditions, in this order, with spaces in between.\n\nIt can be proved that a solution always exists. If multiple solutions exist, any of them will be accepted.\n\nSample Input 1\n\n2\n1 0\n\nSample Output 1\n\n1 1\n\nf(x) = x + 1 satisfies the conditions, as follows:\n\nf(0) = 0 + 1 = 1 \\equiv 1 \\pmod 2\n\nf(1) = 1 + 1 = 2 \\equiv 0 \\pmod 2\n\nSample Input 2\n\n3\n0 0 0\n\nSample Output 2\n\n0 0 0\n\nf(x) = 0 is also valid.\n\nSample Input 3\n\n5\n0 1 0 1 0\n\nSample Output 3\n\n0 2 0 1 3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1099, "cpu_time_ms": 2107, "memory_kb": 1152}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s452181382", "group_id": "codeNet:p02951", "input_text": "n=io.read(\"*n\")\nif c-(a-b)>=0 then\n print(c-(a-b))\nelse\n print(0)\nend", "language": "Lua", "metadata": {"date": 1587320872, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02951.html", "problem_id": "p02951", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02951/input.txt", "sample_output_relpath": "derived/input_output/data/p02951/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02951/Lua/s452181382.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s452181382", "user_id": "u045238009"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "n=io.read(\"*n\")\nif c-(a-b)>=0 then\n print(c-(a-b))\nelse\n print(0)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have two bottles for holding water.\n\nBottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.\n\nBottle 2 contains C milliliters of water.\n\nWe will transfer water from Bottle 2 to Bottle 1 as much as possible.\n\nHow much amount of water will remain in Bottle 2?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq B \\leq A \\leq 20\n\n1 \\leq C \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the integer representing the amount of water, in milliliters, that will remain in Bottle 2.\n\nSample Input 1\n\n6 4 3\n\nSample Output 1\n\n1\n\nWe will transfer two milliliters of water from Bottle 2 to Bottle 1, and one milliliter of water will remain in Bottle 2.\n\nSample Input 2\n\n8 3 9\n\nSample Output 2\n\n4\n\nSample Input 3\n\n12 3 7\n\nSample Output 3\n\n0", "sample_input": "6 4 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02951", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have two bottles for holding water.\n\nBottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.\n\nBottle 2 contains C milliliters of water.\n\nWe will transfer water from Bottle 2 to Bottle 1 as much as possible.\n\nHow much amount of water will remain in Bottle 2?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq B \\leq A \\leq 20\n\n1 \\leq C \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the integer representing the amount of water, in milliliters, that will remain in Bottle 2.\n\nSample Input 1\n\n6 4 3\n\nSample Output 1\n\n1\n\nWe will transfer two milliliters of water from Bottle 2 to Bottle 1, and one milliliter of water will remain in Bottle 2.\n\nSample Input 2\n\n8 3 9\n\nSample Output 2\n\n4\n\nSample Input 3\n\n12 3 7\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 75, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s250005978", "group_id": "codeNet:p02951", "input_text": "a=io.read(\"*n\")\nb=io.read(\"*n\")\nc=io.read(\"*n\")\n\nans=c-(a-b)\nif ans < 0 then\n print(\"0\")\nelse\n print(ans)\nend", "language": "Lua", "metadata": {"date": 1568553737, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02951.html", "problem_id": "p02951", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02951/input.txt", "sample_output_relpath": "derived/input_output/data/p02951/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02951/Lua/s250005978.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s250005978", "user_id": "u535423069"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "a=io.read(\"*n\")\nb=io.read(\"*n\")\nc=io.read(\"*n\")\n\nans=c-(a-b)\nif ans < 0 then\n print(\"0\")\nelse\n print(ans)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have two bottles for holding water.\n\nBottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.\n\nBottle 2 contains C milliliters of water.\n\nWe will transfer water from Bottle 2 to Bottle 1 as much as possible.\n\nHow much amount of water will remain in Bottle 2?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq B \\leq A \\leq 20\n\n1 \\leq C \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the integer representing the amount of water, in milliliters, that will remain in Bottle 2.\n\nSample Input 1\n\n6 4 3\n\nSample Output 1\n\n1\n\nWe will transfer two milliliters of water from Bottle 2 to Bottle 1, and one milliliter of water will remain in Bottle 2.\n\nSample Input 2\n\n8 3 9\n\nSample Output 2\n\n4\n\nSample Input 3\n\n12 3 7\n\nSample Output 3\n\n0", "sample_input": "6 4 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02951", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have two bottles for holding water.\n\nBottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.\n\nBottle 2 contains C milliliters of water.\n\nWe will transfer water from Bottle 2 to Bottle 1 as much as possible.\n\nHow much amount of water will remain in Bottle 2?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq B \\leq A \\leq 20\n\n1 \\leq C \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the integer representing the amount of water, in milliliters, that will remain in Bottle 2.\n\nSample Input 1\n\n6 4 3\n\nSample Output 1\n\n1\n\nWe will transfer two milliliters of water from Bottle 2 to Bottle 1, and one milliliter of water will remain in Bottle 2.\n\nSample Input 2\n\n8 3 9\n\nSample Output 2\n\n4\n\nSample Input 3\n\n12 3 7\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 111, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s646200659", "group_id": "codeNet:p02954", "input_text": "local insert = table.insert\n\nlocal s = io.read()\nlocal n = s:len()\n\nlocal s_byte_t = {}\nfor i = 1, n do\n\ts_byte_t[i] = s:byte(i);\nend\n\nlocal L, R = string.byte(\"LR\", 1, 2)\n-- 例の場所に入ったとき偶数回目の移動だったならその場\n\nlocal next_different_t = {}\nlocal current = R\nfor i = 1, n do\n\tif s_byte_t[i] ~= current then\n\t\tinsert(next_different_t, i - 1)\n\t\tif current == R then\n\t\t\tcurrent = L\n\t\telse\n\t\t\tcurrent = R\n\t\tend\n\tend\nend\n\nlocal ans_t = {}\nfor i = 1, n do\n\tans_t[i] = 0\nend\n\nlocal next_different_t_len = #next_different_t\ncurrent = R\nfor i = 1, next_different_t_len + 1 do\n\tlocal front = (i ~= next_different_t_len + 1) and next_different_t[i] or n\n\tlocal front_before = (i - 1 ~= 0) and next_different_t[i - 1] or 0\n\n\tif current == R then\n\t\tif current == R and (front - front_before) % 2 == 0 then\n\t\t\tans_t[front] = ans_t[front] \n\t\t\t\t+ (front - front_before) // 2\n\t\t\tans_t[front + 1] = ans_t[front + 1]\n\t\t\t\t+ (front - front_before) // 2\n\t\telse\n\t\t\tans_t[front] = ans_t[front]\n\t\t\t\t+ (front - front_before) // 2 + 1\n\t\t\tans_t[front + 1] = ans_t[front + 1]\n\t\t\t\t+ (front - front_before) // 2\n\t\tend\n\t\tcurrent = L\n\telseif current == L then\n\t\tif (front - front_before) % 2 == 0 then\n\t\t\tans_t[front_before] = ans_t[front_before]\n\t\t\t\t+ (front - front_before) // 2\n\t\t\tans_t[front_before + 1] = ans_t[front_before + 1]\n\t\t\t\t+ (front - front_before) // 2\n\t\telse\n\t\t\tans_t[front_before] = ans_t[front_before]\n\t\t\t\t+ (front - front_before) // 2\n\t\t\tans_t[front_before + 1] = ans_t[front_before + 1]\n\t\t\t\t+ (front - front_before) // 2 + 1\n\t\tend\n\t\tcurrent = R\n\tend\nend\n\nprint(table.concat(ans_t, \" \"))\n", "language": "Lua", "metadata": {"date": 1598496713, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02954.html", "problem_id": "p02954", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02954/input.txt", "sample_output_relpath": "derived/input_output/data/p02954/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02954/Lua/s646200659.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s646200659", "user_id": "u793881115"}, "prompt_components": {"gold_output": "0 1 2 1 1\n", "input_to_evaluate": "local insert = table.insert\n\nlocal s = io.read()\nlocal n = s:len()\n\nlocal s_byte_t = {}\nfor i = 1, n do\n\ts_byte_t[i] = s:byte(i);\nend\n\nlocal L, R = string.byte(\"LR\", 1, 2)\n-- 例の場所に入ったとき偶数回目の移動だったならその場\n\nlocal next_different_t = {}\nlocal current = R\nfor i = 1, n do\n\tif s_byte_t[i] ~= current then\n\t\tinsert(next_different_t, i - 1)\n\t\tif current == R then\n\t\t\tcurrent = L\n\t\telse\n\t\t\tcurrent = R\n\t\tend\n\tend\nend\n\nlocal ans_t = {}\nfor i = 1, n do\n\tans_t[i] = 0\nend\n\nlocal next_different_t_len = #next_different_t\ncurrent = R\nfor i = 1, next_different_t_len + 1 do\n\tlocal front = (i ~= next_different_t_len + 1) and next_different_t[i] or n\n\tlocal front_before = (i - 1 ~= 0) and next_different_t[i - 1] or 0\n\n\tif current == R then\n\t\tif current == R and (front - front_before) % 2 == 0 then\n\t\t\tans_t[front] = ans_t[front] \n\t\t\t\t+ (front - front_before) // 2\n\t\t\tans_t[front + 1] = ans_t[front + 1]\n\t\t\t\t+ (front - front_before) // 2\n\t\telse\n\t\t\tans_t[front] = ans_t[front]\n\t\t\t\t+ (front - front_before) // 2 + 1\n\t\t\tans_t[front + 1] = ans_t[front + 1]\n\t\t\t\t+ (front - front_before) // 2\n\t\tend\n\t\tcurrent = L\n\telseif current == L then\n\t\tif (front - front_before) % 2 == 0 then\n\t\t\tans_t[front_before] = ans_t[front_before]\n\t\t\t\t+ (front - front_before) // 2\n\t\t\tans_t[front_before + 1] = ans_t[front_before + 1]\n\t\t\t\t+ (front - front_before) // 2\n\t\telse\n\t\t\tans_t[front_before] = ans_t[front_before]\n\t\t\t\t+ (front - front_before) // 2\n\t\t\tans_t[front_before + 1] = ans_t[front_before + 1]\n\t\t\t\t+ (front - front_before) // 2 + 1\n\t\tend\n\t\tcurrent = R\n\tend\nend\n\nprint(table.concat(ans_t, \" \"))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of L and R.\n\nLet N be the length of S. There are N squares arranged from left to right, and the i-th character of S from the left is written on the i-th square from the left.\n\nThe character written on the leftmost square is always R, and the character written on the rightmost square is always L.\n\nInitially, one child is standing on each square.\n\nEach child will perform the move below 10^{100} times:\n\nMove one square in the direction specified by the character written in the square on which the child is standing. L denotes left, and R denotes right.\n\nFind the number of children standing on each square after the children performed the moves.\n\nConstraints\n\nS is a string of length between 2 and 10^5 (inclusive).\n\nEach character of S is L or R.\n\nThe first and last characters of S are R and L, respectively.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of children standing on each square after the children performed the moves, in order from left to right.\n\nSample Input 1\n\nRRLRL\n\nSample Output 1\n\n0 1 2 1 1\n\nAfter each child performed one move, the number of children standing on each square is 0, 2, 1, 1, 1 from left to right.\n\nAfter each child performed two moves, the number of children standing on each square is 0, 1, 2, 1, 1 from left to right.\n\nAfter each child performed 10^{100} moves, the number of children standing on each square is 0, 1, 2, 1, 1 from left to right.\n\nSample Input 2\n\nRRLLLLRLRRLL\n\nSample Output 2\n\n0 3 3 0 0 0 1 1 0 2 2 0\n\nSample Input 3\n\nRRRLLRLLRRRLLLLL\n\nSample Output 3\n\n0 0 3 2 0 2 1 0 0 0 4 4 0 0 0 0", "sample_input": "RRLRL\n"}, "reference_outputs": ["0 1 2 1 1\n"], "source_document_id": "p02954", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of L and R.\n\nLet N be the length of S. There are N squares arranged from left to right, and the i-th character of S from the left is written on the i-th square from the left.\n\nThe character written on the leftmost square is always R, and the character written on the rightmost square is always L.\n\nInitially, one child is standing on each square.\n\nEach child will perform the move below 10^{100} times:\n\nMove one square in the direction specified by the character written in the square on which the child is standing. L denotes left, and R denotes right.\n\nFind the number of children standing on each square after the children performed the moves.\n\nConstraints\n\nS is a string of length between 2 and 10^5 (inclusive).\n\nEach character of S is L or R.\n\nThe first and last characters of S are R and L, respectively.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of children standing on each square after the children performed the moves, in order from left to right.\n\nSample Input 1\n\nRRLRL\n\nSample Output 1\n\n0 1 2 1 1\n\nAfter each child performed one move, the number of children standing on each square is 0, 2, 1, 1, 1 from left to right.\n\nAfter each child performed two moves, the number of children standing on each square is 0, 1, 2, 1, 1 from left to right.\n\nAfter each child performed 10^{100} moves, the number of children standing on each square is 0, 1, 2, 1, 1 from left to right.\n\nSample Input 2\n\nRRLLLLRLRRLL\n\nSample Output 2\n\n0 3 3 0 0 0 1 1 0 2 2 0\n\nSample Input 3\n\nRRRLLRLLRRRLLLLL\n\nSample Output 3\n\n0 0 3 2 0 2 1 0 0 0 4 4 0 0 0 0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1629, "cpu_time_ms": 73, "memory_kb": 8912}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s701822909", "group_id": "codeNet:p02954", "input_text": "S=io.read()\n\nfor s,l,m,r in S:gmatch\"(()R+()L+())\"do\nfor i=l,m-2 do\n\tprint(0)\nend\nln=m-l\nrn=r-m\nprint(math.ceil(ln*.5)+math.floor(rn*.5))\nprint(math.floor(ln*.5)+math.ceil(rn*.5))\nfor i=m+1,r-1 do\n\tprint(0)\nend\nend", "language": "Lua", "metadata": {"date": 1588430984, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02954.html", "problem_id": "p02954", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02954/input.txt", "sample_output_relpath": "derived/input_output/data/p02954/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02954/Lua/s701822909.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s701822909", "user_id": "u726173718"}, "prompt_components": {"gold_output": "0 1 2 1 1\n", "input_to_evaluate": "S=io.read()\n\nfor s,l,m,r in S:gmatch\"(()R+()L+())\"do\nfor i=l,m-2 do\n\tprint(0)\nend\nln=m-l\nrn=r-m\nprint(math.ceil(ln*.5)+math.floor(rn*.5))\nprint(math.floor(ln*.5)+math.ceil(rn*.5))\nfor i=m+1,r-1 do\n\tprint(0)\nend\nend", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of L and R.\n\nLet N be the length of S. There are N squares arranged from left to right, and the i-th character of S from the left is written on the i-th square from the left.\n\nThe character written on the leftmost square is always R, and the character written on the rightmost square is always L.\n\nInitially, one child is standing on each square.\n\nEach child will perform the move below 10^{100} times:\n\nMove one square in the direction specified by the character written in the square on which the child is standing. L denotes left, and R denotes right.\n\nFind the number of children standing on each square after the children performed the moves.\n\nConstraints\n\nS is a string of length between 2 and 10^5 (inclusive).\n\nEach character of S is L or R.\n\nThe first and last characters of S are R and L, respectively.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of children standing on each square after the children performed the moves, in order from left to right.\n\nSample Input 1\n\nRRLRL\n\nSample Output 1\n\n0 1 2 1 1\n\nAfter each child performed one move, the number of children standing on each square is 0, 2, 1, 1, 1 from left to right.\n\nAfter each child performed two moves, the number of children standing on each square is 0, 1, 2, 1, 1 from left to right.\n\nAfter each child performed 10^{100} moves, the number of children standing on each square is 0, 1, 2, 1, 1 from left to right.\n\nSample Input 2\n\nRRLLLLRLRRLL\n\nSample Output 2\n\n0 3 3 0 0 0 1 1 0 2 2 0\n\nSample Input 3\n\nRRRLLRLLRRRLLLLL\n\nSample Output 3\n\n0 0 3 2 0 2 1 0 0 0 4 4 0 0 0 0", "sample_input": "RRLRL\n"}, "reference_outputs": ["0 1 2 1 1\n"], "source_document_id": "p02954", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of L and R.\n\nLet N be the length of S. There are N squares arranged from left to right, and the i-th character of S from the left is written on the i-th square from the left.\n\nThe character written on the leftmost square is always R, and the character written on the rightmost square is always L.\n\nInitially, one child is standing on each square.\n\nEach child will perform the move below 10^{100} times:\n\nMove one square in the direction specified by the character written in the square on which the child is standing. L denotes left, and R denotes right.\n\nFind the number of children standing on each square after the children performed the moves.\n\nConstraints\n\nS is a string of length between 2 and 10^5 (inclusive).\n\nEach character of S is L or R.\n\nThe first and last characters of S are R and L, respectively.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of children standing on each square after the children performed the moves, in order from left to right.\n\nSample Input 1\n\nRRLRL\n\nSample Output 1\n\n0 1 2 1 1\n\nAfter each child performed one move, the number of children standing on each square is 0, 2, 1, 1, 1 from left to right.\n\nAfter each child performed two moves, the number of children standing on each square is 0, 1, 2, 1, 1 from left to right.\n\nAfter each child performed 10^{100} moves, the number of children standing on each square is 0, 1, 2, 1, 1 from left to right.\n\nSample Input 2\n\nRRLLLLRLRRLL\n\nSample Output 2\n\n0 3 3 0 0 0 1 1 0 2 2 0\n\nSample Input 3\n\nRRRLLRLLRRRLLLLL\n\nSample Output 3\n\n0 0 3 2 0 2 1 0 0 0 4 4 0 0 0 0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 214, "cpu_time_ms": 54, "memory_kb": 768}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s060315836", "group_id": "codeNet:p02954", "input_text": "local function str2tbl(s)\n -- limit of #s is approximately 999959\n local t = {string.byte(s, 1, #s)}\n local char = string.char\n for i=1, #t do\n t[i] = char(t[i])\n end\n return t\nend\n\n--\nlocal S = str2tbl(io.read(\"l\"))\nlocal N = #S\nassert(S[1] == 'R')\nassert(S[N] == 'L')\n\nlocal anstbl = {}\nfor i=1,N do\n anstbl[i] = 0\nend\n\nlocal function inc(i)\n anstbl[i] = anstbl[i] + 1\nend\n\nlocal dst = {}\nlocal nearest_left_R = 1\nfor i=2, N do\n if S[i] == 'R' then\n nearest_left_R = i\n else\n dst[i] = {'L', nearest_left_R}\n end\nend\n\nlocal nearest_right_L = N\nfor i=N-1, 1, -1 do\n if S[i] == 'L' then\n nearest_right_L = i\n else\n dst[i] = {'R', nearest_right_L}\n end\nend\n\nfor i=1, N do\n local lr, nearest_x = dst[i][1], dst[i][2]\n if lr == 'R' then\n local nearest_right_L = nearest_x\n if (nearest_right_L - i) % 2 == 0 then\n inc(nearest_right_L)\n else\n inc(nearest_right_L-1)\n end\n else\n -- lr == 'L'\n local nearest_left_R = nearest_x\n if (i - nearest_left_R ) % 2 == 0 then\n inc(nearest_left_R)\n else\n inc(nearest_left_R+1)\n end\n \n end\nend\n\nprint(table.concat(anstbl, ' '))\n", "language": "Lua", "metadata": {"date": 1565002756, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02954.html", "problem_id": "p02954", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02954/input.txt", "sample_output_relpath": "derived/input_output/data/p02954/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02954/Lua/s060315836.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s060315836", "user_id": "u162773977"}, "prompt_components": {"gold_output": "0 1 2 1 1\n", "input_to_evaluate": "local function str2tbl(s)\n -- limit of #s is approximately 999959\n local t = {string.byte(s, 1, #s)}\n local char = string.char\n for i=1, #t do\n t[i] = char(t[i])\n end\n return t\nend\n\n--\nlocal S = str2tbl(io.read(\"l\"))\nlocal N = #S\nassert(S[1] == 'R')\nassert(S[N] == 'L')\n\nlocal anstbl = {}\nfor i=1,N do\n anstbl[i] = 0\nend\n\nlocal function inc(i)\n anstbl[i] = anstbl[i] + 1\nend\n\nlocal dst = {}\nlocal nearest_left_R = 1\nfor i=2, N do\n if S[i] == 'R' then\n nearest_left_R = i\n else\n dst[i] = {'L', nearest_left_R}\n end\nend\n\nlocal nearest_right_L = N\nfor i=N-1, 1, -1 do\n if S[i] == 'L' then\n nearest_right_L = i\n else\n dst[i] = {'R', nearest_right_L}\n end\nend\n\nfor i=1, N do\n local lr, nearest_x = dst[i][1], dst[i][2]\n if lr == 'R' then\n local nearest_right_L = nearest_x\n if (nearest_right_L - i) % 2 == 0 then\n inc(nearest_right_L)\n else\n inc(nearest_right_L-1)\n end\n else\n -- lr == 'L'\n local nearest_left_R = nearest_x\n if (i - nearest_left_R ) % 2 == 0 then\n inc(nearest_left_R)\n else\n inc(nearest_left_R+1)\n end\n \n end\nend\n\nprint(table.concat(anstbl, ' '))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of L and R.\n\nLet N be the length of S. There are N squares arranged from left to right, and the i-th character of S from the left is written on the i-th square from the left.\n\nThe character written on the leftmost square is always R, and the character written on the rightmost square is always L.\n\nInitially, one child is standing on each square.\n\nEach child will perform the move below 10^{100} times:\n\nMove one square in the direction specified by the character written in the square on which the child is standing. L denotes left, and R denotes right.\n\nFind the number of children standing on each square after the children performed the moves.\n\nConstraints\n\nS is a string of length between 2 and 10^5 (inclusive).\n\nEach character of S is L or R.\n\nThe first and last characters of S are R and L, respectively.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of children standing on each square after the children performed the moves, in order from left to right.\n\nSample Input 1\n\nRRLRL\n\nSample Output 1\n\n0 1 2 1 1\n\nAfter each child performed one move, the number of children standing on each square is 0, 2, 1, 1, 1 from left to right.\n\nAfter each child performed two moves, the number of children standing on each square is 0, 1, 2, 1, 1 from left to right.\n\nAfter each child performed 10^{100} moves, the number of children standing on each square is 0, 1, 2, 1, 1 from left to right.\n\nSample Input 2\n\nRRLLLLRLRRLL\n\nSample Output 2\n\n0 3 3 0 0 0 1 1 0 2 2 0\n\nSample Input 3\n\nRRRLLRLLRRRLLLLL\n\nSample Output 3\n\n0 0 3 2 0 2 1 0 0 0 4 4 0 0 0 0", "sample_input": "RRLRL\n"}, "reference_outputs": ["0 1 2 1 1\n"], "source_document_id": "p02954", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of L and R.\n\nLet N be the length of S. There are N squares arranged from left to right, and the i-th character of S from the left is written on the i-th square from the left.\n\nThe character written on the leftmost square is always R, and the character written on the rightmost square is always L.\n\nInitially, one child is standing on each square.\n\nEach child will perform the move below 10^{100} times:\n\nMove one square in the direction specified by the character written in the square on which the child is standing. L denotes left, and R denotes right.\n\nFind the number of children standing on each square after the children performed the moves.\n\nConstraints\n\nS is a string of length between 2 and 10^5 (inclusive).\n\nEach character of S is L or R.\n\nThe first and last characters of S are R and L, respectively.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of children standing on each square after the children performed the moves, in order from left to right.\n\nSample Input 1\n\nRRLRL\n\nSample Output 1\n\n0 1 2 1 1\n\nAfter each child performed one move, the number of children standing on each square is 0, 2, 1, 1, 1 from left to right.\n\nAfter each child performed two moves, the number of children standing on each square is 0, 1, 2, 1, 1 from left to right.\n\nAfter each child performed 10^{100} moves, the number of children standing on each square is 0, 1, 2, 1, 1 from left to right.\n\nSample Input 2\n\nRRLLLLRLRRLL\n\nSample Output 2\n\n0 3 3 0 0 0 1 1 0 2 2 0\n\nSample Input 3\n\nRRRLLRLLRRRLLLLL\n\nSample Output 3\n\n0 0 3 2 0 2 1 0 0 0 4 4 0 0 0 0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1262, "cpu_time_ms": 90, "memory_kb": 17520}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s779168031", "group_id": "codeNet:p02957", "input_text": "a,b=io.read(\"*n\",\"*n\")\nif (a+b)%2==0 then\n print(math.floor((a+b)/2))\nelse\n print(\"IMPOSSIBLE\")\nend", "language": "Lua", "metadata": {"date": 1579314783, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s779168031.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s779168031", "user_id": "u720483676"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "a,b=io.read(\"*n\",\"*n\")\nif (a+b)%2==0 then\n print(math.floor((a+b)/2))\nelse\n print(\"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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 101, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s728144422", "group_id": "codeNet:p02957", "input_text": "local A,B=io.read(\"n\",\"n\")\nif Bcur then\n r = r + 1\n end\n prev = cur\nend\nif r<=2 then\n print(\"Yes\")\nelse\n print(\"No\")\nend", "language": "Lua", "metadata": {"date": 1576037702, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02958.html", "problem_id": "p02958", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02958/input.txt", "sample_output_relpath": "derived/input_output/data/p02958/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02958/Lua/s046560369.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s046560369", "user_id": "u162773977"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "local N=io.read(\"n\")\nlocal prev=0\nlocal r=0\nfor i=1,N do\n local cur = io.read(\"n\")\n if prev>cur then\n r = r + 1\n end\n prev = cur\nend\nif r<=2 then\n print(\"Yes\")\nelse\n print(\"No\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a sequence p = {p_1,\\ p_2,\\ ...,\\ p_N} which is a permutation of {1,\\ 2,\\ ...,\\ N}.\n\nYou can perform the following operation at most once: choose integers i and j (1 \\leq i < j \\leq N), and swap p_i and p_j. Note that you can also choose not to perform it.\n\nPrint YES if you can sort p in ascending order in this way, and NO otherwise.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 50\n\np is a permutation of {1,\\ 2,\\ ...,\\ N}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\np_1 p_2 ... p_N\n\nOutput\n\nPrint YES if you can sort p in ascending order in the way stated in the problem statement, and NO otherwise.\n\nSample Input 1\n\n5\n5 2 3 4 1\n\nSample Output 1\n\nYES\n\nYou can sort p in ascending order by swapping p_1 and p_5.\n\nSample Input 2\n\n5\n2 4 3 5 1\n\nSample Output 2\n\nNO\n\nIn this case, swapping any two elements does not sort p in ascending order.\n\nSample Input 3\n\n7\n1 2 3 4 5 6 7\n\nSample Output 3\n\nYES\n\np is already sorted in ascending order, so no operation is needed.", "sample_input": "5\n5 2 3 4 1\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p02958", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a sequence p = {p_1,\\ p_2,\\ ...,\\ p_N} which is a permutation of {1,\\ 2,\\ ...,\\ N}.\n\nYou can perform the following operation at most once: choose integers i and j (1 \\leq i < j \\leq N), and swap p_i and p_j. Note that you can also choose not to perform it.\n\nPrint YES if you can sort p in ascending order in this way, and NO otherwise.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 50\n\np is a permutation of {1,\\ 2,\\ ...,\\ N}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\np_1 p_2 ... p_N\n\nOutput\n\nPrint YES if you can sort p in ascending order in the way stated in the problem statement, and NO otherwise.\n\nSample Input 1\n\n5\n5 2 3 4 1\n\nSample Output 1\n\nYES\n\nYou can sort p in ascending order by swapping p_1 and p_5.\n\nSample Input 2\n\n5\n2 4 3 5 1\n\nSample Output 2\n\nNO\n\nIn this case, swapping any two elements does not sort p in ascending order.\n\nSample Input 3\n\n7\n1 2 3 4 5 6 7\n\nSample Output 3\n\nYES\n\np is already sorted in ascending order, so no operation is needed.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s531598938", "group_id": "codeNet:p02959", "input_text": "n=io.read(\"*n\",\"*l\")\na={}\nb={}\nfor i=1,n+1 do\n a[i]=io.read(\"*n\")\nend\nfor i=1,n do\n b[i]=io.read(\"*n\")\nend\n\ncounter=0\nfor i=1,n do\n \n if a[i] N then\n break\n end\n bi = bi ~ box[k]\n end\n box[i] = bi\nend\nlocal M = 0\nfor i=1,N do\n if box[i] == 1 then\n M = M + 1\n end\nend\nprint(M)\nif M == 0 then return end\nlocal sb = {}\nfor i=1,N do\n if box[i] == 1 then\n table.insert(sb, tostring(i))\n end\nend\nprint(table.concat(sb, \" \"))\n", "language": "Lua", "metadata": {"date": 1563672673, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s299085794.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s299085794", "user_id": "u162773977"}, "prompt_components": {"gold_output": "1\n1\n", "input_to_evaluate": "local N = io.read(\"n\")\nlocal A = {}\nfor i=1, N do\n A[i] = io.read(\"n\")\nend\n\nlocal box = {}\nfor i=N, 1, -1 do\n local k = i\n local bi = A[i]\n for n=2,1000000 do\n k = k + i\n if k > N then\n break\n end\n bi = bi ~ box[k]\n end\n box[i] = bi\nend\nlocal M = 0\nfor i=1,N do\n if box[i] == 1 then\n M = M + 1\n end\nend\nprint(M)\nif M == 0 then return end\nlocal sb = {}\nfor i=1,N do\n if box[i] == 1 then\n table.insert(sb, tostring(i))\n end\nend\nprint(table.concat(sb, \" \"))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N empty boxes arranged in a row from left to right.\nThe integer i is written on the i-th box from the left (1 \\leq i \\leq N).\n\nFor each of these boxes, Snuke can choose either to put a ball in it or to put nothing in it.\n\nWe say a set of choices to put a ball or not in the boxes is good when the following condition is satisfied:\n\nFor every integer i between 1 and N (inclusive), the total number of balls contained in the boxes with multiples of i written on them is congruent to a_i modulo 2.\n\nDoes there exist a good set of choices? If the answer is yes, find one good set of choices.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\na_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf a good set of choices does not exist, print -1.\n\nIf a good set of choices exists, print one such set of choices in the following format:\n\nM\nb_1 b_2 ... b_M\n\nwhere M denotes the number of boxes that will contain a ball, and b_1,\\ b_2,\\ ...,\\ b_M are the integers written on these boxes, in any order.\n\nSample Input 1\n\n3\n1 0 0\n\nSample Output 1\n\n1\n1\n\nConsider putting a ball only in the box with 1 written on it.\n\nThere are three boxes with multiples of 1 written on them: the boxes with 1, 2, and 3. The total number of balls contained in these boxes is 1.\n\nThere is only one box with a multiple of 2 written on it: the box with 2. The total number of balls contained in these boxes is 0.\n\nThere is only one box with a multiple of 3 written on it: the box with 3. The total number of balls contained in these boxes is 0.\n\nThus, the condition is satisfied, so this set of choices is good.\n\nSample Input 2\n\n5\n0 0 0 0 0\n\nSample Output 2\n\n0\n\nPutting nothing in the boxes can be a good set of choices.", "sample_input": "3\n1 0 0\n"}, "reference_outputs": ["1\n1\n"], "source_document_id": "p02972", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N empty boxes arranged in a row from left to right.\nThe integer i is written on the i-th box from the left (1 \\leq i \\leq N).\n\nFor each of these boxes, Snuke can choose either to put a ball in it or to put nothing in it.\n\nWe say a set of choices to put a ball or not in the boxes is good when the following condition is satisfied:\n\nFor every integer i between 1 and N (inclusive), the total number of balls contained in the boxes with multiples of i written on them is congruent to a_i modulo 2.\n\nDoes there exist a good set of choices? If the answer is yes, find one good set of choices.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\na_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf a good set of choices does not exist, print -1.\n\nIf a good set of choices exists, print one such set of choices in the following format:\n\nM\nb_1 b_2 ... b_M\n\nwhere M denotes the number of boxes that will contain a ball, and b_1,\\ b_2,\\ ...,\\ b_M are the integers written on these boxes, in any order.\n\nSample Input 1\n\n3\n1 0 0\n\nSample Output 1\n\n1\n1\n\nConsider putting a ball only in the box with 1 written on it.\n\nThere are three boxes with multiples of 1 written on them: the boxes with 1, 2, and 3. The total number of balls contained in these boxes is 1.\n\nThere is only one box with a multiple of 2 written on it: the box with 2. The total number of balls contained in these boxes is 0.\n\nThere is only one box with a multiple of 3 written on it: the box with 3. The total number of balls contained in these boxes is 0.\n\nThus, the condition is satisfied, so this set of choices is good.\n\nSample Input 2\n\n5\n0 0 0 0 0\n\nSample Output 2\n\n0\n\nPutting nothing in the boxes can be a good set of choices.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 538, "cpu_time_ms": 233, "memory_kb": 20068}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s223536637", "group_id": "codeNet:p02972", "input_text": "local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max\nlocal n = io.read(\"*n\")\nlocal a, t = {}, {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\n t[i] = 0\nend\nfor i = n, 1, -1 do\n local dst = a[i]\n local j = 2\n local cur = 0\n while j * i <= n do\n cur = cur + t[j * i]\n j = j + 1\n end\n cur = cur % 2\n t[i] = (a[i] + cur) % 2\nend\nlocal m = 0\nfor i = 1, n do\n if t[i] == 1 then m = m + 1 end\nend\nprint(m)\nfor i = 1, n do\n if t[i] == 1 then print(i) end\nend\n", "language": "Lua", "metadata": {"date": 1563671482, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s223536637.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s223536637", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n1\n", "input_to_evaluate": "local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max\nlocal n = io.read(\"*n\")\nlocal a, t = {}, {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\n t[i] = 0\nend\nfor i = n, 1, -1 do\n local dst = a[i]\n local j = 2\n local cur = 0\n while j * i <= n do\n cur = cur + t[j * i]\n j = j + 1\n end\n cur = cur % 2\n t[i] = (a[i] + cur) % 2\nend\nlocal m = 0\nfor i = 1, n do\n if t[i] == 1 then m = m + 1 end\nend\nprint(m)\nfor i = 1, n do\n if t[i] == 1 then print(i) end\nend\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N empty boxes arranged in a row from left to right.\nThe integer i is written on the i-th box from the left (1 \\leq i \\leq N).\n\nFor each of these boxes, Snuke can choose either to put a ball in it or to put nothing in it.\n\nWe say a set of choices to put a ball or not in the boxes is good when the following condition is satisfied:\n\nFor every integer i between 1 and N (inclusive), the total number of balls contained in the boxes with multiples of i written on them is congruent to a_i modulo 2.\n\nDoes there exist a good set of choices? If the answer is yes, find one good set of choices.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\na_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf a good set of choices does not exist, print -1.\n\nIf a good set of choices exists, print one such set of choices in the following format:\n\nM\nb_1 b_2 ... b_M\n\nwhere M denotes the number of boxes that will contain a ball, and b_1,\\ b_2,\\ ...,\\ b_M are the integers written on these boxes, in any order.\n\nSample Input 1\n\n3\n1 0 0\n\nSample Output 1\n\n1\n1\n\nConsider putting a ball only in the box with 1 written on it.\n\nThere are three boxes with multiples of 1 written on them: the boxes with 1, 2, and 3. The total number of balls contained in these boxes is 1.\n\nThere is only one box with a multiple of 2 written on it: the box with 2. The total number of balls contained in these boxes is 0.\n\nThere is only one box with a multiple of 3 written on it: the box with 3. The total number of balls contained in these boxes is 0.\n\nThus, the condition is satisfied, so this set of choices is good.\n\nSample Input 2\n\n5\n0 0 0 0 0\n\nSample Output 2\n\n0\n\nPutting nothing in the boxes can be a good set of choices.", "sample_input": "3\n1 0 0\n"}, "reference_outputs": ["1\n1\n"], "source_document_id": "p02972", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N empty boxes arranged in a row from left to right.\nThe integer i is written on the i-th box from the left (1 \\leq i \\leq N).\n\nFor each of these boxes, Snuke can choose either to put a ball in it or to put nothing in it.\n\nWe say a set of choices to put a ball or not in the boxes is good when the following condition is satisfied:\n\nFor every integer i between 1 and N (inclusive), the total number of balls contained in the boxes with multiples of i written on them is congruent to a_i modulo 2.\n\nDoes there exist a good set of choices? If the answer is yes, find one good set of choices.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\na_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf a good set of choices does not exist, print -1.\n\nIf a good set of choices exists, print one such set of choices in the following format:\n\nM\nb_1 b_2 ... b_M\n\nwhere M denotes the number of boxes that will contain a ball, and b_1,\\ b_2,\\ ...,\\ b_M are the integers written on these boxes, in any order.\n\nSample Input 1\n\n3\n1 0 0\n\nSample Output 1\n\n1\n1\n\nConsider putting a ball only in the box with 1 written on it.\n\nThere are three boxes with multiples of 1 written on them: the boxes with 1, 2, and 3. The total number of balls contained in these boxes is 1.\n\nThere is only one box with a multiple of 2 written on it: the box with 2. The total number of balls contained in these boxes is 0.\n\nThere is only one box with a multiple of 3 written on it: the box with 3. The total number of balls contained in these boxes is 0.\n\nThus, the condition is satisfied, so this set of choices is good.\n\nSample Input 2\n\n5\n0 0 0 0 0\n\nSample Output 2\n\n0\n\nPutting nothing in the boxes can be a good set of choices.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 114, "memory_kb": 5376}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s078164137", "group_id": "codeNet:p02975", "input_text": "local function getxor(x, y)\n local ret = 0\n local mul = 1\n while 0 < x or 0 < y do\n if (x % 2) + (y % 2) == 1 then\n ret = ret + mul\n end\n x, y, mul = x // 2, y // 2, mul * 2\n end\n return ret\nend\n\nlocal n = io.read(\"*n\")\nlocal a = {}\nlocal allzero = true\nlocal t = {}\nlocal tcnt = 0\nfor i = 1, n do\n a[i] = io.read(\"*n\")\n if a[i] ~= 0 then allzero = false end\n if t[a[i]] then\n t[a[i]] = t[a[i]] + 1\n else\n if tcnt < 3 then\n tcnt = tcnt + 1\n t[a[i]] = 1\n else\n tcnt = 4\n end\n end\nend\nif allzero then\n print(\"Yes\")\nelseif n % 3 ~= 0 then\n print(\"No\")\nelseif tcnt == 3 then\n local f = true\n local g = {}\n for k, v in pairs(t) do\n if v ~= n // 3 then f = false end\n table.insert(g, k)\n end\n if f then\n f = getxor(g[1], g[2]) == g[3]\n end\n print(f and \"Yes\" or \"No\")\nelseif tcnt == 2 then\n local f = true\n for k, v in pairs(t) do\n if v == n // 3 and k == 0 then\n elseif v == n * 2 // 3 then\n else f = false\n end\n end\n print(f and \"Yes\" or \"No\")\nelse\n print(\"No\")\nend\n", "language": "Lua", "metadata": {"date": 1563331654, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s078164137.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s078164137", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local function getxor(x, y)\n local ret = 0\n local mul = 1\n while 0 < x or 0 < y do\n if (x % 2) + (y % 2) == 1 then\n ret = ret + mul\n end\n x, y, mul = x // 2, y // 2, mul * 2\n end\n return ret\nend\n\nlocal n = io.read(\"*n\")\nlocal a = {}\nlocal allzero = true\nlocal t = {}\nlocal tcnt = 0\nfor i = 1, n do\n a[i] = io.read(\"*n\")\n if a[i] ~= 0 then allzero = false end\n if t[a[i]] then\n t[a[i]] = t[a[i]] + 1\n else\n if tcnt < 3 then\n tcnt = tcnt + 1\n t[a[i]] = 1\n else\n tcnt = 4\n end\n end\nend\nif allzero then\n print(\"Yes\")\nelseif n % 3 ~= 0 then\n print(\"No\")\nelseif tcnt == 3 then\n local f = true\n local g = {}\n for k, v in pairs(t) do\n if v ~= n // 3 then f = false end\n table.insert(g, k)\n end\n if f then\n f = getxor(g[1], g[2]) == g[3]\n end\n print(f and \"Yes\" or \"No\")\nelseif tcnt == 2 then\n local f = true\n for k, v in pairs(t) do\n if v == n // 3 and k == 0 then\n elseif v == n * 2 // 3 then\n else f = false\n end\n end\n print(f and \"Yes\" or \"No\")\nelse\n print(\"No\")\nend\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has N hats. The i-th hat has an integer a_i written on it.\n\nThere are N camels standing in a circle.\nSnuke will put one of his hats on each of these camels.\n\nIf there exists a way to distribute the hats to the camels such that the following condition is satisfied for every camel, print Yes; otherwise, print No.\n\nThe bitwise XOR of the numbers written on the hats on both adjacent camels is equal to the number on the hat on itself.\n\nWhat is XOR?\n\nThe bitwise XOR x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n of n non-negative integers x_1, x_2, \\ldots, x_n is defined as follows:\n\n- When x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if the number of integers among x_1, x_2, \\ldots, x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if that count is even.\n\nFor example, 3 \\oplus 5 = 6.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10^{5}\n\n0 \\leq a_i \\leq 10^{9}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\ldots a_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\nYes\n\nIf we put the hats with 1, 2, and 3 in this order, clockwise, the condition will be satisfied for every camel, so the answer is Yes.\n\nSample Input 2\n\n4\n1 2 4 8\n\nSample Output 2\n\nNo\n\nThere is no such way to distribute the hats; the answer is No.", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02975", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has N hats. The i-th hat has an integer a_i written on it.\n\nThere are N camels standing in a circle.\nSnuke will put one of his hats on each of these camels.\n\nIf there exists a way to distribute the hats to the camels such that the following condition is satisfied for every camel, print Yes; otherwise, print No.\n\nThe bitwise XOR of the numbers written on the hats on both adjacent camels is equal to the number on the hat on itself.\n\nWhat is XOR?\n\nThe bitwise XOR x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n of n non-negative integers x_1, x_2, \\ldots, x_n is defined as follows:\n\n- When x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if the number of integers among x_1, x_2, \\ldots, x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if that count is even.\n\nFor example, 3 \\oplus 5 = 6.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10^{5}\n\n0 \\leq a_i \\leq 10^{9}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\ldots a_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\nYes\n\nIf we put the hats with 1, 2, and 3 in this order, clockwise, the condition will be satisfied for every camel, so the answer is Yes.\n\nSample Input 2\n\n4\n1 2 4 8\n\nSample Output 2\n\nNo\n\nThere is no such way to distribute the hats; the answer is No.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1048, "cpu_time_ms": 47, "memory_kb": 2424}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s864962849", "group_id": "codeNet:p02976", "input_text": "local mfl, mce = math.floor, math.ceil\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal edge = {}\nlocal edgenum = {}\nfor i = 1, n do\n edge[i] = {}\nend\nfor i = 1, m do\n local a, b = io.read(\"*n\", \"*n\")\n edge[a][b], edge[b][a] = true, true\nend\nif m % 2 == 1 then\n print(-1)\n os.exit()\nend\nfor i = 1, n do\n local dsts = {}\n for dst, _u in pairs(edge[i]) do\n table.insert(dsts, dst)\n end\n local lim = mfl(#dsts / 2)\n for j = 1, lim, 2 do\n print(i .. \" \" .. dsts[j * 2 - 1])\n print(i .. \" \" .. dsts[j * 2])\n end\n for j = 1, lim * 2 do\n edge[dsts[j]][i] = nil\n end\nend\n", "language": "Lua", "metadata": {"date": 1588807401, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02976.html", "problem_id": "p02976", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02976/input.txt", "sample_output_relpath": "derived/input_output/data/p02976/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02976/Lua/s864962849.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s864962849", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1 2\n1 4\n3 2\n3 4\n", "input_to_evaluate": "local mfl, mce = math.floor, math.ceil\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal edge = {}\nlocal edgenum = {}\nfor i = 1, n do\n edge[i] = {}\nend\nfor i = 1, m do\n local a, b = io.read(\"*n\", \"*n\")\n edge[a][b], edge[b][a] = true, true\nend\nif m % 2 == 1 then\n print(-1)\n os.exit()\nend\nfor i = 1, n do\n local dsts = {}\n for dst, _u in pairs(edge[i]) do\n table.insert(dsts, dst)\n end\n local lim = mfl(#dsts / 2)\n for j = 1, lim, 2 do\n print(i .. \" \" .. dsts[j * 2 - 1])\n print(i .. \" \" .. dsts[j * 2])\n end\n for j = 1, lim * 2 do\n edge[dsts[j]][i] = nil\n end\nend\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nYou are given a simple connected undirected graph with N vertices and M edges. The vertices are numbered 1 to N, and the i-th edge connects Vertex A_i and Vertex B_i.\nTakahashi will assign one of the two possible directions to each of the edges in the graph to make a directed graph.\nDetermine if it is possible to make a directed graph with an even number of edges going out from every vertex. If the answer is yes, construct one such graph.\n\nNotes\n\nAn undirected graph is said to be simple when it contains no self-loops or multiple edges.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\nN-1 \\leq M \\leq 10^5\n\n1 \\leq A_i,B_i \\leq N (1\\leq i\\leq M)\n\nThe given graph is simple and connected.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\n:\nA_M B_M\n\nOutput\n\nIf it is impossible to assign directions\b to satisfy the requirement, print -1.\nOtherwise, print an assignment of directions that satisfies the requirement, in the following format:\n\nC_1 D_1\n:\nC_M D_M\n\nHere each pair (C_i, D_i) means that there is an edge directed from Vertex C_i to Vertex D_i. The edges may be printed in any order.\n\nSample Input 1\n\n4 4\n1 2\n2 3\n3 4\n4 1\n\nSample Output 1\n\n1 2\n1 4\n3 2\n3 4\n\nAfter this assignment of directions, Vertex 1 and 3 will each have two outgoing edges, and Vertex 2 and 4 will each have zero outgoing edges.\n\nSample Input 2\n\n5 5\n1 2\n2 3\n3 4\n2 5\n4 5\n\nSample Output 2\n\n-1", "sample_input": "4 4\n1 2\n2 3\n3 4\n4 1\n"}, "reference_outputs": ["1 2\n1 4\n3 2\n3 4\n"], "source_document_id": "p02976", "source_text": "Score : 700 points\n\nProblem Statement\n\nYou are given a simple connected undirected graph with N vertices and M edges. The vertices are numbered 1 to N, and the i-th edge connects Vertex A_i and Vertex B_i.\nTakahashi will assign one of the two possible directions to each of the edges in the graph to make a directed graph.\nDetermine if it is possible to make a directed graph with an even number of edges going out from every vertex. If the answer is yes, construct one such graph.\n\nNotes\n\nAn undirected graph is said to be simple when it contains no self-loops or multiple edges.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\nN-1 \\leq M \\leq 10^5\n\n1 \\leq A_i,B_i \\leq N (1\\leq i\\leq M)\n\nThe given graph is simple and connected.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\n:\nA_M B_M\n\nOutput\n\nIf it is impossible to assign directions\b to satisfy the requirement, print -1.\nOtherwise, print an assignment of directions that satisfies the requirement, in the following format:\n\nC_1 D_1\n:\nC_M D_M\n\nHere each pair (C_i, D_i) means that there is an edge directed from Vertex C_i to Vertex D_i. The edges may be printed in any order.\n\nSample Input 1\n\n4 4\n1 2\n2 3\n3 4\n4 1\n\nSample Output 1\n\n1 2\n1 4\n3 2\n3 4\n\nAfter this assignment of directions, Vertex 1 and 3 will each have two outgoing edges, and Vertex 2 and 4 will each have zero outgoing edges.\n\nSample Input 2\n\n5 5\n1 2\n2 3\n3 4\n2 5\n4 5\n\nSample Output 2\n\n-1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 578, "cpu_time_ms": 309, "memory_kb": 25844}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s976213703", "group_id": "codeNet:p02981", "input_text": "n,a,b=io.read(\"*n\",\"*n\",\"*n\")\nprint(math.min(n*a,b))", "language": "Lua", "metadata": {"date": 1579314974, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s976213703.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s976213703", "user_id": "u720483676"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "n,a,b=io.read(\"*n\",\"*n\",\"*n\")\nprint(math.min(n*a,b))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 52, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s326074334", "group_id": "codeNet:p02981", "input_text": "local n,a,b=io.read(\"*n\",\"*n\",\"*n\")\nprint(math.min(n*a,b))", "language": "Lua", "metadata": {"date": 1576476574, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s326074334.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s326074334", "user_id": "u373958718"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "local n,a,b=io.read(\"*n\",\"*n\",\"*n\")\nprint(math.min(n*a,b))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 58, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s739044211", "group_id": "codeNet:p02982", "input_text": "local N, D = io.read(\"n\",\"n\")\nlocal X = {}\nfor i=1,N do\n local p = {}\n for j=1,D do\n table.insert(p, io.read(\"n\"))\n end\n table.insert(X, p)\nend\nlocal function d(i,j)\n local sq = 0\n for k=1,D do\n sq = sq + (X[i][k] - X[j][k])^2\n end\n return math.sqrt(sq)\nend\nlocal function is_int(x)\n return x - math.floor(x) == 0\nend\nlocal ans = 0\nfor i=1,N-1 do\n for j=i+1, N do\n if is_int(d(i,j)) then\n ans = ans + 1\n end\n end\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1569717333, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02982.html", "problem_id": "p02982", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02982/input.txt", "sample_output_relpath": "derived/input_output/data/p02982/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02982/Lua/s739044211.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s739044211", "user_id": "u162773977"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local N, D = io.read(\"n\",\"n\")\nlocal X = {}\nfor i=1,N do\n local p = {}\n for j=1,D do\n table.insert(p, io.read(\"n\"))\n end\n table.insert(X, p)\nend\nlocal function d(i,j)\n local sq = 0\n for k=1,D do\n sq = sq + (X[i][k] - X[j][k])^2\n end\n return math.sqrt(sq)\nend\nlocal function is_int(x)\n return x - math.floor(x) == 0\nend\nlocal ans = 0\nfor i=1,N-1 do\n for j=i+1, N do\n if is_int(d(i,j)) then\n ans = ans + 1\n end\n end\nend\nprint(ans)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N points in a D-dimensional space.\n\nThe coordinates of the i-th point are (X_{i1}, X_{i2}, ..., X_{iD}).\n\nThe distance between two points with coordinates (y_1, y_2, ..., y_D) and (z_1, z_2, ..., z_D) is \\sqrt{(y_1 - z_1)^2 + (y_2 - z_2)^2 + ... + (y_D - z_D)^2}.\n\nHow many pairs (i, j) (i < j) are there such that the distance between the i-th point and the j-th point is an integer?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10\n\n1 \\leq D \\leq 10\n\n-20 \\leq X_{ij} \\leq 20\n\nNo two given points have the same coordinates. That is, if i \\neq j, there exists k such that X_{ik} \\neq X_{jk}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_{11} X_{12} ... X_{1D}\nX_{21} X_{22} ... X_{2D}\n\\vdots\nX_{N1} X_{N2} ... X_{ND}\n\nOutput\n\nPrint the number of pairs (i, j) (i < j) such that the distance between the i-th point and the j-th point is an integer.\n\nSample Input 1\n\n3 2\n1 2\n5 5\n-2 8\n\nSample Output 1\n\n1\n\nThe number of pairs with an integer distance is one, as follows:\n\nThe distance between the first point and the second point is \\sqrt{|1-5|^2 + |2-5|^2} = 5, which is an integer.\n\nThe distance between the second point and the third point is \\sqrt{|5-(-2)|^2 + |5-8|^2} = \\sqrt{58}, which is not an integer.\n\nThe distance between the third point and the first point is \\sqrt{|-2-1|^2+|8-2|^2} = 3\\sqrt{5}, which is not an integer.\n\nSample Input 2\n\n3 4\n-3 7 8 2\n-12 1 10 2\n-2 8 9 3\n\nSample Output 2\n\n2\n\nSample Input 3\n\n5 1\n1\n2\n3\n4\n5\n\nSample Output 3\n\n10", "sample_input": "3 2\n1 2\n5 5\n-2 8\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02982", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N points in a D-dimensional space.\n\nThe coordinates of the i-th point are (X_{i1}, X_{i2}, ..., X_{iD}).\n\nThe distance between two points with coordinates (y_1, y_2, ..., y_D) and (z_1, z_2, ..., z_D) is \\sqrt{(y_1 - z_1)^2 + (y_2 - z_2)^2 + ... + (y_D - z_D)^2}.\n\nHow many pairs (i, j) (i < j) are there such that the distance between the i-th point and the j-th point is an integer?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10\n\n1 \\leq D \\leq 10\n\n-20 \\leq X_{ij} \\leq 20\n\nNo two given points have the same coordinates. That is, if i \\neq j, there exists k such that X_{ik} \\neq X_{jk}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_{11} X_{12} ... X_{1D}\nX_{21} X_{22} ... X_{2D}\n\\vdots\nX_{N1} X_{N2} ... X_{ND}\n\nOutput\n\nPrint the number of pairs (i, j) (i < j) such that the distance between the i-th point and the j-th point is an integer.\n\nSample Input 1\n\n3 2\n1 2\n5 5\n-2 8\n\nSample Output 1\n\n1\n\nThe number of pairs with an integer distance is one, as follows:\n\nThe distance between the first point and the second point is \\sqrt{|1-5|^2 + |2-5|^2} = 5, which is an integer.\n\nThe distance between the second point and the third point is \\sqrt{|5-(-2)|^2 + |5-8|^2} = \\sqrt{58}, which is not an integer.\n\nThe distance between the third point and the first point is \\sqrt{|-2-1|^2+|8-2|^2} = 3\\sqrt{5}, which is not an integer.\n\nSample Input 2\n\n3 4\n-3 7 8 2\n-12 1 10 2\n-2 8 9 3\n\nSample Output 2\n\n2\n\nSample Input 3\n\n5 1\n1\n2\n3\n4\n5\n\nSample Output 3\n\n10", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 499, "cpu_time_ms": 130, "memory_kb": 1136}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s654104021", "group_id": "codeNet:p02984", "input_text": "local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max\nlocal n = io.read(\"*n\")\nlocal a = {}\nlocal sum = 0\nfor i = 1, n do\n a[i] = 2 * io.read(\"*n\")\n sum = sum + a[i]\nend\nsum = sum / 2\n-- get t1\nlocal t = {}\nt[1] = sum\nfor i = 2, n, 2 do\n t[1] = t[1] - a[i]\nend\n-- print(t[1])\nfor i = 2, n do\n t[i] = a[i - 1] - t[i - 1]\nend\nio.write(t[1])\nfor i = 2, n do\n io.write(\" \" .. t[i])\nend\nio.write(\"\\n\")\n", "language": "Lua", "metadata": {"date": 1562548656, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s654104021.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s654104021", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4 0 4\n", "input_to_evaluate": "local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max\nlocal n = io.read(\"*n\")\nlocal a = {}\nlocal sum = 0\nfor i = 1, n do\n a[i] = 2 * io.read(\"*n\")\n sum = sum + a[i]\nend\nsum = sum / 2\n-- get t1\nlocal t = {}\nt[1] = sum\nfor i = 2, n, 2 do\n t[1] = t[1] - a[i]\nend\n-- print(t[1])\nfor i = 2, n do\n t[i] = a[i - 1] - t[i - 1]\nend\nio.write(t[1])\nfor i = 2, n do\n io.write(\" \" .. t[i])\nend\nio.write(\"\\n\")\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 134, "memory_kb": 7920}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s088598926", "group_id": "codeNet:p02986", "input_text": "local mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal mab = math.abs\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getValue = function(self, pos)\n return self.stage[self.stagenum][pos]\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mmi(r, mce((l - 1) / sz) * sz)\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)\n l = newr + 1\n end\n if sz <= r + 1 - l then\n ret = self.func(ret, self.stage[stage][mce(l / sz)])\n l = l + sz\n end\n if l <= r then\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n end\n end\n return ret\nend\nSegTree.setValue = function(self, idx, value, silent)\n self.stage[self.stagenum][idx] = value\n if not silent then\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n end\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal n, q = io.read(\"*n\", \"*n\")\nlocal edge = {}\nlocal asked = {}\nlocal depth = {}\nlocal childstep = {}\nlocal segpos = {}\nfor i = 1, n do\n edge[i] = {}\n asked[i] = false\n depth[i] = 0\n childstep[i] = 0\n segpos[i] = 0\nend\ndepth[n + 1] = n + 1\nlocal color = {}\nlocal value = {}\nfor i = 1, 2 * n - 1 do\n color[i] = 0\n value[i] = 0\nend\nlocal colormap = {}\nfor i = 1, n - 1 do\n local x, y, c, d = io.read(\"*n\", \"*n\", \"*n\", \"*n\")\n table.insert(edge[x], {y, c, d})\n table.insert(edge[y], {x, c, d})\n colormap[i] = {}\nend\n\nlocal stDepth = SegTree.new(2 * n - 1, function(x, y) return depth[x] < depth[y] and x or y end, n + 1)\nlocal stLen = SegTree.new(2 * n - 1, function(x, y) return x + y end, 0)\nlocal stCol = SegTree.new(2 * n - 1, function(x, y) return x + y end, 0)\nlocal tasks = {{1, 0, 0}}\nlocal done = 0\nwhile done < 2 * n - 1 do\n done = done + 1\n local src, sval, scol = tasks[#tasks][1], tasks[#tasks][2], tasks[#tasks][3]\n table.remove(tasks)\n asked[src] = true\n stDepth:setValue(done, src, true)\n stLen:setValue(done, sval, true)\n segpos[src] = done\n if 1 < done then table.insert(colormap[scol], done) end\n local cs = childstep[src]\n while cs < #edge[src] do\n cs = cs + 1\n childstep[src] = cs\n local dst = edge[src][cs][1]\n if not asked[dst] then\n depth[dst] = depth[src] + 1\n table.insert(tasks, {src, edge[src][cs][3], edge[src][cs][2]})\n table.insert(tasks, {dst, -edge[src][cs][3], edge[src][cs][2]})\n break\n end\n end\nend\nstDepth:updateAll()\nstLen:updateAll()\nlocal qlist = {}\nfor i = 1, q do\n qlist[i] = {i, io.read(\"*n\", \"*n\", \"*n\", \"*n\")}\nend\ntable.sort(qlist, function(x, y) return x[2] < y[2] end)\nlocal curcol = 0\nlocal storeval = {}\nfor i = 1, q do\n local tmp = qlist[i]\n local ccol, cval, u, v = tmp[2], tmp[3], tmp[4], tmp[5]\n if curcol ~= ccol then\n -- restore\n for j = 1, #storeval do\n stLen:setValue(storeval[j][1], storeval[j][2])\n stCol:setValue(storeval[j][1], 0)\n end\n -- changecolor\n local cmap = colormap[ccol]\n storeval = {}\n for j = 1, #cmap do\n storeval[j] = {cmap[j], stLen:getValue(cmap[j])}\n if storeval[j][2] < 0 then\n stCol:setValue(cmap[j], -1)\n else\n stCol:setValue(cmap[j], 1)\n end\n stLen:setValue(cmap[j], 0)\n end\n curcol = ccol\n end\n -- get parent\n local spu, spv = segpos[u], segpos[v]\n if spv < spu then spu, spv = spv, spu end\n local spp = stDepth:getRange(spu, spv)\n local ret = 0\n if spv < spp then\n ret = ret + mab(stLen:getRange(spv + 1, spp))\n ret = ret + cval * mab(stCol:getRange(spv + 1, spp))\n elseif spp < spv then\n ret = ret + mab(stLen:getRange(spp + 1, spv))\n ret = ret + cval * mab(stCol:getRange(spp + 1, spv))\n end\n if spu < spp then\n ret = ret + mab(stLen:getRange(spu + 1, spp) + cval * stCol:getRange(spu + 1, spp))\n elseif spp < spu then\n ret = ret + mab(stLen:getRange(spp + 1, spu) + cval * stCol:getRange(spp + 1, spu))\n end\n qlist[i][6] = ret\nend\n\ntable.sort(qlist, function(x, y) return x[1] < y[1] end)\nfor i = 1, q do\n print(qlist[i][6])\nend\n", "language": "Lua", "metadata": {"date": 1577422147, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02986.html", "problem_id": "p02986", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02986/input.txt", "sample_output_relpath": "derived/input_output/data/p02986/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02986/Lua/s088598926.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s088598926", "user_id": "u120582723"}, "prompt_components": {"gold_output": "130\n200\n60\n", "input_to_evaluate": "local mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal mab = math.abs\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getValue = function(self, pos)\n return self.stage[self.stagenum][pos]\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mmi(r, mce((l - 1) / sz) * sz)\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)\n l = newr + 1\n end\n if sz <= r + 1 - l then\n ret = self.func(ret, self.stage[stage][mce(l / sz)])\n l = l + sz\n end\n if l <= r then\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n end\n end\n return ret\nend\nSegTree.setValue = function(self, idx, value, silent)\n self.stage[self.stagenum][idx] = value\n if not silent then\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n end\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal n, q = io.read(\"*n\", \"*n\")\nlocal edge = {}\nlocal asked = {}\nlocal depth = {}\nlocal childstep = {}\nlocal segpos = {}\nfor i = 1, n do\n edge[i] = {}\n asked[i] = false\n depth[i] = 0\n childstep[i] = 0\n segpos[i] = 0\nend\ndepth[n + 1] = n + 1\nlocal color = {}\nlocal value = {}\nfor i = 1, 2 * n - 1 do\n color[i] = 0\n value[i] = 0\nend\nlocal colormap = {}\nfor i = 1, n - 1 do\n local x, y, c, d = io.read(\"*n\", \"*n\", \"*n\", \"*n\")\n table.insert(edge[x], {y, c, d})\n table.insert(edge[y], {x, c, d})\n colormap[i] = {}\nend\n\nlocal stDepth = SegTree.new(2 * n - 1, function(x, y) return depth[x] < depth[y] and x or y end, n + 1)\nlocal stLen = SegTree.new(2 * n - 1, function(x, y) return x + y end, 0)\nlocal stCol = SegTree.new(2 * n - 1, function(x, y) return x + y end, 0)\nlocal tasks = {{1, 0, 0}}\nlocal done = 0\nwhile done < 2 * n - 1 do\n done = done + 1\n local src, sval, scol = tasks[#tasks][1], tasks[#tasks][2], tasks[#tasks][3]\n table.remove(tasks)\n asked[src] = true\n stDepth:setValue(done, src, true)\n stLen:setValue(done, sval, true)\n segpos[src] = done\n if 1 < done then table.insert(colormap[scol], done) end\n local cs = childstep[src]\n while cs < #edge[src] do\n cs = cs + 1\n childstep[src] = cs\n local dst = edge[src][cs][1]\n if not asked[dst] then\n depth[dst] = depth[src] + 1\n table.insert(tasks, {src, edge[src][cs][3], edge[src][cs][2]})\n table.insert(tasks, {dst, -edge[src][cs][3], edge[src][cs][2]})\n break\n end\n end\nend\nstDepth:updateAll()\nstLen:updateAll()\nlocal qlist = {}\nfor i = 1, q do\n qlist[i] = {i, io.read(\"*n\", \"*n\", \"*n\", \"*n\")}\nend\ntable.sort(qlist, function(x, y) return x[2] < y[2] end)\nlocal curcol = 0\nlocal storeval = {}\nfor i = 1, q do\n local tmp = qlist[i]\n local ccol, cval, u, v = tmp[2], tmp[3], tmp[4], tmp[5]\n if curcol ~= ccol then\n -- restore\n for j = 1, #storeval do\n stLen:setValue(storeval[j][1], storeval[j][2])\n stCol:setValue(storeval[j][1], 0)\n end\n -- changecolor\n local cmap = colormap[ccol]\n storeval = {}\n for j = 1, #cmap do\n storeval[j] = {cmap[j], stLen:getValue(cmap[j])}\n if storeval[j][2] < 0 then\n stCol:setValue(cmap[j], -1)\n else\n stCol:setValue(cmap[j], 1)\n end\n stLen:setValue(cmap[j], 0)\n end\n curcol = ccol\n end\n -- get parent\n local spu, spv = segpos[u], segpos[v]\n if spv < spu then spu, spv = spv, spu end\n local spp = stDepth:getRange(spu, spv)\n local ret = 0\n if spv < spp then\n ret = ret + mab(stLen:getRange(spv + 1, spp))\n ret = ret + cval * mab(stCol:getRange(spv + 1, spp))\n elseif spp < spv then\n ret = ret + mab(stLen:getRange(spp + 1, spv))\n ret = ret + cval * mab(stCol:getRange(spp + 1, spv))\n end\n if spu < spp then\n ret = ret + mab(stLen:getRange(spu + 1, spp) + cval * stCol:getRange(spu + 1, spp))\n elseif spp < spu then\n ret = ret + mab(stLen:getRange(spp + 1, spu) + cval * stCol:getRange(spp + 1, spu))\n end\n qlist[i][6] = ret\nend\n\ntable.sort(qlist, function(x, y) return x[1] < y[1] end)\nfor i = 1, q do\n print(qlist[i][6])\nend\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere is a tree with N vertices numbered 1 to N.\nThe i-th edge in this tree connects Vertex a_i and Vertex b_i, and the color and length of that edge are c_i and d_i, respectively.\nHere the color of each edge is represented by an integer between 1 and N-1 (inclusive). The same integer corresponds to the same color, and different integers correspond to different colors.\n\nAnswer the following Q queries:\n\nQuery j (1 \\leq j \\leq Q): assuming that the length of every edge whose color is x_j is changed to y_j, find the distance between Vertex u_j and Vertex v_j. (The changes of the lengths of edges do not affect the subsequent queries.)\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq a_i, b_i \\leq N\n\n1 \\leq c_i \\leq N-1\n\n1 \\leq d_i \\leq 10^4\n\n1 \\leq x_j \\leq N-1\n\n1 \\leq y_j \\leq 10^4\n\n1 \\leq u_j < v_j \\leq N\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1 c_1 d_1\n:\na_{N-1} b_{N-1} c_{N-1} d_{N-1}\nx_1 y_1 u_1 v_1\n:\nx_Q y_Q u_Q v_Q\n\nOutput\n\nPrint Q lines. The j-th line (1 \\leq j \\leq Q) should contain the answer to Query j.\n\nSample Input 1\n\n5 3\n1 2 1 10\n1 3 2 20\n2 4 4 30\n5 2 1 40\n1 100 1 4\n1 100 1 5\n3 1000 3 4\n\nSample Output 1\n\n130\n200\n60\n\nThe graph in this input is as follows:\n\nHere the edges of Color 1 are shown as solid red lines, the edge of Color 2 is shown as a bold green line, and the edge of Color 4 is shown as a blue dashed line.\n\nQuery 1: Assuming that the length of every edge whose color is 1 is changed to 100, the distance between Vertex 1 and Vertex 4 is 100 + 30 = 130.\n\nQuery 2: Assuming that the length of every edge whose color is 1 is changed to 100, the distance between Vertex 1 and Vertex 5 is 100 + 100 = 200.\n\nQuery 3: Assuming that the length of every edge whose color is 3 is changed to 1000 (there is no such edge), the distance between Vertex 3 and Vertex 4 is 20 + 10 + 30 = 60. Note that the edges of Color 1 now have their original lengths.", "sample_input": "5 3\n1 2 1 10\n1 3 2 20\n2 4 4 30\n5 2 1 40\n1 100 1 4\n1 100 1 5\n3 1000 3 4\n"}, "reference_outputs": ["130\n200\n60\n"], "source_document_id": "p02986", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere is a tree with N vertices numbered 1 to N.\nThe i-th edge in this tree connects Vertex a_i and Vertex b_i, and the color and length of that edge are c_i and d_i, respectively.\nHere the color of each edge is represented by an integer between 1 and N-1 (inclusive). The same integer corresponds to the same color, and different integers correspond to different colors.\n\nAnswer the following Q queries:\n\nQuery j (1 \\leq j \\leq Q): assuming that the length of every edge whose color is x_j is changed to y_j, find the distance between Vertex u_j and Vertex v_j. (The changes of the lengths of edges do not affect the subsequent queries.)\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq a_i, b_i \\leq N\n\n1 \\leq c_i \\leq N-1\n\n1 \\leq d_i \\leq 10^4\n\n1 \\leq x_j \\leq N-1\n\n1 \\leq y_j \\leq 10^4\n\n1 \\leq u_j < v_j \\leq N\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1 c_1 d_1\n:\na_{N-1} b_{N-1} c_{N-1} d_{N-1}\nx_1 y_1 u_1 v_1\n:\nx_Q y_Q u_Q v_Q\n\nOutput\n\nPrint Q lines. The j-th line (1 \\leq j \\leq Q) should contain the answer to Query j.\n\nSample Input 1\n\n5 3\n1 2 1 10\n1 3 2 20\n2 4 4 30\n5 2 1 40\n1 100 1 4\n1 100 1 5\n3 1000 3 4\n\nSample Output 1\n\n130\n200\n60\n\nThe graph in this input is as follows:\n\nHere the edges of Color 1 are shown as solid red lines, the edge of Color 2 is shown as a bold green line, and the edge of Color 4 is shown as a blue dashed line.\n\nQuery 1: Assuming that the length of every edge whose color is 1 is changed to 100, the distance between Vertex 1 and Vertex 4 is 100 + 30 = 130.\n\nQuery 2: Assuming that the length of every edge whose color is 1 is changed to 100, the distance between Vertex 1 and Vertex 5 is 100 + 100 = 200.\n\nQuery 3: Assuming that the length of every edge whose color is 3 is changed to 1000 (there is no such edge), the distance between Vertex 3 and Vertex 4 is 20 + 10 + 30 = 60. Note that the edges of Color 1 now have their original lengths.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5341, "cpu_time_ms": 2227, "memory_kb": 136348}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s147840366", "group_id": "codeNet:p02987", "input_text": "local s = io.read(\"l\")\nlocal a, b, c, d = string.byte(s, 1, 4)\nif ((a == b) and (c == d)) or\n ((a == c) and (b == d)) or\n ((a == d) and (b == c)) then\n if (a == b) and (a == c) then\n print(\"No\")\n else\n print(\"Yes\")\n end\nelse\n print(\"No\")\nend\n", "language": "Lua", "metadata": {"date": 1565811112, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02987.html", "problem_id": "p02987", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02987/input.txt", "sample_output_relpath": "derived/input_output/data/p02987/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02987/Lua/s147840366.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s147840366", "user_id": "u162773977"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local s = io.read(\"l\")\nlocal a, b, c, d = string.byte(s, 1, 4)\nif ((a == b) and (c == d)) or\n ((a == c) and (b == d)) or\n ((a == d) and (b == c)) then\n if (a == b) and (a == c) then\n print(\"No\")\n else\n print(\"Yes\")\n end\nelse\n print(\"No\")\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a 4-character string S consisting of uppercase English letters.\nDetermine if S consists of exactly two kinds of characters which both appear twice in S.\n\nConstraints\n\nThe length of S is 4.\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.\n\nSample Input 1\n\nASSA\n\nSample Output 1\n\nYes\n\nS consists of A and S which both appear twice in S.\n\nSample Input 2\n\nSTOP\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nFFEE\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nFREE\n\nSample Output 4\n\nNo", "sample_input": "ASSA\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02987", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a 4-character string S consisting of uppercase English letters.\nDetermine if S consists of exactly two kinds of characters which both appear twice in S.\n\nConstraints\n\nThe length of S is 4.\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.\n\nSample Input 1\n\nASSA\n\nSample Output 1\n\nYes\n\nS consists of A and S which both appear twice in S.\n\nSample Input 2\n\nSTOP\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nFFEE\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nFREE\n\nSample Output 4\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s365274634", "group_id": "codeNet:p02988", "input_text": "local n = io.read(\"n\")\nlocal prev = io.read(\"n\") -- 1\nlocal cur = io.read(\"n\") -- 2\nlocal count = 0\nfor i=3,n do\n local next = io.read(\"n\")\n if (prev < cur and cur < next) or (next < cur and cur < prev) then\n count = count + 1\n end\nend\nprint(count)", "language": "Lua", "metadata": {"date": 1565842771, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02988.html", "problem_id": "p02988", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02988/input.txt", "sample_output_relpath": "derived/input_output/data/p02988/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02988/Lua/s365274634.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s365274634", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n = io.read(\"n\")\nlocal prev = io.read(\"n\") -- 1\nlocal cur = io.read(\"n\") -- 2\nlocal count = 0\nfor i=3,n do\n local next = io.read(\"n\")\n if (prev < cur and cur < next) or (next < cur and cur < prev) then\n count = count + 1\n end\nend\nprint(count)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a permutation p = {p_1,\\ p_2,\\ ...,\\ p_n} of {1,\\ 2,\\ ...,\\ n}.\n\nPrint the number of elements p_i (1 < i < n) that satisfy the following condition:\n\np_i is the second smallest number among the three numbers p_{i - 1}, p_i, and p_{i + 1}.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq n \\leq 20\n\np is a permutation of {1,\\ 2,\\ ...,\\ n}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\np_1 p_2 ... p_n\n\nOutput\n\nPrint the number of elements p_i (1 < i < n) that satisfy the condition.\n\nSample Input 1\n\n5\n1 3 5 4 2\n\nSample Output 1\n\n2\n\np_2 = 3 is the second smallest number among p_1 = 1, p_2 = 3, and p_3 = 5. Also, p_4 = 4 is the second smallest number among p_3 = 5, p_4 = 4, and p_5 = 2. These two elements satisfy the condition.\n\nSample Input 2\n\n9\n9 6 3 2 5 8 7 4 1\n\nSample Output 2\n\n5", "sample_input": "5\n1 3 5 4 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02988", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a permutation p = {p_1,\\ p_2,\\ ...,\\ p_n} of {1,\\ 2,\\ ...,\\ n}.\n\nPrint the number of elements p_i (1 < i < n) that satisfy the following condition:\n\np_i is the second smallest number among the three numbers p_{i - 1}, p_i, and p_{i + 1}.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq n \\leq 20\n\np is a permutation of {1,\\ 2,\\ ...,\\ n}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\np_1 p_2 ... p_n\n\nOutput\n\nPrint the number of elements p_i (1 < i < n) that satisfy the condition.\n\nSample Input 1\n\n5\n1 3 5 4 2\n\nSample Output 1\n\n2\n\np_2 = 3 is the second smallest number among p_1 = 1, p_2 = 3, and p_3 = 5. Also, p_4 = 4 is the second smallest number among p_3 = 5, p_4 = 4, and p_5 = 2. These two elements satisfy the condition.\n\nSample Input 2\n\n9\n9 6 3 2 5 8 7 4 1\n\nSample Output 2\n\n5", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s073162186", "group_id": "codeNet:p02991", "input_text": "local n, m = io.read(\"*n\", \"*n\")\nlocal edge = {}\nfor i = 1, n do edge[i] = {} end\nfor i = 1, m do\n local u, v = io.read(\"*n\", \"*n\")\n table.insert(edge[u], v)\nend\nlocal s, t = io.read(\"*n\", \"*n\")\n\nlocal len = {}\nfor i = 1, 3 * n do\n len[i] = -1\nend\nlocal start_idx = (s - 1) * 3 + 1\nlen[start_idx] = 0\n\n\nlocal taskstate = {}\nfor i = 1, 3 * n do taskstate[i] = false end\nlocal tasks = {}\nlocal tasknum = 0\nlocal done = 0\nlocal tasklim = 3 * n\n\nlocal function addtask(idx)\n if not taskstate[idx] then\n taskstate[idx] = true\n tasknum = tasknum + 1\n local taskidx = tasknum % tasklim\n if taskidx == 0 then taskidx = tasklim end\n tasks[taskidx] = idx\n end\nend\n\nlocal function walk(src, dst)\n if len[dst] < 0 or len[src] + 1 < len[dst] then\n len[dst] = len[src] + 1\n addtask(dst)\n end\nend\n\naddtask(start_idx)\nlocal mfl = math.floor\n\nwhile done < tasknum do\n done = done + 1\n local taskidx = done % tasklim\n if taskidx == 0 then taskidx = tasklim end\n local srcidx = tasks[taskidx]\n taskstate[srcidx] = false\n local pos = 1 + mfl((srcidx - 1) / 3)\n local rem = srcidx - (pos - 1) * 3\n local dstrem = rem + 1\n if dstrem == 4 then dstrem = 1 end\n for i = 1, #edge[pos] do\n local dstpos = edge[pos][i]\n local dstidx = (dstpos - 1) * 3 + dstrem\n walk(srcidx, dstidx)\n end\nend\nlocal goal_idx = (t - 1) * 3 + 1\nlocal ret = len[goal_idx]\nif 0 < ret then ret = math.floor(ret / 3) end\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1567048593, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02991.html", "problem_id": "p02991", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02991/input.txt", "sample_output_relpath": "derived/input_output/data/p02991/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02991/Lua/s073162186.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s073162186", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n, m = io.read(\"*n\", \"*n\")\nlocal edge = {}\nfor i = 1, n do edge[i] = {} end\nfor i = 1, m do\n local u, v = io.read(\"*n\", \"*n\")\n table.insert(edge[u], v)\nend\nlocal s, t = io.read(\"*n\", \"*n\")\n\nlocal len = {}\nfor i = 1, 3 * n do\n len[i] = -1\nend\nlocal start_idx = (s - 1) * 3 + 1\nlen[start_idx] = 0\n\n\nlocal taskstate = {}\nfor i = 1, 3 * n do taskstate[i] = false end\nlocal tasks = {}\nlocal tasknum = 0\nlocal done = 0\nlocal tasklim = 3 * n\n\nlocal function addtask(idx)\n if not taskstate[idx] then\n taskstate[idx] = true\n tasknum = tasknum + 1\n local taskidx = tasknum % tasklim\n if taskidx == 0 then taskidx = tasklim end\n tasks[taskidx] = idx\n end\nend\n\nlocal function walk(src, dst)\n if len[dst] < 0 or len[src] + 1 < len[dst] then\n len[dst] = len[src] + 1\n addtask(dst)\n end\nend\n\naddtask(start_idx)\nlocal mfl = math.floor\n\nwhile done < tasknum do\n done = done + 1\n local taskidx = done % tasklim\n if taskidx == 0 then taskidx = tasklim end\n local srcidx = tasks[taskidx]\n taskstate[srcidx] = false\n local pos = 1 + mfl((srcidx - 1) / 3)\n local rem = srcidx - (pos - 1) * 3\n local dstrem = rem + 1\n if dstrem == 4 then dstrem = 1 end\n for i = 1, #edge[pos] do\n local dstpos = edge[pos][i]\n local dstidx = (dstpos - 1) * 3 + dstrem\n walk(srcidx, dstidx)\n end\nend\nlocal goal_idx = (t - 1) * 3 + 1\nlocal ret = len[goal_idx]\nif 0 < ret then ret = math.floor(ret / 3) end\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nKen loves ken-ken-pa (Japanese version of hopscotch). Today, he will play it on a directed graph G.\nG consists of N vertices numbered 1 to N, and M edges. The i-th edge points from Vertex u_i to Vertex v_i.\n\nFirst, Ken stands on Vertex S. He wants to reach Vertex T by repeating ken-ken-pa. In one ken-ken-pa, he does the following exactly three times: follow an edge pointing from the vertex on which he is standing.\n\nDetermine if he can reach Vertex T by repeating ken-ken-pa. If the answer is yes, find the minimum number of ken-ken-pa needed to reach Vertex T. Note that visiting Vertex T in the middle of a ken-ken-pa does not count as reaching Vertex T by repeating ken-ken-pa.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq M \\leq \\min(10^5, N (N-1))\n\n1 \\leq u_i, v_i \\leq N(1 \\leq i \\leq M)\n\nu_i \\neq v_i (1 \\leq i \\leq M)\n\nIf i \\neq j, (u_i, v_i) \\neq (u_j, v_j).\n\n1 \\leq S, T \\leq N\n\nS \\neq T\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nu_1 v_1\n:\nu_M v_M\nS T\n\nOutput\n\nIf Ken cannot reach Vertex T from Vertex S by repeating ken-ken-pa, print -1.\nIf he can, print the minimum number of ken-ken-pa needed to reach vertex T.\n\nSample Input 1\n\n4 4\n1 2\n2 3\n3 4\n4 1\n1 3\n\nSample Output 1\n\n2\n\nKen can reach Vertex 3 from Vertex 1 in two ken-ken-pa, as follows: 1 \\rightarrow 2 \\rightarrow 3 \\rightarrow 4 in the first ken-ken-pa, then 4 \\rightarrow 1 \\rightarrow 2 \\rightarrow 3 in the second ken-ken-pa. This is the minimum number of ken-ken-pa needed.\n\nSample Input 2\n\n3 3\n1 2\n2 3\n3 1\n1 2\n\nSample Output 2\n\n-1\n\nAny number of ken-ken-pa will bring Ken back to Vertex 1, so he cannot reach Vertex 2, though he can pass through it in the middle of a ken-ken-pa.\n\nSample Input 3\n\n2 0\n1 2\n\nSample Output 3\n\n-1\n\nVertex S and Vertex T may be disconnected.\n\nSample Input 4\n\n6 8\n1 2\n2 3\n3 4\n4 5\n5 1\n1 4\n1 5\n4 6\n1 6\n\nSample Output 4\n\n2", "sample_input": "4 4\n1 2\n2 3\n3 4\n4 1\n1 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02991", "source_text": "Score : 500 points\n\nProblem Statement\n\nKen loves ken-ken-pa (Japanese version of hopscotch). Today, he will play it on a directed graph G.\nG consists of N vertices numbered 1 to N, and M edges. The i-th edge points from Vertex u_i to Vertex v_i.\n\nFirst, Ken stands on Vertex S. He wants to reach Vertex T by repeating ken-ken-pa. In one ken-ken-pa, he does the following exactly three times: follow an edge pointing from the vertex on which he is standing.\n\nDetermine if he can reach Vertex T by repeating ken-ken-pa. If the answer is yes, find the minimum number of ken-ken-pa needed to reach Vertex T. Note that visiting Vertex T in the middle of a ken-ken-pa does not count as reaching Vertex T by repeating ken-ken-pa.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq M \\leq \\min(10^5, N (N-1))\n\n1 \\leq u_i, v_i \\leq N(1 \\leq i \\leq M)\n\nu_i \\neq v_i (1 \\leq i \\leq M)\n\nIf i \\neq j, (u_i, v_i) \\neq (u_j, v_j).\n\n1 \\leq S, T \\leq N\n\nS \\neq T\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nu_1 v_1\n:\nu_M v_M\nS T\n\nOutput\n\nIf Ken cannot reach Vertex T from Vertex S by repeating ken-ken-pa, print -1.\nIf he can, print the minimum number of ken-ken-pa needed to reach vertex T.\n\nSample Input 1\n\n4 4\n1 2\n2 3\n3 4\n4 1\n1 3\n\nSample Output 1\n\n2\n\nKen can reach Vertex 3 from Vertex 1 in two ken-ken-pa, as follows: 1 \\rightarrow 2 \\rightarrow 3 \\rightarrow 4 in the first ken-ken-pa, then 4 \\rightarrow 1 \\rightarrow 2 \\rightarrow 3 in the second ken-ken-pa. This is the minimum number of ken-ken-pa needed.\n\nSample Input 2\n\n3 3\n1 2\n2 3\n3 1\n1 2\n\nSample Output 2\n\n-1\n\nAny number of ken-ken-pa will bring Ken back to Vertex 1, so he cannot reach Vertex 2, though he can pass through it in the middle of a ken-ken-pa.\n\nSample Input 3\n\n2 0\n1 2\n\nSample Output 3\n\n-1\n\nVertex S and Vertex T may be disconnected.\n\nSample Input 4\n\n6 8\n1 2\n2 3\n3 4\n4 5\n5 1\n1 4\n1 5\n4 6\n1 6\n\nSample Output 4\n\n2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1428, "cpu_time_ms": 99, "memory_kb": 22372}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s646349658", "group_id": "codeNet:p02995", "input_text": "local function gcd(a,b)\n if b == 0 then\n return a\n else\n return gcd(b, a % b)\n end\nend\n\nlocal function gcdmany(tbl)\n local ans = tbl[1]\n for i=2,#tbl do\n ans = gcd(ans, tbl[i])\n end\n return ans\nend\n\nlocal function lcm(a, b)\n return a // gcd(a, b) * b\nend\n\nlocal function lcmmany(tbl)\n local ans = tbl[1]\n for i=2, #tbl do\n ans = lcm(ans, tbl[i])\n end\n return ans\nend\n\n---\nlocal A, B, C, D = io.read(\"n\", \"n\", \"n\", \"n\")\nlocal function candiv(x)\n return (B // x) - ((A-1) // x)\nend\nlocal total = B - A + 1\nlocal c_div = candiv(C)\nlocal d_div = candiv(D)\nlocal cd_lcm = lcm(C, D)\nlocal cd_div = candiv(cd_lcm)\nlocal ans = total - c_div - d_div + cd_div\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1565770648, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02995.html", "problem_id": "p02995", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02995/input.txt", "sample_output_relpath": "derived/input_output/data/p02995/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02995/Lua/s646349658.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s646349658", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local function gcd(a,b)\n if b == 0 then\n return a\n else\n return gcd(b, a % b)\n end\nend\n\nlocal function gcdmany(tbl)\n local ans = tbl[1]\n for i=2,#tbl do\n ans = gcd(ans, tbl[i])\n end\n return ans\nend\n\nlocal function lcm(a, b)\n return a // gcd(a, b) * b\nend\n\nlocal function lcmmany(tbl)\n local ans = tbl[1]\n for i=2, #tbl do\n ans = lcm(ans, tbl[i])\n end\n return ans\nend\n\n---\nlocal A, B, C, D = io.read(\"n\", \"n\", \"n\", \"n\")\nlocal function candiv(x)\n return (B // x) - ((A-1) // x)\nend\nlocal total = B - A + 1\nlocal c_div = candiv(C)\nlocal d_div = candiv(D)\nlocal cd_lcm = lcm(C, D)\nlocal cd_div = candiv(cd_lcm)\nlocal ans = total - c_div - d_div + cd_div\nprint(ans)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given four integers A, B, C, and D. Find the number of integers between A and B (inclusive) that can be evenly divided by neither C nor D.\n\nConstraints\n\n1\\leq A\\leq B\\leq 10^{18}\n\n1\\leq C,D\\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint the number of integers between A and B (inclusive) that can be evenly divided by neither C nor D.\n\nSample Input 1\n\n4 9 2 3\n\nSample Output 1\n\n2\n\n5 and 7 satisfy the condition.\n\nSample Input 2\n\n10 40 6 8\n\nSample Output 2\n\n23\n\nSample Input 3\n\n314159265358979323 846264338327950288 419716939 937510582\n\nSample Output 3\n\n532105071133627368", "sample_input": "4 9 2 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02995", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given four integers A, B, C, and D. Find the number of integers between A and B (inclusive) that can be evenly divided by neither C nor D.\n\nConstraints\n\n1\\leq A\\leq B\\leq 10^{18}\n\n1\\leq C,D\\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint the number of integers between A and B (inclusive) that can be evenly divided by neither C nor D.\n\nSample Input 1\n\n4 9 2 3\n\nSample Output 1\n\n2\n\n5 and 7 satisfy the condition.\n\nSample Input 2\n\n10 40 6 8\n\nSample Output 2\n\n23\n\nSample Input 3\n\n314159265358979323 846264338327950288 419716939 937510582\n\nSample Output 3\n\n532105071133627368", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s337879946", "group_id": "codeNet:p02996", "input_text": "local n=io.read(\"*n\")\nlocal works={}\nfor i=1,n do\n works[i]={io.read(\"*n\",\"*n\")}\nend\ntable.sort(works,function(a,b)\n return a[2]works[i][2] then\n print(\"No\")\n return\n end\nend\nprint(\"Yes\")", "language": "Lua", "metadata": {"date": 1589874182, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02996.html", "problem_id": "p02996", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02996/input.txt", "sample_output_relpath": "derived/input_output/data/p02996/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02996/Lua/s337879946.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s337879946", "user_id": "u045238009"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local n=io.read(\"*n\")\nlocal works={}\nfor i=1,n do\n works[i]={io.read(\"*n\",\"*n\")}\nend\ntable.sort(works,function(a,b)\n return a[2]works[i][2] then\n print(\"No\")\n return\n end\nend\nprint(\"Yes\")", "problem_context": "Score: 400 points\n\nProblem Statement\n\nKizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.\n\nLet the current time be time 0. Kizahashi has N jobs numbered 1 to N.\n\nIt takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.\n\nKizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.\n\nCan Kizahashi complete all the jobs in time? If he can, print Yes; if he cannot, print No.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i, B_i \\leq 10^9 (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n.\n.\n.\nA_N B_N\n\nOutput\n\nIf Kizahashi can complete all the jobs in time, print Yes; if he cannot, print No.\n\nSample Input 1\n\n5\n2 4\n1 9\n1 8\n4 9\n3 12\n\nSample Output 1\n\nYes\n\nHe can complete all the jobs in time by, for example, doing them in the following order:\n\nDo Job 2 from time 0 to 1.\n\nDo Job 1 from time 1 to 3.\n\nDo Job 4 from time 3 to 7.\n\nDo Job 3 from time 7 to 8.\n\nDo Job 5 from time 8 to 11.\n\nNote that it is fine to complete Job 3 exactly at the deadline, time 8.\n\nSample Input 2\n\n3\n334 1000\n334 1000\n334 1000\n\nSample Output 2\n\nNo\n\nHe cannot complete all the jobs in time, no matter what order he does them in.\n\nSample Input 3\n\n30\n384 8895\n1725 9791\n170 1024\n4 11105\n2 6\n578 1815\n702 3352\n143 5141\n1420 6980\n24 1602\n849 999\n76 7586\n85 5570\n444 4991\n719 11090\n470 10708\n1137 4547\n455 9003\n110 9901\n15 8578\n368 3692\n104 1286\n3 4\n366 12143\n7 6649\n610 2374\n152 7324\n4 7042\n292 11386\n334 5720\n\nSample Output 3\n\nYes", "sample_input": "5\n2 4\n1 9\n1 8\n4 9\n3 12\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02996", "source_text": "Score: 400 points\n\nProblem Statement\n\nKizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.\n\nLet the current time be time 0. Kizahashi has N jobs numbered 1 to N.\n\nIt takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.\n\nKizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.\n\nCan Kizahashi complete all the jobs in time? If he can, print Yes; if he cannot, print No.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i, B_i \\leq 10^9 (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n.\n.\n.\nA_N B_N\n\nOutput\n\nIf Kizahashi can complete all the jobs in time, print Yes; if he cannot, print No.\n\nSample Input 1\n\n5\n2 4\n1 9\n1 8\n4 9\n3 12\n\nSample Output 1\n\nYes\n\nHe can complete all the jobs in time by, for example, doing them in the following order:\n\nDo Job 2 from time 0 to 1.\n\nDo Job 1 from time 1 to 3.\n\nDo Job 4 from time 3 to 7.\n\nDo Job 3 from time 7 to 8.\n\nDo Job 5 from time 8 to 11.\n\nNote that it is fine to complete Job 3 exactly at the deadline, time 8.\n\nSample Input 2\n\n3\n334 1000\n334 1000\n334 1000\n\nSample Output 2\n\nNo\n\nHe cannot complete all the jobs in time, no matter what order he does them in.\n\nSample Input 3\n\n30\n384 8895\n1725 9791\n170 1024\n4 11105\n2 6\n578 1815\n702 3352\n143 5141\n1420 6980\n24 1602\n849 999\n76 7586\n85 5570\n444 4991\n719 11090\n470 10708\n1137 4547\n455 9003\n110 9901\n15 8578\n368 3692\n104 1286\n3 4\n366 12143\n7 6649\n610 2374\n152 7324\n4 7042\n292 11386\n334 5720\n\nSample Output 3\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 346, "memory_kb": 14844}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s174846998", "group_id": "codeNet:p02996", "input_text": "--締切の早いやつからやるべき？\nlocal n=io.read(\"*n\")\nlocal works={}\nfor i=1,n do\n works[i]={io.read(\"*n\",\"*n\")}\nend\ntable.sort(works,function(a,b)\n return a[2]works[i][2] then\n print(\"No\")\n return\n end\nend\nprint(\"Yes\")", "language": "Lua", "metadata": {"date": 1589873842, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02996.html", "problem_id": "p02996", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02996/input.txt", "sample_output_relpath": "derived/input_output/data/p02996/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02996/Lua/s174846998.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s174846998", "user_id": "u045238009"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "--締切の早いやつからやるべき？\nlocal n=io.read(\"*n\")\nlocal works={}\nfor i=1,n do\n works[i]={io.read(\"*n\",\"*n\")}\nend\ntable.sort(works,function(a,b)\n return a[2]works[i][2] then\n print(\"No\")\n return\n end\nend\nprint(\"Yes\")", "problem_context": "Score: 400 points\n\nProblem Statement\n\nKizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.\n\nLet the current time be time 0. Kizahashi has N jobs numbered 1 to N.\n\nIt takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.\n\nKizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.\n\nCan Kizahashi complete all the jobs in time? If he can, print Yes; if he cannot, print No.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i, B_i \\leq 10^9 (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n.\n.\n.\nA_N B_N\n\nOutput\n\nIf Kizahashi can complete all the jobs in time, print Yes; if he cannot, print No.\n\nSample Input 1\n\n5\n2 4\n1 9\n1 8\n4 9\n3 12\n\nSample Output 1\n\nYes\n\nHe can complete all the jobs in time by, for example, doing them in the following order:\n\nDo Job 2 from time 0 to 1.\n\nDo Job 1 from time 1 to 3.\n\nDo Job 4 from time 3 to 7.\n\nDo Job 3 from time 7 to 8.\n\nDo Job 5 from time 8 to 11.\n\nNote that it is fine to complete Job 3 exactly at the deadline, time 8.\n\nSample Input 2\n\n3\n334 1000\n334 1000\n334 1000\n\nSample Output 2\n\nNo\n\nHe cannot complete all the jobs in time, no matter what order he does them in.\n\nSample Input 3\n\n30\n384 8895\n1725 9791\n170 1024\n4 11105\n2 6\n578 1815\n702 3352\n143 5141\n1420 6980\n24 1602\n849 999\n76 7586\n85 5570\n444 4991\n719 11090\n470 10708\n1137 4547\n455 9003\n110 9901\n15 8578\n368 3692\n104 1286\n3 4\n366 12143\n7 6649\n610 2374\n152 7324\n4 7042\n292 11386\n334 5720\n\nSample Output 3\n\nYes", "sample_input": "5\n2 4\n1 9\n1 8\n4 9\n3 12\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02996", "source_text": "Score: 400 points\n\nProblem Statement\n\nKizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.\n\nLet the current time be time 0. Kizahashi has N jobs numbered 1 to N.\n\nIt takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.\n\nKizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.\n\nCan Kizahashi complete all the jobs in time? If he can, print Yes; if he cannot, print No.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i, B_i \\leq 10^9 (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n.\n.\n.\nA_N B_N\n\nOutput\n\nIf Kizahashi can complete all the jobs in time, print Yes; if he cannot, print No.\n\nSample Input 1\n\n5\n2 4\n1 9\n1 8\n4 9\n3 12\n\nSample Output 1\n\nYes\n\nHe can complete all the jobs in time by, for example, doing them in the following order:\n\nDo Job 2 from time 0 to 1.\n\nDo Job 1 from time 1 to 3.\n\nDo Job 4 from time 3 to 7.\n\nDo Job 3 from time 7 to 8.\n\nDo Job 5 from time 8 to 11.\n\nNote that it is fine to complete Job 3 exactly at the deadline, time 8.\n\nSample Input 2\n\n3\n334 1000\n334 1000\n334 1000\n\nSample Output 2\n\nNo\n\nHe cannot complete all the jobs in time, no matter what order he does them in.\n\nSample Input 3\n\n30\n384 8895\n1725 9791\n170 1024\n4 11105\n2 6\n578 1815\n702 3352\n143 5141\n1420 6980\n24 1602\n849 999\n76 7586\n85 5570\n444 4991\n719 11090\n470 10708\n1137 4547\n455 9003\n110 9901\n15 8578\n368 3692\n104 1286\n3 4\n366 12143\n7 6649\n610 2374\n152 7324\n4 7042\n292 11386\n334 5720\n\nSample Output 3\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 335, "cpu_time_ms": 681, "memory_kb": 26360}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s620766290", "group_id": "codeNet:p02996", "input_text": "local n = io.read(\"*n\")\nlocal a, b = {}, {}\nlocal idx = {}\nfor i = 1, n do\n a[i], b[i] = io.read(\"*n\", \"*n\")\n idx[i] = i\nend\ntable.sort(idx, function(x, y) return b[x] < b[y] end)\nlocal cur = 0\nlocal valid = true\nfor i = 1, n do\n local ai, bi = a[idx[i]], b[idx[i]]\n if bi < cur + ai then\n valid = false break\n end\n cur = cur + ai\nend\nprint(valid and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1589645377, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02996.html", "problem_id": "p02996", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02996/input.txt", "sample_output_relpath": "derived/input_output/data/p02996/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02996/Lua/s620766290.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s620766290", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal a, b = {}, {}\nlocal idx = {}\nfor i = 1, n do\n a[i], b[i] = io.read(\"*n\", \"*n\")\n idx[i] = i\nend\ntable.sort(idx, function(x, y) return b[x] < b[y] end)\nlocal cur = 0\nlocal valid = true\nfor i = 1, n do\n local ai, bi = a[idx[i]], b[idx[i]]\n if bi < cur + ai then\n valid = false break\n end\n cur = cur + ai\nend\nprint(valid and \"Yes\" or \"No\")\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nKizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.\n\nLet the current time be time 0. Kizahashi has N jobs numbered 1 to N.\n\nIt takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.\n\nKizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.\n\nCan Kizahashi complete all the jobs in time? If he can, print Yes; if he cannot, print No.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i, B_i \\leq 10^9 (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n.\n.\n.\nA_N B_N\n\nOutput\n\nIf Kizahashi can complete all the jobs in time, print Yes; if he cannot, print No.\n\nSample Input 1\n\n5\n2 4\n1 9\n1 8\n4 9\n3 12\n\nSample Output 1\n\nYes\n\nHe can complete all the jobs in time by, for example, doing them in the following order:\n\nDo Job 2 from time 0 to 1.\n\nDo Job 1 from time 1 to 3.\n\nDo Job 4 from time 3 to 7.\n\nDo Job 3 from time 7 to 8.\n\nDo Job 5 from time 8 to 11.\n\nNote that it is fine to complete Job 3 exactly at the deadline, time 8.\n\nSample Input 2\n\n3\n334 1000\n334 1000\n334 1000\n\nSample Output 2\n\nNo\n\nHe cannot complete all the jobs in time, no matter what order he does them in.\n\nSample Input 3\n\n30\n384 8895\n1725 9791\n170 1024\n4 11105\n2 6\n578 1815\n702 3352\n143 5141\n1420 6980\n24 1602\n849 999\n76 7586\n85 5570\n444 4991\n719 11090\n470 10708\n1137 4547\n455 9003\n110 9901\n15 8578\n368 3692\n104 1286\n3 4\n366 12143\n7 6649\n610 2374\n152 7324\n4 7042\n292 11386\n334 5720\n\nSample Output 3\n\nYes", "sample_input": "5\n2 4\n1 9\n1 8\n4 9\n3 12\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02996", "source_text": "Score: 400 points\n\nProblem Statement\n\nKizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.\n\nLet the current time be time 0. Kizahashi has N jobs numbered 1 to N.\n\nIt takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.\n\nKizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.\n\nCan Kizahashi complete all the jobs in time? If he can, print Yes; if he cannot, print No.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i, B_i \\leq 10^9 (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n.\n.\n.\nA_N B_N\n\nOutput\n\nIf Kizahashi can complete all the jobs in time, print Yes; if he cannot, print No.\n\nSample Input 1\n\n5\n2 4\n1 9\n1 8\n4 9\n3 12\n\nSample Output 1\n\nYes\n\nHe can complete all the jobs in time by, for example, doing them in the following order:\n\nDo Job 2 from time 0 to 1.\n\nDo Job 1 from time 1 to 3.\n\nDo Job 4 from time 3 to 7.\n\nDo Job 3 from time 7 to 8.\n\nDo Job 5 from time 8 to 11.\n\nNote that it is fine to complete Job 3 exactly at the deadline, time 8.\n\nSample Input 2\n\n3\n334 1000\n334 1000\n334 1000\n\nSample Output 2\n\nNo\n\nHe cannot complete all the jobs in time, no matter what order he does them in.\n\nSample Input 3\n\n30\n384 8895\n1725 9791\n170 1024\n4 11105\n2 6\n578 1815\n702 3352\n143 5141\n1420 6980\n24 1602\n849 999\n76 7586\n85 5570\n444 4991\n719 11090\n470 10708\n1137 4547\n455 9003\n110 9901\n15 8578\n368 3692\n104 1286\n3 4\n366 12143\n7 6649\n610 2374\n152 7324\n4 7042\n292 11386\n334 5720\n\nSample Output 3\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 375, "cpu_time_ms": 588, "memory_kb": 12664}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s035925427", "group_id": "codeNet:p02998", "input_text": "local n = io.read(\"*n\")\n\nlocal parent = {}\nfor i = 1, 2 * n do parent[i] = i end\n\nlocal function uf_findroot(idx)\n local idx_update = idx\n while parent[idx] ~= idx do\n idx = parent[idx]\n end\n while parent[idx_update] ~= idx do\n parent[idx_update], idx_update = idx, parent[idx_update]\n end\n return idx\nend\n\nlocal x, y = {}, {}\nlocal xinvmap, yinvmap = {}, {}\nlocal xary, yary = {}, {}\nfor i = 1, n do\n x[i], y[i] = io.read(\"*n\", \"*n\")\n if not xinvmap[x[i]] then\n table.insert(xary, x[i])\n xinvmap[x[i]] = #xary\n end\n if not yinvmap[y[i]] then\n table.insert(yary, y[i])\n yinvmap[y[i]] = n + #yary\n end\nend\n\nfor i = 1, n do\n local xi, yi = x[i], y[i]\n local idx1, idx2 = xinvmap[xi], yinvmap[yi]\n local p1, p2 = uf_findroot(idx1), uf_findroot(idx2)\n parent[p2], parent[idx2] = p1, p1\nend\nlocal groups = {}\nfor i = 1, 2 * n do\n local p = uf_findroot(i)\n if not groups[p] then\n groups[p] = {}\n groups[p].xcnt = 0\n groups[p].ycnt = 0\n groups[p].pointcnt = 0\n end\n if i <= n then\n groups[p].xcnt = groups[p].xcnt + 1\n else\n groups[p].ycnt = groups[p].ycnt + 1\n end\nend\nfor i = 1, n do\n local xi, yi = x[i], y[i]\n local p = uf_findroot(xinvmap[xi])\n groups[p].pointcnt = groups[p].pointcnt + 1\nend\nlocal ret = 0\nfor k, v in pairs(groups) do\n if 1 < v.xcnt and 1 < v.ycnt then\n ret = ret + v.xcnt * v.ycnt - v.pointcnt\n end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1585737491, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02998.html", "problem_id": "p02998", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02998/input.txt", "sample_output_relpath": "derived/input_output/data/p02998/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02998/Lua/s035925427.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s035925427", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local n = io.read(\"*n\")\n\nlocal parent = {}\nfor i = 1, 2 * n do parent[i] = i end\n\nlocal function uf_findroot(idx)\n local idx_update = idx\n while parent[idx] ~= idx do\n idx = parent[idx]\n end\n while parent[idx_update] ~= idx do\n parent[idx_update], idx_update = idx, parent[idx_update]\n end\n return idx\nend\n\nlocal x, y = {}, {}\nlocal xinvmap, yinvmap = {}, {}\nlocal xary, yary = {}, {}\nfor i = 1, n do\n x[i], y[i] = io.read(\"*n\", \"*n\")\n if not xinvmap[x[i]] then\n table.insert(xary, x[i])\n xinvmap[x[i]] = #xary\n end\n if not yinvmap[y[i]] then\n table.insert(yary, y[i])\n yinvmap[y[i]] = n + #yary\n end\nend\n\nfor i = 1, n do\n local xi, yi = x[i], y[i]\n local idx1, idx2 = xinvmap[xi], yinvmap[yi]\n local p1, p2 = uf_findroot(idx1), uf_findroot(idx2)\n parent[p2], parent[idx2] = p1, p1\nend\nlocal groups = {}\nfor i = 1, 2 * n do\n local p = uf_findroot(i)\n if not groups[p] then\n groups[p] = {}\n groups[p].xcnt = 0\n groups[p].ycnt = 0\n groups[p].pointcnt = 0\n end\n if i <= n then\n groups[p].xcnt = groups[p].xcnt + 1\n else\n groups[p].ycnt = groups[p].ycnt + 1\n end\nend\nfor i = 1, n do\n local xi, yi = x[i], y[i]\n local p = uf_findroot(xinvmap[xi])\n groups[p].pointcnt = groups[p].pointcnt + 1\nend\nlocal ret = 0\nfor k, v in pairs(groups) do\n if 1 < v.xcnt and 1 < v.ycnt then\n ret = ret + v.xcnt * v.ycnt - v.pointcnt\n end\nend\nprint(ret)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere are N dots in a two-dimensional plane. The coordinates of the i-th dot are (x_i, y_i).\n\nWe will repeat the following operation as long as possible:\n\nChoose four integers a, b, c, d (a \\neq c, b \\neq d) such that there are dots at exactly three of the positions (a, b), (a, d), (c, b) and (c, d), and add a dot at the remaining position.\n\nWe can prove that we can only do this operation a finite number of times. Find the maximum number of times we can do the operation.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq x_i, y_i \\leq 10^5\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 maximum number of times we can do the operation.\n\nSample Input 1\n\n3\n1 1\n5 1\n5 5\n\nSample Output 1\n\n1\n\nBy choosing a = 1, b = 1, c = 5, d = 5, we can add a dot at (1, 5). We cannot do the operation any more, so the maximum number of operations is 1.\n\nSample Input 2\n\n2\n10 10\n20 20\n\nSample Output 2\n\n0\n\nThere are only two dots, so we cannot do the operation at all.\n\nSample Input 3\n\n9\n1 1\n2 1\n3 1\n4 1\n5 1\n1 2\n1 3\n1 4\n1 5\n\nSample Output 3\n\n16\n\nWe can do the operation for all choices of the form a = 1, b = 1, c = i, d = j (2 \\leq i,j \\leq 5), and no more. Thus, the maximum number of operations is 16.", "sample_input": "3\n1 1\n5 1\n5 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02998", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere are N dots in a two-dimensional plane. The coordinates of the i-th dot are (x_i, y_i).\n\nWe will repeat the following operation as long as possible:\n\nChoose four integers a, b, c, d (a \\neq c, b \\neq d) such that there are dots at exactly three of the positions (a, b), (a, d), (c, b) and (c, d), and add a dot at the remaining position.\n\nWe can prove that we can only do this operation a finite number of times. Find the maximum number of times we can do the operation.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq x_i, y_i \\leq 10^5\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 maximum number of times we can do the operation.\n\nSample Input 1\n\n3\n1 1\n5 1\n5 5\n\nSample Output 1\n\n1\n\nBy choosing a = 1, b = 1, c = 5, d = 5, we can add a dot at (1, 5). We cannot do the operation any more, so the maximum number of operations is 1.\n\nSample Input 2\n\n2\n10 10\n20 20\n\nSample Output 2\n\n0\n\nThere are only two dots, so we cannot do the operation at all.\n\nSample Input 3\n\n9\n1 1\n2 1\n3 1\n4 1\n5 1\n1 2\n1 3\n1 4\n1 5\n\nSample Output 3\n\n16\n\nWe can do the operation for all choices of the form a = 1, b = 1, c = i, d = j (2 \\leq i,j \\leq 5), and no more. Thus, the maximum number of operations is 16.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1396, "cpu_time_ms": 141, "memory_kb": 37620}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s692692726", "group_id": "codeNet:p02999", "input_text": "local X, A = io.read(\"n\", \"n\")\nprint(X < A and 0 or 10)", "language": "Lua", "metadata": {"date": 1565550967, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02999.html", "problem_id": "p02999", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02999/input.txt", "sample_output_relpath": "derived/input_output/data/p02999/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02999/Lua/s692692726.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s692692726", "user_id": "u162773977"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "local X, A = io.read(\"n\", \"n\")\nprint(X < A and 0 or 10)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nX and A are integers between 0 and 9 (inclusive).\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nConstraints\n\n0 \\leq X, A \\leq 9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX A\n\nOutput\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nSample Input 1\n\n3 5\n\nSample Output 1\n\n0\n\n3 is less than 5, so we should print 0.\n\nSample Input 2\n\n7 5\n\nSample Output 2\n\n10\n\n7 is not less than 5, so we should print 10.\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n10\n\n6 is not less than 6, so we should print 10.", "sample_input": "3 5\n"}, "reference_outputs": ["0\n"], "source_document_id": "p02999", "source_text": "Score : 100 points\n\nProblem Statement\n\nX and A are integers between 0 and 9 (inclusive).\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nConstraints\n\n0 \\leq X, A \\leq 9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX A\n\nOutput\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nSample Input 1\n\n3 5\n\nSample Output 1\n\n0\n\n3 is less than 5, so we should print 0.\n\nSample Input 2\n\n7 5\n\nSample Output 2\n\n10\n\n7 is not less than 5, so we should print 10.\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n10\n\n6 is not less than 6, so we should print 10.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s106016868", "group_id": "codeNet:p03000", "input_text": "local x, a = io.stdin:read();\nif x < a then print(0) else print(10) end", "language": "Lua", "metadata": {"date": 1566311824, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03000.html", "problem_id": "p03000", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03000/input.txt", "sample_output_relpath": "derived/input_output/data/p03000/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03000/Lua/s106016868.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s106016868", "user_id": "u918364989"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local x, a = io.stdin:read();\nif x < a then print(0) else print(10) end", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \\leq i \\leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.\n\nHow many times will the ball make a bounce where the coordinate is at most X?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq L_i \\leq 100\n\n1 \\leq X \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nL_1 L_2 ... L_{N-1} L_N\n\nOutput\n\nPrint the number of times the ball will make a bounce where the coordinate is at most X.\n\nSample Input 1\n\n3 6\n3 4 5\n\nSample Output 1\n\n2\n\nThe ball will make a bounce at the coordinates 0, 3, 7 and 12, among which two are less than or equal to 6.\n\nSample Input 2\n\n4 9\n3 3 3 3\n\nSample Output 2\n\n4\n\nThe ball will make a bounce at the coordinates 0, 3, 6, 9 and 12, among which four are less than or equal to 9.", "sample_input": "3 6\n3 4 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03000", "source_text": "Score : 200 points\n\nProblem Statement\n\nA ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \\leq i \\leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.\n\nHow many times will the ball make a bounce where the coordinate is at most X?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq L_i \\leq 100\n\n1 \\leq X \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nL_1 L_2 ... L_{N-1} L_N\n\nOutput\n\nPrint the number of times the ball will make a bounce where the coordinate is at most X.\n\nSample Input 1\n\n3 6\n3 4 5\n\nSample Output 1\n\n2\n\nThe ball will make a bounce at the coordinates 0, 3, 7 and 12, among which two are less than or equal to 6.\n\nSample Input 2\n\n4 9\n3 3 3 3\n\nSample Output 2\n\n4\n\nThe ball will make a bounce at the coordinates 0, 3, 6, 9 and 12, among which four are less than or equal to 9.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 376}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s036370608", "group_id": "codeNet:p03000", "input_text": "local N, X = io.read(\"n\", \"n\")\nlocal D = 0\nlocal count = 1\nfor k=1, N do\n local L = io.read(\"n\")\n D = D + L\n if D <= X then\n count = count + 1\n end\nend\nprint(count)", "language": "Lua", "metadata": {"date": 1565551245, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03000.html", "problem_id": "p03000", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03000/input.txt", "sample_output_relpath": "derived/input_output/data/p03000/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03000/Lua/s036370608.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s036370608", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local N, X = io.read(\"n\", \"n\")\nlocal D = 0\nlocal count = 1\nfor k=1, N do\n local L = io.read(\"n\")\n D = D + L\n if D <= X then\n count = count + 1\n end\nend\nprint(count)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \\leq i \\leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.\n\nHow many times will the ball make a bounce where the coordinate is at most X?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq L_i \\leq 100\n\n1 \\leq X \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nL_1 L_2 ... L_{N-1} L_N\n\nOutput\n\nPrint the number of times the ball will make a bounce where the coordinate is at most X.\n\nSample Input 1\n\n3 6\n3 4 5\n\nSample Output 1\n\n2\n\nThe ball will make a bounce at the coordinates 0, 3, 7 and 12, among which two are less than or equal to 6.\n\nSample Input 2\n\n4 9\n3 3 3 3\n\nSample Output 2\n\n4\n\nThe ball will make a bounce at the coordinates 0, 3, 6, 9 and 12, among which four are less than or equal to 9.", "sample_input": "3 6\n3 4 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03000", "source_text": "Score : 200 points\n\nProblem Statement\n\nA ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \\leq i \\leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.\n\nHow many times will the ball make a bounce where the coordinate is at most X?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq L_i \\leq 100\n\n1 \\leq X \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nL_1 L_2 ... L_{N-1} L_N\n\nOutput\n\nPrint the number of times the ball will make a bounce where the coordinate is at most X.\n\nSample Input 1\n\n3 6\n3 4 5\n\nSample Output 1\n\n2\n\nThe ball will make a bounce at the coordinates 0, 3, 7 and 12, among which two are less than or equal to 6.\n\nSample Input 2\n\n4 9\n3 3 3 3\n\nSample Output 2\n\n4\n\nThe ball will make a bounce at the coordinates 0, 3, 6, 9 and 12, among which four are less than or equal to 9.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s913153003", "group_id": "codeNet:p03001", "input_text": "local w,h,x,y=io.read(\"*n\",\"*n\",\"*n\",\"*n\")\nlocal max=string.format(\"%.10f\",w*h/2)\nprint(max,w==2*x and h==2*y and 1 or 0)", "language": "Lua", "metadata": {"date": 1589706752, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s913153003.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s913153003", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3.000000 0\n", "input_to_evaluate": "local w,h,x,y=io.read(\"*n\",\"*n\",\"*n\",\"*n\")\nlocal max=string.format(\"%.10f\",w*h/2)\nprint(max,w==2*x and h==2*y and 1 or 0)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 121, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s302118178", "group_id": "codeNet:p03001", "input_text": "local function same(a, b)\n return math.abs(a-b) < 10^-9\nend\nlocal W, H, x, y = io.read(\"n\", \"n\", \"n\", \"n\")\nlocal cw, ch = W/2, H/2\nlocal space = W*H/2\nlocal mult = 0\nif same(x, cw) and same(y, ch) then\n mult = 1\nend\nprint(space, mult)", "language": "Lua", "metadata": {"date": 1565583247, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s302118178.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s302118178", "user_id": "u162773977"}, "prompt_components": {"gold_output": "3.000000 0\n", "input_to_evaluate": "local function same(a, b)\n return math.abs(a-b) < 10^-9\nend\nlocal W, H, x, y = io.read(\"n\", \"n\", \"n\", \"n\")\nlocal cw, ch = W/2, H/2\nlocal space = W*H/2\nlocal mult = 0\nif same(x, cw) and same(y, ch) then\n mult = 1\nend\nprint(space, mult)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s422837941", "group_id": "codeNet:p03001", "input_text": "local W, H, x, y = io.read(\"*n\",\"*n\",\"*n\", \"*n\")\nlocal rect = W * H / 2\nlocal flg = 0\n\nif 2*x == W and 2*y == H then\n flg = 1\nend\n\nprint(string.format(\"%.10f\", rect))\nprint(\" \" .. flg .. \"\\n\")", "language": "Lua", "metadata": {"date": 1561222785, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s422837941.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s422837941", "user_id": "u678875535"}, "prompt_components": {"gold_output": "3.000000 0\n", "input_to_evaluate": "local W, H, x, y = io.read(\"*n\",\"*n\",\"*n\", \"*n\")\nlocal rect = W * H / 2\nlocal flg = 0\n\nif 2*x == W and 2*y == H then\n flg = 1\nend\n\nprint(string.format(\"%.10f\", rect))\nprint(\" \" .. flg .. \"\\n\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H).\nYou are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the part whose area is not larger than that of the other. Additionally, determine if there are multiple ways to cut the rectangle and achieve that maximum.\n\nConstraints\n\n1 \\leq W,H \\leq 10^9\n\n0\\leq x\\leq W\n\n0\\leq y\\leq H\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nW H x y\n\nOutput\n\nPrint the maximum possible area of the part whose area is not larger than that of the other, followed by 1 if there are multiple ways to cut the rectangle and achieve that maximum, and 0 otherwise.\n\nThe area printed will be judged correct when its absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n2 3 1 2\n\nSample Output 1\n\n3.000000 0\n\nThe line x=1 gives the optimal cut, and no other line does.\n\nSample Input 2\n\n2 2 1 1\n\nSample Output 2\n\n2.000000 1", "sample_input": "2 3 1 2\n"}, "reference_outputs": ["3.000000 0\n"], "source_document_id": "p03001", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H).\nYou are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the part whose area is not larger than that of the other. Additionally, determine if there are multiple ways to cut the rectangle and achieve that maximum.\n\nConstraints\n\n1 \\leq W,H \\leq 10^9\n\n0\\leq x\\leq W\n\n0\\leq y\\leq H\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nW H x y\n\nOutput\n\nPrint the maximum possible area of the part whose area is not larger than that of the other, followed by 1 if there are multiple ways to cut the rectangle and achieve that maximum, and 0 otherwise.\n\nThe area printed will be judged correct when its absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n2 3 1 2\n\nSample Output 1\n\n3.000000 0\n\nThe line x=1 gives the optimal cut, and no other line does.\n\nSample Input 2\n\n2 2 1 1\n\nSample Output 2\n\n2.000000 1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s893183036", "group_id": "codeNet:p03006", "input_text": "local n=io.read(\"n\")\nlocal x,y={},{}\nfor i=1,n do\n x[i],y[i]=io.read(\"n\",\"n\")\nend\n\nlocal map={}\nfor i=1,n do\n for j=1,n do\n if i~=j then\n local p=tostring(x[i]-x[j])\n local q=tostring(y[i]-y[j])\n local s=p..\" \"..q\n map[s]=(map[s] or 0)+1\n end\n end\nend\n\nlocal mincost=n\nfor k,v in pairs(map) do\n mincost=math.min(mincost,n-v)\nend\nprint(mincost)", "language": "Lua", "metadata": {"date": 1593561295, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s893183036.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s893183036", "user_id": "u045238009"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal x,y={},{}\nfor i=1,n do\n x[i],y[i]=io.read(\"n\",\"n\")\nend\n\nlocal map={}\nfor i=1,n do\n for j=1,n do\n if i~=j then\n local p=tostring(x[i]-x[j])\n local q=tostring(y[i]-y[j])\n local s=p..\" \"..q\n map[s]=(map[s] or 0)+1\n end\n end\nend\n\nlocal mincost=n\nfor k,v in pairs(map) do\n mincost=math.min(mincost,n-v)\nend\nprint(mincost)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 2800}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s247932343", "group_id": "codeNet:p03007", "input_text": "local n = io.read(\"*n\")\nlocal p, m = {}, {}\nfor i = 1, n do\n local a = io.read(\"*n\")\n if 0 <= a then\n table.insert(p, a)\n else\n table.insert(m, a)\n end\nend\ntable.sort(p)\ntable.sort(m, function(a, b) return a > b end)\nlocal v = 0\nlocal r1, r2 = {}, {}\nif #m == 0 then\n v = p[1]\n for i = 3, #p do\n table.insert(r1, v)\n table.insert(r2, p[i])\n v = v - p[i]\n end\n table.insert(r1, p[2])\n table.insert(r2, v)\n v = p[2] - v\nelseif #p == 0 then\n v = m[1]\n for i = 2, #m do\n table.insert(r1, v)\n table.insert(r2, m[i])\n v = v - m[i]\n end\nelse\n v = m[1]\n for i = 2, #p do\n table.insert(r1, v)\n table.insert(r2, p[i])\n v = v - p[i]\n end\n table.insert(r1, p[1])\n table.insert(r2, v)\n v = p[1] - v\n for i = 2, #m do\n table.insert(r1, v)\n table.insert(r2, m[i])\n v = v - m[i]\n end\nend\nprint(v)\nfor i = 1, n - 1 do\n print(r1[i] .. \" \" ..r2[i])\nend\n", "language": "Lua", "metadata": {"date": 1589907396, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s247932343.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s247932343", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n-1 1\n2 -2\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal p, m = {}, {}\nfor i = 1, n do\n local a = io.read(\"*n\")\n if 0 <= a then\n table.insert(p, a)\n else\n table.insert(m, a)\n end\nend\ntable.sort(p)\ntable.sort(m, function(a, b) return a > b end)\nlocal v = 0\nlocal r1, r2 = {}, {}\nif #m == 0 then\n v = p[1]\n for i = 3, #p do\n table.insert(r1, v)\n table.insert(r2, p[i])\n v = v - p[i]\n end\n table.insert(r1, p[2])\n table.insert(r2, v)\n v = p[2] - v\nelseif #p == 0 then\n v = m[1]\n for i = 2, #m do\n table.insert(r1, v)\n table.insert(r2, m[i])\n v = v - m[i]\n end\nelse\n v = m[1]\n for i = 2, #p do\n table.insert(r1, v)\n table.insert(r2, p[i])\n v = v - p[i]\n end\n table.insert(r1, p[1])\n table.insert(r2, v)\n v = p[1] - v\n for i = 2, #m do\n table.insert(r1, v)\n table.insert(r2, m[i])\n v = v - m[i]\n end\nend\nprint(v)\nfor i = 1, n - 1 do\n print(r1[i] .. \" \" ..r2[i])\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on a blackboard.\n\nWe will repeat the following operation N-1 times so that we have only one integer on the blackboard.\n\nChoose two integers x and y on the blackboard and erase these two integers. Then, write a new integer x-y.\n\nFind the maximum possible value of the final integer on the blackboard and a sequence of operations that maximizes the final integer.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n-10^4 \\leq A_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value M of the final integer on the blackboard, and a sequence of operations x_i, y_i that maximizes the final integer, in the format below.\n\nHere x_i and y_i represent the integers x and y chosen in the i-th operation, respectively.\n\nIf there are multiple sequences of operations that maximize the final integer, any of them will be accepted.\n\nM\nx_1 y_1\n:\nx_{N-1} y_{N-1}\n\nSample Input 1\n\n3\n1 -1 2\n\nSample Output 1\n\n4\n-1 1\n2 -2\n\nIf we choose x = -1 and y = 1 in the first operation, the set of integers written on the blackboard becomes (-2, 2).\n\nThen, if we choose x = 2 and y = -2 in the second operation, the set of integers written on the blackboard becomes (4).\n\nIn this case, we have 4 as the final integer. We cannot end with a greater integer, so the answer is 4.\n\nSample Input 2\n\n3\n1 1 1\n\nSample Output 2\n\n1\n1 1\n1 0", "sample_input": "3\n1 -1 2\n"}, "reference_outputs": ["4\n-1 1\n2 -2\n"], "source_document_id": "p03007", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on a blackboard.\n\nWe will repeat the following operation N-1 times so that we have only one integer on the blackboard.\n\nChoose two integers x and y on the blackboard and erase these two integers. Then, write a new integer x-y.\n\nFind the maximum possible value of the final integer on the blackboard and a sequence of operations that maximizes the final integer.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n-10^4 \\leq A_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value M of the final integer on the blackboard, and a sequence of operations x_i, y_i that maximizes the final integer, in the format below.\n\nHere x_i and y_i represent the integers x and y chosen in the i-th operation, respectively.\n\nIf there are multiple sequences of operations that maximize the final integer, any of them will be accepted.\n\nM\nx_1 y_1\n:\nx_{N-1} y_{N-1}\n\nSample Input 1\n\n3\n1 -1 2\n\nSample Output 1\n\n4\n-1 1\n2 -2\n\nIf we choose x = -1 and y = 1 in the first operation, the set of integers written on the blackboard becomes (-2, 2).\n\nThen, if we choose x = 2 and y = -2 in the second operation, the set of integers written on the blackboard becomes (4).\n\nIn this case, we have 4 as the final integer. We cannot end with a greater integer, so the answer is 4.\n\nSample Input 2\n\n3\n1 1 1\n\nSample Output 2\n\n1\n1 1\n1 0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 898, "cpu_time_ms": 526, "memory_kb": 20956}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s689099786", "group_id": "codeNet:p03007", "input_text": "local n = io.read(\"*n\")\nlocal p, m = {}, {}\nfor i = 1, n do\n local a = io.read(\"*n\")\n if 0 <= a then\n table.insert(p, a)\n else\n table.insert(m, a)\n end\nend\nlocal v = 0\nlocal r1, r2 = {}, {}\nif #m == 0 then\n v = p[1]\n for i = 3, #p do\n table.insert(r1, v)\n table.insert(r2, p[i])\n v = v - p[i]\n end\n table.insert(r1, p[2])\n table.insert(r2, v)\n v = p[2] - v\nelseif #p == 0 then\n v = m[1]\n for i = 2, #m do\n table.insert(r1, v)\n table.insert(r2, m[i])\n v = v - m[i]\n end\nelse\n v = m[1]\n for i = 2, #p do\n table.insert(r1, v)\n table.insert(r2, p[i])\n v = v - p[i]\n end\n table.insert(r1, p[1])\n table.insert(r2, v)\n v = p[1] - v\n for i = 2, #m do\n table.insert(r1, v)\n table.insert(r2, m[i])\n v = v - m[i]\n end\nend\nprint(v)\nfor i = 1, n - 1 do\n print(r1[i] .. \" \" ..r2[i])\nend\n", "language": "Lua", "metadata": {"date": 1589907313, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s689099786.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s689099786", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n-1 1\n2 -2\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal p, m = {}, {}\nfor i = 1, n do\n local a = io.read(\"*n\")\n if 0 <= a then\n table.insert(p, a)\n else\n table.insert(m, a)\n end\nend\nlocal v = 0\nlocal r1, r2 = {}, {}\nif #m == 0 then\n v = p[1]\n for i = 3, #p do\n table.insert(r1, v)\n table.insert(r2, p[i])\n v = v - p[i]\n end\n table.insert(r1, p[2])\n table.insert(r2, v)\n v = p[2] - v\nelseif #p == 0 then\n v = m[1]\n for i = 2, #m do\n table.insert(r1, v)\n table.insert(r2, m[i])\n v = v - m[i]\n end\nelse\n v = m[1]\n for i = 2, #p do\n table.insert(r1, v)\n table.insert(r2, p[i])\n v = v - p[i]\n end\n table.insert(r1, p[1])\n table.insert(r2, v)\n v = p[1] - v\n for i = 2, #m do\n table.insert(r1, v)\n table.insert(r2, m[i])\n v = v - m[i]\n end\nend\nprint(v)\nfor i = 1, n - 1 do\n print(r1[i] .. \" \" ..r2[i])\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on a blackboard.\n\nWe will repeat the following operation N-1 times so that we have only one integer on the blackboard.\n\nChoose two integers x and y on the blackboard and erase these two integers. Then, write a new integer x-y.\n\nFind the maximum possible value of the final integer on the blackboard and a sequence of operations that maximizes the final integer.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n-10^4 \\leq A_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value M of the final integer on the blackboard, and a sequence of operations x_i, y_i that maximizes the final integer, in the format below.\n\nHere x_i and y_i represent the integers x and y chosen in the i-th operation, respectively.\n\nIf there are multiple sequences of operations that maximize the final integer, any of them will be accepted.\n\nM\nx_1 y_1\n:\nx_{N-1} y_{N-1}\n\nSample Input 1\n\n3\n1 -1 2\n\nSample Output 1\n\n4\n-1 1\n2 -2\n\nIf we choose x = -1 and y = 1 in the first operation, the set of integers written on the blackboard becomes (-2, 2).\n\nThen, if we choose x = 2 and y = -2 in the second operation, the set of integers written on the blackboard becomes (4).\n\nIn this case, we have 4 as the final integer. We cannot end with a greater integer, so the answer is 4.\n\nSample Input 2\n\n3\n1 1 1\n\nSample Output 2\n\n1\n1 1\n1 0", "sample_input": "3\n1 -1 2\n"}, "reference_outputs": ["4\n-1 1\n2 -2\n"], "source_document_id": "p03007", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on a blackboard.\n\nWe will repeat the following operation N-1 times so that we have only one integer on the blackboard.\n\nChoose two integers x and y on the blackboard and erase these two integers. Then, write a new integer x-y.\n\nFind the maximum possible value of the final integer on the blackboard and a sequence of operations that maximizes the final integer.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n-10^4 \\leq A_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value M of the final integer on the blackboard, and a sequence of operations x_i, y_i that maximizes the final integer, in the format below.\n\nHere x_i and y_i represent the integers x and y chosen in the i-th operation, respectively.\n\nIf there are multiple sequences of operations that maximize the final integer, any of them will be accepted.\n\nM\nx_1 y_1\n:\nx_{N-1} y_{N-1}\n\nSample Input 1\n\n3\n1 -1 2\n\nSample Output 1\n\n4\n-1 1\n2 -2\n\nIf we choose x = -1 and y = 1 in the first operation, the set of integers written on the blackboard becomes (-2, 2).\n\nThen, if we choose x = 2 and y = -2 in the second operation, the set of integers written on the blackboard becomes (4).\n\nIn this case, we have 4 as the final integer. We cannot end with a greater integer, so the answer is 4.\n\nSample Input 2\n\n3\n1 1 1\n\nSample Output 2\n\n1\n1 1\n1 0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 412, "memory_kb": 20864}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s800248746", "group_id": "codeNet:p03007", "input_text": "local mab = math.abs\nlocal n = io.read(\"*n\")\nlocal a = {}\nlocal sum = 0\nlocal abssum = 0\nfor i = 1, n do\n a[i] = io.read(\"*n\")\n sum = sum + a[i]\n abssum = abssum + mab(a[i])\nend\ntable.sort(a)\nlocal allplus = 0 <= a[1]\nlocal allminus = a[n] < 0\n\nif n == 2 then\n if a[1] < a[2] then\n print(a[2] - a[1])\n print(a[2] .. \" \" .. a[1])\n else\n print(a[1] - a[2])\n print(a[1] .. \" \" .. a[2])\n end\nelse\n if allplus then\n print(sum - a[1] * 2)\n local cur = a[1]\n for i = 2, n - 1 do\n print(cur .. \" \" .. a[i])\n cur = cur - a[i]\n end\n print(a[n] .. \" \" .. cur)\n elseif allminus then\n print(a[n] * 2 - sum)\n local cur = a[n]\n for i = 1, n - 1 do\n print(cur .. \" \" .. a[i])\n cur = cur - a[i]\n end\n else\n print(abssum)\n local minlast = 1\n for i = 1, n do\n if a[i] < 0 then\n minlast = i\n else\n break\n end\n end\n local cur = a[minlast]\n for i = minlast + 1, n - 1 do\n print(cur .. \" \" .. a[i])\n cur = cur - a[i]\n end\n print(a[n] .. \" \" .. cur)\n cur = a[n] - cur\n for i = 1, minlast - 1 do\n print(cur .. \" \" .. a[i])\n cur = cur - a[i]\n end\n end\nend\n", "language": "Lua", "metadata": {"date": 1560650144, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s800248746.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s800248746", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n-1 1\n2 -2\n", "input_to_evaluate": "local mab = math.abs\nlocal n = io.read(\"*n\")\nlocal a = {}\nlocal sum = 0\nlocal abssum = 0\nfor i = 1, n do\n a[i] = io.read(\"*n\")\n sum = sum + a[i]\n abssum = abssum + mab(a[i])\nend\ntable.sort(a)\nlocal allplus = 0 <= a[1]\nlocal allminus = a[n] < 0\n\nif n == 2 then\n if a[1] < a[2] then\n print(a[2] - a[1])\n print(a[2] .. \" \" .. a[1])\n else\n print(a[1] - a[2])\n print(a[1] .. \" \" .. a[2])\n end\nelse\n if allplus then\n print(sum - a[1] * 2)\n local cur = a[1]\n for i = 2, n - 1 do\n print(cur .. \" \" .. a[i])\n cur = cur - a[i]\n end\n print(a[n] .. \" \" .. cur)\n elseif allminus then\n print(a[n] * 2 - sum)\n local cur = a[n]\n for i = 1, n - 1 do\n print(cur .. \" \" .. a[i])\n cur = cur - a[i]\n end\n else\n print(abssum)\n local minlast = 1\n for i = 1, n do\n if a[i] < 0 then\n minlast = i\n else\n break\n end\n end\n local cur = a[minlast]\n for i = minlast + 1, n - 1 do\n print(cur .. \" \" .. a[i])\n cur = cur - a[i]\n end\n print(a[n] .. \" \" .. cur)\n cur = a[n] - cur\n for i = 1, minlast - 1 do\n print(cur .. \" \" .. a[i])\n cur = cur - a[i]\n end\n end\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on a blackboard.\n\nWe will repeat the following operation N-1 times so that we have only one integer on the blackboard.\n\nChoose two integers x and y on the blackboard and erase these two integers. Then, write a new integer x-y.\n\nFind the maximum possible value of the final integer on the blackboard and a sequence of operations that maximizes the final integer.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n-10^4 \\leq A_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value M of the final integer on the blackboard, and a sequence of operations x_i, y_i that maximizes the final integer, in the format below.\n\nHere x_i and y_i represent the integers x and y chosen in the i-th operation, respectively.\n\nIf there are multiple sequences of operations that maximize the final integer, any of them will be accepted.\n\nM\nx_1 y_1\n:\nx_{N-1} y_{N-1}\n\nSample Input 1\n\n3\n1 -1 2\n\nSample Output 1\n\n4\n-1 1\n2 -2\n\nIf we choose x = -1 and y = 1 in the first operation, the set of integers written on the blackboard becomes (-2, 2).\n\nThen, if we choose x = 2 and y = -2 in the second operation, the set of integers written on the blackboard becomes (4).\n\nIn this case, we have 4 as the final integer. We cannot end with a greater integer, so the answer is 4.\n\nSample Input 2\n\n3\n1 1 1\n\nSample Output 2\n\n1\n1 1\n1 0", "sample_input": "3\n1 -1 2\n"}, "reference_outputs": ["4\n-1 1\n2 -2\n"], "source_document_id": "p03007", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on a blackboard.\n\nWe will repeat the following operation N-1 times so that we have only one integer on the blackboard.\n\nChoose two integers x and y on the blackboard and erase these two integers. Then, write a new integer x-y.\n\nFind the maximum possible value of the final integer on the blackboard and a sequence of operations that maximizes the final integer.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n-10^4 \\leq A_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value M of the final integer on the blackboard, and a sequence of operations x_i, y_i that maximizes the final integer, in the format below.\n\nHere x_i and y_i represent the integers x and y chosen in the i-th operation, respectively.\n\nIf there are multiple sequences of operations that maximize the final integer, any of them will be accepted.\n\nM\nx_1 y_1\n:\nx_{N-1} y_{N-1}\n\nSample Input 1\n\n3\n1 -1 2\n\nSample Output 1\n\n4\n-1 1\n2 -2\n\nIf we choose x = -1 and y = 1 in the first operation, the set of integers written on the blackboard becomes (-2, 2).\n\nThen, if we choose x = 2 and y = -2 in the second operation, the set of integers written on the blackboard becomes (4).\n\nIn this case, we have 4 as the final integer. We cannot end with a greater integer, so the answer is 4.\n\nSample Input 2\n\n3\n1 1 1\n\nSample Output 2\n\n1\n1 1\n1 0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 226, "memory_kb": 5344}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s762262873", "group_id": "codeNet:p03011", "input_text": "local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max\nlocal p = io.read(\"*n\")\nlocal q, r = io.read(\"*n\", \"*n\")\nlocal s = p + q + r\ns = s - mma(p, mma(q, r))\nprint(s)\n", "language": "Lua", "metadata": {"date": 1560128524, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03011.html", "problem_id": "p03011", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03011/input.txt", "sample_output_relpath": "derived/input_output/data/p03011/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03011/Lua/s762262873.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s762262873", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max\nlocal p = io.read(\"*n\")\nlocal q, r = io.read(\"*n\", \"*n\")\nlocal s = p + q + r\ns = s - mma(p, mma(q, r))\nprint(s)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are three airports A, B and C, and flights between each pair of airports in both directions.\n\nA one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours.\n\nConsider a route where we start at one of the airports, fly to another airport and then fly to the other airport.\n\nWhat is the minimum possible sum of the flight times?\n\nConstraints\n\n1 \\leq P,Q,R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nP Q R\n\nOutput\n\nPrint the minimum possible sum of the flight times.\n\nSample Input 1\n\n1 3 4\n\nSample Output 1\n\n4\n\nThe sum of the flight times in the route A \\rightarrow B \\rightarrow C: 1 + 3 = 4 hours\n\nThe sum of the flight times in the route A \\rightarrow C \\rightarrow C: 4 + 3 = 7 hours\n\nThe sum of the flight times in the route B \\rightarrow A \\rightarrow C: 1 + 4 = 5 hours\n\nThe sum of the flight times in the route B \\rightarrow C \\rightarrow A: 3 + 4 = 7 hours\n\nThe sum of the flight times in the route C \\rightarrow A \\rightarrow B: 4 + 1 = 5 hours\n\nThe sum of the flight times in the route C \\rightarrow B \\rightarrow A: 3 + 1 = 4 hours\n\nThe minimum of these is 4 hours.\n\nSample Input 2\n\n3 2 3\n\nSample Output 2\n\n5", "sample_input": "1 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03011", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are three airports A, B and C, and flights between each pair of airports in both directions.\n\nA one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours.\n\nConsider a route where we start at one of the airports, fly to another airport and then fly to the other airport.\n\nWhat is the minimum possible sum of the flight times?\n\nConstraints\n\n1 \\leq P,Q,R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nP Q R\n\nOutput\n\nPrint the minimum possible sum of the flight times.\n\nSample Input 1\n\n1 3 4\n\nSample Output 1\n\n4\n\nThe sum of the flight times in the route A \\rightarrow B \\rightarrow C: 1 + 3 = 4 hours\n\nThe sum of the flight times in the route A \\rightarrow C \\rightarrow C: 4 + 3 = 7 hours\n\nThe sum of the flight times in the route B \\rightarrow A \\rightarrow C: 1 + 4 = 5 hours\n\nThe sum of the flight times in the route B \\rightarrow C \\rightarrow A: 3 + 4 = 7 hours\n\nThe sum of the flight times in the route C \\rightarrow A \\rightarrow B: 4 + 1 = 5 hours\n\nThe sum of the flight times in the route C \\rightarrow B \\rightarrow A: 3 + 1 = 4 hours\n\nThe minimum of these is 4 hours.\n\nSample Input 2\n\n3 2 3\n\nSample Output 2\n\n5", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s820116529", "group_id": "codeNet:p03012", "input_text": "n = io.read(\"*n\")\nw = {}\nsum = 0\nfor i = 1, n do\n w[i] = io.read(\"*n\")\n sum = sum + w[i]\nend\nl = 0\nret = sum\nfor i = 1, n - 1 do\n l = l + w[i]\n ret = math.min(ret, math.abs(sum - l - l))\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1597605147, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s820116529.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s820116529", "user_id": "u120582723"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "n = io.read(\"*n\")\nw = {}\nsum = 0\nfor i = 1, n do\n w[i] = io.read(\"*n\")\n sum = sum + w[i]\nend\nl = 0\nret = sum\nfor i = 1, n - 1 do\n l = l + w[i]\n ret = math.min(ret, math.abs(sum - l - l))\nend\nprint(ret)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have N weights indexed 1 to N. The \bmass of the weight indexed i is W_i.\n\nWe will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \\leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be the sum of the masses of the weights in the latter group.\n\nConsider all possible such divisions and find the minimum possible absolute difference of S_1 and S_2.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n1 \\leq W_i \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1 W_2 ... W_{N-1} W_N\n\nOutput\n\nPrint the minimum possible absolute difference of S_1 and S_2.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n0\n\nIf T = 2, S_1 = 1 + 2 = 3 and S_2 = 3, with the absolute difference of 0.\n\nSample Input 2\n\n4\n1 3 1 1\n\nSample Output 2\n\n2\n\nIf T = 2, S_1 = 1 + 3 = 4 and S_2 = 1 + 1 = 2, with the absolute difference of 2. We cannot have a smaller absolute difference.\n\nSample Input 3\n\n8\n27 23 76 2 3 5 62 52\n\nSample Output 3\n\n2", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03012", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have N weights indexed 1 to N. The \bmass of the weight indexed i is W_i.\n\nWe will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \\leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be the sum of the masses of the weights in the latter group.\n\nConsider all possible such divisions and find the minimum possible absolute difference of S_1 and S_2.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n1 \\leq W_i \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1 W_2 ... W_{N-1} W_N\n\nOutput\n\nPrint the minimum possible absolute difference of S_1 and S_2.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n0\n\nIf T = 2, S_1 = 1 + 2 = 3 and S_2 = 3, with the absolute difference of 0.\n\nSample Input 2\n\n4\n1 3 1 1\n\nSample Output 2\n\n2\n\nIf T = 2, S_1 = 1 + 3 = 4 and S_2 = 1 + 1 = 2, with the absolute difference of 2. We cannot have a smaller absolute difference.\n\nSample Input 3\n\n8\n27 23 76 2 3 5 62 52\n\nSample Output 3\n\n2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 2720}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s815624715", "group_id": "codeNet:p03012", "input_text": "local N = io.read(\"n\")\nlocal W = {}\n\nfor i=1, N do\n local w = io.read(\"n\")\n W[i] = w\nend\n\nlocal ans = 100 * 100\nfor T=1,N do\n local sum_left = 0\n local sum_right = 0\n for i=1,T do\n sum_left = sum_left + W[i]\n end\n for i=T+1,N do\n sum_right = sum_right + W[i]\n end\n ans = math.min(ans, math.abs(sum_left - sum_right))\nend\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1565494047, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s815624715.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s815624715", "user_id": "u162773977"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "local N = io.read(\"n\")\nlocal W = {}\n\nfor i=1, N do\n local w = io.read(\"n\")\n W[i] = w\nend\n\nlocal ans = 100 * 100\nfor T=1,N do\n local sum_left = 0\n local sum_right = 0\n for i=1,T do\n sum_left = sum_left + W[i]\n end\n for i=T+1,N do\n sum_right = sum_right + W[i]\n end\n ans = math.min(ans, math.abs(sum_left - sum_right))\nend\nprint(ans)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have N weights indexed 1 to N. The \bmass of the weight indexed i is W_i.\n\nWe will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \\leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be the sum of the masses of the weights in the latter group.\n\nConsider all possible such divisions and find the minimum possible absolute difference of S_1 and S_2.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n1 \\leq W_i \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1 W_2 ... W_{N-1} W_N\n\nOutput\n\nPrint the minimum possible absolute difference of S_1 and S_2.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n0\n\nIf T = 2, S_1 = 1 + 2 = 3 and S_2 = 3, with the absolute difference of 0.\n\nSample Input 2\n\n4\n1 3 1 1\n\nSample Output 2\n\n2\n\nIf T = 2, S_1 = 1 + 3 = 4 and S_2 = 1 + 1 = 2, with the absolute difference of 2. We cannot have a smaller absolute difference.\n\nSample Input 3\n\n8\n27 23 76 2 3 5 62 52\n\nSample Output 3\n\n2", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03012", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have N weights indexed 1 to N. The \bmass of the weight indexed i is W_i.\n\nWe will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \\leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be the sum of the masses of the weights in the latter group.\n\nConsider all possible such divisions and find the minimum possible absolute difference of S_1 and S_2.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n1 \\leq W_i \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1 W_2 ... W_{N-1} W_N\n\nOutput\n\nPrint the minimum possible absolute difference of S_1 and S_2.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n0\n\nIf T = 2, S_1 = 1 + 2 = 3 and S_2 = 3, with the absolute difference of 0.\n\nSample Input 2\n\n4\n1 3 1 1\n\nSample Output 2\n\n2\n\nIf T = 2, S_1 = 1 + 3 = 4 and S_2 = 1 + 1 = 2, with the absolute difference of 2. We cannot have a smaller absolute difference.\n\nSample Input 3\n\n8\n27 23 76 2 3 5 62 52\n\nSample Output 3\n\n2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 373, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s341923000", "group_id": "codeNet:p03012", "input_text": "local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max\nlocal mab = math.abs\nlocal n = io.read(\"*n\")\nlocal w = {}\nfor i = 1, n do w[i] = io.read(\"*n\") end\nlocal sum = {}\nsum[1] = w[1]\nfor i = 2, n do\n sum[i] = sum[i - 1] + w[i]\nend\nlocal dif = mab((sum[n] - sum[1]) - sum[1])\nfor i = 2, n - 1 do\n local adif = mab((sum[n] - sum[i]) - sum[i])\n dif = mmi(dif, adif)\nend\nprint(dif)\n", "language": "Lua", "metadata": {"date": 1560128808, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s341923000.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s341923000", "user_id": "u120582723"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max\nlocal mab = math.abs\nlocal n = io.read(\"*n\")\nlocal w = {}\nfor i = 1, n do w[i] = io.read(\"*n\") end\nlocal sum = {}\nsum[1] = w[1]\nfor i = 2, n do\n sum[i] = sum[i - 1] + w[i]\nend\nlocal dif = mab((sum[n] - sum[1]) - sum[1])\nfor i = 2, n - 1 do\n local adif = mab((sum[n] - sum[i]) - sum[i])\n dif = mmi(dif, adif)\nend\nprint(dif)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have N weights indexed 1 to N. The \bmass of the weight indexed i is W_i.\n\nWe will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \\leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be the sum of the masses of the weights in the latter group.\n\nConsider all possible such divisions and find the minimum possible absolute difference of S_1 and S_2.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n1 \\leq W_i \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1 W_2 ... W_{N-1} W_N\n\nOutput\n\nPrint the minimum possible absolute difference of S_1 and S_2.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n0\n\nIf T = 2, S_1 = 1 + 2 = 3 and S_2 = 3, with the absolute difference of 0.\n\nSample Input 2\n\n4\n1 3 1 1\n\nSample Output 2\n\n2\n\nIf T = 2, S_1 = 1 + 3 = 4 and S_2 = 1 + 1 = 2, with the absolute difference of 2. We cannot have a smaller absolute difference.\n\nSample Input 3\n\n8\n27 23 76 2 3 5 62 52\n\nSample Output 3\n\n2", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03012", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have N weights indexed 1 to N. The \bmass of the weight indexed i is W_i.\n\nWe will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \\leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be the sum of the masses of the weights in the latter group.\n\nConsider all possible such divisions and find the minimum possible absolute difference of S_1 and S_2.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n1 \\leq W_i \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1 W_2 ... W_{N-1} W_N\n\nOutput\n\nPrint the minimum possible absolute difference of S_1 and S_2.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n0\n\nIf T = 2, S_1 = 1 + 2 = 3 and S_2 = 3, with the absolute difference of 0.\n\nSample Input 2\n\n4\n1 3 1 1\n\nSample Output 2\n\n2\n\nIf T = 2, S_1 = 1 + 3 = 4 and S_2 = 1 + 1 = 2, with the absolute difference of 2. We cannot have a smaller absolute difference.\n\nSample Input 3\n\n8\n27 23 76 2 3 5 62 52\n\nSample Output 3\n\n2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s833928878", "group_id": "codeNet:p03013", "input_text": "local mod = 1000000007\nlocal function badd(x, y) return (x + y) % mod end\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal f, dp = {}, {}\nfor i = 1, n + 2 do\n f[i] = true\n dp[i] = 0\nend\nfor i = 1, m do\n local a = io.read(\"*n\")\n f[a + 1] = false\nend\ndp[1] = 1\nfor i = 1, n do\n if f[i] then\n dp[i + 1] = badd(dp[i + 1], dp[i])\n dp[i + 2] = badd(dp[i + 2], dp[i])\n end\nend\nprint(dp[n + 1])\n", "language": "Lua", "metadata": {"date": 1597605314, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s833928878.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s833928878", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local mod = 1000000007\nlocal function badd(x, y) return (x + y) % mod end\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal f, dp = {}, {}\nfor i = 1, n + 2 do\n f[i] = true\n dp[i] = 0\nend\nfor i = 1, m do\n local a = io.read(\"*n\")\n f[a + 1] = false\nend\ndp[1] = 1\nfor i = 1, n do\n if f[i] then\n dp[i + 1] = badd(dp[i + 1], dp[i])\n dp[i + 2] = badd(dp[i + 2], dp[i])\n end\nend\nprint(dp[n + 1])\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step.\nHe can climb up one or two steps at a time.\n\nHowever, the treads of the a_1-th, a_2-th, a_3-th, \\ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps.\n\nHow many are there to climb up to the top step, that is, the N-th step, without setting foot on the broken steps?\nFind the count modulo 1\\ 000\\ 000\\ 007.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq M \\leq N-1\n\n1 \\leq a_1 < a_2 < ... < a_M \\leq N-1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1\na_2\n.\n.\n.\na_M\n\nOutput\n\nPrint the number of ways to climb up the stairs under the condition, modulo 1\\ 000\\ 000\\ 007.\n\nSample Input 1\n\n6 1\n3\n\nSample Output 1\n\n4\n\nThere are four ways to climb up the stairs, as follows:\n\n0 \\to 1 \\to 2 \\to 4 \\to 5 \\to 6\n\n0 \\to 1 \\to 2 \\to 4 \\to 6\n\n0 \\to 2 \\to 4 \\to 5 \\to 6\n\n0 \\to 2 \\to 4 \\to 6\n\nSample Input 2\n\n10 2\n4\n5\n\nSample Output 2\n\n0\n\nThere may be no way to climb up the stairs without setting foot on the broken steps.\n\nSample Input 3\n\n100 5\n1\n23\n45\n67\n89\n\nSample Output 3\n\n608200469\n\nBe sure to print the count modulo 1\\ 000\\ 000\\ 007.", "sample_input": "6 1\n3\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03013", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step.\nHe can climb up one or two steps at a time.\n\nHowever, the treads of the a_1-th, a_2-th, a_3-th, \\ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps.\n\nHow many are there to climb up to the top step, that is, the N-th step, without setting foot on the broken steps?\nFind the count modulo 1\\ 000\\ 000\\ 007.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq M \\leq N-1\n\n1 \\leq a_1 < a_2 < ... < a_M \\leq N-1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1\na_2\n.\n.\n.\na_M\n\nOutput\n\nPrint the number of ways to climb up the stairs under the condition, modulo 1\\ 000\\ 000\\ 007.\n\nSample Input 1\n\n6 1\n3\n\nSample Output 1\n\n4\n\nThere are four ways to climb up the stairs, as follows:\n\n0 \\to 1 \\to 2 \\to 4 \\to 5 \\to 6\n\n0 \\to 1 \\to 2 \\to 4 \\to 6\n\n0 \\to 2 \\to 4 \\to 5 \\to 6\n\n0 \\to 2 \\to 4 \\to 6\n\nSample Input 2\n\n10 2\n4\n5\n\nSample Output 2\n\n0\n\nThere may be no way to climb up the stairs without setting foot on the broken steps.\n\nSample Input 3\n\n100 5\n1\n23\n45\n67\n89\n\nSample Output 3\n\n608200469\n\nBe sure to print the count modulo 1\\ 000\\ 000\\ 007.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 41, "memory_kb": 6452}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s129804579", "group_id": "codeNet:p03014", "input_text": "local h, w = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nlocal s_sharp = string.byte(\"#\")\nfor i = 1, h do\n local s = io.read()\n for j = 1, w do\n local idx = (i - 1) * w + j\n t[idx] = s:byte(j) ~= s_sharp\n end\nend\nlocal score = {}\nfor i = 1, h * w do score[i] = 0 end\nlocal len = 0\nlocal function func(idx)\n score[idx] = score[idx] + len\n if t[idx] then len = len + 1\n else len = 0\n end\nend\nfor i = 1, h do\n len = 0\n for j = 1, w do\n func((i - 1) * w + j)\n end\nend\nfor i = 1, h do\n len = 0\n for j = w, 1, -1 do\n func((i - 1) * w + j)\n end\nend\nfor j = 1, w do\n len = 0\n for i = 1, h do\n func((i - 1) * w + j)\n end\nend\nfor j = 1, w do\n len = 0\n for i = h, 1, -1 do\n func((i - 1) * w + j)\n end\nend\nlocal ret = 0\nlocal mma = math.max\nfor i = 1, h * w do\n if t[i] then\n ret = mma(ret, score[i])\n end\nend\nprint(ret + 1)\n", "language": "Lua", "metadata": {"date": 1597605806, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s129804579.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s129804579", "user_id": "u120582723"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "local h, w = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nlocal s_sharp = string.byte(\"#\")\nfor i = 1, h do\n local s = io.read()\n for j = 1, w do\n local idx = (i - 1) * w + j\n t[idx] = s:byte(j) ~= s_sharp\n end\nend\nlocal score = {}\nfor i = 1, h * w do score[i] = 0 end\nlocal len = 0\nlocal function func(idx)\n score[idx] = score[idx] + len\n if t[idx] then len = len + 1\n else len = 0\n end\nend\nfor i = 1, h do\n len = 0\n for j = 1, w do\n func((i - 1) * w + j)\n end\nend\nfor i = 1, h do\n len = 0\n for j = w, 1, -1 do\n func((i - 1) * w + j)\n end\nend\nfor j = 1, w do\n len = 0\n for i = 1, h do\n func((i - 1) * w + j)\n end\nend\nfor j = 1, w do\n len = 0\n for i = h, 1, -1 do\n func((i - 1) * w + j)\n end\nend\nlocal ret = 0\nlocal mma = math.max\nfor i = 1, h * w do\n if t[i] then\n ret = mma(ret, score[i])\n end\nend\nprint(ret + 1)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 850, "cpu_time_ms": 2208, "memory_kb": 135436}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s005048397", "group_id": "codeNet:p03017", "input_text": "local n = io.read(\"*n\")\nlocal a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nlocal c = io.read(\"*n\")\nlocal d = io.read(\"*n\")\nio.read(\"*l\")\nlocal s = io.read(\"*l\")\nlocal empty = string.byte(\".\", 1)\nlocal rock = string.byte(\"#\", 1)\nif a > b then\n\ta, b = b, a\n\tc, d = d, c\nend\nlocal threeempty = false\nfor i = 1, math.max(c, d) do \n\tif a < i and i < c and string.byte(s, i) == rock and string.byte(s, i + 1) == rock then\n\t\tprint(\"No\")\n\t\treturn\n\tend\n\tif b < i and i < d and string.byte(s, i) == rock and string.byte(s, i + 1) == rock then\n\t\tprint(\"No\")\n\t\treturn\n\tend\n\tif b <= i and i <= d and i + 2 <= n and string.byte(s, i) == empty and string.byte(s, i + 1) == empty and string.byte(s, i + 2) == empty then\n\t\tthreeempty = true\n\tend\nend\n\nif d < c then\n\tif not threeempty then\n\t\tprint('No')\n\t\treturn\n\tend\nend\nprint(\"Yes\")", "language": "Lua", "metadata": {"date": 1594437514, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s005048397.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s005048397", "user_id": "u018679195"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nlocal c = io.read(\"*n\")\nlocal d = io.read(\"*n\")\nio.read(\"*l\")\nlocal s = io.read(\"*l\")\nlocal empty = string.byte(\".\", 1)\nlocal rock = string.byte(\"#\", 1)\nif a > b then\n\ta, b = b, a\n\tc, d = d, c\nend\nlocal threeempty = false\nfor i = 1, math.max(c, d) do \n\tif a < i and i < c and string.byte(s, i) == rock and string.byte(s, i + 1) == rock then\n\t\tprint(\"No\")\n\t\treturn\n\tend\n\tif b < i and i < d and string.byte(s, i) == rock and string.byte(s, i + 1) == rock then\n\t\tprint(\"No\")\n\t\treturn\n\tend\n\tif b <= i and i <= d and i + 2 <= n and string.byte(s, i) == empty and string.byte(s, i + 1) == empty and string.byte(s, i + 2) == empty then\n\t\tthreeempty = true\n\tend\nend\n\nif d < c then\n\tif not threeempty then\n\t\tprint('No')\n\t\treturn\n\tend\nend\nprint(\"Yes\")", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 813, "cpu_time_ms": 67, "memory_kb": 2716}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s403407047", "group_id": "codeNet:p03017", "input_text": "local n = io.read(\"*n\")\nlocal a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nlocal c = io.read(\"*n\")\nlocal d = io.read(\"*n\")\nio.read(\"*l\")\nlocal s = io.read(\"*l\")\nlocal empty = string.byte(\".\", 1)\nlocal rock = string.byte(\"#\", 1)\nif a > b then\n\ta, b = b, a\n\tc, d = d, c\nend\nlocal threeempty = false\nfor i = 1, math.max(c, d) do \n\tif a < i and i < c and string.byte(s, i) == rock and string.byte(s, i + 1) == rock then\n\t\tprint(\"No\")\n\t\treturn\n\tend\n\tif b < i and i < d and string.byte(s, i) == rock and string.byte(s, i + 1) == rock then\n\t\tprint(\"No\")\n\tend\n\tif b <= i and i <= d and i + 2 <= n and string.byte(s, i) == empty and string.byte(s, i + 1) == empty and string.byte(s, i + 2) == empty then\n\t\tthreeempty = true\n\tend\nend\n\nif d < c then\n\tif not threeempty then\n\t\tprint('No')\n\t\treturn\n\tend\nend\nprint(\"Yes\")", "language": "Lua", "metadata": {"date": 1594437326, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s403407047.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s403407047", "user_id": "u816631826"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nlocal c = io.read(\"*n\")\nlocal d = io.read(\"*n\")\nio.read(\"*l\")\nlocal s = io.read(\"*l\")\nlocal empty = string.byte(\".\", 1)\nlocal rock = string.byte(\"#\", 1)\nif a > b then\n\ta, b = b, a\n\tc, d = d, c\nend\nlocal threeempty = false\nfor i = 1, math.max(c, d) do \n\tif a < i and i < c and string.byte(s, i) == rock and string.byte(s, i + 1) == rock then\n\t\tprint(\"No\")\n\t\treturn\n\tend\n\tif b < i and i < d and string.byte(s, i) == rock and string.byte(s, i + 1) == rock then\n\t\tprint(\"No\")\n\tend\n\tif b <= i and i <= d and i + 2 <= n and string.byte(s, i) == empty and string.byte(s, i + 1) == empty and string.byte(s, i + 2) == empty then\n\t\tthreeempty = true\n\tend\nend\n\nif d < c then\n\tif not threeempty then\n\t\tprint('No')\n\t\treturn\n\tend\nend\nprint(\"Yes\")", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 804, "cpu_time_ms": 71, "memory_kb": 2728}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s511654697", "group_id": "codeNet:p03017", "input_text": "local n,a,b,c,d=io.read(\"*n\",\"*n\",\"*n\",\"*n\",\"*n\",\"*l\")\nlocal s=io.read()\n\nif cd then\n local flag=true\n for i=a,c-1 do\n if s:sub(i,i+1)==\"##\" then\n flag=false\n end\n end\n for i=b,d-1 do\n if s:sub(i,i+1)==\"##\" then\n flag=false\n end\n end\n if flag then\n flag=false\n for i=b-1,d-1 do\n if s:sub(i,i+2)==\"...\" then\n flag=true\n end\n end\n print(flag and \"Yes\" or \"No\")\n end\nend", "language": "Lua", "metadata": {"date": 1590149196, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s511654697.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s511654697", "user_id": "u045238009"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local n,a,b,c,d=io.read(\"*n\",\"*n\",\"*n\",\"*n\",\"*n\",\"*l\")\nlocal s=io.read()\n\nif cd then\n local flag=true\n for i=a,c-1 do\n if s:sub(i,i+1)==\"##\" then\n flag=false\n end\n end\n for i=b,d-1 do\n if s:sub(i,i+1)==\"##\" then\n flag=false\n end\n end\n if flag then\n flag=false\n for i=b-1,d-1 do\n if s:sub(i,i+2)==\"...\" then\n flag=true\n end\n end\n print(flag and \"Yes\" or \"No\")\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 33, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s552411149", "group_id": "codeNet:p03017", "input_text": "local n,a,b,c,d=io.read(\"*n\",\"*n\",\"*n\",\"*n\",\"*n\",\"*l\")\nlocal s=io.read()\n \nif #s:sub(a,c):match(\"#+\")>1 or #s:sub(b,d):match(\"#+\")>1 then\n print(\"No\")\nelse\n if c>d then\n for i=b-1,d-1 do\n if s:sub(i,i+2)==\"...\" then\n print(\"Yes\")\n return\n end\n end\n print(\"No\")\n else\n print(\"Yes\")\n end\nend", "language": "Lua", "metadata": {"date": 1590148647, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s552411149.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s552411149", "user_id": "u045238009"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local n,a,b,c,d=io.read(\"*n\",\"*n\",\"*n\",\"*n\",\"*n\",\"*l\")\nlocal s=io.read()\n \nif #s:sub(a,c):match(\"#+\")>1 or #s:sub(b,d):match(\"#+\")>1 then\n print(\"No\")\nelse\n if c>d then\n for i=b-1,d-1 do\n if s:sub(i,i+2)==\"...\" then\n print(\"Yes\")\n return\n end\n end\n print(\"No\")\n else\n print(\"Yes\")\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 381, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s146310094", "group_id": "codeNet:p03017", "input_text": "local n,a,b,c,d=io.read(\"*n\",\"*n\",\"*n\",\"*n\",\"*n\",\"*l\")\nlocal s=io.read()\nif #s:sub(a,c):match(\"#+\")>1 or #s:sub(b,d):match(\"#+\")>1 or s:sub(c-1,c-1)==\"#\" or s:sub(c+1,c+1)==\"#\" or s:sub(d-1,d-1)==\"#\" or s:sub(d+1,d+1)==\"#\" then\n print(\"No\")\nelse\n print(\"Yes\")\nend", "language": "Lua", "metadata": {"date": 1590147784, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s146310094.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s146310094", "user_id": "u045238009"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local n,a,b,c,d=io.read(\"*n\",\"*n\",\"*n\",\"*n\",\"*n\",\"*l\")\nlocal s=io.read()\nif #s:sub(a,c):match(\"#+\")>1 or #s:sub(b,d):match(\"#+\")>1 or s:sub(c-1,c-1)==\"#\" or s:sub(c+1,c+1)==\"#\" or s:sub(d-1,d-1)==\"#\" or s:sub(d+1,d+1)==\"#\" then\n print(\"No\")\nelse\n print(\"Yes\")\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 269, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s506181302", "group_id": "codeNet:p03017", "input_text": "local n, a, b, c, d = io.read(\"*n\", \"*n\", \"*n\", \"*n\", \"*n\", \"*l\")\nlocal s = io.read()\n\nlocal function check1(l, r)\n for i = l, r - 1 do\n if s:sub(i, i) == \"#\" and s:sub(i + 1, i + 1) == \"#\" then\n return false\n end\n end\n return true\nend\n\nlocal function check2(l, r)\n for i = l, r - 2 do\n if s:sub(i, i) == \".\" and s:sub(i + 1, i + 1) == \".\" and s:sub(i + 2, i + 2) == \".\" then\n return true\n end\n end\n return false\nend\n\nif c < d then\n local r = check1(a, c) and check1(b, d)\n print(r and \"Yes\" or \"No\")\nelse\n local r = check1(a, c)\n if not r then print(\"No\")\n else\n r = check2(b - 1, d + 1)\n print(r and \"Yes\" or \"No\")\n end\nend\n", "language": "Lua", "metadata": {"date": 1563333000, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s506181302.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s506181302", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local n, a, b, c, d = io.read(\"*n\", \"*n\", \"*n\", \"*n\", \"*n\", \"*l\")\nlocal s = io.read()\n\nlocal function check1(l, r)\n for i = l, r - 1 do\n if s:sub(i, i) == \"#\" and s:sub(i + 1, i + 1) == \"#\" then\n return false\n end\n end\n return true\nend\n\nlocal function check2(l, r)\n for i = l, r - 2 do\n if s:sub(i, i) == \".\" and s:sub(i + 1, i + 1) == \".\" and s:sub(i + 2, i + 2) == \".\" then\n return true\n end\n end\n return false\nend\n\nif c < d then\n local r = check1(a, c) and check1(b, d)\n print(r and \"Yes\" or \"No\")\nelse\n local r = check1(a, c)\n if not r then print(\"No\")\n else\n r = check2(b - 1, d + 1)\n print(r and \"Yes\" or \"No\")\n end\nend\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N squares arranged in a row, numbered 1, 2, ..., N from left to right.\nYou are given a string S of length N consisting of . and #. If the i-th character of S is #, Square i contains a rock; if the i-th character of S is ., Square i is empty.\n\nIn the beginning, Snuke stands on Square A, and Fnuke stands on Square B.\n\nYou can repeat the following operation any number of times:\n\nChoose Snuke or Fnuke, and make him jump one or two squares to the right. The destination must be one of the squares, and it must not contain a rock or the other person.\n\nYou want to repeat this operation so that Snuke will stand on Square C and Fnuke will stand on Square D.\n\nDetermine whether this is possible.\n\nConstraints\n\n4 \\leq N \\leq 200\\ 000\n\nS is a string of length N consisting of . and #.\n\n1 \\leq A, B, C, D \\leq N\n\nSquare A, B, C and D do not contain a rock.\n\nA, B, C and D are all different.\n\nA < B\n\nA < C\n\nB < D\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C D\nS\n\nOutput\n\nPrint Yes if the objective is achievable, and No if it is not.\n\nSample Input 1\n\n7 1 3 6 7\n.#..#..\n\nSample Output 1\n\nYes\n\nThe objective is achievable by, for example, moving the two persons as follows. (A and B represent Snuke and Fnuke, respectively.)\n\nA#B.#..\n\nA#.B#..\n\n.#AB#..\n\n.#A.#B.\n\n.#.A#B.\n\n.#.A#.B\n\n.#..#AB\n\nSample Input 2\n\n7 1 3 7 6\n.#..#..\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n15 1 3 15 13\n...#.#...#.#...\n\nSample Output 3\n\nYes", "sample_input": "7 1 3 6 7\n.#..#..\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03017", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N squares arranged in a row, numbered 1, 2, ..., N from left to right.\nYou are given a string S of length N consisting of . and #. If the i-th character of S is #, Square i contains a rock; if the i-th character of S is ., Square i is empty.\n\nIn the beginning, Snuke stands on Square A, and Fnuke stands on Square B.\n\nYou can repeat the following operation any number of times:\n\nChoose Snuke or Fnuke, and make him jump one or two squares to the right. The destination must be one of the squares, and it must not contain a rock or the other person.\n\nYou want to repeat this operation so that Snuke will stand on Square C and Fnuke will stand on Square D.\n\nDetermine whether this is possible.\n\nConstraints\n\n4 \\leq N \\leq 200\\ 000\n\nS is a string of length N consisting of . and #.\n\n1 \\leq A, B, C, D \\leq N\n\nSquare A, B, C and D do not contain a rock.\n\nA, B, C and D are all different.\n\nA < B\n\nA < C\n\nB < D\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C D\nS\n\nOutput\n\nPrint Yes if the objective is achievable, and No if it is not.\n\nSample Input 1\n\n7 1 3 6 7\n.#..#..\n\nSample Output 1\n\nYes\n\nThe objective is achievable by, for example, moving the two persons as follows. (A and B represent Snuke and Fnuke, respectively.)\n\nA#B.#..\n\nA#.B#..\n\n.#AB#..\n\n.#A.#B.\n\n.#.A#B.\n\n.#.A#.B\n\n.#..#AB\n\nSample Input 2\n\n7 1 3 7 6\n.#..#..\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n15 1 3 15 13\n...#.#...#.#...\n\nSample Output 3\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 666, "cpu_time_ms": 45, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s967616525", "group_id": "codeNet:p03025", "input_text": "local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max\nlocal mod = 1000000007\nlocal function bmul(x, y)\n local x1, y1 = x % 10000, y % 10000\n local x2, y2 = mfl(x / 10000) % 10000, mfl(y / 10000) % 10000\n local x3, y3 = mfl(x / 100000000), mfl(y / 100000000)\n local ret = (x1 * y1 + (x1 * y2 + x2 * y1) * 10000) % mod\n ret = (ret + (x1 * y3 + x2 * y2 + x3 * y1) * 10000 % mod * 10000 % mod) % mod\n ret = (ret + (x2 * y3 + x3 * y2) * 10000 % mod * 10000 % mod * 10000) % mod\n ret = (ret + x3 * y3 * 930000007) % mod\n return ret\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while (0 < pow) do\n if (pow % 2 == 1) then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res;\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\n\nlocal cmb = 1\nlocal n, a, b, c = io.read(\"*n\", \"*n\", \"*n\", \"*n\")\nlocal e = 0\nlocal ta = bmul(a, modinv(a + b))\nlocal tb = bmul(b, modinv(a + b))\nfor x = n, 2 * n - 1 do\n if x == n then cmb = 1\n else\n cmb = bmul(cmb, x - 1)\n cmb = bmul(cmb, modinv(x - 2 - (n - 1) + 1))\n end\n -- local cmb = getComb(x - 1, n - 1)\n local p1 = cmb\n local q = modpow(ta, n)\n local r = modpow(tb, x - n)\n p1 = bmul(p1, bmul(q, r))\n p1 = bmul(p1, x)\n\n local p2 = cmb\n q = modpow(tb, n)\n r = modpow(ta, x - n)\n p2 = bmul(p2, bmul(q, r))\n p2 = bmul(p2, x)\n\n local p = p1 + p2\n -- print(p1, p2)\n p = bmul(p, modinv(a + b))\n p = bmul(p, 100)\n e = (e + p) % mod\nend\nprint(e)\n", "language": "Lua", "metadata": {"date": 1559444743, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03025.html", "problem_id": "p03025", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03025/input.txt", "sample_output_relpath": "derived/input_output/data/p03025/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03025/Lua/s967616525.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s967616525", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max\nlocal mod = 1000000007\nlocal function bmul(x, y)\n local x1, y1 = x % 10000, y % 10000\n local x2, y2 = mfl(x / 10000) % 10000, mfl(y / 10000) % 10000\n local x3, y3 = mfl(x / 100000000), mfl(y / 100000000)\n local ret = (x1 * y1 + (x1 * y2 + x2 * y1) * 10000) % mod\n ret = (ret + (x1 * y3 + x2 * y2 + x3 * y1) * 10000 % mod * 10000 % mod) % mod\n ret = (ret + (x2 * y3 + x3 * y2) * 10000 % mod * 10000 % mod * 10000) % mod\n ret = (ret + x3 * y3 * 930000007) % mod\n return ret\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while (0 < pow) do\n if (pow % 2 == 1) then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res;\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\n\nlocal cmb = 1\nlocal n, a, b, c = io.read(\"*n\", \"*n\", \"*n\", \"*n\")\nlocal e = 0\nlocal ta = bmul(a, modinv(a + b))\nlocal tb = bmul(b, modinv(a + b))\nfor x = n, 2 * n - 1 do\n if x == n then cmb = 1\n else\n cmb = bmul(cmb, x - 1)\n cmb = bmul(cmb, modinv(x - 2 - (n - 1) + 1))\n end\n -- local cmb = getComb(x - 1, n - 1)\n local p1 = cmb\n local q = modpow(ta, n)\n local r = modpow(tb, x - n)\n p1 = bmul(p1, bmul(q, r))\n p1 = bmul(p1, x)\n\n local p2 = cmb\n q = modpow(tb, n)\n r = modpow(ta, x - n)\n p2 = bmul(p2, bmul(q, r))\n p2 = bmul(p2, x)\n\n local p = p1 + p2\n -- print(p1, p2)\n p = bmul(p, modinv(a + b))\n p = bmul(p, 100)\n e = (e + p) % mod\nend\nprint(e)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nTakahashi and Aoki will play a game. They will repeatedly play it until one of them have N wins in total.\n\nWhen they play the game once, Takahashi wins with probability A %, Aoki wins with probability B %, and the game ends in a draw (that is, nobody wins) with probability C %.\nFind the expected number of games that will be played, and print it as follows.\n\nWe can represent the expected value as P/Q with coprime integers P and Q.\nPrint the integer R between 0 and 10^9+6 (inclusive) such that R \\times Q \\equiv P\\pmod {10^9+7}.\n(Such an integer R always uniquely exists under the constraints of this problem.)\n\nConstraints\n\n1 \\leq N \\leq 100000\n\n0 \\leq A,B,C \\leq 100\n\n1 \\leq A+B\n\nA+B+C=100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C\n\nOutput\n\nPrint the expected number of games that will be played, in the manner specified in the statement.\n\nSample Input 1\n\n1 25 25 50\n\nSample Output 1\n\n2\n\nSince N=1, they will repeat the game until one of them wins.\nThe expected number of games played is 2.\n\nSample Input 2\n\n4 50 50 0\n\nSample Output 2\n\n312500008\n\nC may be 0.\n\nSample Input 3\n\n1 100 0 0\n\nSample Output 3\n\n1\n\nB may also be 0.\n\nSample Input 4\n\n100000 31 41 28\n\nSample Output 4\n\n104136146", "sample_input": "1 25 25 50\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03025", "source_text": "Score : 500 points\n\nProblem Statement\n\nTakahashi and Aoki will play a game. They will repeatedly play it until one of them have N wins in total.\n\nWhen they play the game once, Takahashi wins with probability A %, Aoki wins with probability B %, and the game ends in a draw (that is, nobody wins) with probability C %.\nFind the expected number of games that will be played, and print it as follows.\n\nWe can represent the expected value as P/Q with coprime integers P and Q.\nPrint the integer R between 0 and 10^9+6 (inclusive) such that R \\times Q \\equiv P\\pmod {10^9+7}.\n(Such an integer R always uniquely exists under the constraints of this problem.)\n\nConstraints\n\n1 \\leq N \\leq 100000\n\n0 \\leq A,B,C \\leq 100\n\n1 \\leq A+B\n\nA+B+C=100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C\n\nOutput\n\nPrint the expected number of games that will be played, in the manner specified in the statement.\n\nSample Input 1\n\n1 25 25 50\n\nSample Output 1\n\n2\n\nSince N=1, they will repeat the game until one of them wins.\nThe expected number of games played is 2.\n\nSample Input 2\n\n4 50 50 0\n\nSample Output 2\n\n312500008\n\nC may be 0.\n\nSample Input 3\n\n1 100 0 0\n\nSample Output 3\n\n1\n\nB may also be 0.\n\nSample Input 4\n\n100000 31 41 28\n\nSample Output 4\n\n104136146", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1528, "cpu_time_ms": 1356, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s019290249", "group_id": "codeNet:p03026", "input_text": "local n = io.read(\"*n\")\nlocal edge = {}\nlocal edgecnt = {}\nlocal cost = {}\nfor i = 1, n do\n edge[i] = {}\n edgecnt[i] = 0\n cost[i] = 0\nend\nfor i = 1, n - 1 do\n local a, b = io.read(\"*n\", \"*n\")\n edgecnt[a] = edgecnt[a] + 1\n edgecnt[b] = edgecnt[b] + 1\n edge[a][b], edge[b][a] = true, true\nend\nlocal c = {}\nfor i = 1, n do\n c[i] = io.read(\"*n\")\nend\ntable.sort(c)\ndo\n local csum = 0\n for i = 1, n - 1 do\n csum = csum + c[i]\n end\n print(csum)\nend\nlocal tasks = {}\nfor i = 1, n do\n if edgecnt[i] == 1 then\n table.insert(tasks, i)\n end\nend\nfor i = 1, n do\n local src = tasks[i]\n cost[src] = c[i]\n for dst, _u in pairs(edge[src]) do\n if 1 < edgecnt[dst] then\n edgecnt[dst] = edgecnt[dst] - 1\n if edgecnt[dst] == 1 then\n table.insert(tasks, dst)\n end\n end\n end\nend\nprint(table.concat(cost, \" \"))\n", "language": "Lua", "metadata": {"date": 1589908062, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03026.html", "problem_id": "p03026", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03026/input.txt", "sample_output_relpath": "derived/input_output/data/p03026/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03026/Lua/s019290249.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s019290249", "user_id": "u120582723"}, "prompt_components": {"gold_output": "10\n1 2 3 4 5\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal edge = {}\nlocal edgecnt = {}\nlocal cost = {}\nfor i = 1, n do\n edge[i] = {}\n edgecnt[i] = 0\n cost[i] = 0\nend\nfor i = 1, n - 1 do\n local a, b = io.read(\"*n\", \"*n\")\n edgecnt[a] = edgecnt[a] + 1\n edgecnt[b] = edgecnt[b] + 1\n edge[a][b], edge[b][a] = true, true\nend\nlocal c = {}\nfor i = 1, n do\n c[i] = io.read(\"*n\")\nend\ntable.sort(c)\ndo\n local csum = 0\n for i = 1, n - 1 do\n csum = csum + c[i]\n end\n print(csum)\nend\nlocal tasks = {}\nfor i = 1, n do\n if edgecnt[i] == 1 then\n table.insert(tasks, i)\n end\nend\nfor i = 1, n do\n local src = tasks[i]\n cost[src] = c[i]\n for dst, _u in pairs(edge[src]) do\n if 1 < edgecnt[dst] then\n edgecnt[dst] = edgecnt[dst] - 1\n if edgecnt[dst] == 1 then\n table.insert(tasks, dst)\n end\n end\n end\nend\nprint(table.concat(cost, \" \"))\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a tree with N vertices 1,2,\\ldots,N, and positive integers c_1,c_2,\\ldots,c_N.\nThe i-th edge in the tree (1 \\leq i \\leq N-1) connects Vertex a_i and Vertex b_i.\n\nWe will write a positive integer on each vertex in T and calculate our score as follows:\n\nOn each edge, write the smaller of the integers written on the two endpoints.\n\nLet our score be the sum of the integers written on all the edges.\n\nFind the maximum possible score when we write each of c_1,c_2,\\ldots,c_N on one vertex in T, and show one way to achieve it. If an integer occurs multiple times in c_1,c_2,\\ldots,c_N, we must use it that number of times.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\n1 \\leq a_i,b_i \\leq N\n\n1 \\leq c_i \\leq 10^5\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}\nc_1 \\ldots c_N\n\nOutput\n\nUse the following format:\n\nM\nd_1 \\ldots d_N\n\nwhere M is the maximum possible score, and d_i is the integer to write on Vertex i.\nd_1,d_2,\\ldots,d_N must be a permutation of c_1,c_2,\\ldots,c_N.\nIf there are multiple ways to achieve the maximum score, any of them will be accepted.\n\nSample Input 1\n\n5\n1 2\n2 3\n3 4\n4 5\n1 2 3 4 5\n\nSample Output 1\n\n10\n1 2 3 4 5\n\nIf we write 1,2,3,4,5 on Vertex 1,2,3,4,5, respectively, the integers written on the four edges will be 1,2,3,4, for the score of 10. This is the maximum possible score.\n\nSample Input 2\n\n5\n1 2\n1 3\n1 4\n1 5\n3141 59 26 53 59\n\nSample Output 2\n\n197\n59 26 3141 59 53\n\nc_1,c_2,\\ldots,c_N may not be pairwise distinct.", "sample_input": "5\n1 2\n2 3\n3 4\n4 5\n1 2 3 4 5\n"}, "reference_outputs": ["10\n1 2 3 4 5\n"], "source_document_id": "p03026", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a tree with N vertices 1,2,\\ldots,N, and positive integers c_1,c_2,\\ldots,c_N.\nThe i-th edge in the tree (1 \\leq i \\leq N-1) connects Vertex a_i and Vertex b_i.\n\nWe will write a positive integer on each vertex in T and calculate our score as follows:\n\nOn each edge, write the smaller of the integers written on the two endpoints.\n\nLet our score be the sum of the integers written on all the edges.\n\nFind the maximum possible score when we write each of c_1,c_2,\\ldots,c_N on one vertex in T, and show one way to achieve it. If an integer occurs multiple times in c_1,c_2,\\ldots,c_N, we must use it that number of times.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\n1 \\leq a_i,b_i \\leq N\n\n1 \\leq c_i \\leq 10^5\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}\nc_1 \\ldots c_N\n\nOutput\n\nUse the following format:\n\nM\nd_1 \\ldots d_N\n\nwhere M is the maximum possible score, and d_i is the integer to write on Vertex i.\nd_1,d_2,\\ldots,d_N must be a permutation of c_1,c_2,\\ldots,c_N.\nIf there are multiple ways to achieve the maximum score, any of them will be accepted.\n\nSample Input 1\n\n5\n1 2\n2 3\n3 4\n4 5\n1 2 3 4 5\n\nSample Output 1\n\n10\n1 2 3 4 5\n\nIf we write 1,2,3,4,5 on Vertex 1,2,3,4,5, respectively, the integers written on the four edges will be 1,2,3,4, for the score of 10. This is the maximum possible score.\n\nSample Input 2\n\n5\n1 2\n1 3\n1 4\n1 5\n3141 59 26 53 59\n\nSample Output 2\n\n197\n59 26 3141 59 53\n\nc_1,c_2,\\ldots,c_N may not be pairwise distinct.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 839, "cpu_time_ms": 30, "memory_kb": 3832}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s503631168", "group_id": "codeNet:p03026", "input_text": "local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max\nlocal n = io.read(\"*n\")\nlocal at, bt = {}, {}\nlocal c = {}\nlocal ref = {}\nfor i = 1, n do\n ref[i] = {}\n ref[i].dst = {}\n ref[i].dstnum = 0\n ref[i].c = 0\n ref[i].reserved = false\nend\nfor i = 1, n - 1 do\n local a, b = io.read(\"*n\", \"*n\")\n at[i], bt[i] = a, b\n table.insert(ref[a].dst, b)\n table.insert(ref[b].dst, a)\n ref[a].dstnum, ref[b].dstnum = ref[a].dstnum + 1, ref[b].dstnum + 1\nend\nfor i = 1, n do\n c[i] = io.read(\"*n\")\nend\ntable.sort(c)\nlocal tasks = {}\nlocal tasknum, done = 0, 0\nlocal function addtask(idx)\n ref[idx].reserved = true\n table.insert(tasks, idx)\n tasknum = tasknum + 1\nend\nfor i = 1, n do\n if #(ref[i].dst) == 1 then\n addtask(i)\n end\nend\nwhile done < tasknum do\n done = done + 1\n local idx = tasks[done]\n ref[idx].c = c[done]\n for i = 1, #(ref[idx].dst) do\n local dstidx = ref[idx].dst[i]\n if not ref[dstidx].reserved then\n ref[dstidx].dstnum = ref[dstidx].dstnum - 1\n if ref[dstidx].dstnum == 1 then\n addtask(dstidx)\n end\n end\n end\nend\n\nlocal sum = 0\nfor i = 1, n - 1 do\n sum = sum + mmi(ref[at[i]].c, ref[bt[i]].c)\nend\nprint(sum)\nio.write(ref[1].c)\nfor i = 2, n do\n io.write(\" \" .. ref[i].c)\nend\nio.write(\"\\n\")\n", "language": "Lua", "metadata": {"date": 1559441070, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03026.html", "problem_id": "p03026", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03026/input.txt", "sample_output_relpath": "derived/input_output/data/p03026/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03026/Lua/s503631168.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s503631168", "user_id": "u120582723"}, "prompt_components": {"gold_output": "10\n1 2 3 4 5\n", "input_to_evaluate": "local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max\nlocal n = io.read(\"*n\")\nlocal at, bt = {}, {}\nlocal c = {}\nlocal ref = {}\nfor i = 1, n do\n ref[i] = {}\n ref[i].dst = {}\n ref[i].dstnum = 0\n ref[i].c = 0\n ref[i].reserved = false\nend\nfor i = 1, n - 1 do\n local a, b = io.read(\"*n\", \"*n\")\n at[i], bt[i] = a, b\n table.insert(ref[a].dst, b)\n table.insert(ref[b].dst, a)\n ref[a].dstnum, ref[b].dstnum = ref[a].dstnum + 1, ref[b].dstnum + 1\nend\nfor i = 1, n do\n c[i] = io.read(\"*n\")\nend\ntable.sort(c)\nlocal tasks = {}\nlocal tasknum, done = 0, 0\nlocal function addtask(idx)\n ref[idx].reserved = true\n table.insert(tasks, idx)\n tasknum = tasknum + 1\nend\nfor i = 1, n do\n if #(ref[i].dst) == 1 then\n addtask(i)\n end\nend\nwhile done < tasknum do\n done = done + 1\n local idx = tasks[done]\n ref[idx].c = c[done]\n for i = 1, #(ref[idx].dst) do\n local dstidx = ref[idx].dst[i]\n if not ref[dstidx].reserved then\n ref[dstidx].dstnum = ref[dstidx].dstnum - 1\n if ref[dstidx].dstnum == 1 then\n addtask(dstidx)\n end\n end\n end\nend\n\nlocal sum = 0\nfor i = 1, n - 1 do\n sum = sum + mmi(ref[at[i]].c, ref[bt[i]].c)\nend\nprint(sum)\nio.write(ref[1].c)\nfor i = 2, n do\n io.write(\" \" .. ref[i].c)\nend\nio.write(\"\\n\")\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a tree with N vertices 1,2,\\ldots,N, and positive integers c_1,c_2,\\ldots,c_N.\nThe i-th edge in the tree (1 \\leq i \\leq N-1) connects Vertex a_i and Vertex b_i.\n\nWe will write a positive integer on each vertex in T and calculate our score as follows:\n\nOn each edge, write the smaller of the integers written on the two endpoints.\n\nLet our score be the sum of the integers written on all the edges.\n\nFind the maximum possible score when we write each of c_1,c_2,\\ldots,c_N on one vertex in T, and show one way to achieve it. If an integer occurs multiple times in c_1,c_2,\\ldots,c_N, we must use it that number of times.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\n1 \\leq a_i,b_i \\leq N\n\n1 \\leq c_i \\leq 10^5\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}\nc_1 \\ldots c_N\n\nOutput\n\nUse the following format:\n\nM\nd_1 \\ldots d_N\n\nwhere M is the maximum possible score, and d_i is the integer to write on Vertex i.\nd_1,d_2,\\ldots,d_N must be a permutation of c_1,c_2,\\ldots,c_N.\nIf there are multiple ways to achieve the maximum score, any of them will be accepted.\n\nSample Input 1\n\n5\n1 2\n2 3\n3 4\n4 5\n1 2 3 4 5\n\nSample Output 1\n\n10\n1 2 3 4 5\n\nIf we write 1,2,3,4,5 on Vertex 1,2,3,4,5, respectively, the integers written on the four edges will be 1,2,3,4, for the score of 10. This is the maximum possible score.\n\nSample Input 2\n\n5\n1 2\n1 3\n1 4\n1 5\n3141 59 26 53 59\n\nSample Output 2\n\n197\n59 26 3141 59 53\n\nc_1,c_2,\\ldots,c_N may not be pairwise distinct.", "sample_input": "5\n1 2\n2 3\n3 4\n4 5\n1 2 3 4 5\n"}, "reference_outputs": ["10\n1 2 3 4 5\n"], "source_document_id": "p03026", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a tree with N vertices 1,2,\\ldots,N, and positive integers c_1,c_2,\\ldots,c_N.\nThe i-th edge in the tree (1 \\leq i \\leq N-1) connects Vertex a_i and Vertex b_i.\n\nWe will write a positive integer on each vertex in T and calculate our score as follows:\n\nOn each edge, write the smaller of the integers written on the two endpoints.\n\nLet our score be the sum of the integers written on all the edges.\n\nFind the maximum possible score when we write each of c_1,c_2,\\ldots,c_N on one vertex in T, and show one way to achieve it. If an integer occurs multiple times in c_1,c_2,\\ldots,c_N, we must use it that number of times.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\n1 \\leq a_i,b_i \\leq N\n\n1 \\leq c_i \\leq 10^5\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}\nc_1 \\ldots c_N\n\nOutput\n\nUse the following format:\n\nM\nd_1 \\ldots d_N\n\nwhere M is the maximum possible score, and d_i is the integer to write on Vertex i.\nd_1,d_2,\\ldots,d_N must be a permutation of c_1,c_2,\\ldots,c_N.\nIf there are multiple ways to achieve the maximum score, any of them will be accepted.\n\nSample Input 1\n\n5\n1 2\n2 3\n3 4\n4 5\n1 2 3 4 5\n\nSample Output 1\n\n10\n1 2 3 4 5\n\nIf we write 1,2,3,4,5 on Vertex 1,2,3,4,5, respectively, the integers written on the four edges will be 1,2,3,4, for the score of 10. This is the maximum possible score.\n\nSample Input 2\n\n5\n1 2\n1 3\n1 4\n1 5\n3141 59 26 53 59\n\nSample Output 2\n\n197\n59 26 3141 59 53\n\nc_1,c_2,\\ldots,c_N may not be pairwise distinct.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 32, "memory_kb": 4096}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s248604837", "group_id": "codeNet:p03026", "input_text": "local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max\nlocal n = io.read(\"*n\")\nlocal at, bt, c = {}, {}\nlocal c = {}\nlocal ref = {}\nfor i = 1, n do\n ref[i] = {}\n ref[i].idx = i\n ref[i].v = 0\n ref[i].c = 0\nend\nfor i = 1, n - 1 do\n local a, b = io.read(\"*n\", \"*n\")\n at[i], bt[i] = a, b\n ref[a].v, ref[b].v = ref[a].v + 1, ref[b].v + 1\nend\nfor i = 1, n do\n c[i] = io.read(\"*n\")\nend\ntable.sort(ref, function(x, y) return x.v < y.v end)\ntable.sort(c)\nfor i = 1, n do\n ref[i].c = c[i]\nend\ntable.sort(ref, function(x, y) return x.idx < y.idx end)\nlocal sum = 0\nfor i = 1, n - 1 do\n sum = sum + mmi(ref[at[i]].c, ref[bt[i]].c)\nend\nprint(sum)\nio.write(ref[1].c)\nfor i = 2, n do\n io.write(\" \" .. ref[i].c)\nend\nio.write(\"\\n\")\n", "language": "Lua", "metadata": {"date": 1559438876, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03026.html", "problem_id": "p03026", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03026/input.txt", "sample_output_relpath": "derived/input_output/data/p03026/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03026/Lua/s248604837.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s248604837", "user_id": "u120582723"}, "prompt_components": {"gold_output": "10\n1 2 3 4 5\n", "input_to_evaluate": "local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max\nlocal n = io.read(\"*n\")\nlocal at, bt, c = {}, {}\nlocal c = {}\nlocal ref = {}\nfor i = 1, n do\n ref[i] = {}\n ref[i].idx = i\n ref[i].v = 0\n ref[i].c = 0\nend\nfor i = 1, n - 1 do\n local a, b = io.read(\"*n\", \"*n\")\n at[i], bt[i] = a, b\n ref[a].v, ref[b].v = ref[a].v + 1, ref[b].v + 1\nend\nfor i = 1, n do\n c[i] = io.read(\"*n\")\nend\ntable.sort(ref, function(x, y) return x.v < y.v end)\ntable.sort(c)\nfor i = 1, n do\n ref[i].c = c[i]\nend\ntable.sort(ref, function(x, y) return x.idx < y.idx end)\nlocal sum = 0\nfor i = 1, n - 1 do\n sum = sum + mmi(ref[at[i]].c, ref[bt[i]].c)\nend\nprint(sum)\nio.write(ref[1].c)\nfor i = 2, n do\n io.write(\" \" .. ref[i].c)\nend\nio.write(\"\\n\")\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a tree with N vertices 1,2,\\ldots,N, and positive integers c_1,c_2,\\ldots,c_N.\nThe i-th edge in the tree (1 \\leq i \\leq N-1) connects Vertex a_i and Vertex b_i.\n\nWe will write a positive integer on each vertex in T and calculate our score as follows:\n\nOn each edge, write the smaller of the integers written on the two endpoints.\n\nLet our score be the sum of the integers written on all the edges.\n\nFind the maximum possible score when we write each of c_1,c_2,\\ldots,c_N on one vertex in T, and show one way to achieve it. If an integer occurs multiple times in c_1,c_2,\\ldots,c_N, we must use it that number of times.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\n1 \\leq a_i,b_i \\leq N\n\n1 \\leq c_i \\leq 10^5\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}\nc_1 \\ldots c_N\n\nOutput\n\nUse the following format:\n\nM\nd_1 \\ldots d_N\n\nwhere M is the maximum possible score, and d_i is the integer to write on Vertex i.\nd_1,d_2,\\ldots,d_N must be a permutation of c_1,c_2,\\ldots,c_N.\nIf there are multiple ways to achieve the maximum score, any of them will be accepted.\n\nSample Input 1\n\n5\n1 2\n2 3\n3 4\n4 5\n1 2 3 4 5\n\nSample Output 1\n\n10\n1 2 3 4 5\n\nIf we write 1,2,3,4,5 on Vertex 1,2,3,4,5, respectively, the integers written on the four edges will be 1,2,3,4, for the score of 10. This is the maximum possible score.\n\nSample Input 2\n\n5\n1 2\n1 3\n1 4\n1 5\n3141 59 26 53 59\n\nSample Output 2\n\n197\n59 26 3141 59 53\n\nc_1,c_2,\\ldots,c_N may not be pairwise distinct.", "sample_input": "5\n1 2\n2 3\n3 4\n4 5\n1 2 3 4 5\n"}, "reference_outputs": ["10\n1 2 3 4 5\n"], "source_document_id": "p03026", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a tree with N vertices 1,2,\\ldots,N, and positive integers c_1,c_2,\\ldots,c_N.\nThe i-th edge in the tree (1 \\leq i \\leq N-1) connects Vertex a_i and Vertex b_i.\n\nWe will write a positive integer on each vertex in T and calculate our score as follows:\n\nOn each edge, write the smaller of the integers written on the two endpoints.\n\nLet our score be the sum of the integers written on all the edges.\n\nFind the maximum possible score when we write each of c_1,c_2,\\ldots,c_N on one vertex in T, and show one way to achieve it. If an integer occurs multiple times in c_1,c_2,\\ldots,c_N, we must use it that number of times.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\n1 \\leq a_i,b_i \\leq N\n\n1 \\leq c_i \\leq 10^5\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}\nc_1 \\ldots c_N\n\nOutput\n\nUse the following format:\n\nM\nd_1 \\ldots d_N\n\nwhere M is the maximum possible score, and d_i is the integer to write on Vertex i.\nd_1,d_2,\\ldots,d_N must be a permutation of c_1,c_2,\\ldots,c_N.\nIf there are multiple ways to achieve the maximum score, any of them will be accepted.\n\nSample Input 1\n\n5\n1 2\n2 3\n3 4\n4 5\n1 2 3 4 5\n\nSample Output 1\n\n10\n1 2 3 4 5\n\nIf we write 1,2,3,4,5 on Vertex 1,2,3,4,5, respectively, the integers written on the four edges will be 1,2,3,4, for the score of 10. This is the maximum possible score.\n\nSample Input 2\n\n5\n1 2\n1 3\n1 4\n1 5\n3141 59 26 53 59\n\nSample Output 2\n\n197\n59 26 3141 59 53\n\nc_1,c_2,\\ldots,c_N may not be pairwise distinct.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 756, "cpu_time_ms": 41, "memory_kb": 3072}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s170808116", "group_id": "codeNet:p03029", "input_text": "a, p = io.read(\"*n\", \"*n\")\nprint(math.floor((a * 3 + p) / 2))", "language": "Lua", "metadata": {"date": 1579359136, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03029.html", "problem_id": "p03029", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03029/input.txt", "sample_output_relpath": "derived/input_output/data/p03029/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03029/Lua/s170808116.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s170808116", "user_id": "u720483676"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "a, p = io.read(\"*n\", \"*n\")\nprint(math.floor((a * 3 + p) / 2))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have A apples and P pieces of apple.\n\nWe can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan.\n\nFind the maximum number of apple pies we can make with what we have now.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, P \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA P\n\nOutput\n\nPrint the maximum number of apple pies we can make with what we have.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n3\n\nWe can first make one apple pie by simmering two of the three pieces of apple. Then, we can make two more by simmering the remaining piece and three more pieces obtained by cutting the whole apple.\n\nSample Input 2\n\n0 1\n\nSample Output 2\n\n0\n\nWe cannot make an apple pie in this case, unfortunately.\n\nSample Input 3\n\n32 21\n\nSample Output 3\n\n58", "sample_input": "1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03029", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have A apples and P pieces of apple.\n\nWe can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan.\n\nFind the maximum number of apple pies we can make with what we have now.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, P \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA P\n\nOutput\n\nPrint the maximum number of apple pies we can make with what we have.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n3\n\nWe can first make one apple pie by simmering two of the three pieces of apple. Then, we can make two more by simmering the remaining piece and three more pieces obtained by cutting the whole apple.\n\nSample Input 2\n\n0 1\n\nSample Output 2\n\n0\n\nWe cannot make an apple pie in this case, unfortunately.\n\nSample Input 3\n\n32 21\n\nSample Output 3\n\n58", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 61, "cpu_time_ms": 7, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s490068498", "group_id": "codeNet:p03030", "input_text": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nlocal str2tbl = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\n--\nlocal N = read.nl()\nlocal cities = {}\nfor i=1,N do\n local s, p = read.l():split()\n p = tonumber(p)\n cities[s] = cities[s] or {}\n table.insert(cities[s], {i, p})\nend\n\nlocal cities2 = {}\nfor city in pairs(cities) do\n table.insert(cities2, city)\nend\ntable.sort(cities2, function (x,y) return xy[2] end)\n for _, r in ipairs(city) do\n print(r[1])\n end\nend\n", "language": "Lua", "metadata": {"date": 1570373007, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03030.html", "problem_id": "p03030", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03030/input.txt", "sample_output_relpath": "derived/input_output/data/p03030/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03030/Lua/s490068498.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s490068498", "user_id": "u162773977"}, "prompt_components": {"gold_output": "3\n4\n6\n1\n5\n2\n", "input_to_evaluate": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nlocal str2tbl = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\n--\nlocal N = read.nl()\nlocal cities = {}\nfor i=1,N do\n local s, p = read.l():split()\n p = tonumber(p)\n cities[s] = cities[s] or {}\n table.insert(cities[s], {i, p})\nend\n\nlocal cities2 = {}\nfor city in pairs(cities) do\n table.insert(cities2, city)\nend\ntable.sort(cities2, function (x,y) return xy[2] end)\n for _, r in ipairs(city) do\n print(r[1])\n end\nend\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have decided to write a book introducing good restaurants.\nThere are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i.\nNo two restaurants have the same score.\n\nYou want to introduce the restaurants in the following order:\n\nThe restaurants are arranged in lexicographical order of the names of their cities.\n\nIf there are multiple restaurants in the same city, they are arranged in descending order of score.\n\nPrint the identification numbers of the restaurants in the order they are introduced in the book.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nS is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\n0 ≤ P_i ≤ 100\n\nP_i is an integer.\n\nP_i ≠ P_j (1 ≤ i < j ≤ N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 P_1\n:\nS_N P_N\n\nOutput\n\nPrint N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.\n\nSample Input 1\n\n6\nkhabarovsk 20\nmoscow 10\nkazan 50\nkazan 35\nmoscow 60\nkhabarovsk 40\n\nSample Output 1\n\n3\n4\n6\n1\n5\n2\n\nThe lexicographical order of the names of the three cities is kazan < khabarovsk < moscow. For each of these cities, the restaurants in it are introduced in descending order of score. Thus, the restaurants are introduced in the order 3,4,6,1,5,2.\n\nSample Input 2\n\n10\nyakutsk 10\nyakutsk 20\nyakutsk 30\nyakutsk 40\nyakutsk 50\nyakutsk 60\nyakutsk 70\nyakutsk 80\nyakutsk 90\nyakutsk 100\n\nSample Output 2\n\n10\n9\n8\n7\n6\n5\n4\n3\n2\n1", "sample_input": "6\nkhabarovsk 20\nmoscow 10\nkazan 50\nkazan 35\nmoscow 60\nkhabarovsk 40\n"}, "reference_outputs": ["3\n4\n6\n1\n5\n2\n"], "source_document_id": "p03030", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have decided to write a book introducing good restaurants.\nThere are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i.\nNo two restaurants have the same score.\n\nYou want to introduce the restaurants in the following order:\n\nThe restaurants are arranged in lexicographical order of the names of their cities.\n\nIf there are multiple restaurants in the same city, they are arranged in descending order of score.\n\nPrint the identification numbers of the restaurants in the order they are introduced in the book.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nS is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\n0 ≤ P_i ≤ 100\n\nP_i is an integer.\n\nP_i ≠ P_j (1 ≤ i < j ≤ N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 P_1\n:\nS_N P_N\n\nOutput\n\nPrint N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.\n\nSample Input 1\n\n6\nkhabarovsk 20\nmoscow 10\nkazan 50\nkazan 35\nmoscow 60\nkhabarovsk 40\n\nSample Output 1\n\n3\n4\n6\n1\n5\n2\n\nThe lexicographical order of the names of the three cities is kazan < khabarovsk < moscow. For each of these cities, the restaurants in it are introduced in descending order of score. Thus, the restaurants are introduced in the order 3,4,6,1,5,2.\n\nSample Input 2\n\n10\nyakutsk 10\nyakutsk 20\nyakutsk 30\nyakutsk 40\nyakutsk 50\nyakutsk 60\nyakutsk 70\nyakutsk 80\nyakutsk 90\nyakutsk 100\n\nSample Output 2\n\n10\n9\n8\n7\n6\n5\n4\n3\n2\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1049, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s958807027", "group_id": "codeNet:p03031", "input_text": "local n,m=io.read(\"n\",\"n\")\nlocal s={}\nfor i=1,m do\n local k=io.read(\"n\")\n s[i]={}\n for j=1,k do\n s[i][j]=io.read(\"n\")-1\n end\nend\nlocal p={}\nfor i=1,m do\n p[i]=io.read(\"n\")\nend\n\nlocal counter=0\nfor bit=0,(1<0 and 1 or 0)\n end\n if onoff%2~=p[i] then\n checker=false\n end\n end\n counter=counter+(checker and 1 or 0)\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1590986357, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s958807027.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s958807027", "user_id": "u045238009"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local n,m=io.read(\"n\",\"n\")\nlocal s={}\nfor i=1,m do\n local k=io.read(\"n\")\n s[i]={}\n for j=1,k do\n s[i][j]=io.read(\"n\")-1\n end\nend\nlocal p={}\nfor i=1,m do\n p[i]=io.read(\"n\")\nend\n\nlocal counter=0\nfor bit=0,(1<0 and 1 or 0)\n end\n if onoff%2~=p[i] then\n checker=false\n end\n end\n counter=counter+(checker and 1 or 0)\nend\nprint(counter)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 530, "cpu_time_ms": 13, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s406418874", "group_id": "codeNet:p03032", "input_text": "local DBG = false\nlocal function dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nlocal function dbgpr_t(tbl, use_pairs)\n if DBG then\n local enum = ipairs\n if use_pairs then\n enum = pairs\n end\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in enum(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\n----\nlocal N, Kmax = io.read(\"n\", \"n\")\nlocal V = {}\nfor i=1,N do\n V[i] = io.read(\"n\")\nend\n\nlocal lim_left = math.min(N, Kmax)\nlocal ans = 0\nfor a=0, lim_left do\n local got_left = {}\n local lim_right = math.min(N-a, Kmax-a)\n assert(lim_right >= 0)\n for i=1,a do\n got_left[i] = V[i]\n end\n for b=0, lim_right do\n local got = {table.unpack(got_left)}\n for i=1,b do\n got[#got + 1] = V[N+1-i]\n end\n table.sort(got)\n local ndiscard = Kmax - a - b\n local ndiscard_orig = ndiscard\n assert(ndiscard >= 0)\n local value = 0\n for i=1, #got do\n if got[i] < 0 and ndiscard > 0 then\n ndiscard = ndiscard - 1\n else\n value = value + got[i]\n end\n end\n dbgpr(a, b, #got, ndiscard_orig, value)\n ans = math.max(ans, value)\n end\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1565484832, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03032.html", "problem_id": "p03032", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03032/input.txt", "sample_output_relpath": "derived/input_output/data/p03032/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03032/Lua/s406418874.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s406418874", "user_id": "u162773977"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "local DBG = false\nlocal function dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nlocal function dbgpr_t(tbl, use_pairs)\n if DBG then\n local enum = ipairs\n if use_pairs then\n enum = pairs\n end\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in enum(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\n----\nlocal N, Kmax = io.read(\"n\", \"n\")\nlocal V = {}\nfor i=1,N do\n V[i] = io.read(\"n\")\nend\n\nlocal lim_left = math.min(N, Kmax)\nlocal ans = 0\nfor a=0, lim_left do\n local got_left = {}\n local lim_right = math.min(N-a, Kmax-a)\n assert(lim_right >= 0)\n for i=1,a do\n got_left[i] = V[i]\n end\n for b=0, lim_right do\n local got = {table.unpack(got_left)}\n for i=1,b do\n got[#got + 1] = V[N+1-i]\n end\n table.sort(got)\n local ndiscard = Kmax - a - b\n local ndiscard_orig = ndiscard\n assert(ndiscard >= 0)\n local value = 0\n for i=1, #got do\n if got[i] < 0 and ndiscard > 0 then\n ndiscard = ndiscard - 1\n else\n value = value + got[i]\n end\n end\n dbgpr(a, b, #got, ndiscard_orig, value)\n ans = math.max(ans, value)\n end\nend\nprint(ans)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYour friend gave you a dequeue D as a birthday present.\n\nD is a horizontal cylinder that contains a row of N jewels.\n\nThe values of the jewels are V_1, V_2, ..., V_N from left to right. There may be jewels with negative values.\n\nIn the beginning, you have no jewel in your hands.\n\nYou can perform at most K operations on D, chosen from the following, at most K times (possibly zero):\n\nOperation A: Take out the leftmost jewel contained in D and have it in your hand. You cannot do this operation when D is empty.\n\nOperation B: Take out the rightmost jewel contained in D and have it in your hand. You cannot do this operation when D is empty.\n\nOperation C: Choose a jewel in your hands and insert it to the left end of D. You cannot do this operation when you have no jewel in your hand.\n\nOperation D: Choose a jewel in your hands and insert it to the right end of D. You cannot do this operation when you have no jewel in your hand.\n\nFind the maximum possible sum of the values of jewels in your hands after the operations.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 50\n\n1 \\leq K \\leq 100\n\n-10^7 \\leq V_i \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nV_1 V_2 ... V_N\n\nOutput\n\nPrint the maximum possible sum of the values of jewels in your hands after the operations.\n\nSample Input 1\n\n6 4\n-10 8 2 1 2 6\n\nSample Output 1\n\n14\n\nAfter the following sequence of operations, you have two jewels of values 8 and 6 in your hands for a total of 14, which is the maximum result.\n\nDo operation A. You take out the jewel of value -10 from the left end of D.\n\nDo operation B. You take out the jewel of value 6 from the right end of D.\n\nDo operation A. You take out the jewel of value 8 from the left end of D.\n\nDo operation D. You insert the jewel of value -10 to the right end of D.\n\nSample Input 2\n\n6 4\n-6 -100 50 -2 -5 -3\n\nSample Output 2\n\n44\n\nSample Input 3\n\n6 3\n-6 -100 50 -2 -5 -3\n\nSample Output 3\n\n0\n\nIt is optimal to do no operation.", "sample_input": "6 4\n-10 8 2 1 2 6\n"}, "reference_outputs": ["14\n"], "source_document_id": "p03032", "source_text": "Score : 400 points\n\nProblem Statement\n\nYour friend gave you a dequeue D as a birthday present.\n\nD is a horizontal cylinder that contains a row of N jewels.\n\nThe values of the jewels are V_1, V_2, ..., V_N from left to right. There may be jewels with negative values.\n\nIn the beginning, you have no jewel in your hands.\n\nYou can perform at most K operations on D, chosen from the following, at most K times (possibly zero):\n\nOperation A: Take out the leftmost jewel contained in D and have it in your hand. You cannot do this operation when D is empty.\n\nOperation B: Take out the rightmost jewel contained in D and have it in your hand. You cannot do this operation when D is empty.\n\nOperation C: Choose a jewel in your hands and insert it to the left end of D. You cannot do this operation when you have no jewel in your hand.\n\nOperation D: Choose a jewel in your hands and insert it to the right end of D. You cannot do this operation when you have no jewel in your hand.\n\nFind the maximum possible sum of the values of jewels in your hands after the operations.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 50\n\n1 \\leq K \\leq 100\n\n-10^7 \\leq V_i \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nV_1 V_2 ... V_N\n\nOutput\n\nPrint the maximum possible sum of the values of jewels in your hands after the operations.\n\nSample Input 1\n\n6 4\n-10 8 2 1 2 6\n\nSample Output 1\n\n14\n\nAfter the following sequence of operations, you have two jewels of values 8 and 6 in your hands for a total of 14, which is the maximum result.\n\nDo operation A. You take out the jewel of value -10 from the left end of D.\n\nDo operation B. You take out the jewel of value 6 from the right end of D.\n\nDo operation A. You take out the jewel of value 8 from the left end of D.\n\nDo operation D. You insert the jewel of value -10 to the right end of D.\n\nSample Input 2\n\n6 4\n-6 -100 50 -2 -5 -3\n\nSample Output 2\n\n44\n\nSample Input 3\n\n6 3\n-6 -100 50 -2 -5 -3\n\nSample Output 3\n\n0\n\nIt is optimal to do no operation.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1403, "cpu_time_ms": 16, "memory_kb": 1132}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s181763133", "group_id": "codeNet:p03034", "input_text": "local mfl, mce = math.floor, math.ceil\nlocal bls, brs = bit.lshift, bit.rshift\nlocal mmi, mma = math.min, math.max\nlocal n = io.read(\"*n\")\nlocal t = {}\n_u = io.read(\"*n\")\nfor i = 1, n - 1 do\n t[i] = io.read(\"*n\")\nend\nn = n - 1\nlocal ret = 0\nlocal lim = brs(n - 1, 1)\nfor i = 1, n do\n local lim2 = mfl(lim / i)\n local c = 0\n for j = 1, n do\n if n % i == 0 then\n if n - i * j <= i * j then break end\n end\n if n - i * j < i then break end\n c = c + t[i * j] + t[n - i * j]\n ret = mma(ret, c)\n end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1587527632, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03034.html", "problem_id": "p03034", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03034/input.txt", "sample_output_relpath": "derived/input_output/data/p03034/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03034/Lua/s181763133.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s181763133", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local mfl, mce = math.floor, math.ceil\nlocal bls, brs = bit.lshift, bit.rshift\nlocal mmi, mma = math.min, math.max\nlocal n = io.read(\"*n\")\nlocal t = {}\n_u = io.read(\"*n\")\nfor i = 1, n - 1 do\n t[i] = io.read(\"*n\")\nend\nn = n - 1\nlocal ret = 0\nlocal lim = brs(n - 1, 1)\nfor i = 1, n do\n local lim2 = mfl(lim / i)\n local c = 0\n for j = 1, n do\n if n % i == 0 then\n if n - i * j <= i * j then break end\n end\n if n - i * j < i then break end\n c = c + t[i * j] + t[n - i * j]\n ret = mma(ret, c)\n end\nend\nprint(ret)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere is an infinitely large pond, which we consider as a number line.\nIn this pond, there are N lotuses floating at coordinates 0, 1, 2, ..., N-2 and N-1.\nOn the lotus at coordinate i, an integer s_i is written.\n\nYou are standing on the lotus at coordinate 0. You will play a game that proceeds as follows:\n\n1. Choose positive integers A and B. Your score is initially 0.\n\n2. Let x be your current coordinate, and y = x+A. The lotus at coordinate x disappears, and you move to coordinate y.\n\nIf y = N-1, the game ends.\n\nIf y \\neq N-1 and there is a lotus floating at coordinate y, your score increases by s_y.\n\nIf y \\neq N-1 and there is no lotus floating at coordinate y, you drown. Your score decreases by 10^{100} points, and the game ends.\n\n3. Let x be your current coordinate, and y = x-B. The lotus at coordinate x disappears, and you move to coordinate y.\n\nIf y = N-1, the game ends.\n\nIf y \\neq N-1 and there is a lotus floating at coordinate y, your score increases by s_y.\n\nIf y \\neq N-1 and there is no lotus floating at coordinate y, you drown. Your score decreases by 10^{100} points, and the game ends.\n\n4. Go back to step 2.\n\nYou want to end the game with as high a score as possible.\nWhat is the score obtained by the optimal choice of A and B?\n\nConstraints\n\n3 \\leq N \\leq 10^5\n\n-10^9 \\leq s_i \\leq 10^9\n\ns_0=s_{N-1}=0\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_0 s_1 ...... s_{N-1}\n\nOutput\n\nPrint the score obtained by the optimal choice of A and B.\n\nSample Input 1\n\n5\n0 2 5 1 0\n\nSample Output 1\n\n3\n\nIf you choose A = 3 and B = 2, the game proceeds as follows:\n\nMove to coordinate 0 + 3 = 3. Your score increases by s_3 = 1.\n\nMove to coordinate 3 - 2 = 1. Your score increases by s_1 = 2.\n\nMove to coordinate 1 + 3 = 4. The game ends with a score of 3.\n\nThere is no way to end the game with a score of 4 or higher, so the answer is 3. Note that you cannot land the lotus at coordinate 2 without drowning later.\n\nSample Input 2\n\n6\n0 10 -7 -4 -13 0\n\nSample Output 2\n\n0\n\nThe optimal strategy here is to land the final lotus immediately by choosing A = 5 (the value of B does not matter).\n\nSample Input 3\n\n11\n0 -4 0 -99 31 14 -15 -39 43 18 0\n\nSample Output 3\n\n59", "sample_input": "5\n0 2 5 1 0\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03034", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere is an infinitely large pond, which we consider as a number line.\nIn this pond, there are N lotuses floating at coordinates 0, 1, 2, ..., N-2 and N-1.\nOn the lotus at coordinate i, an integer s_i is written.\n\nYou are standing on the lotus at coordinate 0. You will play a game that proceeds as follows:\n\n1. Choose positive integers A and B. Your score is initially 0.\n\n2. Let x be your current coordinate, and y = x+A. The lotus at coordinate x disappears, and you move to coordinate y.\n\nIf y = N-1, the game ends.\n\nIf y \\neq N-1 and there is a lotus floating at coordinate y, your score increases by s_y.\n\nIf y \\neq N-1 and there is no lotus floating at coordinate y, you drown. Your score decreases by 10^{100} points, and the game ends.\n\n3. Let x be your current coordinate, and y = x-B. The lotus at coordinate x disappears, and you move to coordinate y.\n\nIf y = N-1, the game ends.\n\nIf y \\neq N-1 and there is a lotus floating at coordinate y, your score increases by s_y.\n\nIf y \\neq N-1 and there is no lotus floating at coordinate y, you drown. Your score decreases by 10^{100} points, and the game ends.\n\n4. Go back to step 2.\n\nYou want to end the game with as high a score as possible.\nWhat is the score obtained by the optimal choice of A and B?\n\nConstraints\n\n3 \\leq N \\leq 10^5\n\n-10^9 \\leq s_i \\leq 10^9\n\ns_0=s_{N-1}=0\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_0 s_1 ...... s_{N-1}\n\nOutput\n\nPrint the score obtained by the optimal choice of A and B.\n\nSample Input 1\n\n5\n0 2 5 1 0\n\nSample Output 1\n\n3\n\nIf you choose A = 3 and B = 2, the game proceeds as follows:\n\nMove to coordinate 0 + 3 = 3. Your score increases by s_3 = 1.\n\nMove to coordinate 3 - 2 = 1. Your score increases by s_1 = 2.\n\nMove to coordinate 1 + 3 = 4. The game ends with a score of 3.\n\nThere is no way to end the game with a score of 4 or higher, so the answer is 3. Note that you cannot land the lotus at coordinate 2 without drowning later.\n\nSample Input 2\n\n6\n0 10 -7 -4 -13 0\n\nSample Output 2\n\n0\n\nThe optimal strategy here is to land the final lotus immediately by choosing A = 5 (the value of B does not matter).\n\nSample Input 3\n\n11\n0 -4 0 -99 31 14 -15 -39 43 18 0\n\nSample Output 3\n\n59", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 533, "cpu_time_ms": 43, "memory_kb": 1280}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s511697932", "group_id": "codeNet:p03035", "input_text": "local a, b = io.read(\"n\", \"n\")\nif a >= 13 then\n print(b)\nelseif a >= 6 then\n print(b//2)\nelse\n print(0)\nend", "language": "Lua", "metadata": {"date": 1563666158, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03035.html", "problem_id": "p03035", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03035/input.txt", "sample_output_relpath": "derived/input_output/data/p03035/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03035/Lua/s511697932.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s511697932", "user_id": "u162773977"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "local a, b = io.read(\"n\", \"n\")\nif a >= 13 then\n print(b)\nelseif a >= 6 then\n print(b//2)\nelse\n print(0)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "sample_input": "30 100\n"}, "reference_outputs": ["100\n"], "source_document_id": "p03035", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 116, "cpu_time_ms": 4, "memory_kb": 508}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s969396542", "group_id": "codeNet:p03037", "input_text": "N, M = io.read(\"*n\", \"*n\", \"*l\")\nL_max = 0\nR_min = 10^5\nfor i = 1, M do\n L, R = io.read(\"*n\", \"*n\", \"*l\")\n if L <= R_min then\n L_max = math.max(L, L_max)\n end\n if R >= L_max then\n R_min = math.min(R, R_min)\n end\nend\nprint(string.format(\"%d\", R_min-L_max+1))", "language": "Lua", "metadata": {"date": 1587091995, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s969396542.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s969396542", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "N, M = io.read(\"*n\", \"*n\", \"*l\")\nL_max = 0\nR_min = 10^5\nfor i = 1, M do\n L, R = io.read(\"*n\", \"*n\", \"*l\")\n if L <= R_min then\n L_max = math.max(L, L_max)\n end\n if R >= L_max then\n R_min = math.min(R, R_min)\n end\nend\nprint(string.format(\"%d\", R_min-L_max+1))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 286, "cpu_time_ms": 81, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s424087852", "group_id": "codeNet:p03037", "input_text": "N, M = io.read(\"*n\", \"*n\", \"*l\")\nL_max = 0\nR_min = 10^5\nfor i = 1, M do\n L, R = io.read(\"*n\", \"*n\", \"*l\")\n if L < R_min then\n L_max = math.max(L, L_max)\n elseif R > L_max then\n R_min = math.min(R, R_min)\n end\nend\nprint(string.format(\"%d\", R_min-L_max+1))", "language": "Lua", "metadata": {"date": 1587091561, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s424087852.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s424087852", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "N, M = io.read(\"*n\", \"*n\", \"*l\")\nL_max = 0\nR_min = 10^5\nfor i = 1, M do\n L, R = io.read(\"*n\", \"*n\", \"*l\")\n if L < R_min then\n L_max = math.max(L, L_max)\n elseif R > L_max then\n R_min = math.min(R, R_min)\n end\nend\nprint(string.format(\"%d\", R_min-L_max+1))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 65, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s879345530", "group_id": "codeNet:p03038", "input_text": "--url:https://gist.github.com/LukeMS/89dc587abd786f92d60886f4977b1953\n--[[ Priority Queue implemented in lua, based on a binary heap.\nCopyright (C) 2017 Lucas de Morais Siqueira \nLicense: zlib\n This software is provided 'as-is', without any express or implied\n warranty. In no event will the authors be held liable for any damages\n arising from the use of this software.\n Permission is granted to anyone to use this software for any purpose,\n including commercial applications, and to alter it and redistribute it\n freely, subject to the following restrictions:\n 1. The origin of this software must not be misrepresented; you must not\n claim that you wrote the original software. If you use this software\n in a product, an acknowledgement in the product documentation would be\n appreciated but is not required.\n 2. Altered source versions must be plainly marked as such, and must not be\n misrepresented as being the original software.\n 3. This notice may not be removed or altered from any source distribution.\n]]--\n\nlocal floor = math.floor\n\n\nlocal PriorityQueue = {}\nPriorityQueue.__index = PriorityQueue\n\nsetmetatable(\n PriorityQueue,\n {\n __call = function (self)\n setmetatable({}, self)\n self:initialize()\n return self\n end\n }\n)\n\n\nfunction PriorityQueue:initialize()\n --[[ Initialization.\n Example:\n PriorityQueue = require(\"priority_queue\")\n pq = PriorityQueue()\n ]]--\n self.heap = {}\n self.current_size = 0\nend\n\nfunction PriorityQueue:empty()\n return self.current_size == 0\nend\n\nfunction PriorityQueue:size()\n return self.current_size\nend\n\nfunction PriorityQueue:swim()\n -- Swim up on the tree and fix the order heap property.\n local heap = self.heap\n local floor = floor\n local i = self.current_size\n\n while floor(i / 2) > 0 do\n local half = floor(i / 2)\n if heap[i][2] < heap[half][2] then\n heap[i], heap[half] = heap[half], heap[i]\n end\n i = half\n end\nend\n\nfunction PriorityQueue:put(v, p)\n --[[ Put an item on the queue.\n Args:\n v: the item to be stored\n p(number): the priority of the item\n ]]--\n --\n\n self.heap[self.current_size + 1] = {v, p}\n self.current_size = self.current_size + 1\n self:swim()\nend\n\nfunction PriorityQueue:sink()\n -- Sink down on the tree and fix the order heap property.\n local size = self.current_size\n local heap = self.heap\n local i = 1\n\n while (i * 2) <= size do\n local mc = self:min_child(i)\n if heap[i][2] > heap[mc][2] then\n heap[i], heap[mc] = heap[mc], heap[i]\n end\n i = mc\n end\nend\n\nfunction PriorityQueue:min_child(i)\n if (i * 2) + 1 > self.current_size then\n return i * 2\n else\n if self.heap[i * 2][2] < self.heap[i * 2 + 1][2] then\n return i * 2\n else\n return i * 2 + 1\n end\n end\nend\n\nfunction PriorityQueue:pop()\n -- Remove and return the top priority item\n local heap = self.heap\n local retval = heap[1][1]\n heap[1] = heap[self.current_size]\n heap[self.current_size] = nil\n self.current_size = self.current_size - 1\n self:sink()\n return retval\nend\n\n--return PriorityQueue\n\nlocal n,m=io.read(\"*n\",\"*n\")\nlocal a=PriorityQueue()\nfor i=1,n do\n local x=io.read(\"*n\")\n a:put(x,x)\nend\n\nlocal bc={}\nfor i=1,m do\n bc[i]={io.read(\"*n\",\"*n\")}\nend\ntable.sort(bc,function(x,y)\n return x[2]>y[2]\nend)\n\nlocal d={}\nlocal i=1\nwhile #d=d[i] then\n a:put(q,q)\n break\n else\n a:put(d[i],d[i])\n end\n else\n break\n end\nend\n\nlocal max=0\nfor i=1,n do\n max=max+a:pop()\nend\nprint(string.format(\"%d\",max))", "language": "Lua", "metadata": {"date": 1591331107, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s879345530.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s879345530", "user_id": "u045238009"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "--url:https://gist.github.com/LukeMS/89dc587abd786f92d60886f4977b1953\n--[[ Priority Queue implemented in lua, based on a binary heap.\nCopyright (C) 2017 Lucas de Morais Siqueira \nLicense: zlib\n This software is provided 'as-is', without any express or implied\n warranty. In no event will the authors be held liable for any damages\n arising from the use of this software.\n Permission is granted to anyone to use this software for any purpose,\n including commercial applications, and to alter it and redistribute it\n freely, subject to the following restrictions:\n 1. The origin of this software must not be misrepresented; you must not\n claim that you wrote the original software. If you use this software\n in a product, an acknowledgement in the product documentation would be\n appreciated but is not required.\n 2. Altered source versions must be plainly marked as such, and must not be\n misrepresented as being the original software.\n 3. This notice may not be removed or altered from any source distribution.\n]]--\n\nlocal floor = math.floor\n\n\nlocal PriorityQueue = {}\nPriorityQueue.__index = PriorityQueue\n\nsetmetatable(\n PriorityQueue,\n {\n __call = function (self)\n setmetatable({}, self)\n self:initialize()\n return self\n end\n }\n)\n\n\nfunction PriorityQueue:initialize()\n --[[ Initialization.\n Example:\n PriorityQueue = require(\"priority_queue\")\n pq = PriorityQueue()\n ]]--\n self.heap = {}\n self.current_size = 0\nend\n\nfunction PriorityQueue:empty()\n return self.current_size == 0\nend\n\nfunction PriorityQueue:size()\n return self.current_size\nend\n\nfunction PriorityQueue:swim()\n -- Swim up on the tree and fix the order heap property.\n local heap = self.heap\n local floor = floor\n local i = self.current_size\n\n while floor(i / 2) > 0 do\n local half = floor(i / 2)\n if heap[i][2] < heap[half][2] then\n heap[i], heap[half] = heap[half], heap[i]\n end\n i = half\n end\nend\n\nfunction PriorityQueue:put(v, p)\n --[[ Put an item on the queue.\n Args:\n v: the item to be stored\n p(number): the priority of the item\n ]]--\n --\n\n self.heap[self.current_size + 1] = {v, p}\n self.current_size = self.current_size + 1\n self:swim()\nend\n\nfunction PriorityQueue:sink()\n -- Sink down on the tree and fix the order heap property.\n local size = self.current_size\n local heap = self.heap\n local i = 1\n\n while (i * 2) <= size do\n local mc = self:min_child(i)\n if heap[i][2] > heap[mc][2] then\n heap[i], heap[mc] = heap[mc], heap[i]\n end\n i = mc\n end\nend\n\nfunction PriorityQueue:min_child(i)\n if (i * 2) + 1 > self.current_size then\n return i * 2\n else\n if self.heap[i * 2][2] < self.heap[i * 2 + 1][2] then\n return i * 2\n else\n return i * 2 + 1\n end\n end\nend\n\nfunction PriorityQueue:pop()\n -- Remove and return the top priority item\n local heap = self.heap\n local retval = heap[1][1]\n heap[1] = heap[self.current_size]\n heap[self.current_size] = nil\n self.current_size = self.current_size - 1\n self:sink()\n return retval\nend\n\n--return PriorityQueue\n\nlocal n,m=io.read(\"*n\",\"*n\")\nlocal a=PriorityQueue()\nfor i=1,n do\n local x=io.read(\"*n\")\n a:put(x,x)\nend\n\nlocal bc={}\nfor i=1,m do\n bc[i]={io.read(\"*n\",\"*n\")}\nend\ntable.sort(bc,function(x,y)\n return x[2]>y[2]\nend)\n\nlocal d={}\nlocal i=1\nwhile #d=d[i] then\n a:put(q,q)\n break\n else\n a:put(d[i],d[i])\n end\n else\n break\n end\nend\n\nlocal max=0\nfor i=1,n do\n max=max+a:pop()\nend\nprint(string.format(\"%d\",max))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3998, "cpu_time_ms": 388, "memory_kb": 23148}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s945130390", "group_id": "codeNet:p03038", "input_text": "local N, M = io.read(\"n\", \"n\")\nlocal A = {}\nfor i=1,N do\n A[i] = io.read(\"n\")\nend\nlocal T = {}\nfor i=1,M do\n local b, c = io.read(\"n\", \"n\")\n T[i] = {b, c}\nend\ntable.sort(A)\ntable.sort(T, function(x, y) return x[2] > y[2] end)\n\nlocal card_idx = 1\nfor i=1, M do\n local b, c = table.unpack(T[i])\n for j = card_idx, math.min(card_idx + b - 1, N) do\n if A[j] < c then\n A[j] = c\n end\n end\n card_idx = card_idx + b\nend\n\nlocal sum = 0\nfor i=1,N do\n sum = sum + A[i]\nend\nprint(sum)\n", "language": "Lua", "metadata": {"date": 1563667667, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s945130390.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s945130390", "user_id": "u162773977"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "local N, M = io.read(\"n\", \"n\")\nlocal A = {}\nfor i=1,N do\n A[i] = io.read(\"n\")\nend\nlocal T = {}\nfor i=1,M do\n local b, c = io.read(\"n\", \"n\")\n T[i] = {b, c}\nend\ntable.sort(A)\ntable.sort(T, function(x, y) return x[2] > y[2] end)\n\nlocal card_idx = 1\nfor i=1, M do\n local b, c = table.unpack(T[i])\n for j = card_idx, math.min(card_idx + b - 1, N) do\n if A[j] < c then\n A[j] = c\n end\n end\n card_idx = card_idx + b\nend\n\nlocal sum = 0\nfor i=1,N do\n sum = sum + A[i]\nend\nprint(sum)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou have N cards. On the i-th card, an integer A_i is written.\n\nFor each j = 1, 2, ..., M in this order, you will perform the following operation once:\n\nOperation: Choose at most B_j cards (possibly zero). Replace the integer written on each chosen card with C_j.\n\nFind the maximum possible sum of the integers written on the N cards after the M operations.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i, C_i \\leq 10^9\n\n1 \\leq B_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\nB_1 C_1\nB_2 C_2\n\\vdots\nB_M C_M\n\nOutput\n\nPrint the maximum possible sum of the integers written on the N cards after the M operations.\n\nSample Input 1\n\n3 2\n5 1 4\n2 3\n1 5\n\nSample Output 1\n\n14\n\nBy replacing the integer on the second card with 5, the sum of the integers written on the three cards becomes 5 + 5 + 4 = 14, which is the maximum result.\n\nSample Input 2\n\n10 3\n1 8 5 7 100 4 52 33 13 5\n3 10\n4 30\n1 4\n\nSample Output 2\n\n338\n\nSample Input 3\n\n3 2\n100 100 100\n3 99\n3 99\n\nSample Output 3\n\n300\n\nSample Input 4\n\n11 3\n1 1 1 1 1 1 1 1 1 1 1\n3 1000000000\n4 1000000000\n3 1000000000\n\nSample Output 4\n\n10000000001\n\nThe output may not fit into a 32-bit integer type.", "sample_input": "3 2\n5 1 4\n2 3\n1 5\n"}, "reference_outputs": ["14\n"], "source_document_id": "p03038", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou have N cards. On the i-th card, an integer A_i is written.\n\nFor each j = 1, 2, ..., M in this order, you will perform the following operation once:\n\nOperation: Choose at most B_j cards (possibly zero). Replace the integer written on each chosen card with C_j.\n\nFind the maximum possible sum of the integers written on the N cards after the M operations.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i, C_i \\leq 10^9\n\n1 \\leq B_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\nB_1 C_1\nB_2 C_2\n\\vdots\nB_M C_M\n\nOutput\n\nPrint the maximum possible sum of the integers written on the N cards after the M operations.\n\nSample Input 1\n\n3 2\n5 1 4\n2 3\n1 5\n\nSample Output 1\n\n14\n\nBy replacing the integer on the second card with 5, the sum of the integers written on the three cards becomes 5 + 5 + 4 = 14, which is the maximum result.\n\nSample Input 2\n\n10 3\n1 8 5 7 100 4 52 33 13 5\n3 10\n4 30\n1 4\n\nSample Output 2\n\n338\n\nSample Input 3\n\n3 2\n100 100 100\n3 99\n3 99\n\nSample Output 3\n\n300\n\nSample Input 4\n\n11 3\n1 1 1 1 1 1 1 1 1 1 1\n3 1000000000\n4 1000000000\n3 1000000000\n\nSample Output 4\n\n10000000001\n\nThe output may not fit into a 32-bit integer type.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 436, "memory_kb": 15352}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s443321952", "group_id": "codeNet:p03040", "input_text": "local mab, mce, mfl, msq, mmi, mma = math.abs, math.ceil, math.floor, math.sqrt, math.min, math.max\n\nlocal function lower_bound(ary, x)\n if(x <= ary[1]) then return 1 end\n local num = #ary\n if(ary[num] < x) then return num + 1 end\n local min, max = 1, num\n while(1 < max - min) do\n local mid = ((min + max) // 2)\n if(ary[mid] < x) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal ior = io.input()\nlocal q = ior:read(\"*n\")\nlocal aall = {}\nlocal ball = 0\nlocal z, a, b = ior:read(\"*n\", \"*n\", \"*n\")\nball = b\n\nlocal leftsum = a\nlocal rightsum = 0\n\ntable.insert(aall, a)\nlocal cnt = 1\nfor i = 2, q do\n local t = ior:read(\"*n\")\n if t == 1 then\n local a, b = ior:read(\"*n\", \"*n\")\n ball = ball + b\n local inspos = lower_bound(aall, a)\n if cnt % 2 == 1 then\n local centerpos = (cnt + 1) // 2\n if centerpos < inspos then\n rightsum = rightsum + a\n else\n leftsum = leftsum + a - aall[centerpos]\n rightsum = rightsum + aall[centerpos]\n end\n else\n local cpos = 1 + cnt // 2\n if cpos < inspos then\n leftsum = leftsum + aall[cpos]\n rightsum = rightsum + a - aall[cpos]\n else\n leftsum = leftsum + a\n end\n end\n table.insert(aall, inspos, a)\n cnt = cnt + 1\n else\n local outpos = (cnt + 1) // 2\n local x = aall[outpos]\n local val = cnt % 2 == 1 and x or 0\n print(x .. \" \" .. val + rightsum - leftsum + ball)\n end\nend\n", "language": "Lua", "metadata": {"date": 1558837336, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03040.html", "problem_id": "p03040", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03040/input.txt", "sample_output_relpath": "derived/input_output/data/p03040/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03040/Lua/s443321952.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s443321952", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4 2\n1 -3\n", "input_to_evaluate": "local mab, mce, mfl, msq, mmi, mma = math.abs, math.ceil, math.floor, math.sqrt, math.min, math.max\n\nlocal function lower_bound(ary, x)\n if(x <= ary[1]) then return 1 end\n local num = #ary\n if(ary[num] < x) then return num + 1 end\n local min, max = 1, num\n while(1 < max - min) do\n local mid = ((min + max) // 2)\n if(ary[mid] < x) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal ior = io.input()\nlocal q = ior:read(\"*n\")\nlocal aall = {}\nlocal ball = 0\nlocal z, a, b = ior:read(\"*n\", \"*n\", \"*n\")\nball = b\n\nlocal leftsum = a\nlocal rightsum = 0\n\ntable.insert(aall, a)\nlocal cnt = 1\nfor i = 2, q do\n local t = ior:read(\"*n\")\n if t == 1 then\n local a, b = ior:read(\"*n\", \"*n\")\n ball = ball + b\n local inspos = lower_bound(aall, a)\n if cnt % 2 == 1 then\n local centerpos = (cnt + 1) // 2\n if centerpos < inspos then\n rightsum = rightsum + a\n else\n leftsum = leftsum + a - aall[centerpos]\n rightsum = rightsum + aall[centerpos]\n end\n else\n local cpos = 1 + cnt // 2\n if cpos < inspos then\n leftsum = leftsum + aall[cpos]\n rightsum = rightsum + a - aall[cpos]\n else\n leftsum = leftsum + a\n end\n end\n table.insert(aall, inspos, a)\n cnt = cnt + 1\n else\n local outpos = (cnt + 1) // 2\n local x = aall[outpos]\n local val = cnt % 2 == 1 and x or 0\n print(x .. \" \" .. val + rightsum - leftsum + ball)\n end\nend\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere is a function f(x), which is initially a constant function f(x) = 0.\n\nWe will ask you to process Q queries in order. There are two kinds of queries, update queries and evaluation queries, as follows:\n\nAn update query 1 a b: Given two integers a and b, let g(x) = f(x) + |x - a| + b and replace f(x) with g(x).\n\nAn evaluation query 2: Print x that minimizes f(x), and the minimum value of f(x). If there are multiple such values of x, choose the minimum such value.\n\nWe can show that the values to be output in an evaluation query are always integers, so we ask you to print those values as integers without decimal points.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n-10^9 \\leq a, b \\leq 10^9\n\nThe first query is an update query.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\nQuery_1\n:\nQuery_Q\n\nSee Sample Input 1 for an example.\n\nOutput\n\nFor each evaluation query, print a line containing the response, in the order in which the queries are given.\n\nThe response to each evaluation query should be the minimum value of x that minimizes f(x), and the minimum value of f(x), in this order, with space in between.\n\nSample Input 1\n\n4\n1 4 2\n2\n1 1 -8\n2\n\nSample Output 1\n\n4 2\n1 -3\n\nIn the first evaluation query, f(x) = |x - 4| + 2, which attains the minimum value of 2 at x = 4.\n\nIn the second evaluation query, f(x) = |x - 1| + |x - 4| - 6, which attains the minimum value of -3 when 1 \\leq x \\leq 4. Among the multiple values of x that minimize f(x), we ask you to print the minimum, that is, 1.\n\nSample Input 2\n\n4\n1 -1000000000 1000000000\n1 -1000000000 1000000000\n1 -1000000000 1000000000\n2\n\nSample Output 2\n\n-1000000000 3000000000", "sample_input": "4\n1 4 2\n2\n1 1 -8\n2\n"}, "reference_outputs": ["4 2\n1 -3\n"], "source_document_id": "p03040", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere is a function f(x), which is initially a constant function f(x) = 0.\n\nWe will ask you to process Q queries in order. There are two kinds of queries, update queries and evaluation queries, as follows:\n\nAn update query 1 a b: Given two integers a and b, let g(x) = f(x) + |x - a| + b and replace f(x) with g(x).\n\nAn evaluation query 2: Print x that minimizes f(x), and the minimum value of f(x). If there are multiple such values of x, choose the minimum such value.\n\nWe can show that the values to be output in an evaluation query are always integers, so we ask you to print those values as integers without decimal points.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n-10^9 \\leq a, b \\leq 10^9\n\nThe first query is an update query.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\nQuery_1\n:\nQuery_Q\n\nSee Sample Input 1 for an example.\n\nOutput\n\nFor each evaluation query, print a line containing the response, in the order in which the queries are given.\n\nThe response to each evaluation query should be the minimum value of x that minimizes f(x), and the minimum value of f(x), in this order, with space in between.\n\nSample Input 1\n\n4\n1 4 2\n2\n1 1 -8\n2\n\nSample Output 1\n\n4 2\n1 -3\n\nIn the first evaluation query, f(x) = |x - 4| + 2, which attains the minimum value of 2 at x = 4.\n\nIn the second evaluation query, f(x) = |x - 1| + |x - 4| - 6, which attains the minimum value of -3 when 1 \\leq x \\leq 4. Among the multiple values of x that minimize f(x), we ask you to print the minimum, that is, 1.\n\nSample Input 2\n\n4\n1 -1000000000 1000000000\n1 -1000000000 1000000000\n1 -1000000000 1000000000\n2\n\nSample Output 2\n\n-1000000000 3000000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1465, "cpu_time_ms": 2103, "memory_kb": 2040}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s626786930", "group_id": "codeNet:p03041", "input_text": "local function str2tbl(s)\n local t = {string.byte(s, 1, #s)}\n local char = string.char\n for i=1, #t do\n t[i] = char(t[i])\n end\n return t\nend\n\nlocal N, K, _, S = io.read(\"n\", \"n\", \"l\", \"l\")\nS = str2tbl(S)\nS[K] = string.char(string.byte(S[K]) + 0x20)\nprint(table.concat(S, \"\"))", "language": "Lua", "metadata": {"date": 1558314301, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s626786930.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s626786930", "user_id": "u162773977"}, "prompt_components": {"gold_output": "aBC\n", "input_to_evaluate": "local function str2tbl(s)\n local t = {string.byte(s, 1, #s)}\n local char = string.char\n for i=1, #t do\n t[i] = char(t[i])\n end\n return t\nend\n\nlocal N, K, _, S = io.read(\"n\", \"n\", \"l\", \"l\")\nS = str2tbl(S)\nS[K] = string.char(string.byte(S[K]) + 0x20)\nprint(table.concat(S, \"\"))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 1008}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s552376618", "group_id": "codeNet:p03042", "input_text": "s = io.read()\ns1 = tonumber(s:sub(1, 2))\ns2 = tonumber(s:sub(3, 4))\nf1 = 0 < s1 and s1 <= 12\nf2 = 0 < s2 and s2 <= 12\nif f1 and f2 then\n print(\"AMBIGUOUS\")\nelseif f1 then\n print(\"MMYY\")\nelseif f2 then\n print(\"YYMM\")\nelse\n print(\"NA\")\nend\n", "language": "Lua", "metadata": {"date": 1597421783, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s552376618.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s552376618", "user_id": "u120582723"}, "prompt_components": {"gold_output": "YYMM\n", "input_to_evaluate": "s = io.read()\ns1 = tonumber(s:sub(1, 2))\ns2 = tonumber(s:sub(3, 4))\nf1 = 0 < s1 and s1 <= 12\nf2 = 0 < s2 and s2 <= 12\nif f1 and f2 then\n print(\"AMBIGUOUS\")\nelseif f1 then\n print(\"MMYY\")\nelseif f2 then\n print(\"YYMM\")\nelse\n print(\"NA\")\nend\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 242, "cpu_time_ms": 5, "memory_kb": 2612}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s799947502", "group_id": "codeNet:p03043", "input_text": "local N, K = io.read(\"n\", \"n\")\n\nlocal ceil = math.ceil\nlocal log = math.log\nlocal function getx(n)\n return ceil(log(K/n, 2))\nend\n\nlocal ans = 0.0\n\nlocal head_win_limit = math.min(K-1, N)\nfor n=1, head_win_limit do\n local x = getx(n)\n --print(n, x)\n ans = ans + (1.0/N) * ((1.0/2.0) ^ x)\nend\n\nif N-K+1 > 0 then\n ans = ans + (N-K+1.0)/N\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1558315466, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s799947502.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s799947502", "user_id": "u162773977"}, "prompt_components": {"gold_output": "0.145833333333\n", "input_to_evaluate": "local N, K = io.read(\"n\", \"n\")\n\nlocal ceil = math.ceil\nlocal log = math.log\nlocal function getx(n)\n return ceil(log(K/n, 2))\nend\n\nlocal ans = 0.0\n\nlocal head_win_limit = math.min(K-1, N)\nfor n=1, head_win_limit do\n local x = getx(n)\n --print(n, x)\n ans = ans + (1.0/N) * ((1.0/2.0) ^ x)\nend\n\nif N-K+1 > 0 then\n ans = ans + (N-K+1.0)/N\nend\nprint(ans)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 880}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s349085814", "group_id": "codeNet:p03044", "input_text": "local List = {}\nfunction List.new ()\n return {first = 0, last = -1}\nend\n\nfunction List.pushleft (list, value)\n local first = list.first - 1\n list.first = first\n list[first] = value\nend\n\nfunction List.pushright (list, value)\n local last = list.last + 1\n list.last = last\n list[last] = value\nend\n\nfunction List.popleft (list)\n local first = list.first\n local value = list[first]\n list[first] = nil\n list.first = first + 1\n return value\nend\n\nfunction List.popright (list)\n local last = list.last\n local value = list[last]\n list[last] = nil\n list.last = last - 1\n return value\nend\n\nfunction List.empty (list)\n return list.first > list.last\nend\n\n----------\n\nlocal n=io.read(\"n\")\nlocal graph={}\nfor i=1,n do\n graph[i]={}\nend\nfor i=1,n-1 do\n local u,v,w=io.read(\"n\",\"n\",\"n\")\n graph[u][v]=w\n graph[v][u]=w\nend\n\nlocal stack=List.new()\nList.pushright(stack,{1,0})\nlocal checked={}\nlocal color={0}\n\nwhile not List.empty(stack) do\n local pop=List.popright(stack)\n local u=pop[1]\n local w=pop[2]\n checked[u]=true\n for v,_ in pairs(graph[u]) do\n if not checked[v] then\n local nw=w+graph[u][v]\n color[v]=nw%2\n List.pushright(stack,{v,nw})\n end\n end\nend\n\nfor i=1,n do\n print(color[i])\nend", "language": "Lua", "metadata": {"date": 1598485003, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03044.html", "problem_id": "p03044", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03044/input.txt", "sample_output_relpath": "derived/input_output/data/p03044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03044/Lua/s349085814.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s349085814", "user_id": "u045238009"}, "prompt_components": {"gold_output": "0\n0\n1\n", "input_to_evaluate": "local List = {}\nfunction List.new ()\n return {first = 0, last = -1}\nend\n\nfunction List.pushleft (list, value)\n local first = list.first - 1\n list.first = first\n list[first] = value\nend\n\nfunction List.pushright (list, value)\n local last = list.last + 1\n list.last = last\n list[last] = value\nend\n\nfunction List.popleft (list)\n local first = list.first\n local value = list[first]\n list[first] = nil\n list.first = first + 1\n return value\nend\n\nfunction List.popright (list)\n local last = list.last\n local value = list[last]\n list[last] = nil\n list.last = last - 1\n return value\nend\n\nfunction List.empty (list)\n return list.first > list.last\nend\n\n----------\n\nlocal n=io.read(\"n\")\nlocal graph={}\nfor i=1,n do\n graph[i]={}\nend\nfor i=1,n-1 do\n local u,v,w=io.read(\"n\",\"n\",\"n\")\n graph[u][v]=w\n graph[v][u]=w\nend\n\nlocal stack=List.new()\nList.pushright(stack,{1,0})\nlocal checked={}\nlocal color={0}\n\nwhile not List.empty(stack) do\n local pop=List.popright(stack)\n local u=pop[1]\n local w=pop[2]\n checked[u]=true\n for v,_ in pairs(graph[u]) do\n if not checked[v] then\n local nw=w+graph[u][v]\n color[v]=nw%2\n List.pushright(stack,{v,nw})\n end\n end\nend\n\nfor i=1,n do\n print(color[i])\nend", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a tree with N vertices numbered 1 to N.\nThe i-th edge in the tree connects Vertex u_i and Vertex v_i, and its length is w_i.\nYour objective is to paint each vertex in the tree white or black (it is fine to paint all vertices the same color) so that the following condition is satisfied:\n\nFor any two vertices painted in the same color, the distance between them is an even number.\n\nFind a coloring of the vertices that satisfies the condition and print it. It can be proved that at least one such coloring exists under the constraints of this problem.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq u_i < v_i \\leq N\n\n1 \\leq w_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nu_1 v_1 w_1\nu_2 v_2 w_2\n.\n.\n.\nu_{N - 1} v_{N - 1} w_{N - 1}\n\nOutput\n\nPrint a coloring of the vertices that satisfies the condition, in N lines.\nThe i-th line should contain 0 if Vertex i is painted white and 1 if it is painted black.\n\nIf there are multiple colorings that satisfy the condition, any of them will be accepted.\n\nSample Input 1\n\n3\n1 2 2\n2 3 1\n\nSample Output 1\n\n0\n0\n1\n\nSample Input 2\n\n5\n2 5 2\n2 3 10\n1 3 8\n3 4 2\n\nSample Output 2\n\n1\n0\n1\n0\n1", "sample_input": "3\n1 2 2\n2 3 1\n"}, "reference_outputs": ["0\n0\n1\n"], "source_document_id": "p03044", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a tree with N vertices numbered 1 to N.\nThe i-th edge in the tree connects Vertex u_i and Vertex v_i, and its length is w_i.\nYour objective is to paint each vertex in the tree white or black (it is fine to paint all vertices the same color) so that the following condition is satisfied:\n\nFor any two vertices painted in the same color, the distance between them is an even number.\n\nFind a coloring of the vertices that satisfies the condition and print it. It can be proved that at least one such coloring exists under the constraints of this problem.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq u_i < v_i \\leq N\n\n1 \\leq w_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nu_1 v_1 w_1\nu_2 v_2 w_2\n.\n.\n.\nu_{N - 1} v_{N - 1} w_{N - 1}\n\nOutput\n\nPrint a coloring of the vertices that satisfies the condition, in N lines.\nThe i-th line should contain 0 if Vertex i is painted white and 1 if it is painted black.\n\nIf there are multiple colorings that satisfy the condition, any of them will be accepted.\n\nSample Input 1\n\n3\n1 2 2\n2 3 1\n\nSample Output 1\n\n0\n0\n1\n\nSample Input 2\n\n5\n2 5 2\n2 3 10\n1 3 8\n3 4 2\n\nSample Output 2\n\n1\n0\n1\n0\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1306, "cpu_time_ms": 401, "memory_kb": 32564}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s311603780", "group_id": "codeNet:p03044", "input_text": "local DBG = true\nlocal function dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nlocal function dbgpr_t(tbl, use_pairs)\n if DBG then\n local enum = ipairs\n if use_pairs then\n enum = pairs\n end\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in enum(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\nlocal function use_strict()\n local mt = {\n __index = function(t,k) error(\"_G __index:\" .. k) end,\n __newindex = function(t,k,v) error(\"_G __newindex:\" .. k) end\n }\n setmetatable(_G, mt)\nend\n\n-- http://www.lua.org/pil/11.4.html\nList = {}\nfunction List.new()\n return setmetatable({first = 0, last = -1}, {__index = List})\nend\n\n--[[\nfunction List:pushleft(value)\n local first = self.first - 1\n self.first = first\n self[first] = value\nend\n]]\n\nfunction List:pushright(value)\n local last = self.last + 1\n self.last = last\n self[last] = value\nend\n\nfunction List:popleft()\n local first = self.first\n if first > self.last then error(\"list is empty\") end\n local value = self[first]\n self[first] = nil -- to allow garbage collection\n self.first = first + 1\n return value\nend\n\n--[[\nfunction List:popright()\n local last = self.last\n if self.first > last then error(\"list is empty\") end\n local value = self[last]\n self[last] = nil -- to allow garbage collection\n self.last = last - 1\n return value\nend\n]]\n\nfunction List:count()\n return self.last - self.first + 1\nend\n--\nuse_strict()\nlocal N = io.read(\"n\")\nlocal weights = {}\nlocal adj_list = {}\nfor i=1,N do\n adj_list[i] = {}\nend\nlocal function key(u,v)\n return u .. \",\" .. v\nend\nlocal function getw(u,v)\n return weights[key(u,v)] or weights[key(v,u)]\nend\nfor i=1,N-1 do\n local u,v,w = io.read(\"n\", \"n\", \"n\")\n weights[key(u,v)] = w\n table.insert(adj_list[u], v)\n table.insert(adj_list[v], u)\nend\n\nlocal distance_from_1 = {}\ndistance_from_1[1] = 0\ndo\n local seen = {}\n seen[1] = true\n local accum = 0\n local q = List.new()\n q:pushright(1)\n local count = 1\n while count < N do\n local from = q:popleft()\n local w_before = distance_from_1[from]\n for _, to in ipairs(adj_list[from]) do\n if not seen[to] then\n seen[to] = true\n local w = getw(from, to)\n distance_from_1[to] = w_before + w\n count = count + 1\n q:pushright(to)\n end\n end\n end\nend\n--dbgpr_t(distance_from_1)\nfor i=1,N do\n if distance_from_1[i] % 2 == 0 then\n print(0)\n else\n print(1)\n end\nend", "language": "Lua", "metadata": {"date": 1558317774, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03044.html", "problem_id": "p03044", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03044/input.txt", "sample_output_relpath": "derived/input_output/data/p03044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03044/Lua/s311603780.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s311603780", "user_id": "u162773977"}, "prompt_components": {"gold_output": "0\n0\n1\n", "input_to_evaluate": "local DBG = true\nlocal function dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nlocal function dbgpr_t(tbl, use_pairs)\n if DBG then\n local enum = ipairs\n if use_pairs then\n enum = pairs\n end\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in enum(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\nlocal function use_strict()\n local mt = {\n __index = function(t,k) error(\"_G __index:\" .. k) end,\n __newindex = function(t,k,v) error(\"_G __newindex:\" .. k) end\n }\n setmetatable(_G, mt)\nend\n\n-- http://www.lua.org/pil/11.4.html\nList = {}\nfunction List.new()\n return setmetatable({first = 0, last = -1}, {__index = List})\nend\n\n--[[\nfunction List:pushleft(value)\n local first = self.first - 1\n self.first = first\n self[first] = value\nend\n]]\n\nfunction List:pushright(value)\n local last = self.last + 1\n self.last = last\n self[last] = value\nend\n\nfunction List:popleft()\n local first = self.first\n if first > self.last then error(\"list is empty\") end\n local value = self[first]\n self[first] = nil -- to allow garbage collection\n self.first = first + 1\n return value\nend\n\n--[[\nfunction List:popright()\n local last = self.last\n if self.first > last then error(\"list is empty\") end\n local value = self[last]\n self[last] = nil -- to allow garbage collection\n self.last = last - 1\n return value\nend\n]]\n\nfunction List:count()\n return self.last - self.first + 1\nend\n--\nuse_strict()\nlocal N = io.read(\"n\")\nlocal weights = {}\nlocal adj_list = {}\nfor i=1,N do\n adj_list[i] = {}\nend\nlocal function key(u,v)\n return u .. \",\" .. v\nend\nlocal function getw(u,v)\n return weights[key(u,v)] or weights[key(v,u)]\nend\nfor i=1,N-1 do\n local u,v,w = io.read(\"n\", \"n\", \"n\")\n weights[key(u,v)] = w\n table.insert(adj_list[u], v)\n table.insert(adj_list[v], u)\nend\n\nlocal distance_from_1 = {}\ndistance_from_1[1] = 0\ndo\n local seen = {}\n seen[1] = true\n local accum = 0\n local q = List.new()\n q:pushright(1)\n local count = 1\n while count < N do\n local from = q:popleft()\n local w_before = distance_from_1[from]\n for _, to in ipairs(adj_list[from]) do\n if not seen[to] then\n seen[to] = true\n local w = getw(from, to)\n distance_from_1[to] = w_before + w\n count = count + 1\n q:pushright(to)\n end\n end\n end\nend\n--dbgpr_t(distance_from_1)\nfor i=1,N do\n if distance_from_1[i] % 2 == 0 then\n print(0)\n else\n print(1)\n end\nend", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a tree with N vertices numbered 1 to N.\nThe i-th edge in the tree connects Vertex u_i and Vertex v_i, and its length is w_i.\nYour objective is to paint each vertex in the tree white or black (it is fine to paint all vertices the same color) so that the following condition is satisfied:\n\nFor any two vertices painted in the same color, the distance between them is an even number.\n\nFind a coloring of the vertices that satisfies the condition and print it. It can be proved that at least one such coloring exists under the constraints of this problem.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq u_i < v_i \\leq N\n\n1 \\leq w_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nu_1 v_1 w_1\nu_2 v_2 w_2\n.\n.\n.\nu_{N - 1} v_{N - 1} w_{N - 1}\n\nOutput\n\nPrint a coloring of the vertices that satisfies the condition, in N lines.\nThe i-th line should contain 0 if Vertex i is painted white and 1 if it is painted black.\n\nIf there are multiple colorings that satisfy the condition, any of them will be accepted.\n\nSample Input 1\n\n3\n1 2 2\n2 3 1\n\nSample Output 1\n\n0\n0\n1\n\nSample Input 2\n\n5\n2 5 2\n2 3 10\n1 3 8\n3 4 2\n\nSample Output 2\n\n1\n0\n1\n0\n1", "sample_input": "3\n1 2 2\n2 3 1\n"}, "reference_outputs": ["0\n0\n1\n"], "source_document_id": "p03044", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a tree with N vertices numbered 1 to N.\nThe i-th edge in the tree connects Vertex u_i and Vertex v_i, and its length is w_i.\nYour objective is to paint each vertex in the tree white or black (it is fine to paint all vertices the same color) so that the following condition is satisfied:\n\nFor any two vertices painted in the same color, the distance between them is an even number.\n\nFind a coloring of the vertices that satisfies the condition and print it. It can be proved that at least one such coloring exists under the constraints of this problem.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq u_i < v_i \\leq N\n\n1 \\leq w_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nu_1 v_1 w_1\nu_2 v_2 w_2\n.\n.\n.\nu_{N - 1} v_{N - 1} w_{N - 1}\n\nOutput\n\nPrint a coloring of the vertices that satisfies the condition, in N lines.\nThe i-th line should contain 0 if Vertex i is painted white and 1 if it is painted black.\n\nIf there are multiple colorings that satisfy the condition, any of them will be accepted.\n\nSample Input 1\n\n3\n1 2 2\n2 3 1\n\nSample Output 1\n\n0\n0\n1\n\nSample Input 2\n\n5\n2 5 2\n2 3 10\n1 3 8\n3 4 2\n\nSample Output 2\n\n1\n0\n1\n0\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2768, "cpu_time_ms": 720, "memory_kb": 38244}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s516317519", "group_id": "codeNet:p03045", "input_text": "local n, m = io.read(\"*n\", \"*n\")\nlocal parent = {}\nfor i = 1, n do\n parent[i] = i\nend\n\nlocal function uf_findroot(idx)\n local idx_update = idx\n while parent[idx] ~= idx do\n idx = parent[idx]\n end\n while parent[idx_update] ~= idx do\n parent[idx_update], idx_update = idx, parent[idx_update]\n end\n return idx\nend\n\nfor i = 1, m do\n local x, y, _z = io.read(\"*n\", \"*n\", \"*n\")\n local xp, yp = uf_findroot(x), uf_findroot(y)\n parent[yp], parent[y] = xp, xp\nend\n\nlocal c = 0\nlocal map = {}\nfor i = 1, n do\n local p = uf_findroot(i)\n if not map[p] then\n c = c + 1\n map[p] = true\n end\nend\nprint(c)\n", "language": "Lua", "metadata": {"date": 1597422572, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03045.html", "problem_id": "p03045", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03045/input.txt", "sample_output_relpath": "derived/input_output/data/p03045/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03045/Lua/s516317519.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s516317519", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n, m = io.read(\"*n\", \"*n\")\nlocal parent = {}\nfor i = 1, n do\n parent[i] = i\nend\n\nlocal function uf_findroot(idx)\n local idx_update = idx\n while parent[idx] ~= idx do\n idx = parent[idx]\n end\n while parent[idx_update] ~= idx do\n parent[idx_update], idx_update = idx, parent[idx_update]\n end\n return idx\nend\n\nfor i = 1, m do\n local x, y, _z = io.read(\"*n\", \"*n\", \"*n\")\n local xp, yp = uf_findroot(x), uf_findroot(y)\n parent[yp], parent[y] = xp, xp\nend\n\nlocal c = 0\nlocal map = {}\nfor i = 1, n do\n local p = uf_findroot(i)\n if not map[p] then\n c = c + 1\n map[p] = true\n end\nend\nprint(c)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N cards placed face down in a row. On each card, an integer 1 or 2 is written.\n\nLet A_i be the integer written on the i-th card.\n\nYour objective is to guess A_1, A_2, ..., A_N correctly.\n\nYou know the following facts:\n\nFor each i = 1, 2, ..., M, the value A_{X_i} + A_{Y_i} + Z_i is an even number.\n\nYou are a magician and can use the following magic any number of times:\n\nMagic: Choose one card and know the integer A_i written on it. The cost of using this magic is 1.\n\nWhat is the minimum cost required to determine all of A_1, A_2, ..., A_N?\n\nIt is guaranteed that there is no contradiction in given input.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq X_i < Y_i \\leq N\n\n1 \\leq Z_i \\leq 100\n\nThe pairs (X_i, Y_i) are distinct.\n\nThere is no contradiction in input. (That is, there exist integers A_1, A_2, ..., A_N that satisfy the conditions.)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nX_1 Y_1 Z_1\nX_2 Y_2 Z_2\n\\vdots\nX_M Y_M Z_M\n\nOutput\n\nPrint the minimum total cost required to determine all of A_1, A_2, ..., A_N.\n\nSample Input 1\n\n3 1\n1 2 1\n\nSample Output 1\n\n2\n\nYou can determine all of A_1, A_2, A_3 by using the magic for the first and third cards.\n\nSample Input 2\n\n6 5\n1 2 1\n2 3 2\n1 3 3\n4 5 4\n5 6 5\n\nSample Output 2\n\n2\n\nSample Input 3\n\n100000 1\n1 100000 100\n\nSample Output 3\n\n99999", "sample_input": "3 1\n1 2 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03045", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N cards placed face down in a row. On each card, an integer 1 or 2 is written.\n\nLet A_i be the integer written on the i-th card.\n\nYour objective is to guess A_1, A_2, ..., A_N correctly.\n\nYou know the following facts:\n\nFor each i = 1, 2, ..., M, the value A_{X_i} + A_{Y_i} + Z_i is an even number.\n\nYou are a magician and can use the following magic any number of times:\n\nMagic: Choose one card and know the integer A_i written on it. The cost of using this magic is 1.\n\nWhat is the minimum cost required to determine all of A_1, A_2, ..., A_N?\n\nIt is guaranteed that there is no contradiction in given input.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq X_i < Y_i \\leq N\n\n1 \\leq Z_i \\leq 100\n\nThe pairs (X_i, Y_i) are distinct.\n\nThere is no contradiction in input. (That is, there exist integers A_1, A_2, ..., A_N that satisfy the conditions.)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nX_1 Y_1 Z_1\nX_2 Y_2 Z_2\n\\vdots\nX_M Y_M Z_M\n\nOutput\n\nPrint the minimum total cost required to determine all of A_1, A_2, ..., A_N.\n\nSample Input 1\n\n3 1\n1 2 1\n\nSample Output 1\n\n2\n\nYou can determine all of A_1, A_2, A_3 by using the magic for the first and third cards.\n\nSample Input 2\n\n6 5\n1 2 1\n2 3 2\n1 3 3\n4 5 4\n5 6 5\n\nSample Output 2\n\n2\n\nSample Input 3\n\n100000 1\n1 100000 100\n\nSample Output 3\n\n99999", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 614, "cpu_time_ms": 90, "memory_kb": 6852}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s272165324", "group_id": "codeNet:p03045", "input_text": "local ior = io.input()\nlocal n, m = ior:read(\"*n\", \"*n\")\n\nlocal parent = {}\nlocal groupsize = {}\nfor i = 1, n do parent[i] = i end\nfor i = 1, n do groupsize[i] = 1 end\n\nlocal function getroot(idx)\n while(parent[idx] ~= idx) do\n idx = parent[idx]\n end\n return idx\nend\n\nfor i = 1, m do\n local x, y, z = ior:read(\"*n\", \"*n\", \"*n\")\n local xroot, yroot = getroot(x), getroot(y)\n if(groupsize[xroot] < groupsize[yroot]) then\n groupsize[yroot] = groupsize[xroot] + groupsize[yroot]\n parent[x] = yroot\n parent[xroot] = yroot\n parent[y] = yroot\n else\n groupsize[xroot] = groupsize[xroot] + groupsize[yroot]\n parent[x] = xroot\n parent[yroot] = xroot\n parent[y] = xroot\n end\nend\nlocal grouplist = {}\nlocal cnt = 0\nfor i = 1, n do\n local r = getroot(i)\n if(grouplist[r] == nil) then\n grouplist[r] = true\n cnt = cnt + 1\n end\nend\nprint(cnt)\n", "language": "Lua", "metadata": {"date": 1558316171, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03045.html", "problem_id": "p03045", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03045/input.txt", "sample_output_relpath": "derived/input_output/data/p03045/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03045/Lua/s272165324.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s272165324", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local ior = io.input()\nlocal n, m = ior:read(\"*n\", \"*n\")\n\nlocal parent = {}\nlocal groupsize = {}\nfor i = 1, n do parent[i] = i end\nfor i = 1, n do groupsize[i] = 1 end\n\nlocal function getroot(idx)\n while(parent[idx] ~= idx) do\n idx = parent[idx]\n end\n return idx\nend\n\nfor i = 1, m do\n local x, y, z = ior:read(\"*n\", \"*n\", \"*n\")\n local xroot, yroot = getroot(x), getroot(y)\n if(groupsize[xroot] < groupsize[yroot]) then\n groupsize[yroot] = groupsize[xroot] + groupsize[yroot]\n parent[x] = yroot\n parent[xroot] = yroot\n parent[y] = yroot\n else\n groupsize[xroot] = groupsize[xroot] + groupsize[yroot]\n parent[x] = xroot\n parent[yroot] = xroot\n parent[y] = xroot\n end\nend\nlocal grouplist = {}\nlocal cnt = 0\nfor i = 1, n do\n local r = getroot(i)\n if(grouplist[r] == nil) then\n grouplist[r] = true\n cnt = cnt + 1\n end\nend\nprint(cnt)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N cards placed face down in a row. On each card, an integer 1 or 2 is written.\n\nLet A_i be the integer written on the i-th card.\n\nYour objective is to guess A_1, A_2, ..., A_N correctly.\n\nYou know the following facts:\n\nFor each i = 1, 2, ..., M, the value A_{X_i} + A_{Y_i} + Z_i is an even number.\n\nYou are a magician and can use the following magic any number of times:\n\nMagic: Choose one card and know the integer A_i written on it. The cost of using this magic is 1.\n\nWhat is the minimum cost required to determine all of A_1, A_2, ..., A_N?\n\nIt is guaranteed that there is no contradiction in given input.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq X_i < Y_i \\leq N\n\n1 \\leq Z_i \\leq 100\n\nThe pairs (X_i, Y_i) are distinct.\n\nThere is no contradiction in input. (That is, there exist integers A_1, A_2, ..., A_N that satisfy the conditions.)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nX_1 Y_1 Z_1\nX_2 Y_2 Z_2\n\\vdots\nX_M Y_M Z_M\n\nOutput\n\nPrint the minimum total cost required to determine all of A_1, A_2, ..., A_N.\n\nSample Input 1\n\n3 1\n1 2 1\n\nSample Output 1\n\n2\n\nYou can determine all of A_1, A_2, A_3 by using the magic for the first and third cards.\n\nSample Input 2\n\n6 5\n1 2 1\n2 3 2\n1 3 3\n4 5 4\n5 6 5\n\nSample Output 2\n\n2\n\nSample Input 3\n\n100000 1\n1 100000 100\n\nSample Output 3\n\n99999", "sample_input": "3 1\n1 2 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03045", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N cards placed face down in a row. On each card, an integer 1 or 2 is written.\n\nLet A_i be the integer written on the i-th card.\n\nYour objective is to guess A_1, A_2, ..., A_N correctly.\n\nYou know the following facts:\n\nFor each i = 1, 2, ..., M, the value A_{X_i} + A_{Y_i} + Z_i is an even number.\n\nYou are a magician and can use the following magic any number of times:\n\nMagic: Choose one card and know the integer A_i written on it. The cost of using this magic is 1.\n\nWhat is the minimum cost required to determine all of A_1, A_2, ..., A_N?\n\nIt is guaranteed that there is no contradiction in given input.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq X_i < Y_i \\leq N\n\n1 \\leq Z_i \\leq 100\n\nThe pairs (X_i, Y_i) are distinct.\n\nThere is no contradiction in input. (That is, there exist integers A_1, A_2, ..., A_N that satisfy the conditions.)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nX_1 Y_1 Z_1\nX_2 Y_2 Z_2\n\\vdots\nX_M Y_M Z_M\n\nOutput\n\nPrint the minimum total cost required to determine all of A_1, A_2, ..., A_N.\n\nSample Input 1\n\n3 1\n1 2 1\n\nSample Output 1\n\n2\n\nYou can determine all of A_1, A_2, A_3 by using the magic for the first and third cards.\n\nSample Input 2\n\n6 5\n1 2 1\n2 3 2\n1 3 3\n4 5 4\n5 6 5\n\nSample Output 2\n\n2\n\nSample Input 3\n\n100000 1\n1 100000 100\n\nSample Output 3\n\n99999", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 871, "cpu_time_ms": 82, "memory_kb": 3456}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s262945614", "group_id": "codeNet:p03048", "input_text": "a, b, c, n = io.read(\"*n\", \"*n\", \"*n\", \"*n\")\nt = {}\nfor i = 1, n + 1 do\n t[i] = 0\nend\n-- f(x) * (1-x^a)(1-x^b)(1-x^c) = 1\nt[1] = 1\nfor i = 2, n + 1 do\n v = 0\n if a < i then v = v - t[i - a] end\n if b < i then v = v - t[i - b] end\n if c < i then v = v - t[i - c] end\n if a + b < i then v = v + t[i - a - b] end\n if b + c < i then v = v + t[i - b - c] end\n if c + a < i then v = v + t[i - c - a] end\n if a + b + c < i then v = v - t[i - a - b - c] end\n t[i] = -v\nend\nprint(t[n + 1])\n", "language": "Lua", "metadata": {"date": 1589898402, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s262945614.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s262945614", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "a, b, c, n = io.read(\"*n\", \"*n\", \"*n\", \"*n\")\nt = {}\nfor i = 1, n + 1 do\n t[i] = 0\nend\n-- f(x) * (1-x^a)(1-x^b)(1-x^c) = 1\nt[1] = 1\nfor i = 2, n + 1 do\n v = 0\n if a < i then v = v - t[i - a] end\n if b < i then v = v - t[i - b] end\n if c < i then v = v - t[i - c] end\n if a + b < i then v = v + t[i - a - b] end\n if b + c < i then v = v + t[i - b - c] end\n if c + a < i then v = v + t[i - c - a] end\n if a + b + c < i then v = v - t[i - a - b - c] end\n t[i] = -v\nend\nprint(t[n + 1])\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has come to a store that sells boxes containing balls. The store sells the following three kinds of boxes:\n\nRed boxes, each containing R red balls\n\nGreen boxes, each containing G green balls\n\nBlue boxes, each containing B blue balls\n\nSnuke wants to get a total of exactly N balls by buying r red boxes, g green boxes and b blue boxes.\nHow many triples of non-negative integers (r,g,b) achieve this?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq R,G,B,N \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR G B N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 2 3 4\n\nSample Output 1\n\n4\n\nFour triples achieve the objective, as follows:\n\n(4,0,0)\n\n(2,1,0)\n\n(1,0,1)\n\n(0,2,0)\n\nSample Input 2\n\n13 1 4 3000\n\nSample Output 2\n\n87058", "sample_input": "1 2 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03048", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has come to a store that sells boxes containing balls. The store sells the following three kinds of boxes:\n\nRed boxes, each containing R red balls\n\nGreen boxes, each containing G green balls\n\nBlue boxes, each containing B blue balls\n\nSnuke wants to get a total of exactly N balls by buying r red boxes, g green boxes and b blue boxes.\nHow many triples of non-negative integers (r,g,b) achieve this?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq R,G,B,N \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR G B N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 2 3 4\n\nSample Output 1\n\n4\n\nFour triples achieve the objective, as follows:\n\n(4,0,0)\n\n(2,1,0)\n\n(1,0,1)\n\n(0,2,0)\n\nSample Input 2\n\n13 1 4 3000\n\nSample Output 2\n\n87058", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 11, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s367419705", "group_id": "codeNet:p03048", "input_text": "r,g,b,n=io.read(\"*n\",\"*n\",\"*n\",\"*n\")\n\ncounter=0\nfor i=0,n do\n for j=0,n do\n rg=r*i+g*j\n if n>=rg and (n-rg)%b==0 then\n counter=counter+1\n end\n end\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1589151096, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s367419705.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s367419705", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "r,g,b,n=io.read(\"*n\",\"*n\",\"*n\",\"*n\")\n\ncounter=0\nfor i=0,n do\n for j=0,n do\n rg=r*i+g*j\n if n>=rg and (n-rg)%b==0 then\n counter=counter+1\n end\n end\nend\nprint(counter)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 83, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s285562024", "group_id": "codeNet:p03048", "input_text": "r,g,b,n=io.read(\"*n\",\"*n\",\"*n\",\"*n\")\n\ncounter=0\nfor i=0,3000 do\n for j=0,3000 do\n rg=r*i+g*j\n if n>=rg and (n-rg)%b==0 then\n counter=counter+1\n end\n end\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1589150918, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s285562024.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s285562024", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "r,g,b,n=io.read(\"*n\",\"*n\",\"*n\",\"*n\")\n\ncounter=0\nfor i=0,3000 do\n for j=0,3000 do\n rg=r*i+g*j\n if n>=rg and (n-rg)%b==0 then\n counter=counter+1\n end\n end\nend\nprint(counter)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1818, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s191901353", "group_id": "codeNet:p03048", "input_text": "local R,G,B,N = io.read(\"n\", \"n\", \"n\", \"n\")\n\nlocal cnt = 0\nfor r=0,N do\n local lim = (N - R*r) / G\n --print(lim)\n for g=0,lim do\n local b = (N - R*r - G*g) / B\n if b >= 0 and b == math.floor(b) then\n cnt = cnt + 1\n --print(r,g,b)\n end\n end\nend\nprint(cnt)", "language": "Lua", "metadata": {"date": 1557625542, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s191901353.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s191901353", "user_id": "u162773977"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local R,G,B,N = io.read(\"n\", \"n\", \"n\", \"n\")\n\nlocal cnt = 0\nfor r=0,N do\n local lim = (N - R*r) / G\n --print(lim)\n for g=0,lim do\n local b = (N - R*r - G*g) / B\n if b >= 0 and b == math.floor(b) then\n cnt = cnt + 1\n --print(r,g,b)\n end\n end\nend\nprint(cnt)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 768, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s300889571", "group_id": "codeNet:p03049", "input_text": "local counter=0\nlocal BA,B_,_A=0,0,0\nlocal n=io.read(\"n\",\"l\")\nfor i=1,n do\n local s=io.read()\n local _,sAB=s:gsub(\"AB\",\"\")\n counter=counter+sAB\n sf=s:sub(1,1)\n sl=s:sub(#s,#s)\n BA=((sf==\"B\" and sl==\"A\") and BA+1 or BA)\n B_=((sf==\"B\" and sl~=\"A\") and B_+1 or B_)\n _A=((sf~=\"B\" and sl==\"A\") and _A+1 or _A)\nend\n\nif BA==0 then\n counter=counter+math.min(B_,_A)\nelseif BA>0 and B_+_A>0 then\n counter=counter+BA+math.min(B_,_A)\nelseif BA>0 and B_+_A==0 then\n counter=counter+BA-1\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1591671703, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s300889571.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s300889571", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local counter=0\nlocal BA,B_,_A=0,0,0\nlocal n=io.read(\"n\",\"l\")\nfor i=1,n do\n local s=io.read()\n local _,sAB=s:gsub(\"AB\",\"\")\n counter=counter+sAB\n sf=s:sub(1,1)\n sl=s:sub(#s,#s)\n BA=((sf==\"B\" and sl==\"A\") and BA+1 or BA)\n B_=((sf==\"B\" and sl~=\"A\") and B_+1 or B_)\n _A=((sf~=\"B\" and sl==\"A\") and _A+1 or _A)\nend\n\nif BA==0 then\n counter=counter+math.min(B_,_A)\nelseif BA>0 and B_+_A>0 then\n counter=counter+BA+math.min(B_,_A)\nelseif BA>0 and B_+_A==0 then\n counter=counter+BA-1\nend\nprint(counter)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 525, "cpu_time_ms": 18, "memory_kb": 880}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s603711275", "group_id": "codeNet:p03050", "input_text": "local DBG = false\nlocal function dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nlocal N = io.read(\"n\")\nlocal lim = math.ceil(N^0.5)\nlocal ans = 0\ndbgpr(lim)\nfor k=lim,1,-1 do\n dbgpr(k)\n if N % k == 0 then\n local d = N // k\n local m = d - 1\n if m > 0 and (N // m == N % m) then\n dbgpr(\"OK\", k, d, m)\n ans = ans + m\n end\n end\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1557628340, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s603711275.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s603711275", "user_id": "u162773977"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "local DBG = false\nlocal function dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nlocal N = io.read(\"n\")\nlocal lim = math.ceil(N^0.5)\nlocal ans = 0\ndbgpr(lim)\nfor k=lim,1,-1 do\n dbgpr(k)\n if N % k == 0 then\n local d = N // k\n local m = d - 1\n if m > 0 and (N // m == N % m) then\n dbgpr(\"OK\", k, d, m)\n ans = ans + m\n end\n end\nend\nprint(ans)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 435, "cpu_time_ms": 69, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s979983629", "group_id": "codeNet:p03054", "input_text": "local h, w, n = io.read(\"*n\", \"*n\", \"*n\", \"*l\")\nlocal sr, sc = io.read(\"*n\", \"*n\", \"*l\")\nlocal s = io.read()\nlocal t = io.read()\nlocal safe_l, safe_r, safe_t, safe_b = 1, w, 1, h\nlocal isok = true\nlocal mma, mmi = math.max, math.min\nfor i = n, 1, -1 do\n local tt = t:sub(i, i)\n if tt == \"L\" then\n safe_r = mmi(safe_r + 1, w)\n elseif tt == \"R\" then\n safe_l = mma(safe_l - 1, 1)\n elseif tt == \"U\" then\n safe_b = mmi(safe_b + 1, h)\n else\n safe_t = mma(safe_t - 1, 1)\n end\n local ss = s:sub(i, i)\n if ss == \"L\" then\n safe_l = safe_l + 1\n if safe_r < safe_l then isok = false break end\n elseif ss == \"R\" then\n safe_r = safe_r - 1\n if safe_r < safe_l then isok = false break end\n elseif ss == \"U\" then\n safe_t = safe_t + 1\n if safe_b < safe_t then isok = false break end\n else\n safe_b = safe_b - 1\n if safe_b < safe_t then isok = false break end\n end\n if not isok then break end\nend\nif isok then\n isok = safe_t <= sr and sr <= safe_b and safe_l <= sc and sc <= safe_r\nend\nprint(isok and \"YES\" or \"NO\")\n", "language": "Lua", "metadata": {"date": 1569433500, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03054.html", "problem_id": "p03054", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03054/input.txt", "sample_output_relpath": "derived/input_output/data/p03054/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03054/Lua/s979983629.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s979983629", "user_id": "u120582723"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "local h, w, n = io.read(\"*n\", \"*n\", \"*n\", \"*l\")\nlocal sr, sc = io.read(\"*n\", \"*n\", \"*l\")\nlocal s = io.read()\nlocal t = io.read()\nlocal safe_l, safe_r, safe_t, safe_b = 1, w, 1, h\nlocal isok = true\nlocal mma, mmi = math.max, math.min\nfor i = n, 1, -1 do\n local tt = t:sub(i, i)\n if tt == \"L\" then\n safe_r = mmi(safe_r + 1, w)\n elseif tt == \"R\" then\n safe_l = mma(safe_l - 1, 1)\n elseif tt == \"U\" then\n safe_b = mmi(safe_b + 1, h)\n else\n safe_t = mma(safe_t - 1, 1)\n end\n local ss = s:sub(i, i)\n if ss == \"L\" then\n safe_l = safe_l + 1\n if safe_r < safe_l then isok = false break end\n elseif ss == \"R\" then\n safe_r = safe_r - 1\n if safe_r < safe_l then isok = false break end\n elseif ss == \"U\" then\n safe_t = safe_t + 1\n if safe_b < safe_t then isok = false break end\n else\n safe_b = safe_b - 1\n if safe_b < safe_t then isok = false break end\n end\n if not isok then break end\nend\nif isok then\n isok = safe_t <= sr and sr <= safe_b and safe_l <= sc and sc <= safe_r\nend\nprint(isok and \"YES\" or \"NO\")\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have a rectangular grid of squares with H horizontal rows and W vertical columns. Let (i,j) denote the square at the i-th row from the top and the j-th column from the left.\nOn this grid, there is a piece, which is initially placed at square (s_r,s_c).\n\nTakahashi and Aoki will play a game, where each player has a string of length N.\nTakahashi's string is S, and Aoki's string is T. S and T both consist of four kinds of letters: L, R, U and D.\n\nThe game consists of N steps. The i-th step proceeds as follows:\n\nFirst, Takahashi performs a move. He either moves the piece in the direction of S_i, or does not move the piece.\n\nSecond, Aoki performs a move. He either moves the piece in the direction of T_i, or does not move the piece.\n\nHere, to move the piece in the direction of L, R, U and D, is to move the piece from square (r,c) to square (r,c-1), (r,c+1), (r-1,c) and (r+1,c), respectively. If the destination square does not exist, the piece is removed from the grid, and the game ends, even if less than N steps are done.\n\nTakahashi wants to remove the piece from the grid in one of the N steps.\nAoki, on the other hand, wants to finish the N steps with the piece remaining on the grid.\nDetermine if the piece will remain on the grid at the end of the game when both players play optimally.\n\nConstraints\n\n2 \\leq H,W \\leq 2 \\times 10^5\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq s_r \\leq H\n\n1 \\leq s_c \\leq W\n\n|S|=|T|=N\n\nS and T consists of the four kinds of letters L, R, U and D.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W N\ns_r s_c\nS\nT\n\nOutput\n\nIf the piece will remain on the grid at the end of the game, print YES; otherwise, print NO.\n\nSample Input 1\n\n2 3 3\n2 2\nRRL\nLUD\n\nSample Output 1\n\nYES\n\nHere is one possible progress of the game:\n\nTakahashi moves the piece right. The piece is now at (2,3).\n\nAoki moves the piece left. The piece is now at (2,2).\n\nTakahashi does not move the piece. The piece remains at (2,2).\n\nAoki moves the piece up. The piece is now at (1,2).\n\nTakahashi moves the piece left. The piece is now at (1,1).\n\nAoki does not move the piece. The piece remains at (1,1).\n\nSample Input 2\n\n4 3 5\n2 2\nUDRRR\nLLDUD\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n5 6 11\n2 1\nRLDRRUDDLRL\nURRDRLLDLRD\n\nSample Output 3\n\nNO", "sample_input": "2 3 3\n2 2\nRRL\nLUD\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03054", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have a rectangular grid of squares with H horizontal rows and W vertical columns. Let (i,j) denote the square at the i-th row from the top and the j-th column from the left.\nOn this grid, there is a piece, which is initially placed at square (s_r,s_c).\n\nTakahashi and Aoki will play a game, where each player has a string of length N.\nTakahashi's string is S, and Aoki's string is T. S and T both consist of four kinds of letters: L, R, U and D.\n\nThe game consists of N steps. The i-th step proceeds as follows:\n\nFirst, Takahashi performs a move. He either moves the piece in the direction of S_i, or does not move the piece.\n\nSecond, Aoki performs a move. He either moves the piece in the direction of T_i, or does not move the piece.\n\nHere, to move the piece in the direction of L, R, U and D, is to move the piece from square (r,c) to square (r,c-1), (r,c+1), (r-1,c) and (r+1,c), respectively. If the destination square does not exist, the piece is removed from the grid, and the game ends, even if less than N steps are done.\n\nTakahashi wants to remove the piece from the grid in one of the N steps.\nAoki, on the other hand, wants to finish the N steps with the piece remaining on the grid.\nDetermine if the piece will remain on the grid at the end of the game when both players play optimally.\n\nConstraints\n\n2 \\leq H,W \\leq 2 \\times 10^5\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq s_r \\leq H\n\n1 \\leq s_c \\leq W\n\n|S|=|T|=N\n\nS and T consists of the four kinds of letters L, R, U and D.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W N\ns_r s_c\nS\nT\n\nOutput\n\nIf the piece will remain on the grid at the end of the game, print YES; otherwise, print NO.\n\nSample Input 1\n\n2 3 3\n2 2\nRRL\nLUD\n\nSample Output 1\n\nYES\n\nHere is one possible progress of the game:\n\nTakahashi moves the piece right. The piece is now at (2,3).\n\nAoki moves the piece left. The piece is now at (2,2).\n\nTakahashi does not move the piece. The piece remains at (2,2).\n\nAoki moves the piece up. The piece is now at (1,2).\n\nTakahashi moves the piece left. The piece is now at (1,1).\n\nAoki does not move the piece. The piece remains at (1,1).\n\nSample Input 2\n\n4 3 5\n2 2\nUDRRR\nLLDUD\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n5 6 11\n2 1\nRLDRRUDDLRL\nURRDRLLDLRD\n\nSample Output 3\n\nNO", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1046, "cpu_time_ms": 75, "memory_kb": 844}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s527807446", "group_id": "codeNet:p03054", "input_text": "local function use_strict()\n local mt = {\n __index = function(t,k) error(\"_G __index:\" .. k) end,\n __newindex = function(t,k,v) error(\"_G __newindex:\" .. k) end\n }\n setmetatable(_G, mt)\nend\nlocal DBG = false\nlocal function dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nlocal function dbgpr_t(tbl, use_pairs)\n if DBG then\n local enum = ipairs\n if use_pairs then\n enum = pairs\n end\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in enum(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\nlocal function dbgpr_tp(tbl)\n dbgpr_t(tbl, true)\nend\n\nlocal function str2tbl(s)\n local t = {string.byte(s, 1, #s)}\n for i=1, #t do\n t[i] = string.char(t[i])\n end\n return t\nend\n\n--\nuse_strict()\nlocal YES, NO = \"YES\", \"NO\"\n\nlocal H, W, N = io.read(\"*n\", \"*n\", \"*n\", \"*l\")\nlocal sr, sc = io.read(\"*n\", \"*n\", \"*l\")\nlocal S = str2tbl(io.read(\"*l\"))\nlocal T = str2tbl(io.read(\"*l\"))\n\nlocal opposite = {\n L=\"R\",\n R=\"L\",\n D=\"U\",\n U=\"D\"\n}\n\nlocal function solve(size, move_lower, init_pos)\n local direc = move_lower == \"L\" and \"horiz\" or \"verti\"\n local move_upper = opposite[move_lower]\n -- Aoki wins when position p satisfies lower_bound <= p <= upper_bound\n local lower_bound = 1\n local upper_bound = size\n local math_max = math.max\n local math_min = math.min\n for n=N,1,-1 do\n if T[n] == move_lower then\n upper_bound = math_min(upper_bound + 1, size)\n elseif T[n] == move_upper then\n lower_bound = math_max(lower_bound - 1, 1)\n end\n if S[n] == move_lower then\n lower_bound = lower_bound + 1\n elseif S[n] == move_upper then\n upper_bound = upper_bound - 1\n end\n if lower_bound > size then\n return NO\n end\n if upper_bound < 1 then\n return NO\n end\n if lower_bound > upper_bound then\n return NO\n end\n dbgpr(direc, n, S[n], T[n], lower_bound, upper_bound)\n end\n if lower_bound <= init_pos and init_pos <= upper_bound then\n return YES\n else\n return NO\n end\nend\n\nlocal horiz_ans = solve(W, \"L\", sc)\ndbgpr(\"horiz\", horiz_ans)\nif horiz_ans == NO then\n print(NO)\n return\nend\nlocal vert_ans = solve(H, \"D\", sr)\ndbgpr(\"vert\", vert_ans)\nif vert_ans == NO then\n print(NO)\n return\nend\nprint(YES)\n", "language": "Lua", "metadata": {"date": 1557447991, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03054.html", "problem_id": "p03054", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03054/input.txt", "sample_output_relpath": "derived/input_output/data/p03054/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03054/Lua/s527807446.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s527807446", "user_id": "u162773977"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "local function use_strict()\n local mt = {\n __index = function(t,k) error(\"_G __index:\" .. k) end,\n __newindex = function(t,k,v) error(\"_G __newindex:\" .. k) end\n }\n setmetatable(_G, mt)\nend\nlocal DBG = false\nlocal function dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nlocal function dbgpr_t(tbl, use_pairs)\n if DBG then\n local enum = ipairs\n if use_pairs then\n enum = pairs\n end\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in enum(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\nlocal function dbgpr_tp(tbl)\n dbgpr_t(tbl, true)\nend\n\nlocal function str2tbl(s)\n local t = {string.byte(s, 1, #s)}\n for i=1, #t do\n t[i] = string.char(t[i])\n end\n return t\nend\n\n--\nuse_strict()\nlocal YES, NO = \"YES\", \"NO\"\n\nlocal H, W, N = io.read(\"*n\", \"*n\", \"*n\", \"*l\")\nlocal sr, sc = io.read(\"*n\", \"*n\", \"*l\")\nlocal S = str2tbl(io.read(\"*l\"))\nlocal T = str2tbl(io.read(\"*l\"))\n\nlocal opposite = {\n L=\"R\",\n R=\"L\",\n D=\"U\",\n U=\"D\"\n}\n\nlocal function solve(size, move_lower, init_pos)\n local direc = move_lower == \"L\" and \"horiz\" or \"verti\"\n local move_upper = opposite[move_lower]\n -- Aoki wins when position p satisfies lower_bound <= p <= upper_bound\n local lower_bound = 1\n local upper_bound = size\n local math_max = math.max\n local math_min = math.min\n for n=N,1,-1 do\n if T[n] == move_lower then\n upper_bound = math_min(upper_bound + 1, size)\n elseif T[n] == move_upper then\n lower_bound = math_max(lower_bound - 1, 1)\n end\n if S[n] == move_lower then\n lower_bound = lower_bound + 1\n elseif S[n] == move_upper then\n upper_bound = upper_bound - 1\n end\n if lower_bound > size then\n return NO\n end\n if upper_bound < 1 then\n return NO\n end\n if lower_bound > upper_bound then\n return NO\n end\n dbgpr(direc, n, S[n], T[n], lower_bound, upper_bound)\n end\n if lower_bound <= init_pos and init_pos <= upper_bound then\n return YES\n else\n return NO\n end\nend\n\nlocal horiz_ans = solve(W, \"L\", sc)\ndbgpr(\"horiz\", horiz_ans)\nif horiz_ans == NO then\n print(NO)\n return\nend\nlocal vert_ans = solve(H, \"D\", sr)\ndbgpr(\"vert\", vert_ans)\nif vert_ans == NO then\n print(NO)\n return\nend\nprint(YES)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have a rectangular grid of squares with H horizontal rows and W vertical columns. Let (i,j) denote the square at the i-th row from the top and the j-th column from the left.\nOn this grid, there is a piece, which is initially placed at square (s_r,s_c).\n\nTakahashi and Aoki will play a game, where each player has a string of length N.\nTakahashi's string is S, and Aoki's string is T. S and T both consist of four kinds of letters: L, R, U and D.\n\nThe game consists of N steps. The i-th step proceeds as follows:\n\nFirst, Takahashi performs a move. He either moves the piece in the direction of S_i, or does not move the piece.\n\nSecond, Aoki performs a move. He either moves the piece in the direction of T_i, or does not move the piece.\n\nHere, to move the piece in the direction of L, R, U and D, is to move the piece from square (r,c) to square (r,c-1), (r,c+1), (r-1,c) and (r+1,c), respectively. If the destination square does not exist, the piece is removed from the grid, and the game ends, even if less than N steps are done.\n\nTakahashi wants to remove the piece from the grid in one of the N steps.\nAoki, on the other hand, wants to finish the N steps with the piece remaining on the grid.\nDetermine if the piece will remain on the grid at the end of the game when both players play optimally.\n\nConstraints\n\n2 \\leq H,W \\leq 2 \\times 10^5\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq s_r \\leq H\n\n1 \\leq s_c \\leq W\n\n|S|=|T|=N\n\nS and T consists of the four kinds of letters L, R, U and D.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W N\ns_r s_c\nS\nT\n\nOutput\n\nIf the piece will remain on the grid at the end of the game, print YES; otherwise, print NO.\n\nSample Input 1\n\n2 3 3\n2 2\nRRL\nLUD\n\nSample Output 1\n\nYES\n\nHere is one possible progress of the game:\n\nTakahashi moves the piece right. The piece is now at (2,3).\n\nAoki moves the piece left. The piece is now at (2,2).\n\nTakahashi does not move the piece. The piece remains at (2,2).\n\nAoki moves the piece up. The piece is now at (1,2).\n\nTakahashi moves the piece left. The piece is now at (1,1).\n\nAoki does not move the piece. The piece remains at (1,1).\n\nSample Input 2\n\n4 3 5\n2 2\nUDRRR\nLLDUD\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n5 6 11\n2 1\nRLDRRUDDLRL\nURRDRLLDLRD\n\nSample Output 3\n\nNO", "sample_input": "2 3 3\n2 2\nRRL\nLUD\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03054", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have a rectangular grid of squares with H horizontal rows and W vertical columns. Let (i,j) denote the square at the i-th row from the top and the j-th column from the left.\nOn this grid, there is a piece, which is initially placed at square (s_r,s_c).\n\nTakahashi and Aoki will play a game, where each player has a string of length N.\nTakahashi's string is S, and Aoki's string is T. S and T both consist of four kinds of letters: L, R, U and D.\n\nThe game consists of N steps. The i-th step proceeds as follows:\n\nFirst, Takahashi performs a move. He either moves the piece in the direction of S_i, or does not move the piece.\n\nSecond, Aoki performs a move. He either moves the piece in the direction of T_i, or does not move the piece.\n\nHere, to move the piece in the direction of L, R, U and D, is to move the piece from square (r,c) to square (r,c-1), (r,c+1), (r-1,c) and (r+1,c), respectively. If the destination square does not exist, the piece is removed from the grid, and the game ends, even if less than N steps are done.\n\nTakahashi wants to remove the piece from the grid in one of the N steps.\nAoki, on the other hand, wants to finish the N steps with the piece remaining on the grid.\nDetermine if the piece will remain on the grid at the end of the game when both players play optimally.\n\nConstraints\n\n2 \\leq H,W \\leq 2 \\times 10^5\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq s_r \\leq H\n\n1 \\leq s_c \\leq W\n\n|S|=|T|=N\n\nS and T consists of the four kinds of letters L, R, U and D.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W N\ns_r s_c\nS\nT\n\nOutput\n\nIf the piece will remain on the grid at the end of the game, print YES; otherwise, print NO.\n\nSample Input 1\n\n2 3 3\n2 2\nRRL\nLUD\n\nSample Output 1\n\nYES\n\nHere is one possible progress of the game:\n\nTakahashi moves the piece right. The piece is now at (2,3).\n\nAoki moves the piece left. The piece is now at (2,2).\n\nTakahashi does not move the piece. The piece remains at (2,2).\n\nAoki moves the piece up. The piece is now at (1,2).\n\nTakahashi moves the piece left. The piece is now at (1,1).\n\nAoki does not move the piece. The piece remains at (1,1).\n\nSample Input 2\n\n4 3 5\n2 2\nUDRRR\nLLDUD\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n5 6 11\n2 1\nRLDRRUDDLRL\nURRDRLLDLRD\n\nSample Output 3\n\nNO", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2544, "cpu_time_ms": 177, "memory_kb": 13364}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s426948963", "group_id": "codeNet:p03054", "input_text": "local ior = io.input()\nlocal h, w, n = ior:read(\"*n\", \"*n\", \"*n\")\nlocal sr, sc = ior:read(\"*n\", \"*n\", \"*l\")\nlocal s = ior:read()\nlocal t = ior:read()\nlocal s_left, s_right, s_up, s_down = {}, {}, {}, {}\nlocal t_left, t_right, t_up, t_down = {}, {}, {}, {}\nlocal str = \"\"\nstr = s:sub(1, 1)\ns_left[1] = str == \"L\" and 1 or 0\ns_right[1] = str == \"R\" and 1 or 0\ns_up[1] = str == \"U\" and 1 or 0\ns_down[1] = str == \"D\" and 1 or 0\n\nstr = t:sub(1, 1)\nt_left[1] = str == \"L\" and 1 or 0\nt_right[1] = str == \"R\" and 1 or 0\nt_up[1] = str == \"U\" and 1 or 0\nt_down[1] = str == \"D\" and 1 or 0\nif(sc == 1) then t_left[1] = 0 end\nif(sc == w) then t_right[1] = 0 end\nif(sr == 1) then t_up[1] = 0 end\nif(sr == h) then t_down[1] = 0 end\n\nlocal mma, mmi = math.max, math.min\n\nfor i = 2, n do\n str = s:sub(i, i)\n s_left[i] = s_left[i - 1] + (str == \"L\" and 1 or 0)\n s_right[i] = s_right[i - 1] + (str == \"R\" and 1 or 0)\n s_up[i] = s_up[i - 1] + (str == \"U\" and 1 or 0)\n s_down[i] = s_down[i - 1] + (str == \"D\" and 1 or 0)\n str = t:sub(i, i)\n t_left[i] = t_left[i - 1] + (str == \"L\" and 1 or 0)\n t_left[i] = mmi(sc - 1, t_left[i])\n t_right[i] = t_right[i - 1] + (str == \"R\" and 1 or 0)\n t_right[i] = mmi(w - sc, t_right[i])\n t_up[i] = t_up[i - 1] + (str == \"U\" and 1 or 0)\n t_up[i] = mmi(sr - 1, t_up[i])\n t_down[i] = t_down[i - 1] + (str == \"D\" and 1 or 0)\n t_down[i] = mmi(h - sr, t_down[i])\nend\n\nlocal leftlim, rightlim = sc, w + 1 - sc\nlocal uplim, downlim = sr, h + 1 - sr\n\nlocal fin = false\nif(\n (leftlim <= s_left[1]) or\n (rightlim <= s_right[1]) or\n (uplim <= s_up[1]) or\n (downlim <= s_down[1])\n) then\n print(\"NO\")\n fin = true\nend\nif(not fin) then\n for i = 2, n do\n if(\n (leftlim <= s_left[i] - t_right[i - 1]) or\n (rightlim <= s_right[i] - t_left[i - 1]) or\n (uplim <= s_up[i] - t_down[i - 1]) or\n (downlim <= s_down[i] - t_up[i - 1])\n ) then\n print(\"NO\")\n fin = true\n end\n end\nend\nif(not fin) then print(\"YES\") end\n", "language": "Lua", "metadata": {"date": 1557020825, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03054.html", "problem_id": "p03054", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03054/input.txt", "sample_output_relpath": "derived/input_output/data/p03054/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03054/Lua/s426948963.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s426948963", "user_id": "u120582723"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "local ior = io.input()\nlocal h, w, n = ior:read(\"*n\", \"*n\", \"*n\")\nlocal sr, sc = ior:read(\"*n\", \"*n\", \"*l\")\nlocal s = ior:read()\nlocal t = ior:read()\nlocal s_left, s_right, s_up, s_down = {}, {}, {}, {}\nlocal t_left, t_right, t_up, t_down = {}, {}, {}, {}\nlocal str = \"\"\nstr = s:sub(1, 1)\ns_left[1] = str == \"L\" and 1 or 0\ns_right[1] = str == \"R\" and 1 or 0\ns_up[1] = str == \"U\" and 1 or 0\ns_down[1] = str == \"D\" and 1 or 0\n\nstr = t:sub(1, 1)\nt_left[1] = str == \"L\" and 1 or 0\nt_right[1] = str == \"R\" and 1 or 0\nt_up[1] = str == \"U\" and 1 or 0\nt_down[1] = str == \"D\" and 1 or 0\nif(sc == 1) then t_left[1] = 0 end\nif(sc == w) then t_right[1] = 0 end\nif(sr == 1) then t_up[1] = 0 end\nif(sr == h) then t_down[1] = 0 end\n\nlocal mma, mmi = math.max, math.min\n\nfor i = 2, n do\n str = s:sub(i, i)\n s_left[i] = s_left[i - 1] + (str == \"L\" and 1 or 0)\n s_right[i] = s_right[i - 1] + (str == \"R\" and 1 or 0)\n s_up[i] = s_up[i - 1] + (str == \"U\" and 1 or 0)\n s_down[i] = s_down[i - 1] + (str == \"D\" and 1 or 0)\n str = t:sub(i, i)\n t_left[i] = t_left[i - 1] + (str == \"L\" and 1 or 0)\n t_left[i] = mmi(sc - 1, t_left[i])\n t_right[i] = t_right[i - 1] + (str == \"R\" and 1 or 0)\n t_right[i] = mmi(w - sc, t_right[i])\n t_up[i] = t_up[i - 1] + (str == \"U\" and 1 or 0)\n t_up[i] = mmi(sr - 1, t_up[i])\n t_down[i] = t_down[i - 1] + (str == \"D\" and 1 or 0)\n t_down[i] = mmi(h - sr, t_down[i])\nend\n\nlocal leftlim, rightlim = sc, w + 1 - sc\nlocal uplim, downlim = sr, h + 1 - sr\n\nlocal fin = false\nif(\n (leftlim <= s_left[1]) or\n (rightlim <= s_right[1]) or\n (uplim <= s_up[1]) or\n (downlim <= s_down[1])\n) then\n print(\"NO\")\n fin = true\nend\nif(not fin) then\n for i = 2, n do\n if(\n (leftlim <= s_left[i] - t_right[i - 1]) or\n (rightlim <= s_right[i] - t_left[i - 1]) or\n (uplim <= s_up[i] - t_down[i - 1]) or\n (downlim <= s_down[i] - t_up[i - 1])\n ) then\n print(\"NO\")\n fin = true\n end\n end\nend\nif(not fin) then print(\"YES\") end\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have a rectangular grid of squares with H horizontal rows and W vertical columns. Let (i,j) denote the square at the i-th row from the top and the j-th column from the left.\nOn this grid, there is a piece, which is initially placed at square (s_r,s_c).\n\nTakahashi and Aoki will play a game, where each player has a string of length N.\nTakahashi's string is S, and Aoki's string is T. S and T both consist of four kinds of letters: L, R, U and D.\n\nThe game consists of N steps. The i-th step proceeds as follows:\n\nFirst, Takahashi performs a move. He either moves the piece in the direction of S_i, or does not move the piece.\n\nSecond, Aoki performs a move. He either moves the piece in the direction of T_i, or does not move the piece.\n\nHere, to move the piece in the direction of L, R, U and D, is to move the piece from square (r,c) to square (r,c-1), (r,c+1), (r-1,c) and (r+1,c), respectively. If the destination square does not exist, the piece is removed from the grid, and the game ends, even if less than N steps are done.\n\nTakahashi wants to remove the piece from the grid in one of the N steps.\nAoki, on the other hand, wants to finish the N steps with the piece remaining on the grid.\nDetermine if the piece will remain on the grid at the end of the game when both players play optimally.\n\nConstraints\n\n2 \\leq H,W \\leq 2 \\times 10^5\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq s_r \\leq H\n\n1 \\leq s_c \\leq W\n\n|S|=|T|=N\n\nS and T consists of the four kinds of letters L, R, U and D.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W N\ns_r s_c\nS\nT\n\nOutput\n\nIf the piece will remain on the grid at the end of the game, print YES; otherwise, print NO.\n\nSample Input 1\n\n2 3 3\n2 2\nRRL\nLUD\n\nSample Output 1\n\nYES\n\nHere is one possible progress of the game:\n\nTakahashi moves the piece right. The piece is now at (2,3).\n\nAoki moves the piece left. The piece is now at (2,2).\n\nTakahashi does not move the piece. The piece remains at (2,2).\n\nAoki moves the piece up. The piece is now at (1,2).\n\nTakahashi moves the piece left. The piece is now at (1,1).\n\nAoki does not move the piece. The piece remains at (1,1).\n\nSample Input 2\n\n4 3 5\n2 2\nUDRRR\nLLDUD\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n5 6 11\n2 1\nRLDRRUDDLRL\nURRDRLLDLRD\n\nSample Output 3\n\nNO", "sample_input": "2 3 3\n2 2\nRRL\nLUD\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03054", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have a rectangular grid of squares with H horizontal rows and W vertical columns. Let (i,j) denote the square at the i-th row from the top and the j-th column from the left.\nOn this grid, there is a piece, which is initially placed at square (s_r,s_c).\n\nTakahashi and Aoki will play a game, where each player has a string of length N.\nTakahashi's string is S, and Aoki's string is T. S and T both consist of four kinds of letters: L, R, U and D.\n\nThe game consists of N steps. The i-th step proceeds as follows:\n\nFirst, Takahashi performs a move. He either moves the piece in the direction of S_i, or does not move the piece.\n\nSecond, Aoki performs a move. He either moves the piece in the direction of T_i, or does not move the piece.\n\nHere, to move the piece in the direction of L, R, U and D, is to move the piece from square (r,c) to square (r,c-1), (r,c+1), (r-1,c) and (r+1,c), respectively. If the destination square does not exist, the piece is removed from the grid, and the game ends, even if less than N steps are done.\n\nTakahashi wants to remove the piece from the grid in one of the N steps.\nAoki, on the other hand, wants to finish the N steps with the piece remaining on the grid.\nDetermine if the piece will remain on the grid at the end of the game when both players play optimally.\n\nConstraints\n\n2 \\leq H,W \\leq 2 \\times 10^5\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq s_r \\leq H\n\n1 \\leq s_c \\leq W\n\n|S|=|T|=N\n\nS and T consists of the four kinds of letters L, R, U and D.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W N\ns_r s_c\nS\nT\n\nOutput\n\nIf the piece will remain on the grid at the end of the game, print YES; otherwise, print NO.\n\nSample Input 1\n\n2 3 3\n2 2\nRRL\nLUD\n\nSample Output 1\n\nYES\n\nHere is one possible progress of the game:\n\nTakahashi moves the piece right. The piece is now at (2,3).\n\nAoki moves the piece left. The piece is now at (2,2).\n\nTakahashi does not move the piece. The piece remains at (2,2).\n\nAoki moves the piece up. The piece is now at (1,2).\n\nTakahashi moves the piece left. The piece is now at (1,1).\n\nAoki does not move the piece. The piece remains at (1,1).\n\nSample Input 2\n\n4 3 5\n2 2\nUDRRR\nLLDUD\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n5 6 11\n2 1\nRLDRRUDDLRL\nURRDRLLDLRD\n\nSample Output 3\n\nNO", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1964, "cpu_time_ms": 43, "memory_kb": 18828}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s157617701", "group_id": "codeNet:p03055", "input_text": "local n = io.read(\"*n\")\nlocal edge = {}\nlocal len = {}\nfor i = 1, n do\n edge[i] = {}\n len[i] = -1\nend\nfor i = 1, n - 1 do\n local a, b = io.read(\"*n\", \"*n\")\n edge[a][b], edge[b][a] = true, true\nend\nlocal tasks = {1}\nlen[1] = 0\nfor i = 1, n do\n local src = tasks[i]\n for dst, _u in pairs(edge[src]) do\n if len[dst] < 0 then\n len[dst] = len[src] + 1\n table.insert(tasks, dst)\n end\n end\nend\nlocal startpos = 1\nfor i = 2, n do\n if len[startpos] < len[i] then\n startpos = i\n end\nend\ntasks = {startpos}\nfor i = 1, n do\n len[i] = -1\nend\nlen[startpos] = 0\nfor i = 1, n do\n local src = tasks[i]\n for dst, _u in pairs(edge[src]) do\n if len[dst] < 0 then\n len[dst] = len[src] + 1\n table.insert(tasks, dst)\n end\n end\nend\nlocal maxlen = 0\nfor i = 1, n do\n if maxlen < len[i] then maxlen = len[i] end\nend\nprint(maxlen % 3 == 1 and \"Second\" or \"First\")\n", "language": "Lua", "metadata": {"date": 1583028339, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03055.html", "problem_id": "p03055", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03055/input.txt", "sample_output_relpath": "derived/input_output/data/p03055/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03055/Lua/s157617701.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s157617701", "user_id": "u120582723"}, "prompt_components": {"gold_output": "First\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal edge = {}\nlocal len = {}\nfor i = 1, n do\n edge[i] = {}\n len[i] = -1\nend\nfor i = 1, n - 1 do\n local a, b = io.read(\"*n\", \"*n\")\n edge[a][b], edge[b][a] = true, true\nend\nlocal tasks = {1}\nlen[1] = 0\nfor i = 1, n do\n local src = tasks[i]\n for dst, _u in pairs(edge[src]) do\n if len[dst] < 0 then\n len[dst] = len[src] + 1\n table.insert(tasks, dst)\n end\n end\nend\nlocal startpos = 1\nfor i = 2, n do\n if len[startpos] < len[i] then\n startpos = i\n end\nend\ntasks = {startpos}\nfor i = 1, n do\n len[i] = -1\nend\nlen[startpos] = 0\nfor i = 1, n do\n local src = tasks[i]\n for dst, _u in pairs(edge[src]) do\n if len[dst] < 0 then\n len[dst] = len[src] + 1\n table.insert(tasks, dst)\n end\n end\nend\nlocal maxlen = 0\nfor i = 1, n do\n if maxlen < len[i] then maxlen = len[i] end\nend\nprint(maxlen % 3 == 1 and \"Second\" or \"First\")\n", "problem_context": "Score : 800 points\n\nProblem Statement\n\nTakahashi and Aoki will play a game on a tree.\nThe tree has N vertices numbered 1 to N, and the i-th of the N-1 edges connects Vertex a_i and Vertex b_i.\n\nAt the beginning of the game, each vertex contains a coin.\nStarting from Takahashi, he and Aoki will alternately perform the following operation:\n\nChoose a vertex v that contains one or more coins, and remove all the coins from v.\n\nThen, move each coin remaining on the tree to the vertex that is nearest to v among the adjacent vertices of the coin's current vertex.\n\nThe player who becomes unable to play, loses the game.\nThat is, the player who takes his turn when there is no coin remaining on the tree, loses the game.\nDetermine the winner of the game when both players play optimally.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq a_i, b_i \\leq N\n\na_i \\neq b_i\n\nThe graph given as input is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\na_2 b_2\n:\na_{N-1} b_{N-1}\n\nOutput\n\nPrint First if Takahashi will win, and print Second if Aoki will win.\n\nSample Input 1\n\n3\n1 2\n2 3\n\nSample Output 1\n\nFirst\n\nHere is one possible progress of the game:\n\nTakahashi removes the coin from Vertex 1. Now, Vertex 1 and Vertex 2 contain one coin each.\n\nAoki removes the coin from Vertex 2. Now, Vertex 2 contains one coin.\n\nTakahashi removes the coin from Vertex 2. Now, there is no coin remaining on the tree.\n\nAoki takes his turn when there is no coin on the tree and loses.\n\nSample Input 2\n\n6\n1 2\n2 3\n2 4\n4 6\n5 6\n\nSample Output 2\n\nSecond\n\nSample Input 3\n\n7\n1 7\n7 4\n3 4\n7 5\n6 3\n2 1\n\nSample Output 3\n\nFirst", "sample_input": "3\n1 2\n2 3\n"}, "reference_outputs": ["First\n"], "source_document_id": "p03055", "source_text": "Score : 800 points\n\nProblem Statement\n\nTakahashi and Aoki will play a game on a tree.\nThe tree has N vertices numbered 1 to N, and the i-th of the N-1 edges connects Vertex a_i and Vertex b_i.\n\nAt the beginning of the game, each vertex contains a coin.\nStarting from Takahashi, he and Aoki will alternately perform the following operation:\n\nChoose a vertex v that contains one or more coins, and remove all the coins from v.\n\nThen, move each coin remaining on the tree to the vertex that is nearest to v among the adjacent vertices of the coin's current vertex.\n\nThe player who becomes unable to play, loses the game.\nThat is, the player who takes his turn when there is no coin remaining on the tree, loses the game.\nDetermine the winner of the game when both players play optimally.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq a_i, b_i \\leq N\n\na_i \\neq b_i\n\nThe graph given as input is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\na_2 b_2\n:\na_{N-1} b_{N-1}\n\nOutput\n\nPrint First if Takahashi will win, and print Second if Aoki will win.\n\nSample Input 1\n\n3\n1 2\n2 3\n\nSample Output 1\n\nFirst\n\nHere is one possible progress of the game:\n\nTakahashi removes the coin from Vertex 1. Now, Vertex 1 and Vertex 2 contain one coin each.\n\nAoki removes the coin from Vertex 2. Now, Vertex 2 contains one coin.\n\nTakahashi removes the coin from Vertex 2. Now, there is no coin remaining on the tree.\n\nAoki takes his turn when there is no coin on the tree and loses.\n\nSample Input 2\n\n6\n1 2\n2 3\n2 4\n4 6\n5 6\n\nSample Output 2\n\nSecond\n\nSample Input 3\n\n7\n1 7\n7 4\n3 4\n7 5\n6 3\n2 1\n\nSample Output 3\n\nFirst", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 335, "memory_kb": 30832}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s360788698", "group_id": "codeNet:p03059", "input_text": "-- Vicfred\n-- https://atcoder.jp/contests/abc125/tasks/abc125_a\n-- math, implementation\na, b, t = io.read(\"*n\", \"*n\", \"*n\")\nprint((t // a) * b)\n\n", "language": "Lua", "metadata": {"date": 1599945963, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03059.html", "problem_id": "p03059", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03059/input.txt", "sample_output_relpath": "derived/input_output/data/p03059/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03059/Lua/s360788698.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s360788698", "user_id": "u737840172"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "-- Vicfred\n-- https://atcoder.jp/contests/abc125/tasks/abc125_a\n-- math, implementation\na, b, t = io.read(\"*n\", \"*n\", \"*n\")\nprint((t // a) * b)\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation.\n\nFind the total number of biscuits produced within T + 0.5 seconds after activation.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, T \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B T\n\nOutput\n\nPrint the total number of biscuits produced within T + 0.5 seconds after activation.\n\nSample Input 1\n\n3 5 7\n\nSample Output 1\n\n10\n\nFive biscuits will be produced three seconds after activation.\n\nAnother five biscuits will be produced six seconds after activation.\n\nThus, a total of ten biscuits will be produced within 7.5 seconds after activation.\n\nSample Input 2\n\n3 2 9\n\nSample Output 2\n\n6\n\nSample Input 3\n\n20 20 19\n\nSample Output 3\n\n0", "sample_input": "3 5 7\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03059", "source_text": "Score : 100 points\n\nProblem Statement\n\nA biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation.\n\nFind the total number of biscuits produced within T + 0.5 seconds after activation.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, T \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B T\n\nOutput\n\nPrint the total number of biscuits produced within T + 0.5 seconds after activation.\n\nSample Input 1\n\n3 5 7\n\nSample Output 1\n\n10\n\nFive biscuits will be produced three seconds after activation.\n\nAnother five biscuits will be produced six seconds after activation.\n\nThus, a total of ten biscuits will be produced within 7.5 seconds after activation.\n\nSample Input 2\n\n3 2 9\n\nSample Output 2\n\n6\n\nSample Input 3\n\n20 20 19\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 10, "memory_kb": 2716}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s615894240", "group_id": "codeNet:p03060", "input_text": "local N = io.read(\"n\")\nlocal V = {} for i=1,N do V[i] = io.read(\"n\") end\nlocal C = {} for i=1,N do C[i] = io.read(\"n\") end\nlocal ans = 0\nfor i=1,N do\n local diff = V[i] - C[i]\n if diff > 0 then\n ans = ans + diff\n end\nend\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1556413514, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03060.html", "problem_id": "p03060", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03060/input.txt", "sample_output_relpath": "derived/input_output/data/p03060/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03060/Lua/s615894240.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s615894240", "user_id": "u162773977"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local N = io.read(\"n\")\nlocal V = {} for i=1,N do V[i] = io.read(\"n\") end\nlocal C = {} for i=1,N do C[i] = io.read(\"n\") end\nlocal ans = 0\nfor i=1,N do\n local diff = V[i] - C[i]\n if diff > 0 then\n ans = ans + diff\n end\nend\nprint(ans)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N gems. The value of the i-th gem is V_i.\n\nYou will choose some of these gems, possibly all or none, and get them.\n\nHowever, you need to pay a cost of C_i to get the i-th gem.\n\nLet X be the sum of the values of the gems obtained, and Y be the sum of the costs paid.\n\nFind the maximum possible value of X-Y.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq C_i, V_i \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nV_1 V_2 ... V_N\nC_1 C_2 ... C_N\n\nOutput\n\nPrint the maximum possible value of X-Y.\n\nSample Input 1\n\n3\n10 2 5\n6 3 4\n\nSample Output 1\n\n5\n\nIf we choose the first and third gems, X = 10 + 5 = 15 and Y = 6 + 4 = 10.\nWe have X-Y = 5 here, which is the maximum possible value.\n\nSample Input 2\n\n4\n13 21 6 19\n11 30 6 15\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1\n1\n50\n\nSample Output 3\n\n0", "sample_input": "3\n10 2 5\n6 3 4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03060", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N gems. The value of the i-th gem is V_i.\n\nYou will choose some of these gems, possibly all or none, and get them.\n\nHowever, you need to pay a cost of C_i to get the i-th gem.\n\nLet X be the sum of the values of the gems obtained, and Y be the sum of the costs paid.\n\nFind the maximum possible value of X-Y.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq C_i, V_i \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nV_1 V_2 ... V_N\nC_1 C_2 ... C_N\n\nOutput\n\nPrint the maximum possible value of X-Y.\n\nSample Input 1\n\n3\n10 2 5\n6 3 4\n\nSample Output 1\n\n5\n\nIf we choose the first and third gems, X = 10 + 5 = 15 and Y = 6 + 4 = 10.\nWe have X-Y = 5 here, which is the maximum possible value.\n\nSample Input 2\n\n4\n13 21 6 19\n11 30 6 15\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1\n1\n50\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 1132}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s449314675", "group_id": "codeNet:p03062", "input_text": "function gcd(x, y)\n\treturn y == 0 and x or gcd(y, x % y)\nend\nn = io.read\"*n\"\na = {}\nfor i=1,n do\n\ta[i] = io.read\"*n\"\nend\nr=0\nfor i=1,n do\n\tt = {table.unpack(a)}\n\tt[i] = a[i+1] or a[i-1]\n\tfor j=1,n-1 do\n\t\tt[1] = gcd(t[1],t[j+1])\n\tend\n\tr = t[1]\nend\nprint(r)", "language": "Lua", "metadata": {"date": 1556418295, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s449314675.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s449314675", "user_id": "u965456277"}, "prompt_components": {"gold_output": "19\n", "input_to_evaluate": "function gcd(x, y)\n\treturn y == 0 and x or gcd(y, x % y)\nend\nn = io.read\"*n\"\na = {}\nfor i=1,n do\n\ta[i] = io.read\"*n\"\nend\nr=0\nfor i=1,n do\n\tt = {table.unpack(a)}\n\tt[i] = a[i+1] or a[i-1]\n\tfor j=1,n-1 do\n\t\tt[1] = gcd(t[1],t[j+1])\n\tend\n\tr = t[1]\nend\nprint(r)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2104, "memory_kb": 16920}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s268632575", "group_id": "codeNet:p03062", "input_text": "local ior = io.read\nlocal n = ior(\"*n\")\nlocal t = {}\nlocal minus = 0\nfor i = 1, n do\n local a = ior(\"*n\")\n if(a < 0) then minus = minus + 1 end\n t[i] = a\nend\ntable.sort(t)\nlocal ma = math.abs\nif(minus % 2 == 0) then\n local sum = 0\n for i = 1, n do\n sum = sum + ma(t[i])\n end\n print(sum)\nelse\n local sum = 0\n for i = 1, minus - 1 do\n sum = sum + ma(t[i])\n end\n if(minus < n) then\n sum = sum + ma(t[minus + 1] + t[minus])\n else\n sum = sum + t[minus]\n end\n for i = minus + 2, n do\n sum = sum + t[i]\n end\n print(sum)\nend\n", "language": "Lua", "metadata": {"date": 1556414214, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s268632575.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s268632575", "user_id": "u120582723"}, "prompt_components": {"gold_output": "19\n", "input_to_evaluate": "local ior = io.read\nlocal n = ior(\"*n\")\nlocal t = {}\nlocal minus = 0\nfor i = 1, n do\n local a = ior(\"*n\")\n if(a < 0) then minus = minus + 1 end\n t[i] = a\nend\ntable.sort(t)\nlocal ma = math.abs\nif(minus % 2 == 0) then\n local sum = 0\n for i = 1, n do\n sum = sum + ma(t[i])\n end\n print(sum)\nelse\n local sum = 0\n for i = 1, minus - 1 do\n sum = sum + ma(t[i])\n end\n if(minus < n) then\n sum = sum + ma(t[minus + 1] + t[minus])\n else\n sum = sum + t[minus]\n end\n for i = minus + 2, n do\n sum = sum + t[i]\n end\n print(sum)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 548, "cpu_time_ms": 93, "memory_kb": 2424}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s332629079", "group_id": "codeNet:p03067", "input_text": "a, b, c = io.read(\"*n\", \"*n\", \"*n\")\nif a < b and b < c then\n print(\"Yes\")\nelseif c < b and b < a then\n print(\"Yes\")\nelse\n print(\"No\")\nend\n", "language": "Lua", "metadata": {"date": 1595699339, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s332629079.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s332629079", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "a, b, c = io.read(\"*n\", \"*n\", \"*n\")\nif a < b and b < c then\n print(\"Yes\")\nelseif c < b and b < a then\n print(\"Yes\")\nelse\n print(\"No\")\nend\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 2600}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s261540034", "group_id": "codeNet:p03067", "input_text": "a,b,c=io.read(\"*n\",\"*n\",\"*n\")\nprint((b-a)*(b-c)>0 and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1555819835, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s261540034.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s261540034", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "a,b,c=io.read(\"*n\",\"*n\",\"*n\")\nprint((b-a)*(b-c)>0 and \"Yes\" or \"No\")\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 69, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s335103472", "group_id": "codeNet:p03069", "input_text": "local n=io.read(\"n\",\"l\")\nlocal s=io.read()\n\nlocal _,white=s:gsub(\"%,\",\"\")\nlocal black=0\nlocal result=black+white\nfor i=1,n do\n if s:sub(i,i)==\"#\" then\n black=black+1\n else\n white=white-1\n end\n result=math.min(result,black+white)\nend\nprint(result)", "language": "Lua", "metadata": {"date": 1592710271, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s335103472.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s335103472", "user_id": "u045238009"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local n=io.read(\"n\",\"l\")\nlocal s=io.read()\n\nlocal _,white=s:gsub(\"%,\",\"\")\nlocal black=0\nlocal result=black+white\nfor i=1,n do\n if s:sub(i,i)==\"#\" then\n black=black+1\n else\n white=white-1\n end\n result=math.min(result,black+white)\nend\nprint(result)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 54, "memory_kb": 2976}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s642959236", "group_id": "codeNet:p03069", "input_text": "local function str2tbl(s)\n local t = {string.byte(s, 1, #s)}\n for i=1, #t do\n t[i] = string.char(t[i])\n end\n return t\nend\n\nlocal function str2numtbl(s, offset)\n local t = {string.byte(s, 1, #s)}\n if offset then\n for i=1, #t do\n t[i] = t[i] - offset\n end\n end\n return t\nend\n\n--local function each_char2(s)\n-- return ipairs(str2tbl(s))\n--end\n\nlocal function each_char(s)\n local f = function(_, i)\n i = i + 1\n if i <= #s then\n return i, string.sub(s, i, i)\n end\n end\n return f, nil, 0\nend\n\nfunction string.at(s, i)\n return string.sub(s, i, i)\nend\n\n--\nlocal N,_,S = io.read(\"n\", \"l\", \"l\")\nlocal B = '#'\nlocal W = '.'\nS = str2tbl(S)\nlocal ans = 0\nlocal flag = false\nfor i=1,N do\n local c = S[i]\n if not flag then\n if c == B then\n flag = true\n end\n else\n if c == W then\n ans = ans + 1\n end\n end\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1555808979, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s642959236.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s642959236", "user_id": "u162773977"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local function str2tbl(s)\n local t = {string.byte(s, 1, #s)}\n for i=1, #t do\n t[i] = string.char(t[i])\n end\n return t\nend\n\nlocal function str2numtbl(s, offset)\n local t = {string.byte(s, 1, #s)}\n if offset then\n for i=1, #t do\n t[i] = t[i] - offset\n end\n end\n return t\nend\n\n--local function each_char2(s)\n-- return ipairs(str2tbl(s))\n--end\n\nlocal function each_char(s)\n local f = function(_, i)\n i = i + 1\n if i <= #s then\n return i, string.sub(s, i, i)\n end\n end\n return f, nil, 0\nend\n\nfunction string.at(s, i)\n return string.sub(s, i, i)\nend\n\n--\nlocal N,_,S = io.read(\"n\", \"l\", \"l\")\nlocal B = '#'\nlocal W = '.'\nS = str2tbl(S)\nlocal ans = 0\nlocal flag = false\nfor i=1,N do\n local c = S[i]\n if not flag then\n if c == B then\n flag = true\n end\n else\n if c == W then\n ans = ans + 1\n end\n end\nend\nprint(ans)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 968, "cpu_time_ms": 135, "memory_kb": 7340}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s716759855", "group_id": "codeNet:p03071", "input_text": "a, b = io.read(\"*n\", \"*n\")\nif a == b then\n print(a * 2)\nelseif a < b then\n print(b * 2 - 1)\nelse\n print(a * 2 - 1)\nend\n", "language": "Lua", "metadata": {"date": 1595401676, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03071.html", "problem_id": "p03071", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03071/input.txt", "sample_output_relpath": "derived/input_output/data/p03071/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03071/Lua/s716759855.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s716759855", "user_id": "u120582723"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "a, b = io.read(\"*n\", \"*n\")\nif a == b then\n print(a * 2)\nelseif a < b then\n print(b * 2 - 1)\nelse\n print(a * 2 - 1)\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are two buttons, one of size A and one of size B.\n\nWhen you press a button of size X, you get X coins and the size of that button decreases by 1.\n\nYou will press a button twice. Here, you can press the same button twice, or press both buttons once.\n\nAt most how many coins can you get?\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq A, B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of coins you can get.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n9\n\nYou can get 5 + 4 = 9 coins by pressing the button of size 5 twice, and this is the maximum result.\n\nSample Input 2\n\n3 4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n12", "sample_input": "5 3\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03071", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are two buttons, one of size A and one of size B.\n\nWhen you press a button of size X, you get X coins and the size of that button decreases by 1.\n\nYou will press a button twice. Here, you can press the same button twice, or press both buttons once.\n\nAt most how many coins can you get?\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq A, B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of coins you can get.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n9\n\nYou can get 5 + 4 = 9 coins by pressing the button of size 5 twice, and this is the maximum result.\n\nSample Input 2\n\n3 4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n12", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 2740}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s061930383", "group_id": "codeNet:p03072", "input_text": "n = io.read(\"*n\")\nmax, cnt = 0, 0\nfor i = 1, n do\n a = io.read(\"*n\")\n if(max <= a) then cnt = cnt + 1 end\n max = math.max(max, a)\nend\nprint(cnt)", "language": "Lua", "metadata": {"date": 1555226483, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03072.html", "problem_id": "p03072", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03072/input.txt", "sample_output_relpath": "derived/input_output/data/p03072/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03072/Lua/s061930383.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s061930383", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "n = io.read(\"*n\")\nmax, cnt = 0, 0\nfor i = 1, n do\n a = io.read(\"*n\")\n if(max <= a) then cnt = cnt + 1 end\n max = math.max(max, a)\nend\nprint(cnt)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N mountains ranging from east to west, and an ocean to the west.\n\nAt the top of each mountain, there is an inn. You have decided to choose where to stay from these inns.\n\nThe height of the i-th mountain from the west is H_i.\n\nYou can certainly see the ocean from the inn at the top of the westmost mountain.\n\nFor the inn at the top of the i-th mountain from the west (i = 2, 3, ..., N), you can see the ocean if and only if H_1 \\leq H_i, H_2 \\leq H_i, ..., and H_{i-1} \\leq H_i.\n\nFrom how many of these N inns can you see the ocean?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq H_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the number of inns from which you can see the ocean.\n\nSample Input 1\n\n4\n6 5 6 8\n\nSample Output 1\n\n3\n\nYou can see the ocean from the first, third and fourth inns from the west.\n\nSample Input 2\n\n5\n4 5 3 5 4\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5\n9 5 6 8 4\n\nSample Output 3\n\n1", "sample_input": "4\n6 5 6 8\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03072", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N mountains ranging from east to west, and an ocean to the west.\n\nAt the top of each mountain, there is an inn. You have decided to choose where to stay from these inns.\n\nThe height of the i-th mountain from the west is H_i.\n\nYou can certainly see the ocean from the inn at the top of the westmost mountain.\n\nFor the inn at the top of the i-th mountain from the west (i = 2, 3, ..., N), you can see the ocean if and only if H_1 \\leq H_i, H_2 \\leq H_i, ..., and H_{i-1} \\leq H_i.\n\nFrom how many of these N inns can you see the ocean?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq H_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the number of inns from which you can see the ocean.\n\nSample Input 1\n\n4\n6 5 6 8\n\nSample Output 1\n\n3\n\nYou can see the ocean from the first, third and fourth inns from the west.\n\nSample Input 2\n\n5\n4 5 3 5 4\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5\n9 5 6 8 4\n\nSample Output 3\n\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 153, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s848411001", "group_id": "codeNet:p03073", "input_text": "s = io.read()\nt = {0, 0}\nfor i = 1, #s do\n f = 1 + (i + s:byte(i) - 48) % 2\n t[f] = t[f] + 1\nend\nprint(math.min(t[1], t[2]))\n", "language": "Lua", "metadata": {"date": 1597410810, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s848411001.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s848411001", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "s = io.read()\nt = {0, 0}\nfor i = 1, #s do\n f = 1 + (i + s:byte(i) - 48) % 2\n t[f] = t[f] + 1\nend\nprint(math.min(t[1], t[2]))\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 36, "memory_kb": 2776}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s786784498", "group_id": "codeNet:p03074", "input_text": "-- D\nlocal N, Kmax, _, tmp = io.read(\"n\", \"n\", \"l\", \"l\")\nlocal S = {}\nlocal ZZ = string.byte('0')\nfor i=1, N do\n S[i] = string.byte(tmp, i, i) - ZZ\nend\nlocal llast, rlast = 1, 1\nlocal k = 0\nlocal left = 1\nlocal ans = 0\nfor right=1, N do\n if rlast == 1 and S[right] == 0 then\n k = k + 1\n end\n rlast = S[right]\n while k > Kmax do\n left = left + 1\n if llast == 0 and S[left] == 1 then\n k = k - 1\n end\n llast = S[left]\n end\n assert(right >= left)\n local v = right - left + 1\n if ans < v then\n ans = v\n end\nend\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1555187061, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03074.html", "problem_id": "p03074", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03074/input.txt", "sample_output_relpath": "derived/input_output/data/p03074/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03074/Lua/s786784498.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s786784498", "user_id": "u162773977"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "-- D\nlocal N, Kmax, _, tmp = io.read(\"n\", \"n\", \"l\", \"l\")\nlocal S = {}\nlocal ZZ = string.byte('0')\nfor i=1, N do\n S[i] = string.byte(tmp, i, i) - ZZ\nend\nlocal llast, rlast = 1, 1\nlocal k = 0\nlocal left = 1\nlocal ans = 0\nfor right=1, N do\n if rlast == 1 and S[right] == 0 then\n k = k + 1\n end\n rlast = S[right]\n while k > Kmax do\n left = left + 1\n if llast == 0 and S[left] == 1 then\n k = k - 1\n end\n llast = S[left]\n end\n assert(right >= left)\n local v = right - left + 1\n if ans < v then\n ans = v\n end\nend\nprint(ans)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nN people are arranged in a row from left to right.\n\nYou are given a string S of length N consisting of 0 and 1, and a positive integer K.\n\nThe i-th person from the left is standing on feet if the i-th character of S is 0, and standing on hands if that character is 1.\n\nYou will give the following direction at most K times (possibly zero):\n\nDirection: Choose integers l and r satisfying 1 \\leq l \\leq r \\leq N, and flip the l-th, (l+1)-th, ..., and r-th persons. That is, for each i = l, l+1, ..., r, the i-th person from the left now stands on hands if he/she was standing on feet, and stands on feet if he/she was standing on hands.\n\nFind the maximum possible number of consecutive people standing on hands after at most K directions.\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^5.\n\nK is an integer satisfying 1 \\leq K \\leq 10^5.\n\nThe length of the string S is N.\n\nEach character of the string S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the maximum possible number of consecutive people standing on hands after at most K directions.\n\nSample Input 1\n\n5 1\n00010\n\nSample Output 1\n\n4\n\nWe can have four consecutive people standing on hands, which is the maximum result, by giving the following direction:\n\nGive the direction with l = 1, r = 3, which flips the first, second and third persons from the left.\n\nSample Input 2\n\n14 2\n11101010110011\n\nSample Output 2\n\n8\n\nSample Input 3\n\n1 1\n1\n\nSample Output 3\n\n1\n\nNo directions are necessary.", "sample_input": "5 1\n00010\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03074", "source_text": "Score : 400 points\n\nProblem Statement\n\nN people are arranged in a row from left to right.\n\nYou are given a string S of length N consisting of 0 and 1, and a positive integer K.\n\nThe i-th person from the left is standing on feet if the i-th character of S is 0, and standing on hands if that character is 1.\n\nYou will give the following direction at most K times (possibly zero):\n\nDirection: Choose integers l and r satisfying 1 \\leq l \\leq r \\leq N, and flip the l-th, (l+1)-th, ..., and r-th persons. That is, for each i = l, l+1, ..., r, the i-th person from the left now stands on hands if he/she was standing on feet, and stands on feet if he/she was standing on hands.\n\nFind the maximum possible number of consecutive people standing on hands after at most K directions.\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^5.\n\nK is an integer satisfying 1 \\leq K \\leq 10^5.\n\nThe length of the string S is N.\n\nEach character of the string S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the maximum possible number of consecutive people standing on hands after at most K directions.\n\nSample Input 1\n\n5 1\n00010\n\nSample Output 1\n\n4\n\nWe can have four consecutive people standing on hands, which is the maximum result, by giving the following direction:\n\nGive the direction with l = 1, r = 3, which flips the first, second and third persons from the left.\n\nSample Input 2\n\n14 2\n11101010110011\n\nSample Output 2\n\n8\n\nSample Input 3\n\n1 1\n1\n\nSample Output 3\n\n1\n\nNo directions are necessary.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 600, "cpu_time_ms": 40, "memory_kb": 2584}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s741880355", "group_id": "codeNet:p03074", "input_text": "-- D\nlocal N, Kmax, _, tmp = io.read(\"n\", \"n\", \"l\", \"l\")\nlocal S = {}\nlocal ZZ = string.byte('0')\nfor i=1, N do\n S[i] = string.byte(tmp, i, i) - ZZ\nend\nlocal llast, rlast = 1, 1\nlocal k = 0\nlocal left = 1\nlocal ans = 0\nfor right=1, N do\n if rlast == 1 and S[right] == 0 then\n k = k + 1\n end\n rlast = S[right]\n while k > Kmax do\n left = left + 1\n if llast == 0 and S[left] == 1 then\n k = k - 1\n end\n llast = S[left]\n end\n local v = right - left + 1\n if ans < v then\n ans = v\n end\nend\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1555185985, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03074.html", "problem_id": "p03074", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03074/input.txt", "sample_output_relpath": "derived/input_output/data/p03074/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03074/Lua/s741880355.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s741880355", "user_id": "u162773977"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "-- D\nlocal N, Kmax, _, tmp = io.read(\"n\", \"n\", \"l\", \"l\")\nlocal S = {}\nlocal ZZ = string.byte('0')\nfor i=1, N do\n S[i] = string.byte(tmp, i, i) - ZZ\nend\nlocal llast, rlast = 1, 1\nlocal k = 0\nlocal left = 1\nlocal ans = 0\nfor right=1, N do\n if rlast == 1 and S[right] == 0 then\n k = k + 1\n end\n rlast = S[right]\n while k > Kmax do\n left = left + 1\n if llast == 0 and S[left] == 1 then\n k = k - 1\n end\n llast = S[left]\n end\n local v = right - left + 1\n if ans < v then\n ans = v\n end\nend\nprint(ans)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nN people are arranged in a row from left to right.\n\nYou are given a string S of length N consisting of 0 and 1, and a positive integer K.\n\nThe i-th person from the left is standing on feet if the i-th character of S is 0, and standing on hands if that character is 1.\n\nYou will give the following direction at most K times (possibly zero):\n\nDirection: Choose integers l and r satisfying 1 \\leq l \\leq r \\leq N, and flip the l-th, (l+1)-th, ..., and r-th persons. That is, for each i = l, l+1, ..., r, the i-th person from the left now stands on hands if he/she was standing on feet, and stands on feet if he/she was standing on hands.\n\nFind the maximum possible number of consecutive people standing on hands after at most K directions.\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^5.\n\nK is an integer satisfying 1 \\leq K \\leq 10^5.\n\nThe length of the string S is N.\n\nEach character of the string S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the maximum possible number of consecutive people standing on hands after at most K directions.\n\nSample Input 1\n\n5 1\n00010\n\nSample Output 1\n\n4\n\nWe can have four consecutive people standing on hands, which is the maximum result, by giving the following direction:\n\nGive the direction with l = 1, r = 3, which flips the first, second and third persons from the left.\n\nSample Input 2\n\n14 2\n11101010110011\n\nSample Output 2\n\n8\n\nSample Input 3\n\n1 1\n1\n\nSample Output 3\n\n1\n\nNo directions are necessary.", "sample_input": "5 1\n00010\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03074", "source_text": "Score : 400 points\n\nProblem Statement\n\nN people are arranged in a row from left to right.\n\nYou are given a string S of length N consisting of 0 and 1, and a positive integer K.\n\nThe i-th person from the left is standing on feet if the i-th character of S is 0, and standing on hands if that character is 1.\n\nYou will give the following direction at most K times (possibly zero):\n\nDirection: Choose integers l and r satisfying 1 \\leq l \\leq r \\leq N, and flip the l-th, (l+1)-th, ..., and r-th persons. That is, for each i = l, l+1, ..., r, the i-th person from the left now stands on hands if he/she was standing on feet, and stands on feet if he/she was standing on hands.\n\nFind the maximum possible number of consecutive people standing on hands after at most K directions.\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^5.\n\nK is an integer satisfying 1 \\leq K \\leq 10^5.\n\nThe length of the string S is N.\n\nEach character of the string S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the maximum possible number of consecutive people standing on hands after at most K directions.\n\nSample Input 1\n\n5 1\n00010\n\nSample Output 1\n\n4\n\nWe can have four consecutive people standing on hands, which is the maximum result, by giving the following direction:\n\nGive the direction with l = 1, r = 3, which flips the first, second and third persons from the left.\n\nSample Input 2\n\n14 2\n11101010110011\n\nSample Output 2\n\n8\n\nSample Input 3\n\n1 1\n1\n\nSample Output 3\n\n1\n\nNo directions are necessary.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 574, "cpu_time_ms": 34, "memory_kb": 2584}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s839852521", "group_id": "codeNet:p03075", "input_text": "a=io.read(\"*n\")\nb=io.read(\"*n\")\nc=io.read(\"*n\")\nd=io.read(\"*n\")\ne=io.read(\"*n\")\nk=io.read(\"*n\")\nif e-a<=k then\n print(\"Yay!\")\nelse \n print(\":(\")\nend\n", "language": "Lua", "metadata": {"date": 1576566421, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03075.html", "problem_id": "p03075", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03075/input.txt", "sample_output_relpath": "derived/input_output/data/p03075/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03075/Lua/s839852521.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s839852521", "user_id": "u373958718"}, "prompt_components": {"gold_output": "Yay!\n", "input_to_evaluate": "a=io.read(\"*n\")\nb=io.read(\"*n\")\nc=io.read(\"*n\")\nd=io.read(\"*n\")\ne=io.read(\"*n\")\nk=io.read(\"*n\")\nif e-a<=k then\n print(\"Yay!\")\nelse \n print(\":(\")\nend\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder city, there are five antennas standing in a straight line. They are called Antenna A, B, C, D and E from west to east, and their coordinates are a, b, c, d and e, respectively.\n\nTwo antennas can communicate directly if the distance between them is k or less, and they cannot if the distance is greater than k.\n\nDetermine if there exists a pair of antennas that cannot communicate directly.\n\nHere, assume that the distance between two antennas at coordinates p and q (p < q) is q - p.\n\nConstraints\n\na, b, c, d, e and k are integers between 0 and 123 (inclusive).\n\na < b < c < d < e\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\nb\nc\nd\ne\nk\n\nOutput\n\nPrint :( if there exists a pair of antennas that cannot communicate directly, and print Yay! if there is no such pair.\n\nSample Input 1\n\n1\n2\n4\n8\n9\n15\n\nSample Output 1\n\nYay!\n\nIn this case, there is no pair of antennas that cannot communicate directly, because:\n\nthe distance between A and B is 2 - 1 = 1\n\nthe distance between A and C is 4 - 1 = 3\n\nthe distance between A and D is 8 - 1 = 7\n\nthe distance between A and E is 9 - 1 = 8\n\nthe distance between B and C is 4 - 2 = 2\n\nthe distance between B and D is 8 - 2 = 6\n\nthe distance between B and E is 9 - 2 = 7\n\nthe distance between C and D is 8 - 4 = 4\n\nthe distance between C and E is 9 - 4 = 5\n\nthe distance between D and E is 9 - 8 = 1\n\nand none of them is greater than 15. Thus, the correct output is Yay!.\n\nSample Input 2\n\n15\n18\n26\n35\n36\n18\n\nSample Output 2\n\n:(\n\nIn this case, the distance between antennas A and D is 35 - 15 = 20 and exceeds 18, so they cannot communicate directly.\nThus, the correct output is :(.", "sample_input": "1\n2\n4\n8\n9\n15\n"}, "reference_outputs": ["Yay!\n"], "source_document_id": "p03075", "source_text": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder city, there are five antennas standing in a straight line. They are called Antenna A, B, C, D and E from west to east, and their coordinates are a, b, c, d and e, respectively.\n\nTwo antennas can communicate directly if the distance between them is k or less, and they cannot if the distance is greater than k.\n\nDetermine if there exists a pair of antennas that cannot communicate directly.\n\nHere, assume that the distance between two antennas at coordinates p and q (p < q) is q - p.\n\nConstraints\n\na, b, c, d, e and k are integers between 0 and 123 (inclusive).\n\na < b < c < d < e\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\nb\nc\nd\ne\nk\n\nOutput\n\nPrint :( if there exists a pair of antennas that cannot communicate directly, and print Yay! if there is no such pair.\n\nSample Input 1\n\n1\n2\n4\n8\n9\n15\n\nSample Output 1\n\nYay!\n\nIn this case, there is no pair of antennas that cannot communicate directly, because:\n\nthe distance between A and B is 2 - 1 = 1\n\nthe distance between A and C is 4 - 1 = 3\n\nthe distance between A and D is 8 - 1 = 7\n\nthe distance between A and E is 9 - 1 = 8\n\nthe distance between B and C is 4 - 2 = 2\n\nthe distance between B and D is 8 - 2 = 6\n\nthe distance between B and E is 9 - 2 = 7\n\nthe distance between C and D is 8 - 4 = 4\n\nthe distance between C and E is 9 - 4 = 5\n\nthe distance between D and E is 9 - 8 = 1\n\nand none of them is greater than 15. Thus, the correct output is Yay!.\n\nSample Input 2\n\n15\n18\n26\n35\n36\n18\n\nSample Output 2\n\n:(\n\nIn this case, the distance between antennas A and D is 35 - 15 = 20 and exceeds 18, so they cannot communicate directly.\nThus, the correct output is :(.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 151, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s937754144", "group_id": "codeNet:p03075", "input_text": "a={}\nfor i = 1,5 do\n\ta[i]=io.read()*1\nend\nprint(a[5]-a[1]>io.read()*1 and \":(\"or\"Yay!\")", "language": "Lua", "metadata": {"date": 1557491883, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03075.html", "problem_id": "p03075", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03075/input.txt", "sample_output_relpath": "derived/input_output/data/p03075/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03075/Lua/s937754144.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s937754144", "user_id": "u837412668"}, "prompt_components": {"gold_output": "Yay!\n", "input_to_evaluate": "a={}\nfor i = 1,5 do\n\ta[i]=io.read()*1\nend\nprint(a[5]-a[1]>io.read()*1 and \":(\"or\"Yay!\")", "problem_context": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder city, there are five antennas standing in a straight line. They are called Antenna A, B, C, D and E from west to east, and their coordinates are a, b, c, d and e, respectively.\n\nTwo antennas can communicate directly if the distance between them is k or less, and they cannot if the distance is greater than k.\n\nDetermine if there exists a pair of antennas that cannot communicate directly.\n\nHere, assume that the distance between two antennas at coordinates p and q (p < q) is q - p.\n\nConstraints\n\na, b, c, d, e and k are integers between 0 and 123 (inclusive).\n\na < b < c < d < e\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\nb\nc\nd\ne\nk\n\nOutput\n\nPrint :( if there exists a pair of antennas that cannot communicate directly, and print Yay! if there is no such pair.\n\nSample Input 1\n\n1\n2\n4\n8\n9\n15\n\nSample Output 1\n\nYay!\n\nIn this case, there is no pair of antennas that cannot communicate directly, because:\n\nthe distance between A and B is 2 - 1 = 1\n\nthe distance between A and C is 4 - 1 = 3\n\nthe distance between A and D is 8 - 1 = 7\n\nthe distance between A and E is 9 - 1 = 8\n\nthe distance between B and C is 4 - 2 = 2\n\nthe distance between B and D is 8 - 2 = 6\n\nthe distance between B and E is 9 - 2 = 7\n\nthe distance between C and D is 8 - 4 = 4\n\nthe distance between C and E is 9 - 4 = 5\n\nthe distance between D and E is 9 - 8 = 1\n\nand none of them is greater than 15. Thus, the correct output is Yay!.\n\nSample Input 2\n\n15\n18\n26\n35\n36\n18\n\nSample Output 2\n\n:(\n\nIn this case, the distance between antennas A and D is 35 - 15 = 20 and exceeds 18, so they cannot communicate directly.\nThus, the correct output is :(.", "sample_input": "1\n2\n4\n8\n9\n15\n"}, "reference_outputs": ["Yay!\n"], "source_document_id": "p03075", "source_text": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder city, there are five antennas standing in a straight line. They are called Antenna A, B, C, D and E from west to east, and their coordinates are a, b, c, d and e, respectively.\n\nTwo antennas can communicate directly if the distance between them is k or less, and they cannot if the distance is greater than k.\n\nDetermine if there exists a pair of antennas that cannot communicate directly.\n\nHere, assume that the distance between two antennas at coordinates p and q (p < q) is q - p.\n\nConstraints\n\na, b, c, d, e and k are integers between 0 and 123 (inclusive).\n\na < b < c < d < e\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\nb\nc\nd\ne\nk\n\nOutput\n\nPrint :( if there exists a pair of antennas that cannot communicate directly, and print Yay! if there is no such pair.\n\nSample Input 1\n\n1\n2\n4\n8\n9\n15\n\nSample Output 1\n\nYay!\n\nIn this case, there is no pair of antennas that cannot communicate directly, because:\n\nthe distance between A and B is 2 - 1 = 1\n\nthe distance between A and C is 4 - 1 = 3\n\nthe distance between A and D is 8 - 1 = 7\n\nthe distance between A and E is 9 - 1 = 8\n\nthe distance between B and C is 4 - 2 = 2\n\nthe distance between B and D is 8 - 2 = 6\n\nthe distance between B and E is 9 - 2 = 7\n\nthe distance between C and D is 8 - 4 = 4\n\nthe distance between C and E is 9 - 4 = 5\n\nthe distance between D and E is 9 - 8 = 1\n\nand none of them is greater than 15. Thus, the correct output is Yay!.\n\nSample Input 2\n\n15\n18\n26\n35\n36\n18\n\nSample Output 2\n\n:(\n\nIn this case, the distance between antennas A and D is 35 - 15 = 20 and exceeds 18, so they cannot communicate directly.\nThus, the correct output is :(.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 87, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s220100841", "group_id": "codeNet:p03076", "input_text": "t = {}\nfor i = 1, 5 do table.insert(t, io.read(\"*n\")) end\ntable.sort(t, function(a, b)\n ad = a % 10\n bd = b % 10\n if(ad == 0) then ad = 10 end\n if(bd == 0) then bd = 10 end\n return ad > bd\n end\n);\nsum = 0\nfor i = 1, 4 do\n if(t[i] % 10 == 0) then sum = sum + t[i] else\n sum = sum + 10 * (1 + math.floor(t[i] / 10))\n end\nend\nsum = sum + t[5]\nprint(sum)", "language": "Lua", "metadata": {"date": 1554577789, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03076.html", "problem_id": "p03076", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03076/input.txt", "sample_output_relpath": "derived/input_output/data/p03076/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03076/Lua/s220100841.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s220100841", "user_id": "u120582723"}, "prompt_components": {"gold_output": "215\n", "input_to_evaluate": "t = {}\nfor i = 1, 5 do table.insert(t, io.read(\"*n\")) end\ntable.sort(t, function(a, b)\n ad = a % 10\n bd = b % 10\n if(ad == 0) then ad = 10 end\n if(bd == 0) then bd = 10 end\n return ad > bd\n end\n);\nsum = 0\nfor i = 1, 4 do\n if(t[i] % 10 == 0) then sum = sum + t[i] else\n sum = sum + 10 * (1 + math.floor(t[i] / 10))\n end\nend\nsum = sum + t[5]\nprint(sum)", "problem_context": "Score: 200 points\n\nProblem Statement\n\nThe restaurant AtCoder serves the following five dishes:\n\nABC Don (rice bowl): takes A minutes to serve.\n\nARC Curry: takes B minutes to serve.\n\nAGC Pasta: takes C minutes to serve.\n\nAPC Ramen: takes D minutes to serve.\n\nATC Hanbagu (hamburger patty): takes E minutes to serve.\n\nHere, the time to serve a dish is the time between when an order is placed and when the dish is delivered.\n\nThis restaurant has the following rules on orders:\n\nAn order can only be placed at a time that is a multiple of 10 (time 0, 10, 20, ...).\n\nOnly one dish can be ordered at a time.\n\nNo new order can be placed when an order is already placed and the dish is still not delivered, but a new order can be placed at the exact time when the dish is delivered.\n\nE869120 arrives at this restaurant at time 0. He will order all five dishes. Find the earliest possible time for the last dish to be delivered.\n\nHere, he can order the dishes in any order he likes, and he can place an order already at time 0.\n\nConstraints\n\nA, B, C, D and E are integers between 1 and 123 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\nE\n\nOutput\n\nPrint the earliest possible time for the last dish to be delivered, as an integer.\n\nSample Input 1\n\n29\n20\n7\n35\n120\n\nSample Output 1\n\n215\n\nIf we decide to order the dishes in the order ABC Don, ARC Curry, AGC Pasta, ATC Hanbagu, APC Ramen, the earliest possible time for each order is as follows:\n\nOrder ABC Don at time 0, which will be delivered at time 29.\n\nOrder ARC Curry at time 30, which will be delivered at time 50.\n\nOrder AGC Pasta at time 50, which will be delivered at time 57.\n\nOrder ATC Hanbagu at time 60, which will be delivered at time 180.\n\nOrder APC Ramen at time 180, which will be delivered at time 215.\n\nThere is no way to order the dishes in which the last dish will be delivered earlier than this.\n\nSample Input 2\n\n101\n86\n119\n108\n57\n\nSample Output 2\n\n481\n\nIf we decide to order the dishes in the order AGC Pasta, ARC Curry, ATC Hanbagu, APC Ramen, ABC Don, the earliest possible time for each order is as follows:\n\nOrder AGC Pasta at time 0, which will be delivered at time 119.\n\nOrder ARC Curry at time 120, which will be delivered at time 206.\n\nOrder ATC Hanbagu at time 210, which will be delivered at time 267.\n\nOrder APC Ramen at time 270, which will be delivered at time 378.\n\nOrder ABC Don at time 380, which will be delivered at time 481.\n\nThere is no way to order the dishes in which the last dish will be delivered earlier than this.\n\nSample Input 3\n\n123\n123\n123\n123\n123\n\nSample Output 3\n\n643\n\nThis is the largest valid case.", "sample_input": "29\n20\n7\n35\n120\n"}, "reference_outputs": ["215\n"], "source_document_id": "p03076", "source_text": "Score: 200 points\n\nProblem Statement\n\nThe restaurant AtCoder serves the following five dishes:\n\nABC Don (rice bowl): takes A minutes to serve.\n\nARC Curry: takes B minutes to serve.\n\nAGC Pasta: takes C minutes to serve.\n\nAPC Ramen: takes D minutes to serve.\n\nATC Hanbagu (hamburger patty): takes E minutes to serve.\n\nHere, the time to serve a dish is the time between when an order is placed and when the dish is delivered.\n\nThis restaurant has the following rules on orders:\n\nAn order can only be placed at a time that is a multiple of 10 (time 0, 10, 20, ...).\n\nOnly one dish can be ordered at a time.\n\nNo new order can be placed when an order is already placed and the dish is still not delivered, but a new order can be placed at the exact time when the dish is delivered.\n\nE869120 arrives at this restaurant at time 0. He will order all five dishes. Find the earliest possible time for the last dish to be delivered.\n\nHere, he can order the dishes in any order he likes, and he can place an order already at time 0.\n\nConstraints\n\nA, B, C, D and E are integers between 1 and 123 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\nE\n\nOutput\n\nPrint the earliest possible time for the last dish to be delivered, as an integer.\n\nSample Input 1\n\n29\n20\n7\n35\n120\n\nSample Output 1\n\n215\n\nIf we decide to order the dishes in the order ABC Don, ARC Curry, AGC Pasta, ATC Hanbagu, APC Ramen, the earliest possible time for each order is as follows:\n\nOrder ABC Don at time 0, which will be delivered at time 29.\n\nOrder ARC Curry at time 30, which will be delivered at time 50.\n\nOrder AGC Pasta at time 50, which will be delivered at time 57.\n\nOrder ATC Hanbagu at time 60, which will be delivered at time 180.\n\nOrder APC Ramen at time 180, which will be delivered at time 215.\n\nThere is no way to order the dishes in which the last dish will be delivered earlier than this.\n\nSample Input 2\n\n101\n86\n119\n108\n57\n\nSample Output 2\n\n481\n\nIf we decide to order the dishes in the order AGC Pasta, ARC Curry, ATC Hanbagu, APC Ramen, ABC Don, the earliest possible time for each order is as follows:\n\nOrder AGC Pasta at time 0, which will be delivered at time 119.\n\nOrder ARC Curry at time 120, which will be delivered at time 206.\n\nOrder ATC Hanbagu at time 210, which will be delivered at time 267.\n\nOrder APC Ramen at time 270, which will be delivered at time 378.\n\nOrder ABC Don at time 380, which will be delivered at time 481.\n\nThere is no way to order the dishes in which the last dish will be delivered earlier than this.\n\nSample Input 3\n\n123\n123\n123\n123\n123\n\nSample Output 3\n\n643\n\nThis is the largest valid case.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 401, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s984275855", "group_id": "codeNet:p03077", "input_text": "n, a, b = io.read(\"*n\", \"*n\", \"*n\")\nc, d, e = io.read(\"*n\", \"*n\", \"*n\")\nr = math.min(a, b, c, d, e)\nrep = math.ceil(n / r)\nprint(rep + 4)", "language": "Lua", "metadata": {"date": 1600522597, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03077.html", "problem_id": "p03077", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03077/input.txt", "sample_output_relpath": "derived/input_output/data/p03077/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03077/Lua/s984275855.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s984275855", "user_id": "u120582723"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "n, a, b = io.read(\"*n\", \"*n\", \"*n\")\nc, d, e = io.read(\"*n\", \"*n\", \"*n\")\nr = math.min(a, b, c, d, e)\nrep = math.ceil(n / r)\nprint(rep + 4)", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn 2028 and after a continuous growth, AtCoder Inc. finally built an empire with six cities (City 1, 2, 3, 4, 5, 6)!\n\nThere are five means of transport in this empire:\n\nTrain: travels from City 1 to 2 in one minute. A train can occupy at most A people.\n\nBus: travels from City 2 to 3 in one minute. A bus can occupy at most B people.\n\nTaxi: travels from City 3 to 4 in one minute. A taxi can occupy at most C people.\n\nAirplane: travels from City 4 to 5 in one minute. An airplane can occupy at most D people.\n\nShip: travels from City 5 to 6 in one minute. A ship can occupy at most E people.\n\nFor each of them, one vehicle leaves the city at each integer time (time 0, 1, 2, ...).\n\nThere is a group of N people at City 1, and they all want to go to City 6.\n\nAt least how long does it take for all of them to reach there?\nYou can ignore the time needed to transfer.\n\nConstraints\n\n1 \\leq N, A, B, C, D, E \\leq 10^{15}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\nB\nC\nD\nE\n\nOutput\n\nPrint the minimum time required for all of the people to reach City 6, in minutes.\n\nSample Input 1\n\n5\n3\n2\n4\n3\n5\n\nSample Output 1\n\n7\n\nOne possible way to travel is as follows.\nFirst, there are N = 5 people at City 1, as shown in the following image:\n\nIn the first minute, three people travels from City 1 to City 2 by train. Note that a train can only occupy at most three people.\n\nIn the second minute, the remaining two people travels from City 1 to City 2 by train, and two of the three people who were already at City 2 travels to City 3 by bus. Note that a bus can only occupy at most two people.\n\nIn the third minute, two people travels from City 2 to City 3 by train, and another two people travels from City 3 to City 4 by taxi.\n\nFrom then on, if they continue traveling without stopping until they reach City 6, all of them can reach there in seven minutes.\n\nThere is no way for them to reach City 6 in 6 minutes or less.\n\nSample Input 2\n\n10\n123\n123\n123\n123\n123\n\nSample Output 2\n\n5\n\nAll kinds of vehicles can occupy N = 10 people at a time.\nThus, if they continue traveling without stopping until they reach City 6, all of them can reach there in five minutes.\n\nSample Input 3\n\n10000000007\n2\n3\n5\n7\n11\n\nSample Output 3\n\n5000000008\n\nNote that the input or output may not fit into a 32-bit integer type.", "sample_input": "5\n3\n2\n4\n3\n5\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03077", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn 2028 and after a continuous growth, AtCoder Inc. finally built an empire with six cities (City 1, 2, 3, 4, 5, 6)!\n\nThere are five means of transport in this empire:\n\nTrain: travels from City 1 to 2 in one minute. A train can occupy at most A people.\n\nBus: travels from City 2 to 3 in one minute. A bus can occupy at most B people.\n\nTaxi: travels from City 3 to 4 in one minute. A taxi can occupy at most C people.\n\nAirplane: travels from City 4 to 5 in one minute. An airplane can occupy at most D people.\n\nShip: travels from City 5 to 6 in one minute. A ship can occupy at most E people.\n\nFor each of them, one vehicle leaves the city at each integer time (time 0, 1, 2, ...).\n\nThere is a group of N people at City 1, and they all want to go to City 6.\n\nAt least how long does it take for all of them to reach there?\nYou can ignore the time needed to transfer.\n\nConstraints\n\n1 \\leq N, A, B, C, D, E \\leq 10^{15}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\nB\nC\nD\nE\n\nOutput\n\nPrint the minimum time required for all of the people to reach City 6, in minutes.\n\nSample Input 1\n\n5\n3\n2\n4\n3\n5\n\nSample Output 1\n\n7\n\nOne possible way to travel is as follows.\nFirst, there are N = 5 people at City 1, as shown in the following image:\n\nIn the first minute, three people travels from City 1 to City 2 by train. Note that a train can only occupy at most three people.\n\nIn the second minute, the remaining two people travels from City 1 to City 2 by train, and two of the three people who were already at City 2 travels to City 3 by bus. Note that a bus can only occupy at most two people.\n\nIn the third minute, two people travels from City 2 to City 3 by train, and another two people travels from City 3 to City 4 by taxi.\n\nFrom then on, if they continue traveling without stopping until they reach City 6, all of them can reach there in seven minutes.\n\nThere is no way for them to reach City 6 in 6 minutes or less.\n\nSample Input 2\n\n10\n123\n123\n123\n123\n123\n\nSample Output 2\n\n5\n\nAll kinds of vehicles can occupy N = 10 people at a time.\nThus, if they continue traveling without stopping until they reach City 6, all of them can reach there in five minutes.\n\nSample Input 3\n\n10000000007\n2\n3\n5\n7\n11\n\nSample Output 3\n\n5000000008\n\nNote that the input or output may not fit into a 32-bit integer type.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 137, "cpu_time_ms": 7, "memory_kb": 2716}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s678401804", "group_id": "codeNet:p03078", "input_text": "local Set = {}\n\nSet.insert=function(self,value)\n local set=self.set\n local reverse=self.reverse\n if not reverse[value] then\n table.insert(set,value)\n reverse[value]=#set\n end\nend\n\nSet.remove=function(set,value)\n local set=self.set\n local reverse=self.reverse\n local index=reverse[value]\n if index then\n reverse[value]=nil\n local top=table.remove(set)\n if top~=value then\n reverse[top]=index\n set[index]=top\n end\n end\nend\n\nSet.contains=function(self,value)\n local reverse=self.reverse\n return reverse[value]~=nil\nend\n\nSet.new=function(self)\n local obj={set={},reverse={}}\n setmetatable(obj,{__index=Set})\n return obj\nend\n\n----------\n\nlocal PairingHeap={}\n\nPairingHeap.merge=function(self,a,b)\n\tif not a then\n\t\treturn b\n\telseif not b then\n\t\treturn a\n\telseif a[1]b\n end)\nend\n\nlocal pq=PairingHeap:new()\nlocal set=Set:new()\n\nlocal frstky=abc[1][1]+abc[2][1]+abc[3][1]\nlocal frstvl={1,1,1,frstky}\npq:push(-frstky,frstvl)\nset:insert(frstvl)\n\nfor i=1,k do\n local pop=pq:pop()\n print(pop[4])\n for j=1,3 do\n if pop[j]b\n end)\nend\n\nlocal pq=PairingHeap:new()\nlocal set=Set:new()\n\nlocal frstky=abc[1][1]+abc[2][1]+abc[3][1]\nlocal frstvl={1,1,1,frstky}\npq:push(-frstky,frstvl)\nset:insert(frstvl)\n\nfor i=1,k do\n local pop=pq:pop()\n print(pop[4])\n for j=1,3 do\n if pop[j]b\n end)\nend\n\nlocal pq=PairingHeap:new()\nlocal map={}\n\nlocal frstky=abc[1][1]+abc[2][1]+abc[3][1]\npq:push(-frstky,{1,1,1,frstky})\n\nfor i=1,k do\n local pop=pq:pop()\n print(pop[4])\n for j=1,3 do\n if pop[j]b\n end)\nend\n\nlocal pq=PairingHeap:new()\nlocal map={}\n\nlocal frstky=abc[1][1]+abc[2][1]+abc[3][1]\npq:push(-frstky,{1,1,1,frstky})\n\nfor i=1,k do\n local pop=pq:pop()\n print(pop[4])\n for j=1,3 do\n if pop[j] y\n end)\nend\n\nlocal function goodness(a, b, c)\n if a > #A or b > #B or c > #C then\n return -10000000000000\n end\n return A[a] + B[b] + C[c]\nend\n\nlocal visited = {}\nlocal function visit(a,b,c)\n visited[tostring(a) .. \"*\" .. tostring(b) .. \"*\" .. tostring(c)] = true\nend\nlocal function isvisited(a,b,c)\n return visited[tostring(a) .. \"*\" .. tostring(b) .. \"*\" .. tostring(c)]\nend\n\n-- most good comb right\nlocal items = {}\nlocal function item_sort(tbl)\n table.sort(items, function(x,y)\n return x[4] < y[4]\n end)\nend\nlocal function items_count()\n return #items\nend\nlocal function items_add(a, b, c)\n if items_count() > 3000 then\n if items[#items][4] >= goodness(a,b,c) then\n return false\n end\n end\n table.insert(items, {a,b,c,goodness(a,b,c)})\n item_sort(items)\n return true\nend\nlocal function check_add(a,b,c)\n if a > #A or b > #B or c > #C then\n return -1\n end\n if isvisited(a, b, c) then\n return -2\n end\n visit(a,b,c)\n items_add(a, b, c)\nend\nlocal ans = {}\nlocal a, b, c = 1, 1, 1\ncheck_add(a, b, c)\nwhile #ans < K do\n local e = table.remove(items)\n table.insert(ans, e[4])\n local a,b,c = e[1], e[2], e[3]\n check_add(a+1,b,c)\n check_add(a,b+1,c)\n check_add(a,b,c+1)\nend\n\n--table.sort(ans, function(x,y) return x>y end)\nfor i=1,K do\n print(ans[i])\nend\n\n", "language": "Lua", "metadata": {"date": 1554636336, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03078.html", "problem_id": "p03078", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03078/input.txt", "sample_output_relpath": "derived/input_output/data/p03078/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03078/Lua/s549526861.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s549526861", "user_id": "u162773977"}, "prompt_components": {"gold_output": "19\n17\n15\n14\n13\n12\n10\n8\n", "input_to_evaluate": "local DBG = true\nlocal function dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nlocal function dbgpr_t(tbl, use_pairs)\n if DBG then\n local enum = ipairs\n if use_pairs then\n enum = pairs\n end\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in enum(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\nlocal function dbgpr_tp(tbl)\n dbgpr_t(tbl, true)\nend\n\n-- D\nlocal X, Y, Z, K = io.read(\"n\", \"n\", \"n\", \"n\")\nlocal A, B, C = {}, {}, {}\n\nfor i, tbl in ipairs {A, B, C} do\n local nums = {X, Y, Z}\n local count = nums[i]\n for j=1, count do\n tbl[j] = io.read(\"n\")\n end\n table.sort(tbl, function (x,y)\n return x > y\n end)\nend\n\nlocal function goodness(a, b, c)\n if a > #A or b > #B or c > #C then\n return -10000000000000\n end\n return A[a] + B[b] + C[c]\nend\n\nlocal visited = {}\nlocal function visit(a,b,c)\n visited[tostring(a) .. \"*\" .. tostring(b) .. \"*\" .. tostring(c)] = true\nend\nlocal function isvisited(a,b,c)\n return visited[tostring(a) .. \"*\" .. tostring(b) .. \"*\" .. tostring(c)]\nend\n\n-- most good comb right\nlocal items = {}\nlocal function item_sort(tbl)\n table.sort(items, function(x,y)\n return x[4] < y[4]\n end)\nend\nlocal function items_count()\n return #items\nend\nlocal function items_add(a, b, c)\n if items_count() > 3000 then\n if items[#items][4] >= goodness(a,b,c) then\n return false\n end\n end\n table.insert(items, {a,b,c,goodness(a,b,c)})\n item_sort(items)\n return true\nend\nlocal function check_add(a,b,c)\n if a > #A or b > #B or c > #C then\n return -1\n end\n if isvisited(a, b, c) then\n return -2\n end\n visit(a,b,c)\n items_add(a, b, c)\nend\nlocal ans = {}\nlocal a, b, c = 1, 1, 1\ncheck_add(a, b, c)\nwhile #ans < K do\n local e = table.remove(items)\n table.insert(ans, e[4])\n local a,b,c = e[1], e[2], e[3]\n check_add(a+1,b,c)\n check_add(a,b+1,c)\n check_add(a,b,c+1)\nend\n\n--table.sort(ans, function(x,y) return x>y end)\nfor i=1,K do\n print(ans[i])\nend\n\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Patisserie AtCoder sells cakes with number-shaped candles.\nThere are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively.\nEach cake has an integer value called deliciousness, as follows:\n\nThe deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X.\n\nThe deliciousness of the cakes with 2-shaped candles are B_1, B_2, ..., B_Y.\n\nThe deliciousness of the cakes with 3-shaped candles are C_1, C_2, ..., C_Z.\n\nTakahashi decides to buy three cakes, one for each of the three shapes of the candles, to celebrate ABC 123.\n\nThere are X \\times Y \\times Z such ways to choose three cakes.\n\nWe will arrange these X \\times Y \\times Z ways in descending order of the sum of the deliciousness of the cakes.\n\nPrint the sums of the deliciousness of the cakes for the first, second, ..., K-th ways in this list.\n\nConstraints\n\n1 \\leq X \\leq 1 \\ 000\n\n1 \\leq Y \\leq 1 \\ 000\n\n1 \\leq Z \\leq 1 \\ 000\n\n1 \\leq K \\leq \\min(3 \\ 000, X \\times Y \\times Z)\n\n1 \\leq A_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq B_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq C_i \\leq 10 \\ 000 \\ 000 \\ 000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z K\nA_1 \\ A_2 \\ A_3 \\ ... \\ A_X\nB_1 \\ B_2 \\ B_3 \\ ... \\ B_Y\nC_1 \\ C_2 \\ C_3 \\ ... \\ C_Z\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th value stated in the problem statement.\n\nSample Input 1\n\n2 2 2 8\n4 6\n1 5\n3 8\n\nSample Output 1\n\n19\n17\n15\n14\n13\n12\n10\n8\n\nThere are 2 \\times 2 \\times 2 = 8 ways to choose three cakes, as shown below in descending order of the sum of the deliciousness of the cakes:\n\n(A_2, B_2, C_2): 6 + 5 + 8 = 19\n\n(A_1, B_2, C_2): 4 + 5 + 8 = 17\n\n(A_2, B_1, C_2): 6 + 1 + 8 = 15\n\n(A_2, B_2, C_1): 6 + 5 + 3 = 14\n\n(A_1, B_1, C_2): 4 + 1 + 8 = 13\n\n(A_1, B_2, C_1): 4 + 5 + 3 = 12\n\n(A_2, B_1, C_1): 6 + 1 + 3 = 10\n\n(A_1, B_1, C_1): 4 + 1 + 3 = 8\n\nSample Input 2\n\n3 3 3 5\n1 10 100\n2 20 200\n1 10 100\n\nSample Output 2\n\n400\n310\n310\n301\n301\n\nThere may be multiple combinations of cakes with the same sum of the deliciousness. For example, in this test case, the sum of A_1, B_3, C_3 and the sum of A_3, B_3, C_1 are both 301.\nHowever, they are different ways of choosing cakes, so 301 occurs twice in the output.\n\nSample Input 3\n\n10 10 10 20\n7467038376 5724769290 292794712 2843504496 3381970101 8402252870 249131806 6310293640 6690322794 6082257488\n1873977926 2576529623 1144842195 1379118507 6003234687 4925540914 3902539811 3326692703 484657758 2877436338\n4975681328 8974383988 2882263257 7690203955 514305523 6679823484 4263279310 585966808 3752282379 620585736\n\nSample Output 3\n\n23379871545\n22444657051\n22302177772\n22095691512\n21667941469\n21366963278\n21287912315\n21279176669\n21160477018\n21085311041\n21059876163\n21017997739\n20703329561\n20702387965\n20590247696\n20383761436\n20343962175\n20254073196\n20210218542\n20150096547\n\nNote that the input or output may not fit into a 32-bit integer type.", "sample_input": "2 2 2 8\n4 6\n1 5\n3 8\n"}, "reference_outputs": ["19\n17\n15\n14\n13\n12\n10\n8\n"], "source_document_id": "p03078", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Patisserie AtCoder sells cakes with number-shaped candles.\nThere are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively.\nEach cake has an integer value called deliciousness, as follows:\n\nThe deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X.\n\nThe deliciousness of the cakes with 2-shaped candles are B_1, B_2, ..., B_Y.\n\nThe deliciousness of the cakes with 3-shaped candles are C_1, C_2, ..., C_Z.\n\nTakahashi decides to buy three cakes, one for each of the three shapes of the candles, to celebrate ABC 123.\n\nThere are X \\times Y \\times Z such ways to choose three cakes.\n\nWe will arrange these X \\times Y \\times Z ways in descending order of the sum of the deliciousness of the cakes.\n\nPrint the sums of the deliciousness of the cakes for the first, second, ..., K-th ways in this list.\n\nConstraints\n\n1 \\leq X \\leq 1 \\ 000\n\n1 \\leq Y \\leq 1 \\ 000\n\n1 \\leq Z \\leq 1 \\ 000\n\n1 \\leq K \\leq \\min(3 \\ 000, X \\times Y \\times Z)\n\n1 \\leq A_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq B_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq C_i \\leq 10 \\ 000 \\ 000 \\ 000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z K\nA_1 \\ A_2 \\ A_3 \\ ... \\ A_X\nB_1 \\ B_2 \\ B_3 \\ ... \\ B_Y\nC_1 \\ C_2 \\ C_3 \\ ... \\ C_Z\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th value stated in the problem statement.\n\nSample Input 1\n\n2 2 2 8\n4 6\n1 5\n3 8\n\nSample Output 1\n\n19\n17\n15\n14\n13\n12\n10\n8\n\nThere are 2 \\times 2 \\times 2 = 8 ways to choose three cakes, as shown below in descending order of the sum of the deliciousness of the cakes:\n\n(A_2, B_2, C_2): 6 + 5 + 8 = 19\n\n(A_1, B_2, C_2): 4 + 5 + 8 = 17\n\n(A_2, B_1, C_2): 6 + 1 + 8 = 15\n\n(A_2, B_2, C_1): 6 + 5 + 3 = 14\n\n(A_1, B_1, C_2): 4 + 1 + 8 = 13\n\n(A_1, B_2, C_1): 4 + 5 + 3 = 12\n\n(A_2, B_1, C_1): 6 + 1 + 3 = 10\n\n(A_1, B_1, C_1): 4 + 1 + 3 = 8\n\nSample Input 2\n\n3 3 3 5\n1 10 100\n2 20 200\n1 10 100\n\nSample Output 2\n\n400\n310\n310\n301\n301\n\nThere may be multiple combinations of cakes with the same sum of the deliciousness. For example, in this test case, the sum of A_1, B_3, C_3 and the sum of A_3, B_3, C_1 are both 301.\nHowever, they are different ways of choosing cakes, so 301 occurs twice in the output.\n\nSample Input 3\n\n10 10 10 20\n7467038376 5724769290 292794712 2843504496 3381970101 8402252870 249131806 6310293640 6690322794 6082257488\n1873977926 2576529623 1144842195 1379118507 6003234687 4925540914 3902539811 3326692703 484657758 2877436338\n4975681328 8974383988 2882263257 7690203955 514305523 6679823484 4263279310 585966808 3752282379 620585736\n\nSample Output 3\n\n23379871545\n22444657051\n22302177772\n22095691512\n21667941469\n21366963278\n21287912315\n21279176669\n21160477018\n21085311041\n21059876163\n21017997739\n20703329561\n20702387965\n20590247696\n20383761436\n20343962175\n20254073196\n20210218542\n20150096547\n\nNote that the input or output may not fit into a 32-bit integer type.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2214, "cpu_time_ms": 2103, "memory_kb": 1400}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s646352797", "group_id": "codeNet:p03078", "input_text": "local DBG = false\nlocal function dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nlocal function dbgpr_t(tbl, use_pairs)\n if DBG then\n local enum = ipairs\n if use_pairs then\n enum = pairs\n end\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in enum(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\nlocal function dbgpr_tp(tbl)\n dbgpr_t(tbl, true)\nend\n\n-- heap\nlocal Heap = {}\nfunction Heap.new(upper_func)\n local self = setmetatable({}, {__index = Heap})\n self.a = {}\n self.upper_func = upper_func\n self.upper = function(k1, k2)\n assert(k1 < k2)\n if k1 == 0 then\n return false\n else\n return upper_func(self.a[k1], self.a[k2])\n end\n end\n self.lower = function(k1, k2)\n return not self.upper(k1, k2)\n end\n return self\nend\n\nfunction Heap:count()\n return #self.a\nend\n\nfunction Heap:_swap(k1, k2)\n local old_k1 = self.a[k1]\n self.a[k1] = self.a[k2]\n self.a[k2] = old_k1\nend\n\nfunction Heap:upheap(newk)\n local ku = newk // 2\n local k = newk\n while ku > 0 and self.lower(ku, k) do\n self:_swap(ku, k)\n k = k//2\n ku = ku//2\n end\nend\n\nfunction Heap:insertq(e)\n table.insert(self.a, e)\n self:upheap(#self.a)\nend\n\nfunction Heap:downheap(newk)\n local k = newk\n while k <= #self.a//2 do\n local kdl = k*2\n local kdr = kdl + 1\n local kd\n if kdr <= #self.a and self.lower(kdl, kdr) then\n kd = kdr\n else\n kd = kdl\n end\n if self.upper(k, kd) then\n break\n end\n self:_swap(k, kd)\n k = kd\n end\nend\n\nfunction Heap:top()\n assert(#self.a >= 1)\n return self.a[1]\nend\n\nfunction Heap:remove_top()\n assert(#self.a >= 1)\n local v = self.a[1]\n self:_swap(1, #self.a)\n table.remove(self.a)\n self:downheap(1)\n return v\nend\n\n--[[\nfunction Heap:replace_top(e)\n assert(#self.a >= 1)\n local old_v = self.a[1]\n local swapped = false\n if self.upper_func(old_v, e) then\n self.a[1] = e\n self:downheap(1)\n swapped = true\n end\n return swapped, old_v\nend\n\nfunction Heap:change()\nend\n\nfunction Heap:delete()\nend\n]]\n-- D\nlocal X, Y, Z, K = io.read(\"n\", \"n\", \"n\", \"n\")\nlocal A, B, C = {}, {}, {}\n\nfor i, tbl in ipairs {A, B, C} do\n local nums = {X, Y, Z}\n local count = nums[i]\n for j=1, count do\n tbl[j] = io.read(\"n\")\n end\n table.sort(tbl, function (x,y)\n return x > y\n end)\nend\n\nlocal function goodness(a, b, c)\n if a > #A or b > #B or c > #C then\n return -10000000000000\n end\n return A[a] + B[b] + C[c]\nend\n\nlocal visited = {}\nlocal function visit(a,b,c)\n visited[tostring(a) .. \"*\" .. tostring(b) .. \"*\" .. tostring(c)] = true\nend\nlocal function isvisited(a,b,c)\n return visited[tostring(a) .. \"*\" .. tostring(b) .. \"*\" .. tostring(c)]\nend\n\n-- most good comb top\nlocal items = Heap.new(function(x,y)\n return x[4] > y[4]\nend)\nlocal function items_add(a, b, c)\n items:insertq({a,b,c,goodness(a,b,c)})\nend\nlocal function check_add(a,b,c)\n if a > #A or b > #B or c > #C then\n return -1\n end\n if isvisited(a, b, c) then\n return -2\n end\n visit(a,b,c)\n items_add(a, b, c)\nend\nlocal ans = {}\nlocal a, b, c = 1, 1, 1\ncheck_add(a, b, c)\nwhile #ans < K do\n local e = items:remove_top()\n table.insert(ans, e[4])\n local a,b,c = e[1], e[2], e[3]\n check_add(a+1,b,c)\n check_add(a,b+1,c)\n check_add(a,b,c+1)\nend\n\ntable.sort(ans, function(x,y) return x>y end)\nfor i=1,K do\n print(ans[i])\nend\n", "language": "Lua", "metadata": {"date": 1554626251, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03078.html", "problem_id": "p03078", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03078/input.txt", "sample_output_relpath": "derived/input_output/data/p03078/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03078/Lua/s646352797.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s646352797", "user_id": "u162773977"}, "prompt_components": {"gold_output": "19\n17\n15\n14\n13\n12\n10\n8\n", "input_to_evaluate": "local DBG = false\nlocal function dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nlocal function dbgpr_t(tbl, use_pairs)\n if DBG then\n local enum = ipairs\n if use_pairs then\n enum = pairs\n end\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in enum(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\nlocal function dbgpr_tp(tbl)\n dbgpr_t(tbl, true)\nend\n\n-- heap\nlocal Heap = {}\nfunction Heap.new(upper_func)\n local self = setmetatable({}, {__index = Heap})\n self.a = {}\n self.upper_func = upper_func\n self.upper = function(k1, k2)\n assert(k1 < k2)\n if k1 == 0 then\n return false\n else\n return upper_func(self.a[k1], self.a[k2])\n end\n end\n self.lower = function(k1, k2)\n return not self.upper(k1, k2)\n end\n return self\nend\n\nfunction Heap:count()\n return #self.a\nend\n\nfunction Heap:_swap(k1, k2)\n local old_k1 = self.a[k1]\n self.a[k1] = self.a[k2]\n self.a[k2] = old_k1\nend\n\nfunction Heap:upheap(newk)\n local ku = newk // 2\n local k = newk\n while ku > 0 and self.lower(ku, k) do\n self:_swap(ku, k)\n k = k//2\n ku = ku//2\n end\nend\n\nfunction Heap:insertq(e)\n table.insert(self.a, e)\n self:upheap(#self.a)\nend\n\nfunction Heap:downheap(newk)\n local k = newk\n while k <= #self.a//2 do\n local kdl = k*2\n local kdr = kdl + 1\n local kd\n if kdr <= #self.a and self.lower(kdl, kdr) then\n kd = kdr\n else\n kd = kdl\n end\n if self.upper(k, kd) then\n break\n end\n self:_swap(k, kd)\n k = kd\n end\nend\n\nfunction Heap:top()\n assert(#self.a >= 1)\n return self.a[1]\nend\n\nfunction Heap:remove_top()\n assert(#self.a >= 1)\n local v = self.a[1]\n self:_swap(1, #self.a)\n table.remove(self.a)\n self:downheap(1)\n return v\nend\n\n--[[\nfunction Heap:replace_top(e)\n assert(#self.a >= 1)\n local old_v = self.a[1]\n local swapped = false\n if self.upper_func(old_v, e) then\n self.a[1] = e\n self:downheap(1)\n swapped = true\n end\n return swapped, old_v\nend\n\nfunction Heap:change()\nend\n\nfunction Heap:delete()\nend\n]]\n-- D\nlocal X, Y, Z, K = io.read(\"n\", \"n\", \"n\", \"n\")\nlocal A, B, C = {}, {}, {}\n\nfor i, tbl in ipairs {A, B, C} do\n local nums = {X, Y, Z}\n local count = nums[i]\n for j=1, count do\n tbl[j] = io.read(\"n\")\n end\n table.sort(tbl, function (x,y)\n return x > y\n end)\nend\n\nlocal function goodness(a, b, c)\n if a > #A or b > #B or c > #C then\n return -10000000000000\n end\n return A[a] + B[b] + C[c]\nend\n\nlocal visited = {}\nlocal function visit(a,b,c)\n visited[tostring(a) .. \"*\" .. tostring(b) .. \"*\" .. tostring(c)] = true\nend\nlocal function isvisited(a,b,c)\n return visited[tostring(a) .. \"*\" .. tostring(b) .. \"*\" .. tostring(c)]\nend\n\n-- most good comb top\nlocal items = Heap.new(function(x,y)\n return x[4] > y[4]\nend)\nlocal function items_add(a, b, c)\n items:insertq({a,b,c,goodness(a,b,c)})\nend\nlocal function check_add(a,b,c)\n if a > #A or b > #B or c > #C then\n return -1\n end\n if isvisited(a, b, c) then\n return -2\n end\n visit(a,b,c)\n items_add(a, b, c)\nend\nlocal ans = {}\nlocal a, b, c = 1, 1, 1\ncheck_add(a, b, c)\nwhile #ans < K do\n local e = items:remove_top()\n table.insert(ans, e[4])\n local a,b,c = e[1], e[2], e[3]\n check_add(a+1,b,c)\n check_add(a,b+1,c)\n check_add(a,b,c+1)\nend\n\ntable.sort(ans, function(x,y) return x>y end)\nfor i=1,K do\n print(ans[i])\nend\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Patisserie AtCoder sells cakes with number-shaped candles.\nThere are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively.\nEach cake has an integer value called deliciousness, as follows:\n\nThe deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X.\n\nThe deliciousness of the cakes with 2-shaped candles are B_1, B_2, ..., B_Y.\n\nThe deliciousness of the cakes with 3-shaped candles are C_1, C_2, ..., C_Z.\n\nTakahashi decides to buy three cakes, one for each of the three shapes of the candles, to celebrate ABC 123.\n\nThere are X \\times Y \\times Z such ways to choose three cakes.\n\nWe will arrange these X \\times Y \\times Z ways in descending order of the sum of the deliciousness of the cakes.\n\nPrint the sums of the deliciousness of the cakes for the first, second, ..., K-th ways in this list.\n\nConstraints\n\n1 \\leq X \\leq 1 \\ 000\n\n1 \\leq Y \\leq 1 \\ 000\n\n1 \\leq Z \\leq 1 \\ 000\n\n1 \\leq K \\leq \\min(3 \\ 000, X \\times Y \\times Z)\n\n1 \\leq A_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq B_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq C_i \\leq 10 \\ 000 \\ 000 \\ 000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z K\nA_1 \\ A_2 \\ A_3 \\ ... \\ A_X\nB_1 \\ B_2 \\ B_3 \\ ... \\ B_Y\nC_1 \\ C_2 \\ C_3 \\ ... \\ C_Z\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th value stated in the problem statement.\n\nSample Input 1\n\n2 2 2 8\n4 6\n1 5\n3 8\n\nSample Output 1\n\n19\n17\n15\n14\n13\n12\n10\n8\n\nThere are 2 \\times 2 \\times 2 = 8 ways to choose three cakes, as shown below in descending order of the sum of the deliciousness of the cakes:\n\n(A_2, B_2, C_2): 6 + 5 + 8 = 19\n\n(A_1, B_2, C_2): 4 + 5 + 8 = 17\n\n(A_2, B_1, C_2): 6 + 1 + 8 = 15\n\n(A_2, B_2, C_1): 6 + 5 + 3 = 14\n\n(A_1, B_1, C_2): 4 + 1 + 8 = 13\n\n(A_1, B_2, C_1): 4 + 5 + 3 = 12\n\n(A_2, B_1, C_1): 6 + 1 + 3 = 10\n\n(A_1, B_1, C_1): 4 + 1 + 3 = 8\n\nSample Input 2\n\n3 3 3 5\n1 10 100\n2 20 200\n1 10 100\n\nSample Output 2\n\n400\n310\n310\n301\n301\n\nThere may be multiple combinations of cakes with the same sum of the deliciousness. For example, in this test case, the sum of A_1, B_3, C_3 and the sum of A_3, B_3, C_1 are both 301.\nHowever, they are different ways of choosing cakes, so 301 occurs twice in the output.\n\nSample Input 3\n\n10 10 10 20\n7467038376 5724769290 292794712 2843504496 3381970101 8402252870 249131806 6310293640 6690322794 6082257488\n1873977926 2576529623 1144842195 1379118507 6003234687 4925540914 3902539811 3326692703 484657758 2877436338\n4975681328 8974383988 2882263257 7690203955 514305523 6679823484 4263279310 585966808 3752282379 620585736\n\nSample Output 3\n\n23379871545\n22444657051\n22302177772\n22095691512\n21667941469\n21366963278\n21287912315\n21279176669\n21160477018\n21085311041\n21059876163\n21017997739\n20703329561\n20702387965\n20590247696\n20383761436\n20343962175\n20254073196\n20210218542\n20150096547\n\nNote that the input or output may not fit into a 32-bit integer type.", "sample_input": "2 2 2 8\n4 6\n1 5\n3 8\n"}, "reference_outputs": ["19\n17\n15\n14\n13\n12\n10\n8\n"], "source_document_id": "p03078", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Patisserie AtCoder sells cakes with number-shaped candles.\nThere are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively.\nEach cake has an integer value called deliciousness, as follows:\n\nThe deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X.\n\nThe deliciousness of the cakes with 2-shaped candles are B_1, B_2, ..., B_Y.\n\nThe deliciousness of the cakes with 3-shaped candles are C_1, C_2, ..., C_Z.\n\nTakahashi decides to buy three cakes, one for each of the three shapes of the candles, to celebrate ABC 123.\n\nThere are X \\times Y \\times Z such ways to choose three cakes.\n\nWe will arrange these X \\times Y \\times Z ways in descending order of the sum of the deliciousness of the cakes.\n\nPrint the sums of the deliciousness of the cakes for the first, second, ..., K-th ways in this list.\n\nConstraints\n\n1 \\leq X \\leq 1 \\ 000\n\n1 \\leq Y \\leq 1 \\ 000\n\n1 \\leq Z \\leq 1 \\ 000\n\n1 \\leq K \\leq \\min(3 \\ 000, X \\times Y \\times Z)\n\n1 \\leq A_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq B_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq C_i \\leq 10 \\ 000 \\ 000 \\ 000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z K\nA_1 \\ A_2 \\ A_3 \\ ... \\ A_X\nB_1 \\ B_2 \\ B_3 \\ ... \\ B_Y\nC_1 \\ C_2 \\ C_3 \\ ... \\ C_Z\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th value stated in the problem statement.\n\nSample Input 1\n\n2 2 2 8\n4 6\n1 5\n3 8\n\nSample Output 1\n\n19\n17\n15\n14\n13\n12\n10\n8\n\nThere are 2 \\times 2 \\times 2 = 8 ways to choose three cakes, as shown below in descending order of the sum of the deliciousness of the cakes:\n\n(A_2, B_2, C_2): 6 + 5 + 8 = 19\n\n(A_1, B_2, C_2): 4 + 5 + 8 = 17\n\n(A_2, B_1, C_2): 6 + 1 + 8 = 15\n\n(A_2, B_2, C_1): 6 + 5 + 3 = 14\n\n(A_1, B_1, C_2): 4 + 1 + 8 = 13\n\n(A_1, B_2, C_1): 4 + 5 + 3 = 12\n\n(A_2, B_1, C_1): 6 + 1 + 3 = 10\n\n(A_1, B_1, C_1): 4 + 1 + 3 = 8\n\nSample Input 2\n\n3 3 3 5\n1 10 100\n2 20 200\n1 10 100\n\nSample Output 2\n\n400\n310\n310\n301\n301\n\nThere may be multiple combinations of cakes with the same sum of the deliciousness. For example, in this test case, the sum of A_1, B_3, C_3 and the sum of A_3, B_3, C_1 are both 301.\nHowever, they are different ways of choosing cakes, so 301 occurs twice in the output.\n\nSample Input 3\n\n10 10 10 20\n7467038376 5724769290 292794712 2843504496 3381970101 8402252870 249131806 6310293640 6690322794 6082257488\n1873977926 2576529623 1144842195 1379118507 6003234687 4925540914 3902539811 3326692703 484657758 2877436338\n4975681328 8974383988 2882263257 7690203955 514305523 6679823484 4263279310 585966808 3752282379 620585736\n\nSample Output 3\n\n23379871545\n22444657051\n22302177772\n22095691512\n21667941469\n21366963278\n21287912315\n21279176669\n21160477018\n21085311041\n21059876163\n21017997739\n20703329561\n20702387965\n20590247696\n20383761436\n20343962175\n20254073196\n20210218542\n20150096547\n\nNote that the input or output may not fit into a 32-bit integer type.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3752, "cpu_time_ms": 134, "memory_kb": 2420}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s905807822", "group_id": "codeNet:p03078", "input_text": "local DBG = false\nlocal function dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nlocal function dbgpr_t(tbl, use_pairs)\n if DBG then\n local enum = ipairs\n if use_pairs then\n enum = pairs\n end\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in enum(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\nlocal function dbgpr_tp(tbl)\n dbgpr_t(tbl, true)\nend\n\n-- heap\nlocal Heap = {}\nfunction Heap.new(upper_func)\n local self = setmetatable({}, {__index = Heap})\n self.a = {}\n self.upper_func = upper_func\n self.upper = function(k1, k2)\n assert(k1 < k2)\n if k1 == 0 then\n return false\n else\n return upper_func(self.a[k1], self.a[k2])\n end\n end\n self.lower = function(k1, k2)\n return not self.upper(k1, k2)\n end\n return self\nend\n\nfunction Heap:count()\n return #self.a\nend\n\nfunction Heap:_swap(k1, k2)\n local old_k1 = self.a[k1]\n self.a[k1] = self.a[k2]\n self.a[k2] = old_k1\nend\n\nfunction Heap:upheap(newk)\n local ku = newk // 2\n local k = newk\n while ku > 0 and self.lower(ku, k) do\n self:_swap(ku, k)\n k = k//2\n ku = ku//2\n end\nend\n\nfunction Heap:insertq(e)\n table.insert(self.a, e)\n self:upheap(#self.a)\nend\n\nfunction Heap:downheap(newk)\n local k = newk\n while k <= #self.a//2 do\n local kdl = k*2\n local kdr = kdl + 1\n local kd\n if kdr <= #self.a and self.lower(kdl, kdr) then\n kd = kdr\n else\n kd = kdl\n end\n if self.upper(k, kd) then\n break\n end\n self:_swap(k, kd)\n k = kd\n end\nend\n\nfunction Heap:top()\n assert(#self.a >= 1)\n return self.a[1]\nend\n\n--[[\nfunction Heap:remove_top()\n assert(#self.a >= 1)\n local v = self.a[1]\n self:_swap(1, #self.a)\n self.a:remove()\n self:downheap(1)\n return v\nend\n\nfunction Heap:replace_top(e)\n assert(#self.a >= 1)\n local old_v = self.a[1]\n local swapped = false\n if self.upper_func(old_v, e) then\n self.a[1] = e\n self:downheap(1)\n swapped = true\n end\n return swapped, old_v\nend\n\nfunction Heap:change()\nend\n\nfunction Heap:delete()\nend\n]]\n-- D\nlocal X, Y, Z, K = io.read(\"n\", \"n\", \"n\", \"n\")\nlocal A, B, C = {}, {}, {}\n\nfor i, tbl in ipairs {A, B, C} do\n local nums = {X, Y, Z}\n local count = nums[i]\n for j=1, count do\n tbl[j] = io.read(\"n\")\n end\n table.sort(tbl, function (x,y)\n return x > y\n end)\nend\n\nlocal function goodness(a, b, c)\n if a > #A or b > #B or c > #C then\n return -10000000000000\n end\n return A[a] + B[b] + C[c]\nend\n\nlocal visited = {}\nlocal function visit(a,b,c)\n visited[tostring(a) .. \"*\" .. tostring(b) .. \"*\" .. tostring(c)] = true\nend\nlocal function isvisited(a,b,c)\n return visited[tostring(a) .. \"*\" .. tostring(b) .. \"*\" .. tostring(c)]\nend\n\n-- most bad comb top\nlocal items = Heap.new(function(x,y)\n return x[4] < y[4]\nend)\nlocal function items_add(a, b, c)\n if items:count() > 3000 then\n local old_top = items:top()\n if old_top[4] >= goodness(a,b,c) then\n return false\n end\n end\n items:insertq({a,b,c,goodness(a,b,c)})\n return true\nend\nlocal function dfs(a, b, c)\n if a > #A or b > #B or c > #C then\n return -1\n end\n if isvisited(a, b, c) then\n return -2\n end\n visit(a,b,c)\n local f = items_add(a, b, c)\n --print(a,b,c,f)\n if f then\n local a_next = {a + 1, b, c, goodness(a + 1, b, c)}\n local b_next = {a, b + 1, c, goodness(a, b + 1, c)}\n local c_next = {a, b, c + 1, goodness(a, b, c + 1)}\n local t = {a_next, b_next, c_next}\n table.sort(t, function(x,y)\n return x[4] > y[4]\n end)\n for i=1, #t do\n local tt = t[i]\n dfs(tt[1], tt[2], tt[3])\n end\n end\nend\ndfs(1, 1, 1)\n\nlocal ans = {}\nfor i=1,#items.a do\n table.insert(ans, items.a[i][4])\nend\ntable.sort(ans, function(x,y) return x>y end)\nfor i=1,K do\n print(ans[i])\nend\n", "language": "Lua", "metadata": {"date": 1554623957, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03078.html", "problem_id": "p03078", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03078/input.txt", "sample_output_relpath": "derived/input_output/data/p03078/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03078/Lua/s905807822.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s905807822", "user_id": "u162773977"}, "prompt_components": {"gold_output": "19\n17\n15\n14\n13\n12\n10\n8\n", "input_to_evaluate": "local DBG = false\nlocal function dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nlocal function dbgpr_t(tbl, use_pairs)\n if DBG then\n local enum = ipairs\n if use_pairs then\n enum = pairs\n end\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in enum(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\nlocal function dbgpr_tp(tbl)\n dbgpr_t(tbl, true)\nend\n\n-- heap\nlocal Heap = {}\nfunction Heap.new(upper_func)\n local self = setmetatable({}, {__index = Heap})\n self.a = {}\n self.upper_func = upper_func\n self.upper = function(k1, k2)\n assert(k1 < k2)\n if k1 == 0 then\n return false\n else\n return upper_func(self.a[k1], self.a[k2])\n end\n end\n self.lower = function(k1, k2)\n return not self.upper(k1, k2)\n end\n return self\nend\n\nfunction Heap:count()\n return #self.a\nend\n\nfunction Heap:_swap(k1, k2)\n local old_k1 = self.a[k1]\n self.a[k1] = self.a[k2]\n self.a[k2] = old_k1\nend\n\nfunction Heap:upheap(newk)\n local ku = newk // 2\n local k = newk\n while ku > 0 and self.lower(ku, k) do\n self:_swap(ku, k)\n k = k//2\n ku = ku//2\n end\nend\n\nfunction Heap:insertq(e)\n table.insert(self.a, e)\n self:upheap(#self.a)\nend\n\nfunction Heap:downheap(newk)\n local k = newk\n while k <= #self.a//2 do\n local kdl = k*2\n local kdr = kdl + 1\n local kd\n if kdr <= #self.a and self.lower(kdl, kdr) then\n kd = kdr\n else\n kd = kdl\n end\n if self.upper(k, kd) then\n break\n end\n self:_swap(k, kd)\n k = kd\n end\nend\n\nfunction Heap:top()\n assert(#self.a >= 1)\n return self.a[1]\nend\n\n--[[\nfunction Heap:remove_top()\n assert(#self.a >= 1)\n local v = self.a[1]\n self:_swap(1, #self.a)\n self.a:remove()\n self:downheap(1)\n return v\nend\n\nfunction Heap:replace_top(e)\n assert(#self.a >= 1)\n local old_v = self.a[1]\n local swapped = false\n if self.upper_func(old_v, e) then\n self.a[1] = e\n self:downheap(1)\n swapped = true\n end\n return swapped, old_v\nend\n\nfunction Heap:change()\nend\n\nfunction Heap:delete()\nend\n]]\n-- D\nlocal X, Y, Z, K = io.read(\"n\", \"n\", \"n\", \"n\")\nlocal A, B, C = {}, {}, {}\n\nfor i, tbl in ipairs {A, B, C} do\n local nums = {X, Y, Z}\n local count = nums[i]\n for j=1, count do\n tbl[j] = io.read(\"n\")\n end\n table.sort(tbl, function (x,y)\n return x > y\n end)\nend\n\nlocal function goodness(a, b, c)\n if a > #A or b > #B or c > #C then\n return -10000000000000\n end\n return A[a] + B[b] + C[c]\nend\n\nlocal visited = {}\nlocal function visit(a,b,c)\n visited[tostring(a) .. \"*\" .. tostring(b) .. \"*\" .. tostring(c)] = true\nend\nlocal function isvisited(a,b,c)\n return visited[tostring(a) .. \"*\" .. tostring(b) .. \"*\" .. tostring(c)]\nend\n\n-- most bad comb top\nlocal items = Heap.new(function(x,y)\n return x[4] < y[4]\nend)\nlocal function items_add(a, b, c)\n if items:count() > 3000 then\n local old_top = items:top()\n if old_top[4] >= goodness(a,b,c) then\n return false\n end\n end\n items:insertq({a,b,c,goodness(a,b,c)})\n return true\nend\nlocal function dfs(a, b, c)\n if a > #A or b > #B or c > #C then\n return -1\n end\n if isvisited(a, b, c) then\n return -2\n end\n visit(a,b,c)\n local f = items_add(a, b, c)\n --print(a,b,c,f)\n if f then\n local a_next = {a + 1, b, c, goodness(a + 1, b, c)}\n local b_next = {a, b + 1, c, goodness(a, b + 1, c)}\n local c_next = {a, b, c + 1, goodness(a, b, c + 1)}\n local t = {a_next, b_next, c_next}\n table.sort(t, function(x,y)\n return x[4] > y[4]\n end)\n for i=1, #t do\n local tt = t[i]\n dfs(tt[1], tt[2], tt[3])\n end\n end\nend\ndfs(1, 1, 1)\n\nlocal ans = {}\nfor i=1,#items.a do\n table.insert(ans, items.a[i][4])\nend\ntable.sort(ans, function(x,y) return x>y end)\nfor i=1,K do\n print(ans[i])\nend\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Patisserie AtCoder sells cakes with number-shaped candles.\nThere are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively.\nEach cake has an integer value called deliciousness, as follows:\n\nThe deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X.\n\nThe deliciousness of the cakes with 2-shaped candles are B_1, B_2, ..., B_Y.\n\nThe deliciousness of the cakes with 3-shaped candles are C_1, C_2, ..., C_Z.\n\nTakahashi decides to buy three cakes, one for each of the three shapes of the candles, to celebrate ABC 123.\n\nThere are X \\times Y \\times Z such ways to choose three cakes.\n\nWe will arrange these X \\times Y \\times Z ways in descending order of the sum of the deliciousness of the cakes.\n\nPrint the sums of the deliciousness of the cakes for the first, second, ..., K-th ways in this list.\n\nConstraints\n\n1 \\leq X \\leq 1 \\ 000\n\n1 \\leq Y \\leq 1 \\ 000\n\n1 \\leq Z \\leq 1 \\ 000\n\n1 \\leq K \\leq \\min(3 \\ 000, X \\times Y \\times Z)\n\n1 \\leq A_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq B_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq C_i \\leq 10 \\ 000 \\ 000 \\ 000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z K\nA_1 \\ A_2 \\ A_3 \\ ... \\ A_X\nB_1 \\ B_2 \\ B_3 \\ ... \\ B_Y\nC_1 \\ C_2 \\ C_3 \\ ... \\ C_Z\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th value stated in the problem statement.\n\nSample Input 1\n\n2 2 2 8\n4 6\n1 5\n3 8\n\nSample Output 1\n\n19\n17\n15\n14\n13\n12\n10\n8\n\nThere are 2 \\times 2 \\times 2 = 8 ways to choose three cakes, as shown below in descending order of the sum of the deliciousness of the cakes:\n\n(A_2, B_2, C_2): 6 + 5 + 8 = 19\n\n(A_1, B_2, C_2): 4 + 5 + 8 = 17\n\n(A_2, B_1, C_2): 6 + 1 + 8 = 15\n\n(A_2, B_2, C_1): 6 + 5 + 3 = 14\n\n(A_1, B_1, C_2): 4 + 1 + 8 = 13\n\n(A_1, B_2, C_1): 4 + 5 + 3 = 12\n\n(A_2, B_1, C_1): 6 + 1 + 3 = 10\n\n(A_1, B_1, C_1): 4 + 1 + 3 = 8\n\nSample Input 2\n\n3 3 3 5\n1 10 100\n2 20 200\n1 10 100\n\nSample Output 2\n\n400\n310\n310\n301\n301\n\nThere may be multiple combinations of cakes with the same sum of the deliciousness. For example, in this test case, the sum of A_1, B_3, C_3 and the sum of A_3, B_3, C_1 are both 301.\nHowever, they are different ways of choosing cakes, so 301 occurs twice in the output.\n\nSample Input 3\n\n10 10 10 20\n7467038376 5724769290 292794712 2843504496 3381970101 8402252870 249131806 6310293640 6690322794 6082257488\n1873977926 2576529623 1144842195 1379118507 6003234687 4925540914 3902539811 3326692703 484657758 2877436338\n4975681328 8974383988 2882263257 7690203955 514305523 6679823484 4263279310 585966808 3752282379 620585736\n\nSample Output 3\n\n23379871545\n22444657051\n22302177772\n22095691512\n21667941469\n21366963278\n21287912315\n21279176669\n21160477018\n21085311041\n21059876163\n21017997739\n20703329561\n20702387965\n20590247696\n20383761436\n20343962175\n20254073196\n20210218542\n20150096547\n\nNote that the input or output may not fit into a 32-bit integer type.", "sample_input": "2 2 2 8\n4 6\n1 5\n3 8\n"}, "reference_outputs": ["19\n17\n15\n14\n13\n12\n10\n8\n"], "source_document_id": "p03078", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Patisserie AtCoder sells cakes with number-shaped candles.\nThere are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively.\nEach cake has an integer value called deliciousness, as follows:\n\nThe deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X.\n\nThe deliciousness of the cakes with 2-shaped candles are B_1, B_2, ..., B_Y.\n\nThe deliciousness of the cakes with 3-shaped candles are C_1, C_2, ..., C_Z.\n\nTakahashi decides to buy three cakes, one for each of the three shapes of the candles, to celebrate ABC 123.\n\nThere are X \\times Y \\times Z such ways to choose three cakes.\n\nWe will arrange these X \\times Y \\times Z ways in descending order of the sum of the deliciousness of the cakes.\n\nPrint the sums of the deliciousness of the cakes for the first, second, ..., K-th ways in this list.\n\nConstraints\n\n1 \\leq X \\leq 1 \\ 000\n\n1 \\leq Y \\leq 1 \\ 000\n\n1 \\leq Z \\leq 1 \\ 000\n\n1 \\leq K \\leq \\min(3 \\ 000, X \\times Y \\times Z)\n\n1 \\leq A_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq B_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq C_i \\leq 10 \\ 000 \\ 000 \\ 000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z K\nA_1 \\ A_2 \\ A_3 \\ ... \\ A_X\nB_1 \\ B_2 \\ B_3 \\ ... \\ B_Y\nC_1 \\ C_2 \\ C_3 \\ ... \\ C_Z\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th value stated in the problem statement.\n\nSample Input 1\n\n2 2 2 8\n4 6\n1 5\n3 8\n\nSample Output 1\n\n19\n17\n15\n14\n13\n12\n10\n8\n\nThere are 2 \\times 2 \\times 2 = 8 ways to choose three cakes, as shown below in descending order of the sum of the deliciousness of the cakes:\n\n(A_2, B_2, C_2): 6 + 5 + 8 = 19\n\n(A_1, B_2, C_2): 4 + 5 + 8 = 17\n\n(A_2, B_1, C_2): 6 + 1 + 8 = 15\n\n(A_2, B_2, C_1): 6 + 5 + 3 = 14\n\n(A_1, B_1, C_2): 4 + 1 + 8 = 13\n\n(A_1, B_2, C_1): 4 + 5 + 3 = 12\n\n(A_2, B_1, C_1): 6 + 1 + 3 = 10\n\n(A_1, B_1, C_1): 4 + 1 + 3 = 8\n\nSample Input 2\n\n3 3 3 5\n1 10 100\n2 20 200\n1 10 100\n\nSample Output 2\n\n400\n310\n310\n301\n301\n\nThere may be multiple combinations of cakes with the same sum of the deliciousness. For example, in this test case, the sum of A_1, B_3, C_3 and the sum of A_3, B_3, C_1 are both 301.\nHowever, they are different ways of choosing cakes, so 301 occurs twice in the output.\n\nSample Input 3\n\n10 10 10 20\n7467038376 5724769290 292794712 2843504496 3381970101 8402252870 249131806 6310293640 6690322794 6082257488\n1873977926 2576529623 1144842195 1379118507 6003234687 4925540914 3902539811 3326692703 484657758 2877436338\n4975681328 8974383988 2882263257 7690203955 514305523 6679823484 4263279310 585966808 3752282379 620585736\n\nSample Output 3\n\n23379871545\n22444657051\n22302177772\n22095691512\n21667941469\n21366963278\n21287912315\n21279176669\n21160477018\n21085311041\n21059876163\n21017997739\n20703329561\n20702387965\n20590247696\n20383761436\n20343962175\n20254073196\n20210218542\n20150096547\n\nNote that the input or output may not fit into a 32-bit integer type.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4218, "cpu_time_ms": 2113, "memory_kb": 94104}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s637572732", "group_id": "codeNet:p03079", "input_text": "local A,B,C = io.read(\"n\", \"n\", \"n\")\nprint((A==B and B == C and C==A) and \"Yes\" or \"No\")", "language": "Lua", "metadata": {"date": 1553976128, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03079.html", "problem_id": "p03079", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03079/input.txt", "sample_output_relpath": "derived/input_output/data/p03079/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03079/Lua/s637572732.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s637572732", "user_id": "u162773977"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local A,B,C = io.read(\"n\", \"n\", \"n\")\nprint((A==B and B == C and C==A) and \"Yes\" or \"No\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given three integers A, B and C.\n\nDetermine if there exists an equilateral triangle whose sides have lengths A, B and C.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A,B,C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf there exists an equilateral triangle whose sides have lengths A, B and C, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 2 2\n\nSample Output 1\n\nYes\n\nThere exists an equilateral triangle whose sides have lengths 2, 2 and 2.\n\nSample Input 2\n\n3 4 5\n\nSample Output 2\n\nNo\n\nThere is no equilateral triangle whose sides have lengths 3, 4 and 5.", "sample_input": "2 2 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03079", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given three integers A, B and C.\n\nDetermine if there exists an equilateral triangle whose sides have lengths A, B and C.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A,B,C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf there exists an equilateral triangle whose sides have lengths A, B and C, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 2 2\n\nSample Output 1\n\nYes\n\nThere exists an equilateral triangle whose sides have lengths 2, 2 and 2.\n\nSample Input 2\n\n3 4 5\n\nSample Output 2\n\nNo\n\nThere is no equilateral triangle whose sides have lengths 3, 4 and 5.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 12, "memory_kb": 1008}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s291684400", "group_id": "codeNet:p03080", "input_text": "n = io.read(\"*n\", \"*l\")\ns = io.read()\nB, R = 0, 0\nfor i = 1, n do\n if(string.sub(s, i, i) == \"B\") then B = B + 1 else R = R + 1 end\nend\nif(B < R) then print(\"Yes\") else print(\"No\") end", "language": "Lua", "metadata": {"date": 1553976246, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s291684400.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s291684400", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "n = io.read(\"*n\", \"*l\")\ns = io.read()\nB, R = 0, 0\nfor i = 1, n do\n if(string.sub(s, i, i) == \"B\") then B = B + 1 else R = R + 1 end\nend\nif(B < R) then print(\"Yes\") else print(\"No\") end", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s085814181", "group_id": "codeNet:p03081", "input_text": "-- C\nlocal DBG = true\nlocal function dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nlocal function dbgpr_t(tbl, use_pairs)\n if DBG then\n local enum = ipairs\n if use_pairs then\n enum = pairs\n end\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in enum(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\nlocal function dbgpr_tp(tbl)\n dbgpr_t(tbl, true)\nend\n\nlocal function str2tbl(s)\n local t = {string.byte(s, 1, #s)}\n for i=1, #t do\n t[i] = string.char(t[i])\n end\n return t\nend\n\nlocal function each_char(s)\n local f = function(_, i)\n i = i + 1\n if i <= #s then\n return i, string.sub(s, i, i)\n end\n end\n return f, nil, 0\nend\nlocal N, Q, _ = io.read(\"n\", \"n\", \"l\")\nlocal s = io.read(\"l\")\nassert(#s == N)\nlocal spells = {}\nfor i=1,Q do\n local t, _, d, _ = io.read(1, 1, 1, \"l\")\n spells[i] = {t, d}\nend\n\nlocal place = str2tbl(s)\n\nlocal left, right\nlocal left_path, right_path = 0, N+1\n\nfor i=Q,1,-1 do\n local t, d = spells[i][1], spells[i][2]\n local flag = true\n if d == 'L' then\n if t == place[1] and not left then\n left_path = 1\n flag = false\n left = true\n end\n else\n if t == place[N] and not right then\n right_path = N\n flag = false\n right = true\n end\n end\n if flag then\n if d == 'L' and left then\n if t == place[left_path+1] then\n left_path = left_path+1\n end\n elseif right then\n if t == place[right_path-1] then\n right_path = right_path-1\n end\n end\n end\nend\n\nlocal dead = 0\nfor i=1,N do\n if i <= left_path or i >= right_path then\n dead = dead + 1\n end\nend\nprint(N - dead)", "language": "Lua", "metadata": {"date": 1553984837, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03081.html", "problem_id": "p03081", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03081/input.txt", "sample_output_relpath": "derived/input_output/data/p03081/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03081/Lua/s085814181.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s085814181", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "-- C\nlocal DBG = true\nlocal function dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nlocal function dbgpr_t(tbl, use_pairs)\n if DBG then\n local enum = ipairs\n if use_pairs then\n enum = pairs\n end\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in enum(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\nlocal function dbgpr_tp(tbl)\n dbgpr_t(tbl, true)\nend\n\nlocal function str2tbl(s)\n local t = {string.byte(s, 1, #s)}\n for i=1, #t do\n t[i] = string.char(t[i])\n end\n return t\nend\n\nlocal function each_char(s)\n local f = function(_, i)\n i = i + 1\n if i <= #s then\n return i, string.sub(s, i, i)\n end\n end\n return f, nil, 0\nend\nlocal N, Q, _ = io.read(\"n\", \"n\", \"l\")\nlocal s = io.read(\"l\")\nassert(#s == N)\nlocal spells = {}\nfor i=1,Q do\n local t, _, d, _ = io.read(1, 1, 1, \"l\")\n spells[i] = {t, d}\nend\n\nlocal place = str2tbl(s)\n\nlocal left, right\nlocal left_path, right_path = 0, N+1\n\nfor i=Q,1,-1 do\n local t, d = spells[i][1], spells[i][2]\n local flag = true\n if d == 'L' then\n if t == place[1] and not left then\n left_path = 1\n flag = false\n left = true\n end\n else\n if t == place[N] and not right then\n right_path = N\n flag = false\n right = true\n end\n end\n if flag then\n if d == 'L' and left then\n if t == place[left_path+1] then\n left_path = left_path+1\n end\n elseif right then\n if t == place[right_path-1] then\n right_path = right_path-1\n end\n end\n end\nend\n\nlocal dead = 0\nfor i=1,N do\n if i <= left_path or i >= right_path then\n dead = dead + 1\n end\nend\nprint(N - dead)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N squares numbered 1 to N from left to right.\nEach square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.\n\nSnuke cast Q spells to move the golems.\n\nThe i-th spell consisted of two characters t_i and d_i, where d_i is L or R.\nWhen Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is L, and moved to the square adjacent to the right if d_i is R.\n\nHowever, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.\n\nFind the number of golems remaining after Snuke cast the Q spells.\n\nConstraints\n\n1 \\leq N,Q \\leq 2 \\times 10^{5}\n\n|s| = N\n\ns_i and t_i are uppercase English letters.\n\nd_i is L or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\ns\nt_1 d_1\n\\vdots\nt_{Q} d_Q\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 4\nABC\nA L\nB L\nB R\nA R\n\nSample Output 1\n\n2\n\nInitially, there is one golem on each square.\n\nIn the first spell, the golem on Square 1 tries to move left and disappears.\n\nIn the second spell, the golem on Square 2 moves left.\n\nIn the third spell, no golem moves.\n\nIn the fourth spell, the golem on Square 1 moves right.\n\nAfter the four spells are cast, there is one golem on Square 2 and one golem on Square 3, for a total of two golems remaining.\n\nSample Input 2\n\n8 3\nAABCBDBA\nA L\nB R\nA R\n\nSample Output 2\n\n5\n\nAfter the three spells are cast, there is one golem on Square 2, two golems on Square 4 and two golems on Square 6, for a total of five golems remaining.\n\nNote that a single spell may move multiple golems.\n\nSample Input 3\n\n10 15\nSNCZWRCEWB\nB R\nR R\nE R\nW R\nZ L\nS R\nQ L\nW L\nB R\nC L\nA L\nN L\nE R\nZ L\nS L\n\nSample Output 3\n\n3", "sample_input": "3 4\nABC\nA L\nB L\nB R\nA R\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03081", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N squares numbered 1 to N from left to right.\nEach square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.\n\nSnuke cast Q spells to move the golems.\n\nThe i-th spell consisted of two characters t_i and d_i, where d_i is L or R.\nWhen Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is L, and moved to the square adjacent to the right if d_i is R.\n\nHowever, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.\n\nFind the number of golems remaining after Snuke cast the Q spells.\n\nConstraints\n\n1 \\leq N,Q \\leq 2 \\times 10^{5}\n\n|s| = N\n\ns_i and t_i are uppercase English letters.\n\nd_i is L or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\ns\nt_1 d_1\n\\vdots\nt_{Q} d_Q\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 4\nABC\nA L\nB L\nB R\nA R\n\nSample Output 1\n\n2\n\nInitially, there is one golem on each square.\n\nIn the first spell, the golem on Square 1 tries to move left and disappears.\n\nIn the second spell, the golem on Square 2 moves left.\n\nIn the third spell, no golem moves.\n\nIn the fourth spell, the golem on Square 1 moves right.\n\nAfter the four spells are cast, there is one golem on Square 2 and one golem on Square 3, for a total of two golems remaining.\n\nSample Input 2\n\n8 3\nAABCBDBA\nA L\nB R\nA R\n\nSample Output 2\n\n5\n\nAfter the three spells are cast, there is one golem on Square 2, two golems on Square 4 and two golems on Square 6, for a total of five golems remaining.\n\nNote that a single spell may move multiple golems.\n\nSample Input 3\n\n10 15\nSNCZWRCEWB\nB R\nR R\nE R\nW R\nZ L\nS R\nQ L\nW L\nB R\nC L\nA L\nN L\nE R\nZ L\nS L\n\nSample Output 3\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1960, "cpu_time_ms": 197, "memory_kb": 32692}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s616512897", "group_id": "codeNet:p03081", "input_text": "-- C\nlocal DBG = true\nlocal function dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nlocal function dbgpr_t(tbl, use_pairs)\n if DBG then\n local enum = ipairs\n if use_pairs then\n enum = pairs\n end\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in enum(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\nlocal function dbgpr_tp(tbl)\n dbgpr_t(tbl, true)\nend\n\nlocal function str2tbl(s)\n local t = {string.byte(s, 1, #s)}\n for i=1, #t do\n t[i] = string.char(t[i])\n end\n return t\nend\n\nlocal function each_char(s)\n local f = function(_, i)\n i = i + 1\n if i <= #s then\n return i, string.sub(s, i, i)\n end\n end\n return f, nil, 0\nend\nlocal N, Q, _ = io.read(\"n\", \"n\", \"l\")\nlocal s = io.read(\"l\")\nassert(#s == N)\nlocal spells = {}\nfor i=1,Q do\n local t, _, d, _ = io.read(1, 1, 1, \"l\")\n spells[i] = {t, d}\nend\n\nlocal place = str2tbl(s)\n\nlocal paths = {}\n\nlocal function new_path(pos)\n local p = {pos, 1}\n return p\nend\nlocal function push_path(p)\n table.insert(paths, p)\nend\n\nlocal left, right\n\nfor i=Q,1,-1 do\n local t, d = spells[i][1], spells[i][2]\n local flag = true\n if d == 'L' then\n if t == place[1] and not left then\n local p = new_path(1)\n push_path(p)\n flag = false\n left = true\n end\n else\n if t == place[N] and not right then\n local p = new_path(N)\n push_path(p)\n flag = false\n right = true\n end\n end\n if flag then\n for _,p in ipairs(paths) do\n local pos, count = p[1], p[2]\n if d == 'L' then\n if t == place[pos+1] then\n p[1], p[2] = pos+1, count+1\n end\n else\n if t == place[pos-1] then\n p[1], p[2] = pos-1, count+1\n end\n end\n end\n end\nend\nlocal dead = 0\nfor _,p in ipairs(paths) do\n dead = dead + p[2]\nend\nprint(N - dead)", "language": "Lua", "metadata": {"date": 1553983347, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03081.html", "problem_id": "p03081", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03081/input.txt", "sample_output_relpath": "derived/input_output/data/p03081/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03081/Lua/s616512897.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s616512897", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "-- C\nlocal DBG = true\nlocal function dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nlocal function dbgpr_t(tbl, use_pairs)\n if DBG then\n local enum = ipairs\n if use_pairs then\n enum = pairs\n end\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in enum(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\nlocal function dbgpr_tp(tbl)\n dbgpr_t(tbl, true)\nend\n\nlocal function str2tbl(s)\n local t = {string.byte(s, 1, #s)}\n for i=1, #t do\n t[i] = string.char(t[i])\n end\n return t\nend\n\nlocal function each_char(s)\n local f = function(_, i)\n i = i + 1\n if i <= #s then\n return i, string.sub(s, i, i)\n end\n end\n return f, nil, 0\nend\nlocal N, Q, _ = io.read(\"n\", \"n\", \"l\")\nlocal s = io.read(\"l\")\nassert(#s == N)\nlocal spells = {}\nfor i=1,Q do\n local t, _, d, _ = io.read(1, 1, 1, \"l\")\n spells[i] = {t, d}\nend\n\nlocal place = str2tbl(s)\n\nlocal paths = {}\n\nlocal function new_path(pos)\n local p = {pos, 1}\n return p\nend\nlocal function push_path(p)\n table.insert(paths, p)\nend\n\nlocal left, right\n\nfor i=Q,1,-1 do\n local t, d = spells[i][1], spells[i][2]\n local flag = true\n if d == 'L' then\n if t == place[1] and not left then\n local p = new_path(1)\n push_path(p)\n flag = false\n left = true\n end\n else\n if t == place[N] and not right then\n local p = new_path(N)\n push_path(p)\n flag = false\n right = true\n end\n end\n if flag then\n for _,p in ipairs(paths) do\n local pos, count = p[1], p[2]\n if d == 'L' then\n if t == place[pos+1] then\n p[1], p[2] = pos+1, count+1\n end\n else\n if t == place[pos-1] then\n p[1], p[2] = pos-1, count+1\n end\n end\n end\n end\nend\nlocal dead = 0\nfor _,p in ipairs(paths) do\n dead = dead + p[2]\nend\nprint(N - dead)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N squares numbered 1 to N from left to right.\nEach square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.\n\nSnuke cast Q spells to move the golems.\n\nThe i-th spell consisted of two characters t_i and d_i, where d_i is L or R.\nWhen Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is L, and moved to the square adjacent to the right if d_i is R.\n\nHowever, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.\n\nFind the number of golems remaining after Snuke cast the Q spells.\n\nConstraints\n\n1 \\leq N,Q \\leq 2 \\times 10^{5}\n\n|s| = N\n\ns_i and t_i are uppercase English letters.\n\nd_i is L or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\ns\nt_1 d_1\n\\vdots\nt_{Q} d_Q\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 4\nABC\nA L\nB L\nB R\nA R\n\nSample Output 1\n\n2\n\nInitially, there is one golem on each square.\n\nIn the first spell, the golem on Square 1 tries to move left and disappears.\n\nIn the second spell, the golem on Square 2 moves left.\n\nIn the third spell, no golem moves.\n\nIn the fourth spell, the golem on Square 1 moves right.\n\nAfter the four spells are cast, there is one golem on Square 2 and one golem on Square 3, for a total of two golems remaining.\n\nSample Input 2\n\n8 3\nAABCBDBA\nA L\nB R\nA R\n\nSample Output 2\n\n5\n\nAfter the three spells are cast, there is one golem on Square 2, two golems on Square 4 and two golems on Square 6, for a total of five golems remaining.\n\nNote that a single spell may move multiple golems.\n\nSample Input 3\n\n10 15\nSNCZWRCEWB\nB R\nR R\nE R\nW R\nZ L\nS R\nQ L\nW L\nB R\nC L\nA L\nN L\nE R\nZ L\nS L\n\nSample Output 3\n\n3", "sample_input": "3 4\nABC\nA L\nB L\nB R\nA R\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03081", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N squares numbered 1 to N from left to right.\nEach square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.\n\nSnuke cast Q spells to move the golems.\n\nThe i-th spell consisted of two characters t_i and d_i, where d_i is L or R.\nWhen Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is L, and moved to the square adjacent to the right if d_i is R.\n\nHowever, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.\n\nFind the number of golems remaining after Snuke cast the Q spells.\n\nConstraints\n\n1 \\leq N,Q \\leq 2 \\times 10^{5}\n\n|s| = N\n\ns_i and t_i are uppercase English letters.\n\nd_i is L or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\ns\nt_1 d_1\n\\vdots\nt_{Q} d_Q\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 4\nABC\nA L\nB L\nB R\nA R\n\nSample Output 1\n\n2\n\nInitially, there is one golem on each square.\n\nIn the first spell, the golem on Square 1 tries to move left and disappears.\n\nIn the second spell, the golem on Square 2 moves left.\n\nIn the third spell, no golem moves.\n\nIn the fourth spell, the golem on Square 1 moves right.\n\nAfter the four spells are cast, there is one golem on Square 2 and one golem on Square 3, for a total of two golems remaining.\n\nSample Input 2\n\n8 3\nAABCBDBA\nA L\nB R\nA R\n\nSample Output 2\n\n5\n\nAfter the three spells are cast, there is one golem on Square 2, two golems on Square 4 and two golems on Square 6, for a total of five golems remaining.\n\nNote that a single spell may move multiple golems.\n\nSample Input 3\n\n10 15\nSNCZWRCEWB\nB R\nR R\nE R\nW R\nZ L\nS R\nQ L\nW L\nB R\nC L\nA L\nN L\nE R\nZ L\nS L\n\nSample Output 3\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2191, "cpu_time_ms": 270, "memory_kb": 32692}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s056904877", "group_id": "codeNet:p03081", "input_text": "function check(rrr)\n tmp = rrr\n res = \"OK\"\n posstr = string.sub(s, tmp, tmp)\n for i = 1, q do\n if(svtgt[i] == posstr) then\n if(svway[i] == \"L\") then\n if(tmp == 1) then\n res = \"LEFT\"\n else\n tmp = tmp - 1\n posstr = string.sub(s, tmp, tmp)\n end\n else\n if(tmp == n) then\n res = \"RIGHT\"\n else\n tmp = tmp + 1\n posstr = string.sub(s, tmp, tmp)\n end\n end\n end\n if(res ~= \"OK\") then break end\n end\n return res\nend\n\nn, q = io.read(\"*n\", \"*n\", \"*l\")\ns = io.read()\nt = {}\nnum = {}\nfor i = 1, n do\n a = string.sub(s, i, i)\n if(t[a] == nil) then\n t[a] = {{}, {}}\n end\n table.insert(t[a][1], i)\n table.insert(t[a][2], 1, i)\n num[i] = 1\nend\nsvtgt, svway = {}, {}\nfor i = 1, q do\n tgt, zz, way = io.read(1, 1, \"*l\")\n table.insert(svtgt, tgt)\n table.insert(svway, way)\nend\nleftmin = 1\nleftmax = n\nleftkill = 0\nfres, nres = check(1), check(n)\nif(nres == \"LEFT\") then\n leftkill = n\nelseif(fres ~= \"OK\") then\n while(1 < leftmax -leftmin) do\n leftmid = math.floor((leftmin + leftmax) / 2)\n midret = check(leftmid)\n if(midret == \"LEFT\") then\n leftmin = leftmid\n else\n leftmax = leftmid\n end\n end\n leftkill = leftmin\nend\nrightmin = leftkill + 1\nrightmax = n\nrightkill = 0\nif(check(rightmin) == \"RIGHT\") then\n rightkill = n - rightmin\nelseif(nres ~= \"OK\") then\n while(1 < rightmax -rightmin) do\n rightmid = math.floor((rightmin + rightmax) / 2)\n midret = check(rightmid)\n if(midret == \"RIGHT\") then\n rightmax = rightmid\n else\n rightmin = rightmid\n end\n end\n rightkill = n + 1 - rightmax\nend\nprint(n - leftkill - rightkill)\n", "language": "Lua", "metadata": {"date": 1553982385, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03081.html", "problem_id": "p03081", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03081/input.txt", "sample_output_relpath": "derived/input_output/data/p03081/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03081/Lua/s056904877.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s056904877", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "function check(rrr)\n tmp = rrr\n res = \"OK\"\n posstr = string.sub(s, tmp, tmp)\n for i = 1, q do\n if(svtgt[i] == posstr) then\n if(svway[i] == \"L\") then\n if(tmp == 1) then\n res = \"LEFT\"\n else\n tmp = tmp - 1\n posstr = string.sub(s, tmp, tmp)\n end\n else\n if(tmp == n) then\n res = \"RIGHT\"\n else\n tmp = tmp + 1\n posstr = string.sub(s, tmp, tmp)\n end\n end\n end\n if(res ~= \"OK\") then break end\n end\n return res\nend\n\nn, q = io.read(\"*n\", \"*n\", \"*l\")\ns = io.read()\nt = {}\nnum = {}\nfor i = 1, n do\n a = string.sub(s, i, i)\n if(t[a] == nil) then\n t[a] = {{}, {}}\n end\n table.insert(t[a][1], i)\n table.insert(t[a][2], 1, i)\n num[i] = 1\nend\nsvtgt, svway = {}, {}\nfor i = 1, q do\n tgt, zz, way = io.read(1, 1, \"*l\")\n table.insert(svtgt, tgt)\n table.insert(svway, way)\nend\nleftmin = 1\nleftmax = n\nleftkill = 0\nfres, nres = check(1), check(n)\nif(nres == \"LEFT\") then\n leftkill = n\nelseif(fres ~= \"OK\") then\n while(1 < leftmax -leftmin) do\n leftmid = math.floor((leftmin + leftmax) / 2)\n midret = check(leftmid)\n if(midret == \"LEFT\") then\n leftmin = leftmid\n else\n leftmax = leftmid\n end\n end\n leftkill = leftmin\nend\nrightmin = leftkill + 1\nrightmax = n\nrightkill = 0\nif(check(rightmin) == \"RIGHT\") then\n rightkill = n - rightmin\nelseif(nres ~= \"OK\") then\n while(1 < rightmax -rightmin) do\n rightmid = math.floor((rightmin + rightmax) / 2)\n midret = check(rightmid)\n if(midret == \"RIGHT\") then\n rightmax = rightmid\n else\n rightmin = rightmid\n end\n end\n rightkill = n + 1 - rightmax\nend\nprint(n - leftkill - rightkill)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N squares numbered 1 to N from left to right.\nEach square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.\n\nSnuke cast Q spells to move the golems.\n\nThe i-th spell consisted of two characters t_i and d_i, where d_i is L or R.\nWhen Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is L, and moved to the square adjacent to the right if d_i is R.\n\nHowever, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.\n\nFind the number of golems remaining after Snuke cast the Q spells.\n\nConstraints\n\n1 \\leq N,Q \\leq 2 \\times 10^{5}\n\n|s| = N\n\ns_i and t_i are uppercase English letters.\n\nd_i is L or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\ns\nt_1 d_1\n\\vdots\nt_{Q} d_Q\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 4\nABC\nA L\nB L\nB R\nA R\n\nSample Output 1\n\n2\n\nInitially, there is one golem on each square.\n\nIn the first spell, the golem on Square 1 tries to move left and disappears.\n\nIn the second spell, the golem on Square 2 moves left.\n\nIn the third spell, no golem moves.\n\nIn the fourth spell, the golem on Square 1 moves right.\n\nAfter the four spells are cast, there is one golem on Square 2 and one golem on Square 3, for a total of two golems remaining.\n\nSample Input 2\n\n8 3\nAABCBDBA\nA L\nB R\nA R\n\nSample Output 2\n\n5\n\nAfter the three spells are cast, there is one golem on Square 2, two golems on Square 4 and two golems on Square 6, for a total of five golems remaining.\n\nNote that a single spell may move multiple golems.\n\nSample Input 3\n\n10 15\nSNCZWRCEWB\nB R\nR R\nE R\nW R\nZ L\nS R\nQ L\nW L\nB R\nC L\nA L\nN L\nE R\nZ L\nS L\n\nSample Output 3\n\n3", "sample_input": "3 4\nABC\nA L\nB L\nB R\nA R\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03081", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N squares numbered 1 to N from left to right.\nEach square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.\n\nSnuke cast Q spells to move the golems.\n\nThe i-th spell consisted of two characters t_i and d_i, where d_i is L or R.\nWhen Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is L, and moved to the square adjacent to the right if d_i is R.\n\nHowever, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.\n\nFind the number of golems remaining after Snuke cast the Q spells.\n\nConstraints\n\n1 \\leq N,Q \\leq 2 \\times 10^{5}\n\n|s| = N\n\ns_i and t_i are uppercase English letters.\n\nd_i is L or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\ns\nt_1 d_1\n\\vdots\nt_{Q} d_Q\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 4\nABC\nA L\nB L\nB R\nA R\n\nSample Output 1\n\n2\n\nInitially, there is one golem on each square.\n\nIn the first spell, the golem on Square 1 tries to move left and disappears.\n\nIn the second spell, the golem on Square 2 moves left.\n\nIn the third spell, no golem moves.\n\nIn the fourth spell, the golem on Square 1 moves right.\n\nAfter the four spells are cast, there is one golem on Square 2 and one golem on Square 3, for a total of two golems remaining.\n\nSample Input 2\n\n8 3\nAABCBDBA\nA L\nB R\nA R\n\nSample Output 2\n\n5\n\nAfter the three spells are cast, there is one golem on Square 2, two golems on Square 4 and two golems on Square 6, for a total of five golems remaining.\n\nNote that a single spell may move multiple golems.\n\nSample Input 3\n\n10 15\nSNCZWRCEWB\nB R\nR R\nE R\nW R\nZ L\nS R\nQ L\nW L\nB R\nC L\nA L\nN L\nE R\nZ L\nS L\n\nSample Output 3\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1946, "cpu_time_ms": 2103, "memory_kb": 11376}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s668932901", "group_id": "codeNet:p03082", "input_text": "local mod = 1000000007\nlocal mfl = math.floor\nlocal mmi = math.min\n\nlocal function bmul(x, y)\n if x * y <= 9999999999999 then -- < 10^14\n return (x * y) % mod\n end\n local x0, y0 = x % 31623, y % 31623\n local x1, y1 = mfl(x / 31623), mfl(y / 31623)\n return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod\nend\nlocal function badd(x, y)\n return (x + y) % mod\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\n\nlocal n, x = io.read(\"*n\", \"*n\")\nlocal fact = {1}\nfor i = 2, 200 do\n fact[i] = bmul(fact[i - 1], i)\nend\nlocal combfact = {}\nfor i = 1, 200 do\n combfact[i] = {}\n local c = 1\n for j = 1, i do\n c = bmul(c, i + 1 - j)\n c = bmul(c, modinv(j))\n combfact[i][j] = bmul(c, fact[j])\n end\nend\n\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\nend\ntable.sort(a)\nlocal t = {}\nfor i = 1, n do\n t[i] = {}\nend\nfor i = 1, n - 1 do\n t[i][x % a[i]] = combfact[n - 1][n - i]\nend\nt[n][x % a[n]] = 1\n\nfor src = n, 2, -1 do\n local cfmap = combfact[src - 2]\n for val, cnt in pairs(t[src]) do\n do\n local nval = val % a[src - 1]\n local precnt = t[src - 1][nval]\n if precnt then\n t[src - 1][nval] = badd(precnt, cnt)\n else\n t[src - 1][nval] = cnt\n end\n end\n end\n for dst = src - 2, 1, -1 do\n local tdst = t[dst]\n for val, cnt in pairs(t[src]) do\n local nval = val % a[dst]\n local k = bmul(cnt, cfmap[src - dst - 1])\n local precnt = tdst[nval]\n if precnt then\n tdst[nval] = badd(precnt, k)\n else\n tdst[nval] = k\n end\n end\n end\nend\nlocal ret = 0\nfor k, v in pairs(t[1]) do\n ret = badd(ret, bmul(k, v))\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1582065711, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03082.html", "problem_id": "p03082", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03082/input.txt", "sample_output_relpath": "derived/input_output/data/p03082/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03082/Lua/s668932901.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s668932901", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local mod = 1000000007\nlocal mfl = math.floor\nlocal mmi = math.min\n\nlocal function bmul(x, y)\n if x * y <= 9999999999999 then -- < 10^14\n return (x * y) % mod\n end\n local x0, y0 = x % 31623, y % 31623\n local x1, y1 = mfl(x / 31623), mfl(y / 31623)\n return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod\nend\nlocal function badd(x, y)\n return (x + y) % mod\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\n\nlocal n, x = io.read(\"*n\", \"*n\")\nlocal fact = {1}\nfor i = 2, 200 do\n fact[i] = bmul(fact[i - 1], i)\nend\nlocal combfact = {}\nfor i = 1, 200 do\n combfact[i] = {}\n local c = 1\n for j = 1, i do\n c = bmul(c, i + 1 - j)\n c = bmul(c, modinv(j))\n combfact[i][j] = bmul(c, fact[j])\n end\nend\n\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\nend\ntable.sort(a)\nlocal t = {}\nfor i = 1, n do\n t[i] = {}\nend\nfor i = 1, n - 1 do\n t[i][x % a[i]] = combfact[n - 1][n - i]\nend\nt[n][x % a[n]] = 1\n\nfor src = n, 2, -1 do\n local cfmap = combfact[src - 2]\n for val, cnt in pairs(t[src]) do\n do\n local nval = val % a[src - 1]\n local precnt = t[src - 1][nval]\n if precnt then\n t[src - 1][nval] = badd(precnt, cnt)\n else\n t[src - 1][nval] = cnt\n end\n end\n end\n for dst = src - 2, 1, -1 do\n local tdst = t[dst]\n for val, cnt in pairs(t[src]) do\n local nval = val % a[dst]\n local k = bmul(cnt, cfmap[src - dst - 1])\n local precnt = tdst[nval]\n if precnt then\n tdst[nval] = badd(precnt, k)\n else\n tdst[nval] = k\n end\n end\n end\nend\nlocal ret = 0\nfor k, v in pairs(t[1]) do\n ret = badd(ret, bmul(k, v))\nend\nprint(ret)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke has a blackboard and a set S consisting of N integers.\nThe i-th element in S is S_i.\n\nHe wrote an integer X on the blackboard, then performed the following operation N times:\n\nChoose one element from S and remove it.\n\nLet x be the number written on the blackboard now, and y be the integer removed from S. Replace the number on the blackboard with x \\bmod {y}.\n\nThere are N! possible orders in which the elements are removed from S.\nFor each of them, find the number that would be written on the blackboard after the N operations, and compute the sum of all those N! numbers modulo 10^{9}+7.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 200\n\n1 \\leq S_i, X \\leq 10^{5}\n\nS_i are pairwise distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nS_1 S_2 \\ldots S_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 19\n3 7\n\nSample Output 1\n\n3\n\nThere are two possible orders in which we remove the numbers from S.\n\nIf we remove 3 and 7 in this order, the number on the blackboard changes as follows: 19 \\rightarrow 1 \\rightarrow 1.\n\nIf we remove 7 and 3 in this order, the number on the blackboard changes as follows: 19 \\rightarrow 5 \\rightarrow 2.\n\nThe output should be the sum of these: 3.\n\nSample Input 2\n\n5 82\n22 11 6 5 13\n\nSample Output 2\n\n288\n\nSample Input 3\n\n10 100000\n50000 50001 50002 50003 50004 50005 50006 50007 50008 50009\n\nSample Output 3\n\n279669259\n\nBe sure to compute the sum modulo 10^{9}+7.", "sample_input": "2 19\n3 7\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03082", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke has a blackboard and a set S consisting of N integers.\nThe i-th element in S is S_i.\n\nHe wrote an integer X on the blackboard, then performed the following operation N times:\n\nChoose one element from S and remove it.\n\nLet x be the number written on the blackboard now, and y be the integer removed from S. Replace the number on the blackboard with x \\bmod {y}.\n\nThere are N! possible orders in which the elements are removed from S.\nFor each of them, find the number that would be written on the blackboard after the N operations, and compute the sum of all those N! numbers modulo 10^{9}+7.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 200\n\n1 \\leq S_i, X \\leq 10^{5}\n\nS_i are pairwise distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nS_1 S_2 \\ldots S_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 19\n3 7\n\nSample Output 1\n\n3\n\nThere are two possible orders in which we remove the numbers from S.\n\nIf we remove 3 and 7 in this order, the number on the blackboard changes as follows: 19 \\rightarrow 1 \\rightarrow 1.\n\nIf we remove 7 and 3 in this order, the number on the blackboard changes as follows: 19 \\rightarrow 5 \\rightarrow 2.\n\nThe output should be the sum of these: 3.\n\nSample Input 2\n\n5 82\n22 11 6 5 13\n\nSample Output 2\n\n288\n\nSample Input 3\n\n10 100000\n50000 50001 50002 50003 50004 50005 50006 50007 50008 50009\n\nSample Output 3\n\n279669259\n\nBe sure to compute the sum modulo 10^{9}+7.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1878, "cpu_time_ms": 2104, "memory_kb": 15360}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s240434812", "group_id": "codeNet:p03082", "input_text": "local mod = 1000000007\nlocal mfl = math.floor\nlocal mmi = math.min\n\nlocal function bmul(x, y)\n local x0, y0 = x % 31623, y % 31623\n local x1, y1 = mfl(x / 31623), mfl(y / 31623)\n return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod\nend\nlocal function badd(x, y)\n return (x + y) % mod\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\n\nlocal n, x = io.read(\"*n\", \"*n\")\nlocal fact = {1}\nfor i = 2, 200 do\n fact[i] = bmul(fact[i - 1], i)\nend\nlocal combfact = {}\nfor i = 1, 200 do\n combfact[i] = {}\n local c = 1\n for j = 1, i do\n c = bmul(c, i + 1 - j)\n c = bmul(c, modinv(j))\n combfact[i][j] = bmul(c, fact[j])\n end\nend\n\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\nend\ntable.sort(a)\nlocal t = {}\nfor i = 1, n do\n t[i] = {}\nend\nfor i = 1, n do\n if 0 < n - 1 and 0 < n - i then\n t[i][x % a[i]] = combfact[n - 1][n - i]\n else\n t[i][x % a[i]] = 1\n end\nend\nfor src = n, 2, -1 do\n local cfmap = combfact[src - 2]\n for val, cnt in pairs(t[src]) do\n do\n local dst = src - 1\n local nval = val % a[dst]\n local precnt = t[dst][nval]\n if precnt then\n t[dst][nval] = badd(precnt, cnt)\n else\n t[dst][nval] = cnt\n end\n end\n for dst = src - 2, 1, -1 do\n local nval = val % a[dst]\n local step = src - dst - 1\n local k = bmul(cnt, cfmap[step])\n local precnt = t[dst][nval]\n if precnt then\n t[dst][nval] = badd(precnt, k)\n else\n t[dst][nval] = k\n end\n end\n end\nend\nlocal ret = 0\nfor k, v in pairs(t[1]) do\n ret = badd(ret, bmul(k, v))\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1582056632, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03082.html", "problem_id": "p03082", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03082/input.txt", "sample_output_relpath": "derived/input_output/data/p03082/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03082/Lua/s240434812.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s240434812", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local mod = 1000000007\nlocal mfl = math.floor\nlocal mmi = math.min\n\nlocal function bmul(x, y)\n local x0, y0 = x % 31623, y % 31623\n local x1, y1 = mfl(x / 31623), mfl(y / 31623)\n return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod\nend\nlocal function badd(x, y)\n return (x + y) % mod\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\n\nlocal n, x = io.read(\"*n\", \"*n\")\nlocal fact = {1}\nfor i = 2, 200 do\n fact[i] = bmul(fact[i - 1], i)\nend\nlocal combfact = {}\nfor i = 1, 200 do\n combfact[i] = {}\n local c = 1\n for j = 1, i do\n c = bmul(c, i + 1 - j)\n c = bmul(c, modinv(j))\n combfact[i][j] = bmul(c, fact[j])\n end\nend\n\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\nend\ntable.sort(a)\nlocal t = {}\nfor i = 1, n do\n t[i] = {}\nend\nfor i = 1, n do\n if 0 < n - 1 and 0 < n - i then\n t[i][x % a[i]] = combfact[n - 1][n - i]\n else\n t[i][x % a[i]] = 1\n end\nend\nfor src = n, 2, -1 do\n local cfmap = combfact[src - 2]\n for val, cnt in pairs(t[src]) do\n do\n local dst = src - 1\n local nval = val % a[dst]\n local precnt = t[dst][nval]\n if precnt then\n t[dst][nval] = badd(precnt, cnt)\n else\n t[dst][nval] = cnt\n end\n end\n for dst = src - 2, 1, -1 do\n local nval = val % a[dst]\n local step = src - dst - 1\n local k = bmul(cnt, cfmap[step])\n local precnt = t[dst][nval]\n if precnt then\n t[dst][nval] = badd(precnt, k)\n else\n t[dst][nval] = k\n end\n end\n end\nend\nlocal ret = 0\nfor k, v in pairs(t[1]) do\n ret = badd(ret, bmul(k, v))\nend\nprint(ret)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke has a blackboard and a set S consisting of N integers.\nThe i-th element in S is S_i.\n\nHe wrote an integer X on the blackboard, then performed the following operation N times:\n\nChoose one element from S and remove it.\n\nLet x be the number written on the blackboard now, and y be the integer removed from S. Replace the number on the blackboard with x \\bmod {y}.\n\nThere are N! possible orders in which the elements are removed from S.\nFor each of them, find the number that would be written on the blackboard after the N operations, and compute the sum of all those N! numbers modulo 10^{9}+7.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 200\n\n1 \\leq S_i, X \\leq 10^{5}\n\nS_i are pairwise distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nS_1 S_2 \\ldots S_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 19\n3 7\n\nSample Output 1\n\n3\n\nThere are two possible orders in which we remove the numbers from S.\n\nIf we remove 3 and 7 in this order, the number on the blackboard changes as follows: 19 \\rightarrow 1 \\rightarrow 1.\n\nIf we remove 7 and 3 in this order, the number on the blackboard changes as follows: 19 \\rightarrow 5 \\rightarrow 2.\n\nThe output should be the sum of these: 3.\n\nSample Input 2\n\n5 82\n22 11 6 5 13\n\nSample Output 2\n\n288\n\nSample Input 3\n\n10 100000\n50000 50001 50002 50003 50004 50005 50006 50007 50008 50009\n\nSample Output 3\n\n279669259\n\nBe sure to compute the sum modulo 10^{9}+7.", "sample_input": "2 19\n3 7\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03082", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke has a blackboard and a set S consisting of N integers.\nThe i-th element in S is S_i.\n\nHe wrote an integer X on the blackboard, then performed the following operation N times:\n\nChoose one element from S and remove it.\n\nLet x be the number written on the blackboard now, and y be the integer removed from S. Replace the number on the blackboard with x \\bmod {y}.\n\nThere are N! possible orders in which the elements are removed from S.\nFor each of them, find the number that would be written on the blackboard after the N operations, and compute the sum of all those N! numbers modulo 10^{9}+7.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 200\n\n1 \\leq S_i, X \\leq 10^{5}\n\nS_i are pairwise distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nS_1 S_2 \\ldots S_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 19\n3 7\n\nSample Output 1\n\n3\n\nThere are two possible orders in which we remove the numbers from S.\n\nIf we remove 3 and 7 in this order, the number on the blackboard changes as follows: 19 \\rightarrow 1 \\rightarrow 1.\n\nIf we remove 7 and 3 in this order, the number on the blackboard changes as follows: 19 \\rightarrow 5 \\rightarrow 2.\n\nThe output should be the sum of these: 3.\n\nSample Input 2\n\n5 82\n22 11 6 5 13\n\nSample Output 2\n\n288\n\nSample Input 3\n\n10 100000\n50000 50001 50002 50003 50004 50005 50006 50007 50008 50009\n\nSample Output 3\n\n279669259\n\nBe sure to compute the sum modulo 10^{9}+7.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1826, "cpu_time_ms": 2104, "memory_kb": 15768}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s232867451", "group_id": "codeNet:p03082", "input_text": "local mod = 1000000007\nlocal mfl = math.floor\nlocal mmi = math.min\n\nlocal function bmul(x, y)\n local x0, y0 = x % 31623, y % 31623\n local x1, y1 = mfl(x / 31623), mfl(y / 31623)\n return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod\nend\nlocal function badd(x, y)\n return (x + y) % mod\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\n\nlocal n, x = io.read(\"*n\", \"*n\")\nlocal fact = {1}\nfor i = 2, 200 do\n fact[i] = bmul(fact[i - 1], i)\nend\nlocal combfact = {}\nfor i = 1, 200 do\n combfact[i] = {}\n local c = 1\n for j = 1, i do\n c = bmul(c, i + 1 - j)\n c = bmul(c, modinv(j))\n combfact[i][j] = bmul(c, fact[j])\n end\nend\nlocal function getCombFact(n, k)\n if n == 0 then return 1 end\n if k == 0 then return 1 end\n return combfact[n][k]\nend\n\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\nend\ntable.sort(a)\nlocal t = {}\nfor i = 1, n do\n t[i] = {}\nend\nfor i = 1, n do\n t[i][x % a[i]] = getCombFact(n - 1, n - i)\nend\nfor src = n, 1, -1 do\n local cfmap = combfact[src - 2]\n for val, cnt in pairs(t[src]) do\n for dst = src - 1, 1, -1 do\n local k = cnt\n local nval = val % a[dst]\n local step = src - dst - 1\n if 0 < step * (src - 2) then\n k = bmul(k, cfmap[step])\n end\n -- k = bmul(k, getCombFact(src - 2, step))\n local precnt = t[dst][nval]\n if precnt then\n t[dst][nval] = badd(precnt, k)\n else\n t[dst][nval] = k\n end\n end\n end\nend\nlocal ret = 0\nfor k, v in pairs(t[1]) do\n ret = badd(ret, bmul(k, v))\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1582056180, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03082.html", "problem_id": "p03082", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03082/input.txt", "sample_output_relpath": "derived/input_output/data/p03082/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03082/Lua/s232867451.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s232867451", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local mod = 1000000007\nlocal mfl = math.floor\nlocal mmi = math.min\n\nlocal function bmul(x, y)\n local x0, y0 = x % 31623, y % 31623\n local x1, y1 = mfl(x / 31623), mfl(y / 31623)\n return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod\nend\nlocal function badd(x, y)\n return (x + y) % mod\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\n\nlocal n, x = io.read(\"*n\", \"*n\")\nlocal fact = {1}\nfor i = 2, 200 do\n fact[i] = bmul(fact[i - 1], i)\nend\nlocal combfact = {}\nfor i = 1, 200 do\n combfact[i] = {}\n local c = 1\n for j = 1, i do\n c = bmul(c, i + 1 - j)\n c = bmul(c, modinv(j))\n combfact[i][j] = bmul(c, fact[j])\n end\nend\nlocal function getCombFact(n, k)\n if n == 0 then return 1 end\n if k == 0 then return 1 end\n return combfact[n][k]\nend\n\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\nend\ntable.sort(a)\nlocal t = {}\nfor i = 1, n do\n t[i] = {}\nend\nfor i = 1, n do\n t[i][x % a[i]] = getCombFact(n - 1, n - i)\nend\nfor src = n, 1, -1 do\n local cfmap = combfact[src - 2]\n for val, cnt in pairs(t[src]) do\n for dst = src - 1, 1, -1 do\n local k = cnt\n local nval = val % a[dst]\n local step = src - dst - 1\n if 0 < step * (src - 2) then\n k = bmul(k, cfmap[step])\n end\n -- k = bmul(k, getCombFact(src - 2, step))\n local precnt = t[dst][nval]\n if precnt then\n t[dst][nval] = badd(precnt, k)\n else\n t[dst][nval] = k\n end\n end\n end\nend\nlocal ret = 0\nfor k, v in pairs(t[1]) do\n ret = badd(ret, bmul(k, v))\nend\nprint(ret)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke has a blackboard and a set S consisting of N integers.\nThe i-th element in S is S_i.\n\nHe wrote an integer X on the blackboard, then performed the following operation N times:\n\nChoose one element from S and remove it.\n\nLet x be the number written on the blackboard now, and y be the integer removed from S. Replace the number on the blackboard with x \\bmod {y}.\n\nThere are N! possible orders in which the elements are removed from S.\nFor each of them, find the number that would be written on the blackboard after the N operations, and compute the sum of all those N! numbers modulo 10^{9}+7.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 200\n\n1 \\leq S_i, X \\leq 10^{5}\n\nS_i are pairwise distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nS_1 S_2 \\ldots S_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 19\n3 7\n\nSample Output 1\n\n3\n\nThere are two possible orders in which we remove the numbers from S.\n\nIf we remove 3 and 7 in this order, the number on the blackboard changes as follows: 19 \\rightarrow 1 \\rightarrow 1.\n\nIf we remove 7 and 3 in this order, the number on the blackboard changes as follows: 19 \\rightarrow 5 \\rightarrow 2.\n\nThe output should be the sum of these: 3.\n\nSample Input 2\n\n5 82\n22 11 6 5 13\n\nSample Output 2\n\n288\n\nSample Input 3\n\n10 100000\n50000 50001 50002 50003 50004 50005 50006 50007 50008 50009\n\nSample Output 3\n\n279669259\n\nBe sure to compute the sum modulo 10^{9}+7.", "sample_input": "2 19\n3 7\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03082", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke has a blackboard and a set S consisting of N integers.\nThe i-th element in S is S_i.\n\nHe wrote an integer X on the blackboard, then performed the following operation N times:\n\nChoose one element from S and remove it.\n\nLet x be the number written on the blackboard now, and y be the integer removed from S. Replace the number on the blackboard with x \\bmod {y}.\n\nThere are N! possible orders in which the elements are removed from S.\nFor each of them, find the number that would be written on the blackboard after the N operations, and compute the sum of all those N! numbers modulo 10^{9}+7.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 200\n\n1 \\leq S_i, X \\leq 10^{5}\n\nS_i are pairwise distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nS_1 S_2 \\ldots S_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 19\n3 7\n\nSample Output 1\n\n3\n\nThere are two possible orders in which we remove the numbers from S.\n\nIf we remove 3 and 7 in this order, the number on the blackboard changes as follows: 19 \\rightarrow 1 \\rightarrow 1.\n\nIf we remove 7 and 3 in this order, the number on the blackboard changes as follows: 19 \\rightarrow 5 \\rightarrow 2.\n\nThe output should be the sum of these: 3.\n\nSample Input 2\n\n5 82\n22 11 6 5 13\n\nSample Output 2\n\n288\n\nSample Input 3\n\n10 100000\n50000 50001 50002 50003 50004 50005 50006 50007 50008 50009\n\nSample Output 3\n\n279669259\n\nBe sure to compute the sum modulo 10^{9}+7.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1769, "cpu_time_ms": 2104, "memory_kb": 15512}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s834112534", "group_id": "codeNet:p03082", "input_text": "local mod = 1000000007\nlocal mfl = math.floor\nlocal mmi = math.min\n\nlocal function bmul(x, y)\n local x0, y0 = x % 31623, y % 31623\n local x1, y1 = mfl(x / 31623), mfl(y / 31623)\n return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod\nend\nlocal function badd(x, y)\n return (x + y) % mod\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\n\nlocal n, x = io.read(\"*n\", \"*n\")\nlocal fact = {1}\nfor i = 2, n do\n fact[i] = bmul(fact[i - 1], i)\nend\nlocal combs = {}\nfor i = 1, 200 do\n combs[i] = {}\n local c = 1\n for j = 1, i do\n c = bmul(c, i + 1 - j)\n c = bmul(c, modinv(j))\n combs[i][j] = c\n end\nend\nlocal function getComb(n, k)\n if n == 0 then return 1 end\n if k == 0 then return 1 end\n return combs[n][k]\nend\n\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\nend\ntable.sort(a)\nlocal t = {}\nfor i = 1, n do\n t[i] = {}\nend\nfor i = 1, n - 1 do\n t[i][x % a[i]] = bmul(fact[n - i], getComb(n - 1, n - i))\nend\nt[n][x % a[n]] = 1\n\nfor src = n, 1, -1 do\n for val, cnt in pairs(t[src]) do\n for dst = src - 1, 1, -1 do\n local k = cnt\n local nval = val % a[dst]\n local step = src - dst - 1\n if 0 < step then k = bmul(k, fact[step]) end\n k = bmul(k, getComb(src - 2, step))\n if t[dst][nval] then\n t[dst][nval] = badd(t[dst][nval], k)\n else\n t[dst][nval] = k\n end\n end\n end\nend\nlocal ret = 0\nfor k, v in pairs(t[1]) do\n ret = badd(ret, bmul(k, v))\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1582044739, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03082.html", "problem_id": "p03082", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03082/input.txt", "sample_output_relpath": "derived/input_output/data/p03082/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03082/Lua/s834112534.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s834112534", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local mod = 1000000007\nlocal mfl = math.floor\nlocal mmi = math.min\n\nlocal function bmul(x, y)\n local x0, y0 = x % 31623, y % 31623\n local x1, y1 = mfl(x / 31623), mfl(y / 31623)\n return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod\nend\nlocal function badd(x, y)\n return (x + y) % mod\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\n\nlocal n, x = io.read(\"*n\", \"*n\")\nlocal fact = {1}\nfor i = 2, n do\n fact[i] = bmul(fact[i - 1], i)\nend\nlocal combs = {}\nfor i = 1, 200 do\n combs[i] = {}\n local c = 1\n for j = 1, i do\n c = bmul(c, i + 1 - j)\n c = bmul(c, modinv(j))\n combs[i][j] = c\n end\nend\nlocal function getComb(n, k)\n if n == 0 then return 1 end\n if k == 0 then return 1 end\n return combs[n][k]\nend\n\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\nend\ntable.sort(a)\nlocal t = {}\nfor i = 1, n do\n t[i] = {}\nend\nfor i = 1, n - 1 do\n t[i][x % a[i]] = bmul(fact[n - i], getComb(n - 1, n - i))\nend\nt[n][x % a[n]] = 1\n\nfor src = n, 1, -1 do\n for val, cnt in pairs(t[src]) do\n for dst = src - 1, 1, -1 do\n local k = cnt\n local nval = val % a[dst]\n local step = src - dst - 1\n if 0 < step then k = bmul(k, fact[step]) end\n k = bmul(k, getComb(src - 2, step))\n if t[dst][nval] then\n t[dst][nval] = badd(t[dst][nval], k)\n else\n t[dst][nval] = k\n end\n end\n end\nend\nlocal ret = 0\nfor k, v in pairs(t[1]) do\n ret = badd(ret, bmul(k, v))\nend\nprint(ret)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke has a blackboard and a set S consisting of N integers.\nThe i-th element in S is S_i.\n\nHe wrote an integer X on the blackboard, then performed the following operation N times:\n\nChoose one element from S and remove it.\n\nLet x be the number written on the blackboard now, and y be the integer removed from S. Replace the number on the blackboard with x \\bmod {y}.\n\nThere are N! possible orders in which the elements are removed from S.\nFor each of them, find the number that would be written on the blackboard after the N operations, and compute the sum of all those N! numbers modulo 10^{9}+7.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 200\n\n1 \\leq S_i, X \\leq 10^{5}\n\nS_i are pairwise distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nS_1 S_2 \\ldots S_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 19\n3 7\n\nSample Output 1\n\n3\n\nThere are two possible orders in which we remove the numbers from S.\n\nIf we remove 3 and 7 in this order, the number on the blackboard changes as follows: 19 \\rightarrow 1 \\rightarrow 1.\n\nIf we remove 7 and 3 in this order, the number on the blackboard changes as follows: 19 \\rightarrow 5 \\rightarrow 2.\n\nThe output should be the sum of these: 3.\n\nSample Input 2\n\n5 82\n22 11 6 5 13\n\nSample Output 2\n\n288\n\nSample Input 3\n\n10 100000\n50000 50001 50002 50003 50004 50005 50006 50007 50008 50009\n\nSample Output 3\n\n279669259\n\nBe sure to compute the sum modulo 10^{9}+7.", "sample_input": "2 19\n3 7\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03082", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke has a blackboard and a set S consisting of N integers.\nThe i-th element in S is S_i.\n\nHe wrote an integer X on the blackboard, then performed the following operation N times:\n\nChoose one element from S and remove it.\n\nLet x be the number written on the blackboard now, and y be the integer removed from S. Replace the number on the blackboard with x \\bmod {y}.\n\nThere are N! possible orders in which the elements are removed from S.\nFor each of them, find the number that would be written on the blackboard after the N operations, and compute the sum of all those N! numbers modulo 10^{9}+7.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 200\n\n1 \\leq S_i, X \\leq 10^{5}\n\nS_i are pairwise distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nS_1 S_2 \\ldots S_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 19\n3 7\n\nSample Output 1\n\n3\n\nThere are two possible orders in which we remove the numbers from S.\n\nIf we remove 3 and 7 in this order, the number on the blackboard changes as follows: 19 \\rightarrow 1 \\rightarrow 1.\n\nIf we remove 7 and 3 in this order, the number on the blackboard changes as follows: 19 \\rightarrow 5 \\rightarrow 2.\n\nThe output should be the sum of these: 3.\n\nSample Input 2\n\n5 82\n22 11 6 5 13\n\nSample Output 2\n\n288\n\nSample Input 3\n\n10 100000\n50000 50001 50002 50003 50004 50005 50006 50007 50008 50009\n\nSample Output 3\n\n279669259\n\nBe sure to compute the sum modulo 10^{9}+7.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1685, "cpu_time_ms": 2104, "memory_kb": 15104}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s529519016", "group_id": "codeNet:p03085", "input_text": "local a=io.read()\nif a=='A'then\n print('T')\nelseif a=='C'then\n print('G')\nelseif a=='G'then\n print('C')\nelse\n print('A')\nend", "language": "Lua", "metadata": {"date": 1576429925, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03085.html", "problem_id": "p03085", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03085/input.txt", "sample_output_relpath": "derived/input_output/data/p03085/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03085/Lua/s529519016.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s529519016", "user_id": "u373958718"}, "prompt_components": {"gold_output": "T\n", "input_to_evaluate": "local a=io.read()\nif a=='A'then\n print('T')\nelseif a=='C'then\n print('G')\nelseif a=='G'then\n print('C')\nelse\n print('A')\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nOn the Planet AtCoder, there are four types of bases: A, C, G and T. A bonds with T, and C bonds with G.\n\nYou are given a letter b as input, which is A, C, G or T. Write a program that prints the letter representing the base that bonds with the base b.\n\nConstraints\n\nb is one of the letters A, C, G and T.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nb\n\nOutput\n\nPrint the letter representing the base that bonds with the base b.\n\nSample Input 1\n\nA\n\nSample Output 1\n\nT\n\nSample Input 2\n\nG\n\nSample Output 2\n\nC", "sample_input": "A\n"}, "reference_outputs": ["T\n"], "source_document_id": "p03085", "source_text": "Score : 100 points\n\nProblem Statement\n\nOn the Planet AtCoder, there are four types of bases: A, C, G and T. A bonds with T, and C bonds with G.\n\nYou are given a letter b as input, which is A, C, G or T. Write a program that prints the letter representing the base that bonds with the base b.\n\nConstraints\n\nb is one of the letters A, C, G and T.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nb\n\nOutput\n\nPrint the letter representing the base that bonds with the base b.\n\nSample Input 1\n\nA\n\nSample Output 1\n\nT\n\nSample Input 2\n\nG\n\nSample Output 2\n\nC", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 128, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s952662206", "group_id": "codeNet:p03085", "input_text": "c=io.read(\"l\")\nt={}\nt['A']='T'\nt['G']='C'\nt['T']='A'\nt['C']='G'\nprint(t[c])", "language": "Lua", "metadata": {"date": 1553457729, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03085.html", "problem_id": "p03085", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03085/input.txt", "sample_output_relpath": "derived/input_output/data/p03085/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03085/Lua/s952662206.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s952662206", "user_id": "u162773977"}, "prompt_components": {"gold_output": "T\n", "input_to_evaluate": "c=io.read(\"l\")\nt={}\nt['A']='T'\nt['G']='C'\nt['T']='A'\nt['C']='G'\nprint(t[c])", "problem_context": "Score : 100 points\n\nProblem Statement\n\nOn the Planet AtCoder, there are four types of bases: A, C, G and T. A bonds with T, and C bonds with G.\n\nYou are given a letter b as input, which is A, C, G or T. Write a program that prints the letter representing the base that bonds with the base b.\n\nConstraints\n\nb is one of the letters A, C, G and T.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nb\n\nOutput\n\nPrint the letter representing the base that bonds with the base b.\n\nSample Input 1\n\nA\n\nSample Output 1\n\nT\n\nSample Input 2\n\nG\n\nSample Output 2\n\nC", "sample_input": "A\n"}, "reference_outputs": ["T\n"], "source_document_id": "p03085", "source_text": "Score : 100 points\n\nProblem Statement\n\nOn the Planet AtCoder, there are four types of bases: A, C, G and T. A bonds with T, and C bonds with G.\n\nYou are given a letter b as input, which is A, C, G or T. Write a program that prints the letter representing the base that bonds with the base b.\n\nConstraints\n\nb is one of the letters A, C, G and T.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nb\n\nOutput\n\nPrint the letter representing the base that bonds with the base b.\n\nSample Input 1\n\nA\n\nSample Output 1\n\nT\n\nSample Input 2\n\nG\n\nSample Output 2\n\nC", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 75, "cpu_time_ms": 7, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s284092964", "group_id": "codeNet:p03086", "input_text": "local s=io.read()\nlocal t={\"A\",\"G\",\"C\",\"T\"}\nlocal max=0\nlocal len=0\nfor i=1,#s do\n local check=false\n for j=1,4 do\n if s:sub(i,i)==t[j] then\n check=true\n end\n end\n if check then\n len=len+1\n else\n len=0\n end\n max=math.max(max,len)\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1594069099, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03086.html", "problem_id": "p03086", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03086/input.txt", "sample_output_relpath": "derived/input_output/data/p03086/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03086/Lua/s284092964.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s284092964", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local s=io.read()\nlocal t={\"A\",\"G\",\"C\",\"T\"}\nlocal max=0\nlocal len=0\nfor i=1,#s do\n local check=false\n for j=1,4 do\n if s:sub(i,i)==t[j] then\n check=true\n end\n end\n if check then\n len=len+1\n else\n len=0\n end\n max=math.max(max,len)\nend\nprint(max)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of uppercase English letters. Find the length of the longest ACGT string that is a substring (see Notes) of S.\n\nHere, a ACGT string is a string that contains no characters other than A, C, G and T.\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\nS is a string of length between 1 and 10 (inclusive).\n\nEach character in S is an uppercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest ACGT string that is a substring of S.\n\nSample Input 1\n\nATCODER\n\nSample Output 1\n\n3\n\nAmong the ACGT strings that are substrings of ATCODER, the longest one is ATC.\n\nSample Input 2\n\nHATAGAYA\n\nSample Output 2\n\n5\n\nAmong the ACGT strings that are substrings of HATAGAYA, the longest one is ATAGA.\n\nSample Input 3\n\nSHINJUKU\n\nSample Output 3\n\n0\n\nAmong the ACGT strings that are substrings of SHINJUKU, the longest one is (the empty string).", "sample_input": "ATCODER\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03086", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of uppercase English letters. Find the length of the longest ACGT string that is a substring (see Notes) of S.\n\nHere, a ACGT string is a string that contains no characters other than A, C, G and T.\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\nS is a string of length between 1 and 10 (inclusive).\n\nEach character in S is an uppercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest ACGT string that is a substring of S.\n\nSample Input 1\n\nATCODER\n\nSample Output 1\n\n3\n\nAmong the ACGT strings that are substrings of ATCODER, the longest one is ATC.\n\nSample Input 2\n\nHATAGAYA\n\nSample Output 2\n\n5\n\nAmong the ACGT strings that are substrings of HATAGAYA, the longest one is ATAGA.\n\nSample Input 3\n\nSHINJUKU\n\nSample Output 3\n\n0\n\nAmong the ACGT strings that are substrings of SHINJUKU, the longest one is (the empty string).", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 2692}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s349982010", "group_id": "codeNet:p03087", "input_text": "n, q = io.read(\"*n\", \"*n\", \"*l\")\ns = io.read()\nt = {0}\nfor i = 2, n do\n if s:sub(i - 1, i - 1) == \"A\" and s:sub(i, i) == \"C\" then\n t[i] = t[i - 1] + 1\n else\n t[i] = t[i - 1]\n end\nend\n\nfor iq = 1, q do\n l, r = io.read(\"*n\", \"*n\")\n z = t[r]\n if 1 < l then z = z - t[l] end\n print(z)\nend\n", "language": "Lua", "metadata": {"date": 1589626143, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s349982010.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s349982010", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n0\n3\n", "input_to_evaluate": "n, q = io.read(\"*n\", \"*n\", \"*l\")\ns = io.read()\nt = {0}\nfor i = 2, n do\n if s:sub(i - 1, i - 1) == \"A\" and s:sub(i, i) == \"C\" then\n t[i] = t[i - 1] + 1\n else\n t[i] = t[i - 1]\n end\nend\n\nfor iq = 1, q do\n l, r = io.read(\"*n\", \"*n\")\n z = t[r]\n if 1 < l then z = z - t[l] end\n print(z)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 361, "memory_kb": 5012}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s744748800", "group_id": "codeNet:p03087", "input_text": "len, n = io.read(\"*n\", \"*n\", \"*l\")\ns = io.read()\npos = 1\nt = {}\ncur = 0\nwhile(pos <= len) do\n st, lst = string.find(s, \"AC\", pos)\n if(st == nil) then st = len + 1 end\n for i = pos, st - 1 do\n t[i] = cur\n end\n cur = cur + 1\n t[st] = cur\n pos = st + 1\nend\nfor i = 1, n do\n x, y = io.read(\"*n\", \"*n\")\n if(x == 1) then\n print(t[y - 1])\n else\n print(t[y-1] - t[x-1])\n end\nend", "language": "Lua", "metadata": {"date": 1554503776, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s744748800.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s744748800", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n0\n3\n", "input_to_evaluate": "len, n = io.read(\"*n\", \"*n\", \"*l\")\ns = io.read()\npos = 1\nt = {}\ncur = 0\nwhile(pos <= len) do\n st, lst = string.find(s, \"AC\", pos)\n if(st == nil) then st = len + 1 end\n for i = pos, st - 1 do\n t[i] = cur\n end\n cur = cur + 1\n t[st] = cur\n pos = st + 1\nend\nfor i = 1, n do\n x, y = io.read(\"*n\", \"*n\")\n if(x == 1) then\n print(t[y - 1])\n else\n print(t[y-1] - t[x-1])\n end\nend", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 424, "cpu_time_ms": 111, "memory_kb": 2176}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s988409606", "group_id": "codeNet:p03087", "input_text": "n,q=io.read():match(\"(.+)%s(.+)\")\ns=io.read()\npre=nil\ncount={[0]=0}\nix=0\nfor i in s:gmatch(\".\")do\n if pre==\"A\" and i==\"C\" then\n count[ix+1]=count[ix]+1\n else\n count[ix+1]=count[ix]\n end\n pre=i\n ix=ix+1\nend\nfor i=1,q do\n l,r=io.read():match(\"(.+)%s(.+)\")\n print(count[r*1]-count[l*1])\nend", "language": "Lua", "metadata": {"date": 1553458673, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s988409606.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s988409606", "user_id": "u837412668"}, "prompt_components": {"gold_output": "2\n0\n3\n", "input_to_evaluate": "n,q=io.read():match(\"(.+)%s(.+)\")\ns=io.read()\npre=nil\ncount={[0]=0}\nix=0\nfor i in s:gmatch(\".\")do\n if pre==\"A\" and i==\"C\" then\n count[ix+1]=count[ix]+1\n else\n count[ix+1]=count[ix]\n end\n pre=i\n ix=ix+1\nend\nfor i=1,q do\n l,r=io.read():match(\"(.+)%s(.+)\")\n print(count[r*1]-count[l*1])\nend", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 463, "memory_kb": 11028}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s632823806", "group_id": "codeNet:p03089", "input_text": "local n=io.read(\"n\")\nlocal b={}\nfor i=1,n do\n b[i]=io.read(\"n\")\nend\n\nlocal a={}\nfor i=1,n do\n for j=#b,1,-1 do\n if b[j]==j then\n table.remove(b,j)\n a[i]=j\n break\n end\n end\nend\n\nif #a==n then\n for i=1,n do\n print(a[i])\n end\nelse\n print(-1)\nend", "language": "Lua", "metadata": {"date": 1590524149, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03089.html", "problem_id": "p03089", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03089/input.txt", "sample_output_relpath": "derived/input_output/data/p03089/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03089/Lua/s632823806.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s632823806", "user_id": "u045238009"}, "prompt_components": {"gold_output": "1\n1\n2\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal b={}\nfor i=1,n do\n b[i]=io.read(\"n\")\nend\n\nlocal a={}\nfor i=1,n do\n for j=#b,1,-1 do\n if b[j]==j then\n table.remove(b,j)\n a[i]=j\n break\n end\n end\nend\n\nif #a==n then\n for i=1,n do\n print(a[i])\n end\nelse\n print(-1)\nend", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has an empty sequence a.\n\nHe will perform N operations on this sequence.\n\nIn the i-th operation, he chooses an integer j satisfying 1 \\leq j \\leq i, and insert j at position j in a (the beginning is position 1).\n\nYou are given a sequence b of length N. Determine if it is possible that a is equal to b after N operations. If it is, show one possible sequence of operations that achieves it.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq b_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nb_1 \\dots b_N\n\nOutput\n\nIf there is no sequence of N operations after which a would be equal to b, print -1.\nIf there is, print N lines. In the i-th line, the integer chosen in the i-th operation should be printed. If there are multiple solutions, any of them is accepted.\n\nSample Input 1\n\n3\n1 2 1\n\nSample Output 1\n\n1\n1\n2\n\nIn this sequence of operations, the sequence a changes as follows:\n\nAfter the first operation: (1)\n\nAfter the second operation: (1,1)\n\nAfter the third operation: (1,2,1)\n\nSample Input 2\n\n2\n2 2\n\nSample Output 2\n\n-1\n\n2 cannot be inserted at the beginning of the sequence, so this is impossible.\n\nSample Input 3\n\n9\n1 1 1 2 2 1 2 3 2\n\nSample Output 3\n\n1\n2\n2\n3\n1\n2\n2\n1\n1", "sample_input": "3\n1 2 1\n"}, "reference_outputs": ["1\n1\n2\n"], "source_document_id": "p03089", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has an empty sequence a.\n\nHe will perform N operations on this sequence.\n\nIn the i-th operation, he chooses an integer j satisfying 1 \\leq j \\leq i, and insert j at position j in a (the beginning is position 1).\n\nYou are given a sequence b of length N. Determine if it is possible that a is equal to b after N operations. If it is, show one possible sequence of operations that achieves it.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq b_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nb_1 \\dots b_N\n\nOutput\n\nIf there is no sequence of N operations after which a would be equal to b, print -1.\nIf there is, print N lines. In the i-th line, the integer chosen in the i-th operation should be printed. If there are multiple solutions, any of them is accepted.\n\nSample Input 1\n\n3\n1 2 1\n\nSample Output 1\n\n1\n1\n2\n\nIn this sequence of operations, the sequence a changes as follows:\n\nAfter the first operation: (1)\n\nAfter the second operation: (1,1)\n\nAfter the third operation: (1,2,1)\n\nSample Input 2\n\n2\n2 2\n\nSample Output 2\n\n-1\n\n2 cannot be inserted at the beginning of the sequence, so this is impossible.\n\nSample Input 3\n\n9\n1 1 1 2 2 1 2 3 2\n\nSample Output 3\n\n1\n2\n2\n3\n1\n2\n2\n1\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 314, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s657438420", "group_id": "codeNet:p03089", "input_text": "local n = io.read(\"*n\")\nlocal t = {}\nlocal ret = {}\nfor i = 1, n do\n t[i] = io.read(\"*n\")\n ret[i] = 0\nend\nlocal found = false\nfor i = n, 1, -1 do\n found = false\n for k = i, 1, -1 do\n if t[k] == k then\n ret[i] = k\n table.remove(t, k)\n found = true\n break\n end\n end\n if not found then break end\nend\nif not found then print(-1)\nelse\n for i = 1, n do print(ret[i]) end\nend", "language": "Lua", "metadata": {"date": 1563370729, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03089.html", "problem_id": "p03089", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03089/input.txt", "sample_output_relpath": "derived/input_output/data/p03089/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03089/Lua/s657438420.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s657438420", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n1\n2\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal t = {}\nlocal ret = {}\nfor i = 1, n do\n t[i] = io.read(\"*n\")\n ret[i] = 0\nend\nlocal found = false\nfor i = n, 1, -1 do\n found = false\n for k = i, 1, -1 do\n if t[k] == k then\n ret[i] = k\n table.remove(t, k)\n found = true\n break\n end\n end\n if not found then break end\nend\nif not found then print(-1)\nelse\n for i = 1, n do print(ret[i]) end\nend", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has an empty sequence a.\n\nHe will perform N operations on this sequence.\n\nIn the i-th operation, he chooses an integer j satisfying 1 \\leq j \\leq i, and insert j at position j in a (the beginning is position 1).\n\nYou are given a sequence b of length N. Determine if it is possible that a is equal to b after N operations. If it is, show one possible sequence of operations that achieves it.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq b_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nb_1 \\dots b_N\n\nOutput\n\nIf there is no sequence of N operations after which a would be equal to b, print -1.\nIf there is, print N lines. In the i-th line, the integer chosen in the i-th operation should be printed. If there are multiple solutions, any of them is accepted.\n\nSample Input 1\n\n3\n1 2 1\n\nSample Output 1\n\n1\n1\n2\n\nIn this sequence of operations, the sequence a changes as follows:\n\nAfter the first operation: (1)\n\nAfter the second operation: (1,1)\n\nAfter the third operation: (1,2,1)\n\nSample Input 2\n\n2\n2 2\n\nSample Output 2\n\n-1\n\n2 cannot be inserted at the beginning of the sequence, so this is impossible.\n\nSample Input 3\n\n9\n1 1 1 2 2 1 2 3 2\n\nSample Output 3\n\n1\n2\n2\n3\n1\n2\n2\n1\n1", "sample_input": "3\n1 2 1\n"}, "reference_outputs": ["1\n1\n2\n"], "source_document_id": "p03089", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has an empty sequence a.\n\nHe will perform N operations on this sequence.\n\nIn the i-th operation, he chooses an integer j satisfying 1 \\leq j \\leq i, and insert j at position j in a (the beginning is position 1).\n\nYou are given a sequence b of length N. Determine if it is possible that a is equal to b after N operations. If it is, show one possible sequence of operations that achieves it.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq b_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nb_1 \\dots b_N\n\nOutput\n\nIf there is no sequence of N operations after which a would be equal to b, print -1.\nIf there is, print N lines. In the i-th line, the integer chosen in the i-th operation should be printed. If there are multiple solutions, any of them is accepted.\n\nSample Input 1\n\n3\n1 2 1\n\nSample Output 1\n\n1\n1\n2\n\nIn this sequence of operations, the sequence a changes as follows:\n\nAfter the first operation: (1)\n\nAfter the second operation: (1,1)\n\nAfter the third operation: (1,2,1)\n\nSample Input 2\n\n2\n2 2\n\nSample Output 2\n\n-1\n\n2 cannot be inserted at the beginning of the sequence, so this is impossible.\n\nSample Input 3\n\n9\n1 1 1 2 2 1 2 3 2\n\nSample Output 3\n\n1\n2\n2\n3\n1\n2\n2\n1\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 401, "cpu_time_ms": 7, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s870963994", "group_id": "codeNet:p03089", "input_text": "local N = io.read(\"n\")\nlocal b = {}\nfor i=1,N do\n b[i] = io.read(\"n\")\nend\nlocal ans = {}\n\nfor i=N,1,-1 do\n for jj=i,1,-1 do\n if b[jj] == jj then\n table.remove(b, jj)\n ans[i] = jj\n break\n end\n end\n if ans[i] == nil then\n print(-1)\n return\n end\nend\n\nfor i=1,N do\n print(ans[i])\nend\n", "language": "Lua", "metadata": {"date": 1553376530, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03089.html", "problem_id": "p03089", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03089/input.txt", "sample_output_relpath": "derived/input_output/data/p03089/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03089/Lua/s870963994.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s870963994", "user_id": "u162773977"}, "prompt_components": {"gold_output": "1\n1\n2\n", "input_to_evaluate": "local N = io.read(\"n\")\nlocal b = {}\nfor i=1,N do\n b[i] = io.read(\"n\")\nend\nlocal ans = {}\n\nfor i=N,1,-1 do\n for jj=i,1,-1 do\n if b[jj] == jj then\n table.remove(b, jj)\n ans[i] = jj\n break\n end\n end\n if ans[i] == nil then\n print(-1)\n return\n end\nend\n\nfor i=1,N do\n print(ans[i])\nend\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has an empty sequence a.\n\nHe will perform N operations on this sequence.\n\nIn the i-th operation, he chooses an integer j satisfying 1 \\leq j \\leq i, and insert j at position j in a (the beginning is position 1).\n\nYou are given a sequence b of length N. Determine if it is possible that a is equal to b after N operations. If it is, show one possible sequence of operations that achieves it.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq b_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nb_1 \\dots b_N\n\nOutput\n\nIf there is no sequence of N operations after which a would be equal to b, print -1.\nIf there is, print N lines. In the i-th line, the integer chosen in the i-th operation should be printed. If there are multiple solutions, any of them is accepted.\n\nSample Input 1\n\n3\n1 2 1\n\nSample Output 1\n\n1\n1\n2\n\nIn this sequence of operations, the sequence a changes as follows:\n\nAfter the first operation: (1)\n\nAfter the second operation: (1,1)\n\nAfter the third operation: (1,2,1)\n\nSample Input 2\n\n2\n2 2\n\nSample Output 2\n\n-1\n\n2 cannot be inserted at the beginning of the sequence, so this is impossible.\n\nSample Input 3\n\n9\n1 1 1 2 2 1 2 3 2\n\nSample Output 3\n\n1\n2\n2\n3\n1\n2\n2\n1\n1", "sample_input": "3\n1 2 1\n"}, "reference_outputs": ["1\n1\n2\n"], "source_document_id": "p03089", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has an empty sequence a.\n\nHe will perform N operations on this sequence.\n\nIn the i-th operation, he chooses an integer j satisfying 1 \\leq j \\leq i, and insert j at position j in a (the beginning is position 1).\n\nYou are given a sequence b of length N. Determine if it is possible that a is equal to b after N operations. If it is, show one possible sequence of operations that achieves it.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq b_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nb_1 \\dots b_N\n\nOutput\n\nIf there is no sequence of N operations after which a would be equal to b, print -1.\nIf there is, print N lines. In the i-th line, the integer chosen in the i-th operation should be printed. If there are multiple solutions, any of them is accepted.\n\nSample Input 1\n\n3\n1 2 1\n\nSample Output 1\n\n1\n1\n2\n\nIn this sequence of operations, the sequence a changes as follows:\n\nAfter the first operation: (1)\n\nAfter the second operation: (1,1)\n\nAfter the third operation: (1,2,1)\n\nSample Input 2\n\n2\n2 2\n\nSample Output 2\n\n-1\n\n2 cannot be inserted at the beginning of the sequence, so this is impossible.\n\nSample Input 3\n\n9\n1 1 1 2 2 1 2 3 2\n\nSample Output 3\n\n1\n2\n2\n3\n1\n2\n2\n1\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 359, "cpu_time_ms": 8, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s598354391", "group_id": "codeNet:p03090", "input_text": "local N = io.read(\"n\")\n\nlocal edges = {}\n\nif N % 2 == 1 then\n for i=1,N do\n for j=i+1,N do\n if j ~= N-i then\n table.insert(edges , tostring(i) .. \" \" .. tostring(j))\n end\n end\n end\nelse\n for i=1,N do\n for j=i+1,N do\n if j ~= N+1-i then\n table.insert(edges , tostring(i) .. \" \" .. tostring(j))\n end\n end\n end\nend\n\n\nprint(#edges)\nfor _,v in pairs(edges) do\n print(v)\nend\n\n", "language": "Lua", "metadata": {"date": 1553381299, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s598354391.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s598354391", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\n1 3\n2 3\n", "input_to_evaluate": "local N = io.read(\"n\")\n\nlocal edges = {}\n\nif N % 2 == 1 then\n for i=1,N do\n for j=i+1,N do\n if j ~= N-i then\n table.insert(edges , tostring(i) .. \" \" .. tostring(j))\n end\n end\n end\nelse\n for i=1,N do\n for j=i+1,N do\n if j ~= N+1-i then\n table.insert(edges , tostring(i) .. \" \" .. tostring(j))\n end\n end\n end\nend\n\n\nprint(#edges)\nfor _,v in pairs(edges) do\n print(v)\nend\n\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 14, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s745992672", "group_id": "codeNet:p03095", "input_text": "local n=io.read(\"n\",\"l\")\nlocal t={}\nfor a,_ in utf8.codes(io.read()) do\n if not t[a] then\n t[a]=1\n else\n t[a]=t[a]+1\n end\nend\n\nlocal combination=1\nfor _,frequency in pairs(t) do\n combination=combination*(frequency+1)%1000000007\nend\nprint(combination-1)", "language": "Lua", "metadata": {"date": 1590482533, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03095.html", "problem_id": "p03095", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03095/input.txt", "sample_output_relpath": "derived/input_output/data/p03095/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03095/Lua/s745992672.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s745992672", "user_id": "u045238009"}, "prompt_components": {"gold_output": "15\n", "input_to_evaluate": "local n=io.read(\"n\",\"l\")\nlocal t={}\nfor a,_ in utf8.codes(io.read()) do\n if not t[a] then\n t[a]=1\n else\n t[a]=t[a]+1\n end\nend\n\nlocal combination=1\nfor _,frequency in pairs(t) do\n combination=combination*(frequency+1)%1000000007\nend\nprint(combination-1)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N.\nAmong its subsequences, count the ones such that all characters are different, modulo 10^9+7. Two subsequences are considered different if their characters come from different positions in the string, even if they are the same as strings.\n\nHere, a subsequence of a string is a concatenation of one or more characters from the string without changing the order.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\nS consists of lowercase English letters.\n\n|S|=N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of the subsequences such that all characters are different, modulo 10^9+7.\n\nSample Input 1\n\n4\nabcd\n\nSample Output 1\n\n15\n\nSince all characters in S itself are different, all its subsequences satisfy the condition.\n\nSample Input 2\n\n3\nbaa\n\nSample Output 2\n\n5\n\nThe answer is five: b, two occurrences of a, two occurrences of ba. Note that we do not count baa, since it contains two as.\n\nSample Input 3\n\n5\nabcab\n\nSample Output 3\n\n17", "sample_input": "4\nabcd\n"}, "reference_outputs": ["15\n"], "source_document_id": "p03095", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N.\nAmong its subsequences, count the ones such that all characters are different, modulo 10^9+7. Two subsequences are considered different if their characters come from different positions in the string, even if they are the same as strings.\n\nHere, a subsequence of a string is a concatenation of one or more characters from the string without changing the order.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\nS consists of lowercase English letters.\n\n|S|=N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of the subsequences such that all characters are different, modulo 10^9+7.\n\nSample Input 1\n\n4\nabcd\n\nSample Output 1\n\n15\n\nSince all characters in S itself are different, all its subsequences satisfy the condition.\n\nSample Input 2\n\n3\nbaa\n\nSample Output 2\n\n5\n\nThe answer is five: b, two occurrences of a, two occurrences of ba. Note that we do not count baa, since it contains two as.\n\nSample Input 3\n\n5\nabcab\n\nSample Output 3\n\n17", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 17, "memory_kb": 2580}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s945271854", "group_id": "codeNet:p03095", "input_text": "local n=io.read(\"n\",\"l\")\nlocal s=io.read()\n\nlocal t={}\nfor i=1,n do\n local a=s:sub(i,i)\n if not t[a] then\n t[a]=1\n else\n t[a]=t[a]+1\n end\nend\n\nlocal combination=1\nfor a,frequency in pairs(t) do\n combination=combination*(frequency+1)\nend\nprint(combination-1)", "language": "Lua", "metadata": {"date": 1590482154, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03095.html", "problem_id": "p03095", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03095/input.txt", "sample_output_relpath": "derived/input_output/data/p03095/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03095/Lua/s945271854.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s945271854", "user_id": "u045238009"}, "prompt_components": {"gold_output": "15\n", "input_to_evaluate": "local n=io.read(\"n\",\"l\")\nlocal s=io.read()\n\nlocal t={}\nfor i=1,n do\n local a=s:sub(i,i)\n if not t[a] then\n t[a]=1\n else\n t[a]=t[a]+1\n end\nend\n\nlocal combination=1\nfor a,frequency in pairs(t) do\n combination=combination*(frequency+1)\nend\nprint(combination-1)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N.\nAmong its subsequences, count the ones such that all characters are different, modulo 10^9+7. Two subsequences are considered different if their characters come from different positions in the string, even if they are the same as strings.\n\nHere, a subsequence of a string is a concatenation of one or more characters from the string without changing the order.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\nS consists of lowercase English letters.\n\n|S|=N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of the subsequences such that all characters are different, modulo 10^9+7.\n\nSample Input 1\n\n4\nabcd\n\nSample Output 1\n\n15\n\nSince all characters in S itself are different, all its subsequences satisfy the condition.\n\nSample Input 2\n\n3\nbaa\n\nSample Output 2\n\n5\n\nThe answer is five: b, two occurrences of a, two occurrences of ba. Note that we do not count baa, since it contains two as.\n\nSample Input 3\n\n5\nabcab\n\nSample Output 3\n\n17", "sample_input": "4\nabcd\n"}, "reference_outputs": ["15\n"], "source_document_id": "p03095", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N.\nAmong its subsequences, count the ones such that all characters are different, modulo 10^9+7. Two subsequences are considered different if their characters come from different positions in the string, even if they are the same as strings.\n\nHere, a subsequence of a string is a concatenation of one or more characters from the string without changing the order.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\nS consists of lowercase English letters.\n\n|S|=N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of the subsequences such that all characters are different, modulo 10^9+7.\n\nSample Input 1\n\n4\nabcd\n\nSample Output 1\n\n15\n\nSince all characters in S itself are different, all its subsequences satisfy the condition.\n\nSample Input 2\n\n3\nbaa\n\nSample Output 2\n\n5\n\nThe answer is five: b, two occurrences of a, two occurrences of ba. Note that we do not count baa, since it contains two as.\n\nSample Input 3\n\n5\nabcab\n\nSample Output 3\n\n17", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 286, "cpu_time_ms": 26, "memory_kb": 1008}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s985520380", "group_id": "codeNet:p03095", "input_text": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal t = {}\nfor i = 1, 26 do t[i] = 0 end\nfor i = 1, n do\n local p = s:sub(i, i):byte() - 96\n t[p] = t[p] + 1\nend\nlocal ret = 1\nfor i = 1, 26 do\n ret = (ret * (1 + t[i])) % 1000000007\nend\nprint(ret - 1)\n", "language": "Lua", "metadata": {"date": 1563307901, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03095.html", "problem_id": "p03095", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03095/input.txt", "sample_output_relpath": "derived/input_output/data/p03095/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03095/Lua/s985520380.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s985520380", "user_id": "u120582723"}, "prompt_components": {"gold_output": "15\n", "input_to_evaluate": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal t = {}\nfor i = 1, 26 do t[i] = 0 end\nfor i = 1, n do\n local p = s:sub(i, i):byte() - 96\n t[p] = t[p] + 1\nend\nlocal ret = 1\nfor i = 1, 26 do\n ret = (ret * (1 + t[i])) % 1000000007\nend\nprint(ret - 1)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N.\nAmong its subsequences, count the ones such that all characters are different, modulo 10^9+7. Two subsequences are considered different if their characters come from different positions in the string, even if they are the same as strings.\n\nHere, a subsequence of a string is a concatenation of one or more characters from the string without changing the order.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\nS consists of lowercase English letters.\n\n|S|=N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of the subsequences such that all characters are different, modulo 10^9+7.\n\nSample Input 1\n\n4\nabcd\n\nSample Output 1\n\n15\n\nSince all characters in S itself are different, all its subsequences satisfy the condition.\n\nSample Input 2\n\n3\nbaa\n\nSample Output 2\n\n5\n\nThe answer is five: b, two occurrences of a, two occurrences of ba. Note that we do not count baa, since it contains two as.\n\nSample Input 3\n\n5\nabcab\n\nSample Output 3\n\n17", "sample_input": "4\nabcd\n"}, "reference_outputs": ["15\n"], "source_document_id": "p03095", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N.\nAmong its subsequences, count the ones such that all characters are different, modulo 10^9+7. Two subsequences are considered different if their characters come from different positions in the string, even if they are the same as strings.\n\nHere, a subsequence of a string is a concatenation of one or more characters from the string without changing the order.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\nS consists of lowercase English letters.\n\n|S|=N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of the subsequences such that all characters are different, modulo 10^9+7.\n\nSample Input 1\n\n4\nabcd\n\nSample Output 1\n\n15\n\nSince all characters in S itself are different, all its subsequences satisfy the condition.\n\nSample Input 2\n\n3\nbaa\n\nSample Output 2\n\n5\n\nThe answer is five: b, two occurrences of a, two occurrences of ba. Note that we do not count baa, since it contains two as.\n\nSample Input 3\n\n5\nabcab\n\nSample Output 3\n\n17", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 257, "cpu_time_ms": 32, "memory_kb": 1008}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s774871304", "group_id": "codeNet:p03095", "input_text": "local n, s = io.read(\"l\",\"l\")\nlocal cnt = {}\nfor i = 1, n do\n local ch = string.sub(s, i, i)\n cnt[ch] = (cnt[ch] or 1) + 1\nend\nlocal ans, mof = 1, 1000000007\nfor _, v in pairs(cnt) do\n ans = ans * v % mof\nend\nprint((ans + mof - 1) % mof)\n", "language": "Lua", "metadata": {"date": 1553347018, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03095.html", "problem_id": "p03095", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03095/input.txt", "sample_output_relpath": "derived/input_output/data/p03095/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03095/Lua/s774871304.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s774871304", "user_id": "u914762730"}, "prompt_components": {"gold_output": "15\n", "input_to_evaluate": "local n, s = io.read(\"l\",\"l\")\nlocal cnt = {}\nfor i = 1, n do\n local ch = string.sub(s, i, i)\n cnt[ch] = (cnt[ch] or 1) + 1\nend\nlocal ans, mof = 1, 1000000007\nfor _, v in pairs(cnt) do\n ans = ans * v % mof\nend\nprint((ans + mof - 1) % mof)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N.\nAmong its subsequences, count the ones such that all characters are different, modulo 10^9+7. Two subsequences are considered different if their characters come from different positions in the string, even if they are the same as strings.\n\nHere, a subsequence of a string is a concatenation of one or more characters from the string without changing the order.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\nS consists of lowercase English letters.\n\n|S|=N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of the subsequences such that all characters are different, modulo 10^9+7.\n\nSample Input 1\n\n4\nabcd\n\nSample Output 1\n\n15\n\nSince all characters in S itself are different, all its subsequences satisfy the condition.\n\nSample Input 2\n\n3\nbaa\n\nSample Output 2\n\n5\n\nThe answer is five: b, two occurrences of a, two occurrences of ba. Note that we do not count baa, since it contains two as.\n\nSample Input 3\n\n5\nabcab\n\nSample Output 3\n\n17", "sample_input": "4\nabcd\n"}, "reference_outputs": ["15\n"], "source_document_id": "p03095", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N.\nAmong its subsequences, count the ones such that all characters are different, modulo 10^9+7. Two subsequences are considered different if their characters come from different positions in the string, even if they are the same as strings.\n\nHere, a subsequence of a string is a concatenation of one or more characters from the string without changing the order.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\nS consists of lowercase English letters.\n\n|S|=N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of the subsequences such that all characters are different, modulo 10^9+7.\n\nSample Input 1\n\n4\nabcd\n\nSample Output 1\n\n15\n\nSince all characters in S itself are different, all its subsequences satisfy the condition.\n\nSample Input 2\n\n3\nbaa\n\nSample Output 2\n\n5\n\nThe answer is five: b, two occurrences of a, two occurrences of ba. Note that we do not count baa, since it contains two as.\n\nSample Input 3\n\n5\nabcab\n\nSample Output 3\n\n17", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 247, "cpu_time_ms": 218, "memory_kb": 1008}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s834625944", "group_id": "codeNet:p03095", "input_text": "local DBG = false\nfunction dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nfunction dbgpr_t(tbl)\n if DBG then\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in ipairs(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\nfunction dbgpr_tp(tbl)\n if DBG then\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in pairs(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\n------------------------------------\nlocal MOD = 1000000007\nlocal AA, ZZ = 97, 122\nlocal alpha_count = {}\nfor i=AA,ZZ,1 do\n alpha_count[i] = 0\nend\nlocal N = io.read(\"n\", \"l\")\nlocal S = io.read(\"l\")\nlocal s_tbl = {string.byte(S, 1, #S)}\nfor _,v in ipairs(s_tbl) do\n alpha_count[v] = alpha_count[v] + 1\nend\ndbgpr_tp(alpha_count)\n\nlocal answer = 1\nfor i=AA,ZZ,1 do\n local place_cnt = alpha_count[i]\n if place_cnt == 0 then\n elseif place_cnt == 1 then\n answer = (answer * 2) % MOD\n else\n -- place_cnt >= 2\n local alphai_combs = 1 + place_cnt\n answer = (answer * alphai_combs) % MOD\n end\nend\nanswer = (answer - 1) % MOD\nprint(answer)", "language": "Lua", "metadata": {"date": 1552772679, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03095.html", "problem_id": "p03095", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03095/input.txt", "sample_output_relpath": "derived/input_output/data/p03095/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03095/Lua/s834625944.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s834625944", "user_id": "u162773977"}, "prompt_components": {"gold_output": "15\n", "input_to_evaluate": "local DBG = false\nfunction dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nfunction dbgpr_t(tbl)\n if DBG then\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in ipairs(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\nfunction dbgpr_tp(tbl)\n if DBG then\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in pairs(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\n------------------------------------\nlocal MOD = 1000000007\nlocal AA, ZZ = 97, 122\nlocal alpha_count = {}\nfor i=AA,ZZ,1 do\n alpha_count[i] = 0\nend\nlocal N = io.read(\"n\", \"l\")\nlocal S = io.read(\"l\")\nlocal s_tbl = {string.byte(S, 1, #S)}\nfor _,v in ipairs(s_tbl) do\n alpha_count[v] = alpha_count[v] + 1\nend\ndbgpr_tp(alpha_count)\n\nlocal answer = 1\nfor i=AA,ZZ,1 do\n local place_cnt = alpha_count[i]\n if place_cnt == 0 then\n elseif place_cnt == 1 then\n answer = (answer * 2) % MOD\n else\n -- place_cnt >= 2\n local alphai_combs = 1 + place_cnt\n answer = (answer * alphai_combs) % MOD\n end\nend\nanswer = (answer - 1) % MOD\nprint(answer)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N.\nAmong its subsequences, count the ones such that all characters are different, modulo 10^9+7. Two subsequences are considered different if their characters come from different positions in the string, even if they are the same as strings.\n\nHere, a subsequence of a string is a concatenation of one or more characters from the string without changing the order.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\nS consists of lowercase English letters.\n\n|S|=N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of the subsequences such that all characters are different, modulo 10^9+7.\n\nSample Input 1\n\n4\nabcd\n\nSample Output 1\n\n15\n\nSince all characters in S itself are different, all its subsequences satisfy the condition.\n\nSample Input 2\n\n3\nbaa\n\nSample Output 2\n\n5\n\nThe answer is five: b, two occurrences of a, two occurrences of ba. Note that we do not count baa, since it contains two as.\n\nSample Input 3\n\n5\nabcab\n\nSample Output 3\n\n17", "sample_input": "4\nabcd\n"}, "reference_outputs": ["15\n"], "source_document_id": "p03095", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N.\nAmong its subsequences, count the ones such that all characters are different, modulo 10^9+7. Two subsequences are considered different if their characters come from different positions in the string, even if they are the same as strings.\n\nHere, a subsequence of a string is a concatenation of one or more characters from the string without changing the order.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\nS consists of lowercase English letters.\n\n|S|=N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of the subsequences such that all characters are different, modulo 10^9+7.\n\nSample Input 1\n\n4\nabcd\n\nSample Output 1\n\n15\n\nSince all characters in S itself are different, all its subsequences satisfy the condition.\n\nSample Input 2\n\n3\nbaa\n\nSample Output 2\n\n5\n\nThe answer is five: b, two occurrences of a, two occurrences of ba. Note that we do not count baa, since it contains two as.\n\nSample Input 3\n\n5\nabcab\n\nSample Output 3\n\n17", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1329, "cpu_time_ms": 17, "memory_kb": 3980}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s848119390", "group_id": "codeNet:p03096", "input_text": "local n = io.read(\"n\")\nlocal colpos, col, dp= {}, {}, {}\nlocal last = -1\nmof = 1000000000+7\nfor i = 1, n do\n local x = io.read(\"n\")\n if last ~= x then\n col[#col+1] = x\n dp[#col] = {0, 0}\n colpos[x] = colpos[x] or {head = 1}\n colpos[x][#colpos[x] + 1] = #col\n last = x\n end\nend\nn = #col\ndp[1][1] = 1\nfor i = 1, n do\n local x = col[i]\n local last_pos = colpos[x][colpos[x].head]\n -- update break now\n dp[i][1] = dp[i][1] + dp[last_pos][2]\n -- update break next\n if i < n then\n dp[i+1][1] = dp[i+1][1] + dp[i][1]\n end\n -- update keep going begin\n dp[i][2] = dp[last_pos][2] + dp[i][1] -- from hitory or from now\n\n dp[i][1] = dp[i][1] % mof\n dp[i][2] = dp[i][2] % mof\n if last_pos ~= i then\n colpos[x].head = colpos[x].head + 1\n end\n --print(string.format(\"dp[%d] = {%d,%d}; col = %d\", i,dp[i][1],dp[i][2], col[i]))\nend\nprint(dp[n][1])", "language": "Lua", "metadata": {"date": 1553353618, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s848119390.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s848119390", "user_id": "u914762730"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local n = io.read(\"n\")\nlocal colpos, col, dp= {}, {}, {}\nlocal last = -1\nmof = 1000000000+7\nfor i = 1, n do\n local x = io.read(\"n\")\n if last ~= x then\n col[#col+1] = x\n dp[#col] = {0, 0}\n colpos[x] = colpos[x] or {head = 1}\n colpos[x][#colpos[x] + 1] = #col\n last = x\n end\nend\nn = #col\ndp[1][1] = 1\nfor i = 1, n do\n local x = col[i]\n local last_pos = colpos[x][colpos[x].head]\n -- update break now\n dp[i][1] = dp[i][1] + dp[last_pos][2]\n -- update break next\n if i < n then\n dp[i+1][1] = dp[i+1][1] + dp[i][1]\n end\n -- update keep going begin\n dp[i][2] = dp[last_pos][2] + dp[i][1] -- from hitory or from now\n\n dp[i][1] = dp[i][1] % mof\n dp[i][2] = dp[i][2] % mof\n if last_pos ~= i then\n colpos[x].head = colpos[x].head + 1\n end\n --print(string.format(\"dp[%d] = {%d,%d}; col = %d\", i,dp[i][1],dp[i][2], col[i]))\nend\nprint(dp[n][1])", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 931, "cpu_time_ms": 512, "memory_kb": 62560}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s037606814", "group_id": "codeNet:p03096", "input_text": "local MOD = 1000000007\nlocal N = io.read(\"n\")\nlocal C = {}\nfor i=1,N do\n C[i] = io.read(\"n\")\nend\n\nlocal dp = {}\nlocal last_pos = {}\ndp[0] = 1\nfor i=1,N do\n if C[i] == C[i-1] then\n -- No stone between i-1 and i\n dp[i] = dp[i-1]\n else\n local c = C[i]\n if last_pos[c] then\n -- Stones from (last_pos[c], i) are reversible.\n -- Not reverse: dp[i-1]\n -- Reverse: dp[last_pos[c]]\n dp[i] = dp[i-1] + dp[last_pos[c]]\n else\n -- Can't reverse stone because this is first appearance of c\n dp[i] = dp[i-1]\n end\n last_pos[c] = i\n end\n --print(i,C[i],dp[i])\n dp[i] = dp[i] % MOD\nend\nprint(dp[N])\n", "language": "Lua", "metadata": {"date": 1552834331, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s037606814.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s037606814", "user_id": "u162773977"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local MOD = 1000000007\nlocal N = io.read(\"n\")\nlocal C = {}\nfor i=1,N do\n C[i] = io.read(\"n\")\nend\n\nlocal dp = {}\nlocal last_pos = {}\ndp[0] = 1\nfor i=1,N do\n if C[i] == C[i-1] then\n -- No stone between i-1 and i\n dp[i] = dp[i-1]\n else\n local c = C[i]\n if last_pos[c] then\n -- Stones from (last_pos[c], i) are reversible.\n -- Not reverse: dp[i-1]\n -- Reverse: dp[last_pos[c]]\n dp[i] = dp[i-1] + dp[last_pos[c]]\n else\n -- Can't reverse stone because this is first appearance of c\n dp[i] = dp[i-1]\n end\n last_pos[c] = i\n end\n --print(i,C[i],dp[i])\n dp[i] = dp[i] % MOD\nend\nprint(dp[N])\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nThere are N stones arranged in a row. The i-th stone from the left is painted in the color C_i.\n\nSnuke will perform the following operation zero or more times:\n\nChoose two stones painted in the same color. Repaint all the stones between them, with the color of the chosen stones.\n\nFind the number of possible final sequences of colors of the stones, modulo 10^9+7.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq C_i \\leq 2\\times 10^5(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nC_1\n:\nC_N\n\nOutput\n\nPrint the number of possible final sequences of colors of the stones, modulo 10^9+7.\n\nSample Input 1\n\n5\n1\n2\n1\n2\n2\n\nSample Output 1\n\n3\n\nWe can make three sequences of colors of stones, as follows:\n\n(1,2,1,2,2), by doing nothing.\n\n(1,1,1,2,2), by choosing the first and third stones to perform the operation.\n\n(1,2,2,2,2), by choosing the second and fourth stones to perform the operation.\n\nSample Input 2\n\n6\n4\n2\n5\n4\n2\n4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n7\n1\n3\n1\n2\n3\n3\n2\n\nSample Output 3\n\n5", "sample_input": "5\n1\n2\n1\n2\n2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03096", "source_text": "Score : 700 points\n\nProblem Statement\n\nThere are N stones arranged in a row. The i-th stone from the left is painted in the color C_i.\n\nSnuke will perform the following operation zero or more times:\n\nChoose two stones painted in the same color. Repaint all the stones between them, with the color of the chosen stones.\n\nFind the number of possible final sequences of colors of the stones, modulo 10^9+7.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq C_i \\leq 2\\times 10^5(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nC_1\n:\nC_N\n\nOutput\n\nPrint the number of possible final sequences of colors of the stones, modulo 10^9+7.\n\nSample Input 1\n\n5\n1\n2\n1\n2\n2\n\nSample Output 1\n\n3\n\nWe can make three sequences of colors of stones, as follows:\n\n(1,2,1,2,2), by doing nothing.\n\n(1,1,1,2,2), by choosing the first and third stones to perform the operation.\n\n(1,2,2,2,2), by choosing the second and fourth stones to perform the operation.\n\nSample Input 2\n\n6\n4\n2\n5\n4\n2\n4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n7\n1\n3\n1\n2\n3\n3\n2\n\nSample Output 3\n\n5", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 117, "memory_kb": 16868}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s079791857", "group_id": "codeNet:p03101", "input_text": "a, b = io.read(\"*n\", \"*n\")\nq, w = io.read(\"*n\", \"*n\")\nprint((a - q) * (b - w))\n", "language": "Lua", "metadata": {"date": 1589651031, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s079791857.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s079791857", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "a, b = io.read(\"*n\", \"*n\")\nq, w = io.read(\"*n\", \"*n\")\nprint((a - q) * (b - w))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are H rows and W columns of white square cells.\n\nYou will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns.\n\nHow many white cells will remain?\n\nIt can be proved that this count does not depend on what rows and columns are chosen.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 20\n\n1 \\leq h \\leq H\n\n1 \\leq w \\leq W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nh w\n\nOutput\n\nPrint the number of white cells that will remain.\n\nSample Input 1\n\n3 2\n2 1\n\nSample Output 1\n\n1\n\nThere are 3 rows and 2 columns of cells. When two rows and one column are chosen and painted in black, there is always one white cell that remains.\n\nSample Input 2\n\n5 5\n2 3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2 4\n2 4\n\nSample Output 3\n\n0", "sample_input": "3 2\n2 1\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03101", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are H rows and W columns of white square cells.\n\nYou will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns.\n\nHow many white cells will remain?\n\nIt can be proved that this count does not depend on what rows and columns are chosen.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 20\n\n1 \\leq h \\leq H\n\n1 \\leq w \\leq W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nh w\n\nOutput\n\nPrint the number of white cells that will remain.\n\nSample Input 1\n\n3 2\n2 1\n\nSample Output 1\n\n1\n\nThere are 3 rows and 2 columns of cells. When two rows and one column are chosen and painted in black, there is always one white cell that remains.\n\nSample Input 2\n\n5 5\n2 3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2 4\n2 4\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s699902996", "group_id": "codeNet:p03101", "input_text": "H,W,h,w=io.read(\"*n\",\"n\",\"*n\",\"n\")\nprint((H-h)*(W-w))", "language": "Lua", "metadata": {"date": 1579339933, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s699902996.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s699902996", "user_id": "u720483676"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "H,W,h,w=io.read(\"*n\",\"n\",\"*n\",\"n\")\nprint((H-h)*(W-w))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 53, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s968211006", "group_id": "codeNet:p03103", "input_text": "local DBG = false\nfunction dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nfunction dbgpr_t(tbl)\n if DBG then\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in ipairs(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\nfunction dbgpr_t2d(tbl2d)\n if DBG then\n dbgpr(tbl2d)\n for i,t in ipairs(tbl2d) do\n io.write(\"[dbg]\")\n for j,v in ipairs(t) do\n io.write(\"(\" .. tostring(i) .. \",\" .. tostring(j) .. \"): \")\n io.write(tostring(v))\n io.write(\"; \")\n end\n print(\"\")\n end\n end\nend\nfunction create_tbl(a, initial)\n local tbl = {}\n for i=1,a do\n tbl[i] = initial\n end\n return tbl\nend\n\nfunction create_2d_tbl(a, b, initial)\n local tbl = {}\n for i=1,a do\n local t = {}\n for j=1,b do\n t[j] = initial\n end\n tbl[i] = t\n end\n return tbl\nend\n\nfunction parse_problem()\n local N, M = io.read(\"n\", \"n\")\n local stores = {}\n for i=1,N do\n local a, b = io.read(\"n\", \"n\")\n stores[i] = {a, b}\n end\n table.sort(stores, function (x, y) return x[1] < y[1] end)\n return N, M, stores\nend\n\nfunction main()\n local N, M, stores = parse_problem()\n dbgpr(N, M)\n dbgpr(\"====stores\")\n dbgpr_t2d(stores)\n local remain = M\n local total_price = 0\n local idx = 1\n while remain > 0 do\n local unit_price, stock = stores[idx][1], stores[idx][2]\n local units = stock\n if remain - units < 0 then\n units = remain\n end\n total_price = total_price + unit_price * units\n remain = remain - units\n dbgpr(idx, remain)\n idx = idx + 1\n end\n print(total_price)\nend\n\nmain()\n", "language": "Lua", "metadata": {"date": 1552162870, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s968211006.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s968211006", "user_id": "u162773977"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "local DBG = false\nfunction dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nfunction dbgpr_t(tbl)\n if DBG then\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in ipairs(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\nfunction dbgpr_t2d(tbl2d)\n if DBG then\n dbgpr(tbl2d)\n for i,t in ipairs(tbl2d) do\n io.write(\"[dbg]\")\n for j,v in ipairs(t) do\n io.write(\"(\" .. tostring(i) .. \",\" .. tostring(j) .. \"): \")\n io.write(tostring(v))\n io.write(\"; \")\n end\n print(\"\")\n end\n end\nend\nfunction create_tbl(a, initial)\n local tbl = {}\n for i=1,a do\n tbl[i] = initial\n end\n return tbl\nend\n\nfunction create_2d_tbl(a, b, initial)\n local tbl = {}\n for i=1,a do\n local t = {}\n for j=1,b do\n t[j] = initial\n end\n tbl[i] = t\n end\n return tbl\nend\n\nfunction parse_problem()\n local N, M = io.read(\"n\", \"n\")\n local stores = {}\n for i=1,N do\n local a, b = io.read(\"n\", \"n\")\n stores[i] = {a, b}\n end\n table.sort(stores, function (x, y) return x[1] < y[1] end)\n return N, M, stores\nend\n\nfunction main()\n local N, M, stores = parse_problem()\n dbgpr(N, M)\n dbgpr(\"====stores\")\n dbgpr_t2d(stores)\n local remain = M\n local total_price = 0\n local idx = 1\n while remain > 0 do\n local unit_price, stock = stores[idx][1], stores[idx][2]\n local units = stock\n if remain - units < 0 then\n units = remain\n end\n total_price = total_price + unit_price * units\n remain = remain - units\n dbgpr(idx, remain)\n idx = idx + 1\n end\n print(total_price)\nend\n\nmain()\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nHearing that energy drinks increase rating in those sites, Takahashi decides to buy up M cans of energy drinks.\n\nThere are N stores that sell energy drinks. In the i-th store, he can buy at most B_i cans of energy drinks for A_i yen (the currency of Japan) each.\n\nWhat is the minimum amount of money with which he can buy M cans of energy drinks?\n\nIt is guaranteed that, in the given inputs, a sufficient amount of money can always buy M cans of energy drinks.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^5\n\nB_1 + ... + B_N \\geq M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the minimum amount of money with which Takahashi can buy M cans of energy drinks.\n\nSample Input 1\n\n2 5\n4 9\n2 4\n\nSample Output 1\n\n12\n\nWith 12 yen, we can buy one drink at the first store and four drinks at the second store, for the total of five drinks. However, we cannot buy 5 drinks with 11 yen or less.\n\nSample Input 2\n\n4 30\n6 18\n2 5\n3 10\n7 9\n\nSample Output 2\n\n130\n\nSample Input 3\n\n1 100000\n1000000000 100000\n\nSample Output 3\n\n100000000000000\n\nThe output may not fit into a 32-bit integer type.", "sample_input": "2 5\n4 9\n2 4\n"}, "reference_outputs": ["12\n"], "source_document_id": "p03103", "source_text": "Score : 300 points\n\nProblem Statement\n\nHearing that energy drinks increase rating in those sites, Takahashi decides to buy up M cans of energy drinks.\n\nThere are N stores that sell energy drinks. In the i-th store, he can buy at most B_i cans of energy drinks for A_i yen (the currency of Japan) each.\n\nWhat is the minimum amount of money with which he can buy M cans of energy drinks?\n\nIt is guaranteed that, in the given inputs, a sufficient amount of money can always buy M cans of energy drinks.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^5\n\nB_1 + ... + B_N \\geq M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the minimum amount of money with which Takahashi can buy M cans of energy drinks.\n\nSample Input 1\n\n2 5\n4 9\n2 4\n\nSample Output 1\n\n12\n\nWith 12 yen, we can buy one drink at the first store and four drinks at the second store, for the total of five drinks. However, we cannot buy 5 drinks with 11 yen or less.\n\nSample Input 2\n\n4 30\n6 18\n2 5\n3 10\n7 9\n\nSample Output 2\n\n130\n\nSample Input 3\n\n1 100000\n1000000000 100000\n\nSample Output 3\n\n100000000000000\n\nThe output may not fit into a 32-bit integer type.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1896, "cpu_time_ms": 310, "memory_kb": 13304}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s778743598", "group_id": "codeNet:p03106", "input_text": "a,b,c=io.read():match(\"(.+)%s(.+)%s(.+)\")\nx=1\nd={}\nfor i=1,100 do\n if a%i==0 and b%i==0 then\n table.insert(d,i)\n end\nend\nprint(d[#d-c+1])", "language": "Lua", "metadata": {"date": 1551685519, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03106.html", "problem_id": "p03106", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03106/input.txt", "sample_output_relpath": "derived/input_output/data/p03106/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03106/Lua/s778743598.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s778743598", "user_id": "u837412668"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "a,b,c=io.read():match(\"(.+)%s(.+)%s(.+)\")\nx=1\nd={}\nfor i=1,100 do\n if a%i==0 and b%i==0 then\n table.insert(d,i)\n end\nend\nprint(d[#d-c+1])", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nFind the K-th largest positive integer that divides both A and B.\n\nThe input guarantees that there exists such a number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 100\n\nThe K-th largest positive integer that divides both A and B exists.\n\nK \\geq 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the K-th largest positive integer that divides both A and B.\n\nSample Input 1\n\n8 12 2\n\nSample Output 1\n\n2\n\nThree positive integers divides both 8 and 12: 1, 2 and 4.\nAmong them, the second largest is 2.\n\nSample Input 2\n\n100 50 4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1 1\n\nSample Output 3\n\n1", "sample_input": "8 12 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03106", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nFind the K-th largest positive integer that divides both A and B.\n\nThe input guarantees that there exists such a number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 100\n\nThe K-th largest positive integer that divides both A and B exists.\n\nK \\geq 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the K-th largest positive integer that divides both A and B.\n\nSample Input 1\n\n8 12 2\n\nSample Output 1\n\n2\n\nThree positive integers divides both 8 and 12: 1, 2 and 4.\nAmong them, the second largest is 2.\n\nSample Input 2\n\n100 50 4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1 1\n\nSample Output 3\n\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s559093117", "group_id": "codeNet:p03106", "input_text": "a,b,k = io.read(\"n\",\"n\",\"n\")\nt = {}\nfor i=1,math.max(a,b) do\n q1 = a % i\n q2 = b % i\n if (q1 == 0 and q2 == 0) then\n table.insert(t, i)\n end\nend\nprint(t[#t + 1 - k])", "language": "Lua", "metadata": {"date": 1551643557, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03106.html", "problem_id": "p03106", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03106/input.txt", "sample_output_relpath": "derived/input_output/data/p03106/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03106/Lua/s559093117.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s559093117", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "a,b,k = io.read(\"n\",\"n\",\"n\")\nt = {}\nfor i=1,math.max(a,b) do\n q1 = a % i\n q2 = b % i\n if (q1 == 0 and q2 == 0) then\n table.insert(t, i)\n end\nend\nprint(t[#t + 1 - k])", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nFind the K-th largest positive integer that divides both A and B.\n\nThe input guarantees that there exists such a number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 100\n\nThe K-th largest positive integer that divides both A and B exists.\n\nK \\geq 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the K-th largest positive integer that divides both A and B.\n\nSample Input 1\n\n8 12 2\n\nSample Output 1\n\n2\n\nThree positive integers divides both 8 and 12: 1, 2 and 4.\nAmong them, the second largest is 2.\n\nSample Input 2\n\n100 50 4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1 1\n\nSample Output 3\n\n1", "sample_input": "8 12 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03106", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nFind the K-th largest positive integer that divides both A and B.\n\nThe input guarantees that there exists such a number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 100\n\nThe K-th largest positive integer that divides both A and B exists.\n\nK \\geq 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the K-th largest positive integer that divides both A and B.\n\nSample Input 1\n\n8 12 2\n\nSample Output 1\n\n2\n\nThree positive integers divides both 8 and 12: 1, 2 and 4.\nAmong them, the second largest is 2.\n\nSample Input 2\n\n100 50 4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1 1\n\nSample Output 3\n\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s369654745", "group_id": "codeNet:p03107", "input_text": "local s=io.read(\"*l\")\nlocal r=0\nfor _ in string.gmatch(s,\"1\") do\n r=r+1 \nend\nprint(math.min(r,#s-r)*2)", "language": "Lua", "metadata": {"date": 1579707804, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s369654745.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s369654745", "user_id": "u373958718"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local s=io.read(\"*l\")\nlocal r=0\nfor _ in string.gmatch(s,\"1\") do\n r=r+1 \nend\nprint(math.min(r,#s-r)*2)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 504}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s312535722", "group_id": "codeNet:p03107", "input_text": "local s = io.read()\nlocal p1 = 0\nfor i = 1, #s do\n if(string.sub(s, i, i) == \"1\") then p1 = p1 + 1 end\nend\nprint(math.min(p1, #s - p1) * 2)\n", "language": "Lua", "metadata": {"date": 1555623258, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s312535722.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s312535722", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local s = io.read()\nlocal p1 = 0\nfor i = 1, #s do\n if(string.sub(s, i, i) == \"1\") then p1 = p1 + 1 end\nend\nprint(math.min(p1, #s - p1) * 2)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cubes stacked vertically on a desk.\n\nYou are given a string S of length N. The color of the i-th cube from the bottom is red if the i-th character in S is 0, and blue if that character is 1.\n\nYou can perform the following operation any number of times: choose a red cube and a blue cube that are adjacent, and remove them. Here, the cubes that were stacked on the removed cubes will fall down onto the object below them.\n\nAt most how many cubes can be removed?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nEach character in S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of cubes that can be removed.\n\nSample Input 1\n\n0011\n\nSample Output 1\n\n4\n\nAll four cubes can be removed, by performing the operation as follows:\n\nRemove the second and third cubes from the bottom. Then, the fourth cube drops onto the first cube.\n\nRemove the first and second cubes from the bottom.\n\nSample Input 2\n\n11011010001011\n\nSample Output 2\n\n12\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "sample_input": "0011\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03107", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cubes stacked vertically on a desk.\n\nYou are given a string S of length N. The color of the i-th cube from the bottom is red if the i-th character in S is 0, and blue if that character is 1.\n\nYou can perform the following operation any number of times: choose a red cube and a blue cube that are adjacent, and remove them. Here, the cubes that were stacked on the removed cubes will fall down onto the object below them.\n\nAt most how many cubes can be removed?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nEach character in S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of cubes that can be removed.\n\nSample Input 1\n\n0011\n\nSample Output 1\n\n4\n\nAll four cubes can be removed, by performing the operation as follows:\n\nRemove the second and third cubes from the bottom. Then, the fourth cube drops onto the first cube.\n\nRemove the first and second cubes from the bottom.\n\nSample Input 2\n\n11011010001011\n\nSample Output 2\n\n12\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 512}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s067728114", "group_id": "codeNet:p03107", "input_text": "S=io.read()\nlocal count=0\nlocal i=1\nwhile i~=#S do\n if string.sub(S,i,i)==\"0\" and string.sub(S,i+1,i+1)==\"1\" or string.sub(S,i,i)==\"1\" and string.sub(S,i+1,i+1)==\"0\" then\n count=count+2\n S=string.sub(S,1,i-1)..string.sub(S,i+2,#S)\n i=i-1\n else\n i=i+1\n end\nend\nprint(count)\n ", "language": "Lua", "metadata": {"date": 1551796081, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s067728114.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s067728114", "user_id": "u015229643"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "S=io.read()\nlocal count=0\nlocal i=1\nwhile i~=#S do\n if string.sub(S,i,i)==\"0\" and string.sub(S,i+1,i+1)==\"1\" or string.sub(S,i,i)==\"1\" and string.sub(S,i+1,i+1)==\"0\" then\n count=count+2\n S=string.sub(S,1,i-1)..string.sub(S,i+2,#S)\n i=i-1\n else\n i=i+1\n end\nend\nprint(count)\n ", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cubes stacked vertically on a desk.\n\nYou are given a string S of length N. The color of the i-th cube from the bottom is red if the i-th character in S is 0, and blue if that character is 1.\n\nYou can perform the following operation any number of times: choose a red cube and a blue cube that are adjacent, and remove them. Here, the cubes that were stacked on the removed cubes will fall down onto the object below them.\n\nAt most how many cubes can be removed?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nEach character in S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of cubes that can be removed.\n\nSample Input 1\n\n0011\n\nSample Output 1\n\n4\n\nAll four cubes can be removed, by performing the operation as follows:\n\nRemove the second and third cubes from the bottom. Then, the fourth cube drops onto the first cube.\n\nRemove the first and second cubes from the bottom.\n\nSample Input 2\n\n11011010001011\n\nSample Output 2\n\n12\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "sample_input": "0011\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03107", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cubes stacked vertically on a desk.\n\nYou are given a string S of length N. The color of the i-th cube from the bottom is red if the i-th character in S is 0, and blue if that character is 1.\n\nYou can perform the following operation any number of times: choose a red cube and a blue cube that are adjacent, and remove them. Here, the cubes that were stacked on the removed cubes will fall down onto the object below them.\n\nAt most how many cubes can be removed?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nEach character in S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of cubes that can be removed.\n\nSample Input 1\n\n0011\n\nSample Output 1\n\n4\n\nAll four cubes can be removed, by performing the operation as follows:\n\nRemove the second and third cubes from the bottom. Then, the fourth cube drops onto the first cube.\n\nRemove the first and second cubes from the bottom.\n\nSample Input 2\n\n11011010001011\n\nSample Output 2\n\n12\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 578, "memory_kb": 1616}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s689583311", "group_id": "codeNet:p03107", "input_text": "local DBG = false\nfunction dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\nfunction dbgpr_t(tbl)\n if DBG then\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in ipairs(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\nfunction parse_problem()\n local tbl = {}\n local S = io.read(\"l\"):gsub(\"[^%d]\", \"\")\n dbgpr(S, string.len(S))\n --local S_split = {S:byte(1, S:len())}\n local cur_char = nil\n local cur_succ = nil\n for _,v in ipairs({S:byte(1, S:len())}) do\n if v ~= cur_char then\n if cur_succ ~= nil then\n table.insert(tbl, cur_succ)\n end\n cur_char = v\n cur_succ = 1\n else\n cur_succ = cur_succ + 1\n end\n end\n if cur_succ ~= nil then\n table.insert(tbl, cur_succ)\n end\n dbgpr_t(tbl)\n return tbl\nend\n\nfunction main()\n local tbl = parse_problem()\n local del_count = 0\n local start = 1\n while start <= (#tbl - 1) do\n local a, b = tbl[start], tbl[start + 1]\n if a == b then\n del_count = del_count + a\n -- remove a, b\n start = start + 2\n elseif a > b then\n local r = a - b\n del_count = del_count + b\n -- remove b, merge r into c\n start = start + 2\n if start <= #tbl then\n tbl[start] = tbl[start] + r\n end\n else\n -- b > a\n local r = b - a\n del_count = del_count + a\n -- remove a\n start = start + 1\n -- update b\n tbl[start] = r\n end\n end\n local ans = del_count * 2\n print(ans)\nend\n\nmain()\n", "language": "Lua", "metadata": {"date": 1551645531, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s689583311.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s689583311", "user_id": "u162773977"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local DBG = false\nfunction dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\nfunction dbgpr_t(tbl)\n if DBG then\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in ipairs(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\nfunction parse_problem()\n local tbl = {}\n local S = io.read(\"l\"):gsub(\"[^%d]\", \"\")\n dbgpr(S, string.len(S))\n --local S_split = {S:byte(1, S:len())}\n local cur_char = nil\n local cur_succ = nil\n for _,v in ipairs({S:byte(1, S:len())}) do\n if v ~= cur_char then\n if cur_succ ~= nil then\n table.insert(tbl, cur_succ)\n end\n cur_char = v\n cur_succ = 1\n else\n cur_succ = cur_succ + 1\n end\n end\n if cur_succ ~= nil then\n table.insert(tbl, cur_succ)\n end\n dbgpr_t(tbl)\n return tbl\nend\n\nfunction main()\n local tbl = parse_problem()\n local del_count = 0\n local start = 1\n while start <= (#tbl - 1) do\n local a, b = tbl[start], tbl[start + 1]\n if a == b then\n del_count = del_count + a\n -- remove a, b\n start = start + 2\n elseif a > b then\n local r = a - b\n del_count = del_count + b\n -- remove b, merge r into c\n start = start + 2\n if start <= #tbl then\n tbl[start] = tbl[start] + r\n end\n else\n -- b > a\n local r = b - a\n del_count = del_count + a\n -- remove a\n start = start + 1\n -- update b\n tbl[start] = r\n end\n end\n local ans = del_count * 2\n print(ans)\nend\n\nmain()\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cubes stacked vertically on a desk.\n\nYou are given a string S of length N. The color of the i-th cube from the bottom is red if the i-th character in S is 0, and blue if that character is 1.\n\nYou can perform the following operation any number of times: choose a red cube and a blue cube that are adjacent, and remove them. Here, the cubes that were stacked on the removed cubes will fall down onto the object below them.\n\nAt most how many cubes can be removed?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nEach character in S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of cubes that can be removed.\n\nSample Input 1\n\n0011\n\nSample Output 1\n\n4\n\nAll four cubes can be removed, by performing the operation as follows:\n\nRemove the second and third cubes from the bottom. Then, the fourth cube drops onto the first cube.\n\nRemove the first and second cubes from the bottom.\n\nSample Input 2\n\n11011010001011\n\nSample Output 2\n\n12\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "sample_input": "0011\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03107", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cubes stacked vertically on a desk.\n\nYou are given a string S of length N. The color of the i-th cube from the bottom is red if the i-th character in S is 0, and blue if that character is 1.\n\nYou can perform the following operation any number of times: choose a red cube and a blue cube that are adjacent, and remove them. Here, the cubes that were stacked on the removed cubes will fall down onto the object below them.\n\nAt most how many cubes can be removed?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nEach character in S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of cubes that can be removed.\n\nSample Input 1\n\n0011\n\nSample Output 1\n\n4\n\nAll four cubes can be removed, by performing the operation as follows:\n\nRemove the second and third cubes from the bottom. Then, the fourth cube drops onto the first cube.\n\nRemove the first and second cubes from the bottom.\n\nSample Input 2\n\n11011010001011\n\nSample Output 2\n\n12\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1821, "cpu_time_ms": 43, "memory_kb": 5780}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s558587264", "group_id": "codeNet:p03108", "input_text": "local DBG = false\nfunction dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nfunction dbgpr_t(tbl)\n if DBG then\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in ipairs(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\nfunction dbgpr_t2d(tbl2d)\n if DBG then\n dbgpr(tbl2d)\n for i,t in ipairs(tbl2d) do\n io.write(\"[dbg]\")\n for j,v in ipairs(t) do\n io.write(\"(\" .. tostring(i) .. \",\" .. tostring(j) .. \"): \")\n io.write(tostring(v))\n io.write(\"; \")\n end\n print(\"\")\n end\n end\nend\n\nfunction create_tbl(a, initial)\n local tbl = {}\n for i=1,a do\n tbl[i] = initial\n end\n return tbl\nend\n\nfunction create_2d_tbl(a, b, initial)\n local tbl = {}\n for i=1,a do\n local t = {}\n for j=1,b do\n t[j] = initial\n end\n tbl[i] = t\n end\n return tbl\nend\n\nfunction parse_problem()\n local N, M = io.read(\"n\", \"n\")\n local bridges = {}\n for i=1, M do\n local a, b = io.read(\"n\", \"n\")\n bridges[i] = {a, b}\n end\n return N, M, bridges\nend\n\nperf = 0\n\nfunction main()\n local N, M, bridges = parse_problem()\n parents = {}\n for i=1,N do\n parents[i] = -1\n end\n local function find_union(a, b)\n local x, y = a, b\n while parents[x] > 0 do\n x = parents[x]\n end\n while parents[y] > 0 do\n y = parents[y]\n end\n local size_a, size_b = -parents[x], -parents[y]\n if x ~= y then\n if size_b > size_a then\n x, y = y, x\n end\n -- size(x) > size(y)\n -- x is new root of y\n parents[x] = parents[x] + parents[y]\n parents[y] = x\n end\n return x == y, size_a, size_b\n end\n dbgpr(N, M)\n dbgpr(\"====bridges\")\n dbgpr_t2d(bridges)\n local ans_tbl = {}\n ans_tbl[M] = N * (N - 1) // 2\n dbgpr(\"M, ansM: \", M, ans_tbl[M])\n for i=M,1,-1 do\n local a, b = bridges[i][1], bridges[i][2]\n local same_group, size_a, size_b = find_union(a, b)\n --dbgpr(i, a, b, same_group, size_a, size_b, size_a * size_b)\n if same_group then\n ans_tbl[i-1] = ans_tbl[i]\n else\n ans_tbl[i-1] = ans_tbl[i] - size_a * size_b\n end\n end\n for i=1,M do\n print(ans_tbl[i])\n end\nend\n\nmain()\n", "language": "Lua", "metadata": {"date": 1551655369, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03108.html", "problem_id": "p03108", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03108/input.txt", "sample_output_relpath": "derived/input_output/data/p03108/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03108/Lua/s558587264.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s558587264", "user_id": "u162773977"}, "prompt_components": {"gold_output": "0\n0\n4\n5\n6\n", "input_to_evaluate": "local DBG = false\nfunction dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nfunction dbgpr_t(tbl)\n if DBG then\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in ipairs(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\nfunction dbgpr_t2d(tbl2d)\n if DBG then\n dbgpr(tbl2d)\n for i,t in ipairs(tbl2d) do\n io.write(\"[dbg]\")\n for j,v in ipairs(t) do\n io.write(\"(\" .. tostring(i) .. \",\" .. tostring(j) .. \"): \")\n io.write(tostring(v))\n io.write(\"; \")\n end\n print(\"\")\n end\n end\nend\n\nfunction create_tbl(a, initial)\n local tbl = {}\n for i=1,a do\n tbl[i] = initial\n end\n return tbl\nend\n\nfunction create_2d_tbl(a, b, initial)\n local tbl = {}\n for i=1,a do\n local t = {}\n for j=1,b do\n t[j] = initial\n end\n tbl[i] = t\n end\n return tbl\nend\n\nfunction parse_problem()\n local N, M = io.read(\"n\", \"n\")\n local bridges = {}\n for i=1, M do\n local a, b = io.read(\"n\", \"n\")\n bridges[i] = {a, b}\n end\n return N, M, bridges\nend\n\nperf = 0\n\nfunction main()\n local N, M, bridges = parse_problem()\n parents = {}\n for i=1,N do\n parents[i] = -1\n end\n local function find_union(a, b)\n local x, y = a, b\n while parents[x] > 0 do\n x = parents[x]\n end\n while parents[y] > 0 do\n y = parents[y]\n end\n local size_a, size_b = -parents[x], -parents[y]\n if x ~= y then\n if size_b > size_a then\n x, y = y, x\n end\n -- size(x) > size(y)\n -- x is new root of y\n parents[x] = parents[x] + parents[y]\n parents[y] = x\n end\n return x == y, size_a, size_b\n end\n dbgpr(N, M)\n dbgpr(\"====bridges\")\n dbgpr_t2d(bridges)\n local ans_tbl = {}\n ans_tbl[M] = N * (N - 1) // 2\n dbgpr(\"M, ansM: \", M, ans_tbl[M])\n for i=M,1,-1 do\n local a, b = bridges[i][1], bridges[i][2]\n local same_group, size_a, size_b = find_union(a, b)\n --dbgpr(i, a, b, same_group, size_a, size_b, size_a * size_b)\n if same_group then\n ans_tbl[i-1] = ans_tbl[i]\n else\n ans_tbl[i-1] = ans_tbl[i] - size_a * size_b\n end\n end\n for i=1,M do\n print(ans_tbl[i])\n end\nend\n\nmain()\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N islands and M bridges.\n\nThe i-th bridge connects the A_i-th and B_i-th islands bidirectionally.\n\nInitially, we can travel between any two islands using some of these bridges.\n\nHowever, the results of a survey show that these bridges will all collapse because of aging, in the order from the first bridge to the M-th bridge.\n\nLet the inconvenience be the number of pairs of islands (a, b) (a < b) such that we are no longer able to travel between the a-th and b-th islands using some of the bridges remaining.\n\nFor each i (1 \\leq i \\leq M), find the inconvenience just after the i-th bridge collapses.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i < B_i \\leq N\n\nAll pairs (A_i, B_i) are distinct.\n\nThe inconvenience is initially 0.\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_M B_M\n\nOutput\n\nIn the order i = 1, 2, ..., M, print the inconvenience just after the i-th bridge collapses.\nNote that the answer may not fit into a 32-bit integer type.\n\nSample Input 1\n\n4 5\n1 2\n3 4\n1 3\n2 3\n1 4\n\nSample Output 1\n\n0\n0\n4\n5\n6\n\nFor example, when the first to third bridges have collapsed, the inconvenience is 4 since we can no longer travel between the pairs (1, 2), (1, 3), (2, 4) and (3, 4).\n\nSample Input 2\n\n6 5\n2 3\n1 2\n5 6\n3 4\n4 5\n\nSample Output 2\n\n8\n9\n12\n14\n15\n\nSample Input 3\n\n2 1\n1 2\n\nSample Output 3\n\n1", "sample_input": "4 5\n1 2\n3 4\n1 3\n2 3\n1 4\n"}, "reference_outputs": ["0\n0\n4\n5\n6\n"], "source_document_id": "p03108", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N islands and M bridges.\n\nThe i-th bridge connects the A_i-th and B_i-th islands bidirectionally.\n\nInitially, we can travel between any two islands using some of these bridges.\n\nHowever, the results of a survey show that these bridges will all collapse because of aging, in the order from the first bridge to the M-th bridge.\n\nLet the inconvenience be the number of pairs of islands (a, b) (a < b) such that we are no longer able to travel between the a-th and b-th islands using some of the bridges remaining.\n\nFor each i (1 \\leq i \\leq M), find the inconvenience just after the i-th bridge collapses.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i < B_i \\leq N\n\nAll pairs (A_i, B_i) are distinct.\n\nThe inconvenience is initially 0.\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_M B_M\n\nOutput\n\nIn the order i = 1, 2, ..., M, print the inconvenience just after the i-th bridge collapses.\nNote that the answer may not fit into a 32-bit integer type.\n\nSample Input 1\n\n4 5\n1 2\n3 4\n1 3\n2 3\n1 4\n\nSample Output 1\n\n0\n0\n4\n5\n6\n\nFor example, when the first to third bridges have collapsed, the inconvenience is 4 since we can no longer travel between the pairs (1, 2), (1, 3), (2, 4) and (3, 4).\n\nSample Input 2\n\n6 5\n2 3\n1 2\n5 6\n3 4\n4 5\n\nSample Output 2\n\n8\n9\n12\n14\n15\n\nSample Input 3\n\n2 1\n1 2\n\nSample Output 3\n\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2558, "cpu_time_ms": 392, "memory_kb": 24168}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s649713807", "group_id": "codeNet:p03108", "input_text": "local DBG = false\nfunction dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nfunction dbgpr_t(tbl)\n if DBG then\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in ipairs(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\nfunction dbgpr_t2d(tbl2d)\n if DBG then\n dbgpr(tbl2d)\n for i,t in ipairs(tbl2d) do\n io.write(\"[dbg]\")\n for j,v in ipairs(t) do\n io.write(\"(\" .. tostring(i) .. \",\" .. tostring(j) .. \"): \")\n io.write(tostring(v))\n io.write(\"; \")\n end\n print(\"\")\n end\n end\nend\nfunction create_tbl(a, initial)\n local tbl = {}\n for i=1,a do\n tbl[i] = initial\n end\n return tbl\nend\n\nfunction create_2d_tbl(a, b, initial)\n local tbl = {}\n for i=1,a do\n local t = {}\n for j=1,b do\n t[j] = initial\n end\n tbl[i] = t\n end\n return tbl\nend\n\nfunction parse_problem()\n local N, M = io.read(\"n\", \"n\")\n local bridges = {}\n local map = create_2d_tbl(N, N, 0)\n for i=1, M do\n local a, b = io.read(\"n\", \"n\")\n bridges[i] = {a, b}\n assert(map[a][b] == 0)\n map[a][b] = 1\n map[b][a] = 1\n end\n return N, M, bridges, map\nend\n\nfunction reachable(N, map, a, b)\n local visited = create_tbl(N, 0)\n local function dfs(src)\n for dest=1, N do\n if src ~= dest and visited[dest] == 0 then\n if map[src][dest] ~= 0 then\n visited[dest] = 1\n dfs(dest)\n end\n end\n end\n end\n visited[a] = 1\n dfs(a)\n local count = 0\n for i=1,N do\n if visited[i] ~= 0 then\n count = count + 1\n end\n end\n --dbgpr_t(visited)\n return visited[b] ~= 0, count\nend\n\nfunction main()\n local N, M, bridges, map = parse_problem()\n dbgpr(N, M)\n dbgpr(\"====bridges\")\n dbgpr_t2d(bridges)\n dbgpr(\"====map\")\n dbgpr_t2d(map)\n local inconvenience = 0\n for i=1,M do\n local a, b = bridges[i][1], bridges[i][2]\n -- bridge collapses\n map[a][b] = 0\n map[b][a] = 0\n -- still reachable?\n local r, count_a = reachable(N, map, a, b)\n local _, count_b = reachable(N, map, b, a)\n dbgpr(\"i,a,b: \",i,a,b, \" r: \", r, \" count: \", count_a, count_b)\n if not r then\n inconvenience = inconvenience + count_a * count_b\n end\n print(inconvenience)\n end\nend\n\nmain()\n", "language": "Lua", "metadata": {"date": 1551648948, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03108.html", "problem_id": "p03108", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03108/input.txt", "sample_output_relpath": "derived/input_output/data/p03108/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03108/Lua/s649713807.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s649713807", "user_id": "u162773977"}, "prompt_components": {"gold_output": "0\n0\n4\n5\n6\n", "input_to_evaluate": "local DBG = false\nfunction dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nfunction dbgpr_t(tbl)\n if DBG then\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in ipairs(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\nfunction dbgpr_t2d(tbl2d)\n if DBG then\n dbgpr(tbl2d)\n for i,t in ipairs(tbl2d) do\n io.write(\"[dbg]\")\n for j,v in ipairs(t) do\n io.write(\"(\" .. tostring(i) .. \",\" .. tostring(j) .. \"): \")\n io.write(tostring(v))\n io.write(\"; \")\n end\n print(\"\")\n end\n end\nend\nfunction create_tbl(a, initial)\n local tbl = {}\n for i=1,a do\n tbl[i] = initial\n end\n return tbl\nend\n\nfunction create_2d_tbl(a, b, initial)\n local tbl = {}\n for i=1,a do\n local t = {}\n for j=1,b do\n t[j] = initial\n end\n tbl[i] = t\n end\n return tbl\nend\n\nfunction parse_problem()\n local N, M = io.read(\"n\", \"n\")\n local bridges = {}\n local map = create_2d_tbl(N, N, 0)\n for i=1, M do\n local a, b = io.read(\"n\", \"n\")\n bridges[i] = {a, b}\n assert(map[a][b] == 0)\n map[a][b] = 1\n map[b][a] = 1\n end\n return N, M, bridges, map\nend\n\nfunction reachable(N, map, a, b)\n local visited = create_tbl(N, 0)\n local function dfs(src)\n for dest=1, N do\n if src ~= dest and visited[dest] == 0 then\n if map[src][dest] ~= 0 then\n visited[dest] = 1\n dfs(dest)\n end\n end\n end\n end\n visited[a] = 1\n dfs(a)\n local count = 0\n for i=1,N do\n if visited[i] ~= 0 then\n count = count + 1\n end\n end\n --dbgpr_t(visited)\n return visited[b] ~= 0, count\nend\n\nfunction main()\n local N, M, bridges, map = parse_problem()\n dbgpr(N, M)\n dbgpr(\"====bridges\")\n dbgpr_t2d(bridges)\n dbgpr(\"====map\")\n dbgpr_t2d(map)\n local inconvenience = 0\n for i=1,M do\n local a, b = bridges[i][1], bridges[i][2]\n -- bridge collapses\n map[a][b] = 0\n map[b][a] = 0\n -- still reachable?\n local r, count_a = reachable(N, map, a, b)\n local _, count_b = reachable(N, map, b, a)\n dbgpr(\"i,a,b: \",i,a,b, \" r: \", r, \" count: \", count_a, count_b)\n if not r then\n inconvenience = inconvenience + count_a * count_b\n end\n print(inconvenience)\n end\nend\n\nmain()\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N islands and M bridges.\n\nThe i-th bridge connects the A_i-th and B_i-th islands bidirectionally.\n\nInitially, we can travel between any two islands using some of these bridges.\n\nHowever, the results of a survey show that these bridges will all collapse because of aging, in the order from the first bridge to the M-th bridge.\n\nLet the inconvenience be the number of pairs of islands (a, b) (a < b) such that we are no longer able to travel between the a-th and b-th islands using some of the bridges remaining.\n\nFor each i (1 \\leq i \\leq M), find the inconvenience just after the i-th bridge collapses.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i < B_i \\leq N\n\nAll pairs (A_i, B_i) are distinct.\n\nThe inconvenience is initially 0.\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_M B_M\n\nOutput\n\nIn the order i = 1, 2, ..., M, print the inconvenience just after the i-th bridge collapses.\nNote that the answer may not fit into a 32-bit integer type.\n\nSample Input 1\n\n4 5\n1 2\n3 4\n1 3\n2 3\n1 4\n\nSample Output 1\n\n0\n0\n4\n5\n6\n\nFor example, when the first to third bridges have collapsed, the inconvenience is 4 since we can no longer travel between the pairs (1, 2), (1, 3), (2, 4) and (3, 4).\n\nSample Input 2\n\n6 5\n2 3\n1 2\n5 6\n3 4\n4 5\n\nSample Output 2\n\n8\n9\n12\n14\n15\n\nSample Input 3\n\n2 1\n1 2\n\nSample Output 3\n\n1", "sample_input": "4 5\n1 2\n3 4\n1 3\n2 3\n1 4\n"}, "reference_outputs": ["0\n0\n4\n5\n6\n"], "source_document_id": "p03108", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N islands and M bridges.\n\nThe i-th bridge connects the A_i-th and B_i-th islands bidirectionally.\n\nInitially, we can travel between any two islands using some of these bridges.\n\nHowever, the results of a survey show that these bridges will all collapse because of aging, in the order from the first bridge to the M-th bridge.\n\nLet the inconvenience be the number of pairs of islands (a, b) (a < b) such that we are no longer able to travel between the a-th and b-th islands using some of the bridges remaining.\n\nFor each i (1 \\leq i \\leq M), find the inconvenience just after the i-th bridge collapses.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i < B_i \\leq N\n\nAll pairs (A_i, B_i) are distinct.\n\nThe inconvenience is initially 0.\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_M B_M\n\nOutput\n\nIn the order i = 1, 2, ..., M, print the inconvenience just after the i-th bridge collapses.\nNote that the answer may not fit into a 32-bit integer type.\n\nSample Input 1\n\n4 5\n1 2\n3 4\n1 3\n2 3\n1 4\n\nSample Output 1\n\n0\n0\n4\n5\n6\n\nFor example, when the first to third bridges have collapsed, the inconvenience is 4 since we can no longer travel between the pairs (1, 2), (1, 3), (2, 4) and (3, 4).\n\nSample Input 2\n\n6 5\n2 3\n1 2\n5 6\n3 4\n4 5\n\nSample Output 2\n\n8\n9\n12\n14\n15\n\nSample Input 3\n\n2 1\n1 2\n\nSample Output 3\n\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2640, "cpu_time_ms": 2207, "memory_kb": 1712888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s006110437", "group_id": "codeNet:p03109", "input_text": "local str = io.read()\nlocal y, m, d = str:match(\"(%d+)/(%d+)/(%d+)\")\ny,m,d=tonumber(y),tonumber(m),tonumber(d)\nif(y < 2019) then print(\"Heisei\")\nelseif(2019 < y) then print(\"TBD\")\nelse\n if(m <= 4) then print(\"Heisei\")\n else print(\"TBD\") end\nend\n", "language": "Lua", "metadata": {"date": 1558211331, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03109.html", "problem_id": "p03109", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03109/input.txt", "sample_output_relpath": "derived/input_output/data/p03109/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03109/Lua/s006110437.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s006110437", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Heisei\n", "input_to_evaluate": "local str = io.read()\nlocal y, m, d = str:match(\"(%d+)/(%d+)/(%d+)\")\ny,m,d=tonumber(y),tonumber(m),tonumber(d)\nif(y < 2019) then print(\"Heisei\")\nelseif(2019 < y) then print(\"TBD\")\nelse\n if(m <= 4) then print(\"Heisei\")\n else print(\"TBD\") end\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S as input. This represents a valid date in the year 2019 in the yyyy/mm/dd format. (For example, April 30, 2019 is represented as 2019/04/30.)\n\nWrite a program that prints Heisei if the date represented by S is not later than April 30, 2019, and prints TBD otherwise.\n\nConstraints\n\nS is a string that represents a valid date in the year 2019 in the yyyy/mm/dd format.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Heisei if the date represented by S is not later than April 30, 2019, and print TBD otherwise.\n\nSample Input 1\n\n2019/04/30\n\nSample Output 1\n\nHeisei\n\nSample Input 2\n\n2019/11/01\n\nSample Output 2\n\nTBD", "sample_input": "2019/04/30\n"}, "reference_outputs": ["Heisei\n"], "source_document_id": "p03109", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S as input. This represents a valid date in the year 2019 in the yyyy/mm/dd format. (For example, April 30, 2019 is represented as 2019/04/30.)\n\nWrite a program that prints Heisei if the date represented by S is not later than April 30, 2019, and prints TBD otherwise.\n\nConstraints\n\nS is a string that represents a valid date in the year 2019 in the yyyy/mm/dd format.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Heisei if the date represented by S is not later than April 30, 2019, and print TBD otherwise.\n\nSample Input 1\n\n2019/04/30\n\nSample Output 1\n\nHeisei\n\nSample Input 2\n\n2019/11/01\n\nSample Output 2\n\nTBD", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 247, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s744839851", "group_id": "codeNet:p03109", "input_text": "a=io.read()\nprint(a<=\"2019/04/30\"and\"Heisei\"or\"TBD\")", "language": "Lua", "metadata": {"date": 1551100068, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03109.html", "problem_id": "p03109", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03109/input.txt", "sample_output_relpath": "derived/input_output/data/p03109/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03109/Lua/s744839851.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s744839851", "user_id": "u837412668"}, "prompt_components": {"gold_output": "Heisei\n", "input_to_evaluate": "a=io.read()\nprint(a<=\"2019/04/30\"and\"Heisei\"or\"TBD\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S as input. This represents a valid date in the year 2019 in the yyyy/mm/dd format. (For example, April 30, 2019 is represented as 2019/04/30.)\n\nWrite a program that prints Heisei if the date represented by S is not later than April 30, 2019, and prints TBD otherwise.\n\nConstraints\n\nS is a string that represents a valid date in the year 2019 in the yyyy/mm/dd format.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Heisei if the date represented by S is not later than April 30, 2019, and print TBD otherwise.\n\nSample Input 1\n\n2019/04/30\n\nSample Output 1\n\nHeisei\n\nSample Input 2\n\n2019/11/01\n\nSample Output 2\n\nTBD", "sample_input": "2019/04/30\n"}, "reference_outputs": ["Heisei\n"], "source_document_id": "p03109", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S as input. This represents a valid date in the year 2019 in the yyyy/mm/dd format. (For example, April 30, 2019 is represented as 2019/04/30.)\n\nWrite a program that prints Heisei if the date represented by S is not later than April 30, 2019, and prints TBD otherwise.\n\nConstraints\n\nS is a string that represents a valid date in the year 2019 in the yyyy/mm/dd format.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Heisei if the date represented by S is not later than April 30, 2019, and print TBD otherwise.\n\nSample Input 1\n\n2019/04/30\n\nSample Output 1\n\nHeisei\n\nSample Input 2\n\n2019/11/01\n\nSample Output 2\n\nTBD", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 52, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s082562890", "group_id": "codeNet:p03109", "input_text": "print(io.read(\"l\")>\"2019/04/30\"and\"TBD\"or\"Heisei\")", "language": "Lua", "metadata": {"date": 1551046240, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03109.html", "problem_id": "p03109", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03109/input.txt", "sample_output_relpath": "derived/input_output/data/p03109/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03109/Lua/s082562890.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s082562890", "user_id": "u162773977"}, "prompt_components": {"gold_output": "Heisei\n", "input_to_evaluate": "print(io.read(\"l\")>\"2019/04/30\"and\"TBD\"or\"Heisei\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S as input. This represents a valid date in the year 2019 in the yyyy/mm/dd format. (For example, April 30, 2019 is represented as 2019/04/30.)\n\nWrite a program that prints Heisei if the date represented by S is not later than April 30, 2019, and prints TBD otherwise.\n\nConstraints\n\nS is a string that represents a valid date in the year 2019 in the yyyy/mm/dd format.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Heisei if the date represented by S is not later than April 30, 2019, and print TBD otherwise.\n\nSample Input 1\n\n2019/04/30\n\nSample Output 1\n\nHeisei\n\nSample Input 2\n\n2019/11/01\n\nSample Output 2\n\nTBD", "sample_input": "2019/04/30\n"}, "reference_outputs": ["Heisei\n"], "source_document_id": "p03109", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S as input. This represents a valid date in the year 2019 in the yyyy/mm/dd format. (For example, April 30, 2019 is represented as 2019/04/30.)\n\nWrite a program that prints Heisei if the date represented by S is not later than April 30, 2019, and prints TBD otherwise.\n\nConstraints\n\nS is a string that represents a valid date in the year 2019 in the yyyy/mm/dd format.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Heisei if the date represented by S is not later than April 30, 2019, and print TBD otherwise.\n\nSample Input 1\n\n2019/04/30\n\nSample Output 1\n\nHeisei\n\nSample Input 2\n\n2019/11/01\n\nSample Output 2\n\nTBD", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s272072417", "group_id": "codeNet:p03109", "input_text": "local y,z0,m,z1,d = io.read(\"n\",1,\"n\",1,\"n\")\nif y >= 2019 and m >= 5 then\n print(\"TBD\")\nelse\n print(\"Heisei\")\nend", "language": "Lua", "metadata": {"date": 1551038666, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03109.html", "problem_id": "p03109", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03109/input.txt", "sample_output_relpath": "derived/input_output/data/p03109/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03109/Lua/s272072417.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s272072417", "user_id": "u162773977"}, "prompt_components": {"gold_output": "Heisei\n", "input_to_evaluate": "local y,z0,m,z1,d = io.read(\"n\",1,\"n\",1,\"n\")\nif y >= 2019 and m >= 5 then\n print(\"TBD\")\nelse\n print(\"Heisei\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S as input. This represents a valid date in the year 2019 in the yyyy/mm/dd format. (For example, April 30, 2019 is represented as 2019/04/30.)\n\nWrite a program that prints Heisei if the date represented by S is not later than April 30, 2019, and prints TBD otherwise.\n\nConstraints\n\nS is a string that represents a valid date in the year 2019 in the yyyy/mm/dd format.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Heisei if the date represented by S is not later than April 30, 2019, and print TBD otherwise.\n\nSample Input 1\n\n2019/04/30\n\nSample Output 1\n\nHeisei\n\nSample Input 2\n\n2019/11/01\n\nSample Output 2\n\nTBD", "sample_input": "2019/04/30\n"}, "reference_outputs": ["Heisei\n"], "source_document_id": "p03109", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S as input. This represents a valid date in the year 2019 in the yyyy/mm/dd format. (For example, April 30, 2019 is represented as 2019/04/30.)\n\nWrite a program that prints Heisei if the date represented by S is not later than April 30, 2019, and prints TBD otherwise.\n\nConstraints\n\nS is a string that represents a valid date in the year 2019 in the yyyy/mm/dd format.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Heisei if the date represented by S is not later than April 30, 2019, and print TBD otherwise.\n\nSample Input 1\n\n2019/04/30\n\nSample Output 1\n\nHeisei\n\nSample Input 2\n\n2019/11/01\n\nSample Output 2\n\nTBD", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 10, "memory_kb": 1132}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s992955465", "group_id": "codeNet:p03110", "input_text": "local n = io.read(\"*n\", \"*l\")\nlocal sum = 0\nfor i = 1, n do\n local str = io.read()\n local xs, u = str:match(\"([%d%.]+) (%w+)\")\n local x = tonumber(xs)\n if(u == \"BTC\") then\n sum = sum + 380000 * x\n else\n sum = sum + x\n end\nend\nprint(string.format(\"%.8f\", sum))\n", "language": "Lua", "metadata": {"date": 1558211054, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03110.html", "problem_id": "p03110", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03110/input.txt", "sample_output_relpath": "derived/input_output/data/p03110/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03110/Lua/s992955465.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s992955465", "user_id": "u120582723"}, "prompt_components": {"gold_output": "48000.0\n", "input_to_evaluate": "local n = io.read(\"*n\", \"*l\")\nlocal sum = 0\nfor i = 1, n do\n local str = io.read()\n local xs, u = str:match(\"([%d%.]+) (%w+)\")\n local x = tonumber(xs)\n if(u == \"BTC\") then\n sum = sum + 380000 * x\n else\n sum = sum + x\n end\nend\nprint(string.format(\"%.8f\", sum))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi received otoshidama (New Year's money gifts) from N of his relatives.\n\nYou are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either JPY or BTC, and x_i and u_i represent the content of the otoshidama from the i-th relative.\n\nFor example, if x_1 = 10000 and u_1 = JPY, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = 0.10000000 and u_2 = BTC, the otoshidama from the second relative is 0.1 bitcoins.\n\nIf we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?\n\nConstraints\n\n2 \\leq N \\leq 10\n\nu_i = JPY or BTC.\n\nIf u_i = JPY, x_i is an integer such that 1 \\leq x_i \\leq 10^8.\n\nIf u_i = BTC, x_i is a decimal with 8 decimal digits, such that 0.00000001 \\leq x_i \\leq 100.00000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 u_1\nx_2 u_2\n:\nx_N u_N\n\nOutput\n\nIf the gifts are worth Y yen in total, print the value Y (not necessarily an integer).\n\nOutput will be judged correct when the absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10000 JPY\n0.10000000 BTC\n\nSample Output 1\n\n48000.0\n\nThe otoshidama from the first relative is 10000 yen. The otoshidama from the second relative is 0.1 bitcoins, which is worth 38000.0 yen if converted at the rate of 380000.0 JPY per 1.0 BTC. The sum of these is 48000.0 yen.\n\nOutputs such as 48000 and 48000.1 will also be judged correct.\n\nSample Input 2\n\n3\n100000000 JPY\n100.00000000 BTC\n0.00000001 BTC\n\nSample Output 2\n\n138000000.0038\n\nIn this case, outputs such as 138001000 and 1.38e8 will also be judged correct.", "sample_input": "2\n10000 JPY\n0.10000000 BTC\n"}, "reference_outputs": ["48000.0\n"], "source_document_id": "p03110", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi received otoshidama (New Year's money gifts) from N of his relatives.\n\nYou are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either JPY or BTC, and x_i and u_i represent the content of the otoshidama from the i-th relative.\n\nFor example, if x_1 = 10000 and u_1 = JPY, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = 0.10000000 and u_2 = BTC, the otoshidama from the second relative is 0.1 bitcoins.\n\nIf we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?\n\nConstraints\n\n2 \\leq N \\leq 10\n\nu_i = JPY or BTC.\n\nIf u_i = JPY, x_i is an integer such that 1 \\leq x_i \\leq 10^8.\n\nIf u_i = BTC, x_i is a decimal with 8 decimal digits, such that 0.00000001 \\leq x_i \\leq 100.00000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 u_1\nx_2 u_2\n:\nx_N u_N\n\nOutput\n\nIf the gifts are worth Y yen in total, print the value Y (not necessarily an integer).\n\nOutput will be judged correct when the absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10000 JPY\n0.10000000 BTC\n\nSample Output 1\n\n48000.0\n\nThe otoshidama from the first relative is 10000 yen. The otoshidama from the second relative is 0.1 bitcoins, which is worth 38000.0 yen if converted at the rate of 380000.0 JPY per 1.0 BTC. The sum of these is 48000.0 yen.\n\nOutputs such as 48000 and 48000.1 will also be judged correct.\n\nSample Input 2\n\n3\n100000000 JPY\n100.00000000 BTC\n0.00000001 BTC\n\nSample Output 2\n\n138000000.0038\n\nIn this case, outputs such as 138001000 and 1.38e8 will also be judged correct.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Lua:s754879965", "group_id": "codeNet:p03110", "input_text": "N=io.read(\"n\")\nx={}\nu={}\nlocal total=0\nfor i=1,N do\n x[i]=io.read(\"n\")\n u[i]=io.read():match(\"%a+\")\n if u[i]==\"BTC\" then\n x[i]=380000*x[i]\n end\n total=total+x[i]\nend\nprint(total)\n", "language": "Lua", "metadata": {"date": 1551715404, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03110.html", "problem_id": "p03110", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03110/input.txt", "sample_output_relpath": "derived/input_output/data/p03110/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03110/Lua/s754879965.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s754879965", "user_id": "u015229643"}, "prompt_components": {"gold_output": "48000.0\n", "input_to_evaluate": "N=io.read(\"n\")\nx={}\nu={}\nlocal total=0\nfor i=1,N do\n x[i]=io.read(\"n\")\n u[i]=io.read():match(\"%a+\")\n if u[i]==\"BTC\" then\n x[i]=380000*x[i]\n end\n total=total+x[i]\nend\nprint(total)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi received otoshidama (New Year's money gifts) from N of his relatives.\n\nYou are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either JPY or BTC, and x_i and u_i represent the content of the otoshidama from the i-th relative.\n\nFor example, if x_1 = 10000 and u_1 = JPY, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = 0.10000000 and u_2 = BTC, the otoshidama from the second relative is 0.1 bitcoins.\n\nIf we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?\n\nConstraints\n\n2 \\leq N \\leq 10\n\nu_i = JPY or BTC.\n\nIf u_i = JPY, x_i is an integer such that 1 \\leq x_i \\leq 10^8.\n\nIf u_i = BTC, x_i is a decimal with 8 decimal digits, such that 0.00000001 \\leq x_i \\leq 100.00000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 u_1\nx_2 u_2\n:\nx_N u_N\n\nOutput\n\nIf the gifts are worth Y yen in total, print the value Y (not necessarily an integer).\n\nOutput will be judged correct when the absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10000 JPY\n0.10000000 BTC\n\nSample Output 1\n\n48000.0\n\nThe otoshidama from the first relative is 10000 yen. The otoshidama from the second relative is 0.1 bitcoins, which is worth 38000.0 yen if converted at the rate of 380000.0 JPY per 1.0 BTC. The sum of these is 48000.0 yen.\n\nOutputs such as 48000 and 48000.1 will also be judged correct.\n\nSample Input 2\n\n3\n100000000 JPY\n100.00000000 BTC\n0.00000001 BTC\n\nSample Output 2\n\n138000000.0038\n\nIn this case, outputs such as 138001000 and 1.38e8 will also be judged correct.", "sample_input": "2\n10000 JPY\n0.10000000 BTC\n"}, "reference_outputs": ["48000.0\n"], "source_document_id": "p03110", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi received otoshidama (New Year's money gifts) from N of his relatives.\n\nYou are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either JPY or BTC, and x_i and u_i represent the content of the otoshidama from the i-th relative.\n\nFor example, if x_1 = 10000 and u_1 = JPY, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = 0.10000000 and u_2 = BTC, the otoshidama from the second relative is 0.1 bitcoins.\n\nIf we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?\n\nConstraints\n\n2 \\leq N \\leq 10\n\nu_i = JPY or BTC.\n\nIf u_i = JPY, x_i is an integer such that 1 \\leq x_i \\leq 10^8.\n\nIf u_i = BTC, x_i is a decimal with 8 decimal digits, such that 0.00000001 \\leq x_i \\leq 100.00000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 u_1\nx_2 u_2\n:\nx_N u_N\n\nOutput\n\nIf the gifts are worth Y yen in total, print the value Y (not necessarily an integer).\n\nOutput will be judged correct when the absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10000 JPY\n0.10000000 BTC\n\nSample Output 1\n\n48000.0\n\nThe otoshidama from the first relative is 10000 yen. The otoshidama from the second relative is 0.1 bitcoins, which is worth 38000.0 yen if converted at the rate of 380000.0 JPY per 1.0 BTC. The sum of these is 48000.0 yen.\n\nOutputs such as 48000 and 48000.1 will also be judged correct.\n\nSample Input 2\n\n3\n100000000 JPY\n100.00000000 BTC\n0.00000001 BTC\n\nSample Output 2\n\n138000000.0038\n\nIn this case, outputs such as 138001000 and 1.38e8 will also be judged correct.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 187, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s719290919", "group_id": "codeNet:p03110", "input_text": "N=io.read(\"n\")\nx={}\nu={}\nlocal total=0\nfor i=1,N do\n x[i],u[i]=io.read():match(\"(%d+)%s(%w+)\")\n if u[i]==\"BTC\" then\n x[i]=380000*x[i]\n end\n total=total+x[i]\nend\nprint(total)", "language": "Lua", "metadata": {"date": 1551714063, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03110.html", "problem_id": "p03110", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03110/input.txt", "sample_output_relpath": "derived/input_output/data/p03110/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03110/Lua/s719290919.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s719290919", "user_id": "u015229643"}, "prompt_components": {"gold_output": "48000.0\n", "input_to_evaluate": "N=io.read(\"n\")\nx={}\nu={}\nlocal total=0\nfor i=1,N do\n x[i],u[i]=io.read():match(\"(%d+)%s(%w+)\")\n if u[i]==\"BTC\" then\n x[i]=380000*x[i]\n end\n total=total+x[i]\nend\nprint(total)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi received otoshidama (New Year's money gifts) from N of his relatives.\n\nYou are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either JPY or BTC, and x_i and u_i represent the content of the otoshidama from the i-th relative.\n\nFor example, if x_1 = 10000 and u_1 = JPY, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = 0.10000000 and u_2 = BTC, the otoshidama from the second relative is 0.1 bitcoins.\n\nIf we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?\n\nConstraints\n\n2 \\leq N \\leq 10\n\nu_i = JPY or BTC.\n\nIf u_i = JPY, x_i is an integer such that 1 \\leq x_i \\leq 10^8.\n\nIf u_i = BTC, x_i is a decimal with 8 decimal digits, such that 0.00000001 \\leq x_i \\leq 100.00000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 u_1\nx_2 u_2\n:\nx_N u_N\n\nOutput\n\nIf the gifts are worth Y yen in total, print the value Y (not necessarily an integer).\n\nOutput will be judged correct when the absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10000 JPY\n0.10000000 BTC\n\nSample Output 1\n\n48000.0\n\nThe otoshidama from the first relative is 10000 yen. The otoshidama from the second relative is 0.1 bitcoins, which is worth 38000.0 yen if converted at the rate of 380000.0 JPY per 1.0 BTC. The sum of these is 48000.0 yen.\n\nOutputs such as 48000 and 48000.1 will also be judged correct.\n\nSample Input 2\n\n3\n100000000 JPY\n100.00000000 BTC\n0.00000001 BTC\n\nSample Output 2\n\n138000000.0038\n\nIn this case, outputs such as 138001000 and 1.38e8 will also be judged correct.", "sample_input": "2\n10000 JPY\n0.10000000 BTC\n"}, "reference_outputs": ["48000.0\n"], "source_document_id": "p03110", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi received otoshidama (New Year's money gifts) from N of his relatives.\n\nYou are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either JPY or BTC, and x_i and u_i represent the content of the otoshidama from the i-th relative.\n\nFor example, if x_1 = 10000 and u_1 = JPY, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = 0.10000000 and u_2 = BTC, the otoshidama from the second relative is 0.1 bitcoins.\n\nIf we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?\n\nConstraints\n\n2 \\leq N \\leq 10\n\nu_i = JPY or BTC.\n\nIf u_i = JPY, x_i is an integer such that 1 \\leq x_i \\leq 10^8.\n\nIf u_i = BTC, x_i is a decimal with 8 decimal digits, such that 0.00000001 \\leq x_i \\leq 100.00000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 u_1\nx_2 u_2\n:\nx_N u_N\n\nOutput\n\nIf the gifts are worth Y yen in total, print the value Y (not necessarily an integer).\n\nOutput will be judged correct when the absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10000 JPY\n0.10000000 BTC\n\nSample Output 1\n\n48000.0\n\nThe otoshidama from the first relative is 10000 yen. The otoshidama from the second relative is 0.1 bitcoins, which is worth 38000.0 yen if converted at the rate of 380000.0 JPY per 1.0 BTC. The sum of these is 48000.0 yen.\n\nOutputs such as 48000 and 48000.1 will also be judged correct.\n\nSample Input 2\n\n3\n100000000 JPY\n100.00000000 BTC\n0.00000001 BTC\n\nSample Output 2\n\n138000000.0038\n\nIn this case, outputs such as 138001000 and 1.38e8 will also be judged correct.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 180, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s877173032", "group_id": "codeNet:p03110", "input_text": "N=io.read(\"n\")\nx={}\nu={}\nlocal total=0\nfor i=1,N do\n x[i]=io.read(\"n\")\n u[i]=io.read()\n if u[i]==\"BTC\" then\n x[i]=380000*x[i]\n end\n total=total+x[i]\nend\nprint(total)", "language": "Lua", "metadata": {"date": 1551713683, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03110.html", "problem_id": "p03110", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03110/input.txt", "sample_output_relpath": "derived/input_output/data/p03110/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03110/Lua/s877173032.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s877173032", "user_id": "u015229643"}, "prompt_components": {"gold_output": "48000.0\n", "input_to_evaluate": "N=io.read(\"n\")\nx={}\nu={}\nlocal total=0\nfor i=1,N do\n x[i]=io.read(\"n\")\n u[i]=io.read()\n if u[i]==\"BTC\" then\n x[i]=380000*x[i]\n end\n total=total+x[i]\nend\nprint(total)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi received otoshidama (New Year's money gifts) from N of his relatives.\n\nYou are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either JPY or BTC, and x_i and u_i represent the content of the otoshidama from the i-th relative.\n\nFor example, if x_1 = 10000 and u_1 = JPY, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = 0.10000000 and u_2 = BTC, the otoshidama from the second relative is 0.1 bitcoins.\n\nIf we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?\n\nConstraints\n\n2 \\leq N \\leq 10\n\nu_i = JPY or BTC.\n\nIf u_i = JPY, x_i is an integer such that 1 \\leq x_i \\leq 10^8.\n\nIf u_i = BTC, x_i is a decimal with 8 decimal digits, such that 0.00000001 \\leq x_i \\leq 100.00000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 u_1\nx_2 u_2\n:\nx_N u_N\n\nOutput\n\nIf the gifts are worth Y yen in total, print the value Y (not necessarily an integer).\n\nOutput will be judged correct when the absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10000 JPY\n0.10000000 BTC\n\nSample Output 1\n\n48000.0\n\nThe otoshidama from the first relative is 10000 yen. The otoshidama from the second relative is 0.1 bitcoins, which is worth 38000.0 yen if converted at the rate of 380000.0 JPY per 1.0 BTC. The sum of these is 48000.0 yen.\n\nOutputs such as 48000 and 48000.1 will also be judged correct.\n\nSample Input 2\n\n3\n100000000 JPY\n100.00000000 BTC\n0.00000001 BTC\n\nSample Output 2\n\n138000000.0038\n\nIn this case, outputs such as 138001000 and 1.38e8 will also be judged correct.", "sample_input": "2\n10000 JPY\n0.10000000 BTC\n"}, "reference_outputs": ["48000.0\n"], "source_document_id": "p03110", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi received otoshidama (New Year's money gifts) from N of his relatives.\n\nYou are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either JPY or BTC, and x_i and u_i represent the content of the otoshidama from the i-th relative.\n\nFor example, if x_1 = 10000 and u_1 = JPY, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = 0.10000000 and u_2 = BTC, the otoshidama from the second relative is 0.1 bitcoins.\n\nIf we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?\n\nConstraints\n\n2 \\leq N \\leq 10\n\nu_i = JPY or BTC.\n\nIf u_i = JPY, x_i is an integer such that 1 \\leq x_i \\leq 10^8.\n\nIf u_i = BTC, x_i is a decimal with 8 decimal digits, such that 0.00000001 \\leq x_i \\leq 100.00000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 u_1\nx_2 u_2\n:\nx_N u_N\n\nOutput\n\nIf the gifts are worth Y yen in total, print the value Y (not necessarily an integer).\n\nOutput will be judged correct when the absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10000 JPY\n0.10000000 BTC\n\nSample Output 1\n\n48000.0\n\nThe otoshidama from the first relative is 10000 yen. The otoshidama from the second relative is 0.1 bitcoins, which is worth 38000.0 yen if converted at the rate of 380000.0 JPY per 1.0 BTC. The sum of these is 48000.0 yen.\n\nOutputs such as 48000 and 48000.1 will also be judged correct.\n\nSample Input 2\n\n3\n100000000 JPY\n100.00000000 BTC\n0.00000001 BTC\n\nSample Output 2\n\n138000000.0038\n\nIn this case, outputs such as 138001000 and 1.38e8 will also be judged correct.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 173, "cpu_time_ms": 7, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s210404792", "group_id": "codeNet:p03110", "input_text": "n=io.read()*1\nlis={JPY=1,BTC=380000.0}\nans=0\nfor i=1,n do\n a,b=io.read():match(\"(.+)%s(.+)\")\n ans=a*lis[b]+ans\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1551100864, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03110.html", "problem_id": "p03110", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03110/input.txt", "sample_output_relpath": "derived/input_output/data/p03110/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03110/Lua/s210404792.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s210404792", "user_id": "u837412668"}, "prompt_components": {"gold_output": "48000.0\n", "input_to_evaluate": "n=io.read()*1\nlis={JPY=1,BTC=380000.0}\nans=0\nfor i=1,n do\n a,b=io.read():match(\"(.+)%s(.+)\")\n ans=a*lis[b]+ans\nend\nprint(ans)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi received otoshidama (New Year's money gifts) from N of his relatives.\n\nYou are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either JPY or BTC, and x_i and u_i represent the content of the otoshidama from the i-th relative.\n\nFor example, if x_1 = 10000 and u_1 = JPY, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = 0.10000000 and u_2 = BTC, the otoshidama from the second relative is 0.1 bitcoins.\n\nIf we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?\n\nConstraints\n\n2 \\leq N \\leq 10\n\nu_i = JPY or BTC.\n\nIf u_i = JPY, x_i is an integer such that 1 \\leq x_i \\leq 10^8.\n\nIf u_i = BTC, x_i is a decimal with 8 decimal digits, such that 0.00000001 \\leq x_i \\leq 100.00000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 u_1\nx_2 u_2\n:\nx_N u_N\n\nOutput\n\nIf the gifts are worth Y yen in total, print the value Y (not necessarily an integer).\n\nOutput will be judged correct when the absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10000 JPY\n0.10000000 BTC\n\nSample Output 1\n\n48000.0\n\nThe otoshidama from the first relative is 10000 yen. The otoshidama from the second relative is 0.1 bitcoins, which is worth 38000.0 yen if converted at the rate of 380000.0 JPY per 1.0 BTC. The sum of these is 48000.0 yen.\n\nOutputs such as 48000 and 48000.1 will also be judged correct.\n\nSample Input 2\n\n3\n100000000 JPY\n100.00000000 BTC\n0.00000001 BTC\n\nSample Output 2\n\n138000000.0038\n\nIn this case, outputs such as 138001000 and 1.38e8 will also be judged correct.", "sample_input": "2\n10000 JPY\n0.10000000 BTC\n"}, "reference_outputs": ["48000.0\n"], "source_document_id": "p03110", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi received otoshidama (New Year's money gifts) from N of his relatives.\n\nYou are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either JPY or BTC, and x_i and u_i represent the content of the otoshidama from the i-th relative.\n\nFor example, if x_1 = 10000 and u_1 = JPY, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = 0.10000000 and u_2 = BTC, the otoshidama from the second relative is 0.1 bitcoins.\n\nIf we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?\n\nConstraints\n\n2 \\leq N \\leq 10\n\nu_i = JPY or BTC.\n\nIf u_i = JPY, x_i is an integer such that 1 \\leq x_i \\leq 10^8.\n\nIf u_i = BTC, x_i is a decimal with 8 decimal digits, such that 0.00000001 \\leq x_i \\leq 100.00000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 u_1\nx_2 u_2\n:\nx_N u_N\n\nOutput\n\nIf the gifts are worth Y yen in total, print the value Y (not necessarily an integer).\n\nOutput will be judged correct when the absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10000 JPY\n0.10000000 BTC\n\nSample Output 1\n\n48000.0\n\nThe otoshidama from the first relative is 10000 yen. The otoshidama from the second relative is 0.1 bitcoins, which is worth 38000.0 yen if converted at the rate of 380000.0 JPY per 1.0 BTC. The sum of these is 48000.0 yen.\n\nOutputs such as 48000 and 48000.1 will also be judged correct.\n\nSample Input 2\n\n3\n100000000 JPY\n100.00000000 BTC\n0.00000001 BTC\n\nSample Output 2\n\n138000000.0038\n\nIn this case, outputs such as 138001000 and 1.38e8 will also be judged correct.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s038595879", "group_id": "codeNet:p03110", "input_text": "n=io.read()*1\nlis={JPY=1,BTC=38000.0}\nans=0\nfor i=1,n do\n a,b=io.read():match(\"(.+)%s(.+)\")\n ans=a*lis[b]+ans\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1551100758, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03110.html", "problem_id": "p03110", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03110/input.txt", "sample_output_relpath": "derived/input_output/data/p03110/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03110/Lua/s038595879.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s038595879", "user_id": "u837412668"}, "prompt_components": {"gold_output": "48000.0\n", "input_to_evaluate": "n=io.read()*1\nlis={JPY=1,BTC=38000.0}\nans=0\nfor i=1,n do\n a,b=io.read():match(\"(.+)%s(.+)\")\n ans=a*lis[b]+ans\nend\nprint(ans)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi received otoshidama (New Year's money gifts) from N of his relatives.\n\nYou are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either JPY or BTC, and x_i and u_i represent the content of the otoshidama from the i-th relative.\n\nFor example, if x_1 = 10000 and u_1 = JPY, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = 0.10000000 and u_2 = BTC, the otoshidama from the second relative is 0.1 bitcoins.\n\nIf we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?\n\nConstraints\n\n2 \\leq N \\leq 10\n\nu_i = JPY or BTC.\n\nIf u_i = JPY, x_i is an integer such that 1 \\leq x_i \\leq 10^8.\n\nIf u_i = BTC, x_i is a decimal with 8 decimal digits, such that 0.00000001 \\leq x_i \\leq 100.00000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 u_1\nx_2 u_2\n:\nx_N u_N\n\nOutput\n\nIf the gifts are worth Y yen in total, print the value Y (not necessarily an integer).\n\nOutput will be judged correct when the absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10000 JPY\n0.10000000 BTC\n\nSample Output 1\n\n48000.0\n\nThe otoshidama from the first relative is 10000 yen. The otoshidama from the second relative is 0.1 bitcoins, which is worth 38000.0 yen if converted at the rate of 380000.0 JPY per 1.0 BTC. The sum of these is 48000.0 yen.\n\nOutputs such as 48000 and 48000.1 will also be judged correct.\n\nSample Input 2\n\n3\n100000000 JPY\n100.00000000 BTC\n0.00000001 BTC\n\nSample Output 2\n\n138000000.0038\n\nIn this case, outputs such as 138001000 and 1.38e8 will also be judged correct.", "sample_input": "2\n10000 JPY\n0.10000000 BTC\n"}, "reference_outputs": ["48000.0\n"], "source_document_id": "p03110", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi received otoshidama (New Year's money gifts) from N of his relatives.\n\nYou are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either JPY or BTC, and x_i and u_i represent the content of the otoshidama from the i-th relative.\n\nFor example, if x_1 = 10000 and u_1 = JPY, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = 0.10000000 and u_2 = BTC, the otoshidama from the second relative is 0.1 bitcoins.\n\nIf we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?\n\nConstraints\n\n2 \\leq N \\leq 10\n\nu_i = JPY or BTC.\n\nIf u_i = JPY, x_i is an integer such that 1 \\leq x_i \\leq 10^8.\n\nIf u_i = BTC, x_i is a decimal with 8 decimal digits, such that 0.00000001 \\leq x_i \\leq 100.00000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 u_1\nx_2 u_2\n:\nx_N u_N\n\nOutput\n\nIf the gifts are worth Y yen in total, print the value Y (not necessarily an integer).\n\nOutput will be judged correct when the absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10000 JPY\n0.10000000 BTC\n\nSample Output 1\n\n48000.0\n\nThe otoshidama from the first relative is 10000 yen. The otoshidama from the second relative is 0.1 bitcoins, which is worth 38000.0 yen if converted at the rate of 380000.0 JPY per 1.0 BTC. The sum of these is 48000.0 yen.\n\nOutputs such as 48000 and 48000.1 will also be judged correct.\n\nSample Input 2\n\n3\n100000000 JPY\n100.00000000 BTC\n0.00000001 BTC\n\nSample Output 2\n\n138000000.0038\n\nIn this case, outputs such as 138001000 and 1.38e8 will also be judged correct.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 126, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s353222336", "group_id": "codeNet:p03111", "input_text": "local n = io.read(\"n\")\nlocal c = io.read(\"n\")\nlocal b = io.read(\"n\")\nlocal a = io.read(\"n\")\nfunction pay(x,y,z)\n return math.abs(x-a)+math.abs(y-b)+math.abs(z-c)\nend\nlocal mem = {}\nfunction dfs(arr)\n local arrstr = table.concat(arr,\":\")\n if mem[arrstr] then\n return mem[arrstr]\n end\n mem[arrstr] = math.huge\n for i=1,#arr do\n for j=i+1, #arr do\n for k=j+1, #arr do\n cnt = pay(arr[i],arr[j],arr[k])\n if cnt < mem[arrstr] then\n mem[arrstr] = cnt\n end\n end\n end\n end\n\n if #arr > 3 then\n for i=1,#arr do\n for j=i+1,#arr do\n local newarr = {}\n for k=1,#arr do\n if k ~= i and k ~= j then\n newarr[#newarr+1] = arr[k]\n end\n end\n newarr[#newarr+1] = arr[i]+arr[j]\n table.sort(newarr)\n local newv = 10 + dfs(newarr)\n if newv < mem[arrstr] then\n mem[arrstr] = newv\n end\n end\n end\n end\n\n return mem[arrstr]\nend\n\nlocal bamboos = {}\n\n\nfor i=1,n do\n bamboos[i] = io.read(\"n\")\nend\ntable.sort(bamboos)\nprint(dfs(bamboos))", "language": "Lua", "metadata": {"date": 1551639156, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03111.html", "problem_id": "p03111", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03111/input.txt", "sample_output_relpath": "derived/input_output/data/p03111/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03111/Lua/s353222336.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s353222336", "user_id": "u914762730"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "local n = io.read(\"n\")\nlocal c = io.read(\"n\")\nlocal b = io.read(\"n\")\nlocal a = io.read(\"n\")\nfunction pay(x,y,z)\n return math.abs(x-a)+math.abs(y-b)+math.abs(z-c)\nend\nlocal mem = {}\nfunction dfs(arr)\n local arrstr = table.concat(arr,\":\")\n if mem[arrstr] then\n return mem[arrstr]\n end\n mem[arrstr] = math.huge\n for i=1,#arr do\n for j=i+1, #arr do\n for k=j+1, #arr do\n cnt = pay(arr[i],arr[j],arr[k])\n if cnt < mem[arrstr] then\n mem[arrstr] = cnt\n end\n end\n end\n end\n\n if #arr > 3 then\n for i=1,#arr do\n for j=i+1,#arr do\n local newarr = {}\n for k=1,#arr do\n if k ~= i and k ~= j then\n newarr[#newarr+1] = arr[k]\n end\n end\n newarr[#newarr+1] = arr[i]+arr[j]\n table.sort(newarr)\n local newv = 10 + dfs(newarr)\n if newv < mem[arrstr] then\n mem[arrstr] = newv\n end\n end\n end\n end\n\n return mem[arrstr]\nend\n\nlocal bamboos = {}\n\n\nfor i=1,n do\n bamboos[i] = io.read(\"n\")\nend\ntable.sort(bamboos)\nprint(dfs(bamboos))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou have N bamboos. The lengths (in centimeters) of these are l_1, l_2, ..., l_N, respectively.\n\nYour objective is to use some of these bamboos (possibly all) to obtain three bamboos of length A, B, C. For that, you can use the following three kinds of magics any number:\n\nExtension Magic: Consumes 1 MP (magic point). Choose one bamboo and increase its length by 1.\n\nShortening Magic: Consumes 1 MP. Choose one bamboo of length at least 2 and decrease its length by 1.\n\nComposition Magic: Consumes 10 MP. Choose two bamboos and combine them into one bamboo. The length of this new bamboo is equal to the sum of the lengths of the two bamboos combined. (Afterwards, further magics can be used on this bamboo.)\n\nAt least how much MP is needed to achieve the objective?\n\nConstraints\n\n3 \\leq N \\leq 8\n\n1 \\leq C < B < A \\leq 1000\n\n1 \\leq l_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C\nl_1\nl_2\n:\nl_N\n\nOutput\n\nPrint the minimum amount of MP needed to achieve the objective.\n\nSample Input 1\n\n5 100 90 80\n98\n40\n30\n21\n80\n\nSample Output 1\n\n23\n\nWe are obtaining three bamboos of lengths 100, 90, 80 from five bamboos 98, 40, 30, 21, 80. We already have a bamboo of length 80, and we can obtain bamboos of lengths 100, 90 by using the magics as follows at the total cost of 23 MP, which is optimal.\n\nUse Extension Magic twice on the bamboo of length 98 to obtain a bamboo of length 100. (MP consumed: 2)\n\nUse Composition Magic on the bamboos of lengths 40, 30 to obtain a bamboo of length 70. (MP consumed: 10)\n\nUse Shortening Magic once on the bamboo of length 21 to obtain a bamboo of length 20. (MP consumed: 1)\n\nUse Composition Magic on the bamboo of length 70 obtained in step 2 and the bamboo of length 20 obtained in step 3 to obtain a bamboo of length 90. (MP consumed: 10)\n\nSample Input 2\n\n8 100 90 80\n100\n100\n90\n90\n90\n80\n80\n80\n\nSample Output 2\n\n0\n\nIf we already have all bamboos of the desired lengths, the amount of MP needed is 0. As seen here, we do not necessarily need to use all the bamboos.\n\nSample Input 3\n\n8 1000 800 100\n300\n333\n400\n444\n500\n555\n600\n666\n\nSample Output 3\n\n243", "sample_input": "5 100 90 80\n98\n40\n30\n21\n80\n"}, "reference_outputs": ["23\n"], "source_document_id": "p03111", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou have N bamboos. The lengths (in centimeters) of these are l_1, l_2, ..., l_N, respectively.\n\nYour objective is to use some of these bamboos (possibly all) to obtain three bamboos of length A, B, C. For that, you can use the following three kinds of magics any number:\n\nExtension Magic: Consumes 1 MP (magic point). Choose one bamboo and increase its length by 1.\n\nShortening Magic: Consumes 1 MP. Choose one bamboo of length at least 2 and decrease its length by 1.\n\nComposition Magic: Consumes 10 MP. Choose two bamboos and combine them into one bamboo. The length of this new bamboo is equal to the sum of the lengths of the two bamboos combined. (Afterwards, further magics can be used on this bamboo.)\n\nAt least how much MP is needed to achieve the objective?\n\nConstraints\n\n3 \\leq N \\leq 8\n\n1 \\leq C < B < A \\leq 1000\n\n1 \\leq l_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C\nl_1\nl_2\n:\nl_N\n\nOutput\n\nPrint the minimum amount of MP needed to achieve the objective.\n\nSample Input 1\n\n5 100 90 80\n98\n40\n30\n21\n80\n\nSample Output 1\n\n23\n\nWe are obtaining three bamboos of lengths 100, 90, 80 from five bamboos 98, 40, 30, 21, 80. We already have a bamboo of length 80, and we can obtain bamboos of lengths 100, 90 by using the magics as follows at the total cost of 23 MP, which is optimal.\n\nUse Extension Magic twice on the bamboo of length 98 to obtain a bamboo of length 100. (MP consumed: 2)\n\nUse Composition Magic on the bamboos of lengths 40, 30 to obtain a bamboo of length 70. (MP consumed: 10)\n\nUse Shortening Magic once on the bamboo of length 21 to obtain a bamboo of length 20. (MP consumed: 1)\n\nUse Composition Magic on the bamboo of length 70 obtained in step 2 and the bamboo of length 20 obtained in step 3 to obtain a bamboo of length 90. (MP consumed: 10)\n\nSample Input 2\n\n8 100 90 80\n100\n100\n90\n90\n90\n80\n80\n80\n\nSample Output 2\n\n0\n\nIf we already have all bamboos of the desired lengths, the amount of MP needed is 0. As seen here, we do not necessarily need to use all the bamboos.\n\nSample Input 3\n\n8 1000 800 100\n300\n333\n400\n444\n500\n555\n600\n666\n\nSample Output 3\n\n243", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1280, "cpu_time_ms": 78, "memory_kb": 1528}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s473814984", "group_id": "codeNet:p03111", "input_text": "local DBG = false\nfunction dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\nfunction dbgpr_t(tbl)\n if DBG then\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in ipairs(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\nfunction tbl_clone(tbl)\n return {table.unpack(tbl)}\nend\n\nfunction parse_problem()\n local N = io.read(\"n\")\n local goals = {}\n table.insert(goals, io.read(\"n\"))\n table.insert(goals, io.read(\"n\"))\n table.insert(goals, io.read(\"n\"))\n local ingredients = {}\n for i=1,N do\n local l, _ = io.read(\"n\", \"l\")\n table.insert(ingredients, l)\n end\n return goals, ingredients\nend\n\nfunction main()\n local goals, ingredients = parse_problem()\n local INF = 999999\n\n local function find_min()\n local function update(cur_lengths, k, x)\n -- Update cur_lengths.\n -- Ingredients k is used for x.\n local t = tbl_clone(cur_lengths)\n t[x] = t[x] + ingredients[k]\n return t\n end\n local function synthesis_cost(cur_lengths, x)\n -- Ingredients is used for x.\n if cur_lengths[x] == 0 then\n return 0\n else\n return 10\n end\n end\n local function find_min_rec(i, cur_lengths, cur_cost)\n -- i (0 <= i <= #ingredients): Number for decided ingredients.\n -- cur_lengths[k] (1 <= k <= 3): Current length for goal k.\n dbgpr(i, cur_cost)\n if i == #ingredients then\n for k=1,#goals do\n if cur_lengths[k] == 0 then\n return INF\n end\n cur_cost = cur_cost + math.abs(cur_lengths[k] - goals[k])\n end\n return cur_cost\n end\n local next_i = i + 1\n local visit_costs = {\n find_min_rec(next_i, update(cur_lengths, next_i, 1), cur_cost + synthesis_cost(cur_lengths, 1)),\n find_min_rec(next_i, update(cur_lengths, next_i, 2), cur_cost + synthesis_cost(cur_lengths, 2)),\n find_min_rec(next_i, update(cur_lengths, next_i, 3), cur_cost + synthesis_cost(cur_lengths, 3)),\n find_min_rec(next_i, tbl_clone(cur_lengths), cur_cost)\n }\n table.sort(visit_costs)\n return visit_costs[1]\n end\n return find_min_rec(0, {0, 0, 0}, 0)\n end\n local min_used_mp = find_min()\n print(min_used_mp)\nend\nmain()\n", "language": "Lua", "metadata": {"date": 1551051380, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03111.html", "problem_id": "p03111", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03111/input.txt", "sample_output_relpath": "derived/input_output/data/p03111/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03111/Lua/s473814984.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s473814984", "user_id": "u162773977"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "local DBG = false\nfunction dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\nfunction dbgpr_t(tbl)\n if DBG then\n dbgpr(tbl)\n io.write(\"[dbg]\")\n for i,v in ipairs(tbl) do\n io.write(i)\n io.write(\":\")\n io.write(tostring(v))\n io.write(\" \")\n end\n print(\"\")\n end\nend\n\nfunction tbl_clone(tbl)\n return {table.unpack(tbl)}\nend\n\nfunction parse_problem()\n local N = io.read(\"n\")\n local goals = {}\n table.insert(goals, io.read(\"n\"))\n table.insert(goals, io.read(\"n\"))\n table.insert(goals, io.read(\"n\"))\n local ingredients = {}\n for i=1,N do\n local l, _ = io.read(\"n\", \"l\")\n table.insert(ingredients, l)\n end\n return goals, ingredients\nend\n\nfunction main()\n local goals, ingredients = parse_problem()\n local INF = 999999\n\n local function find_min()\n local function update(cur_lengths, k, x)\n -- Update cur_lengths.\n -- Ingredients k is used for x.\n local t = tbl_clone(cur_lengths)\n t[x] = t[x] + ingredients[k]\n return t\n end\n local function synthesis_cost(cur_lengths, x)\n -- Ingredients is used for x.\n if cur_lengths[x] == 0 then\n return 0\n else\n return 10\n end\n end\n local function find_min_rec(i, cur_lengths, cur_cost)\n -- i (0 <= i <= #ingredients): Number for decided ingredients.\n -- cur_lengths[k] (1 <= k <= 3): Current length for goal k.\n dbgpr(i, cur_cost)\n if i == #ingredients then\n for k=1,#goals do\n if cur_lengths[k] == 0 then\n return INF\n end\n cur_cost = cur_cost + math.abs(cur_lengths[k] - goals[k])\n end\n return cur_cost\n end\n local next_i = i + 1\n local visit_costs = {\n find_min_rec(next_i, update(cur_lengths, next_i, 1), cur_cost + synthesis_cost(cur_lengths, 1)),\n find_min_rec(next_i, update(cur_lengths, next_i, 2), cur_cost + synthesis_cost(cur_lengths, 2)),\n find_min_rec(next_i, update(cur_lengths, next_i, 3), cur_cost + synthesis_cost(cur_lengths, 3)),\n find_min_rec(next_i, tbl_clone(cur_lengths), cur_cost)\n }\n table.sort(visit_costs)\n return visit_costs[1]\n end\n return find_min_rec(0, {0, 0, 0}, 0)\n end\n local min_used_mp = find_min()\n print(min_used_mp)\nend\nmain()\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou have N bamboos. The lengths (in centimeters) of these are l_1, l_2, ..., l_N, respectively.\n\nYour objective is to use some of these bamboos (possibly all) to obtain three bamboos of length A, B, C. For that, you can use the following three kinds of magics any number:\n\nExtension Magic: Consumes 1 MP (magic point). Choose one bamboo and increase its length by 1.\n\nShortening Magic: Consumes 1 MP. Choose one bamboo of length at least 2 and decrease its length by 1.\n\nComposition Magic: Consumes 10 MP. Choose two bamboos and combine them into one bamboo. The length of this new bamboo is equal to the sum of the lengths of the two bamboos combined. (Afterwards, further magics can be used on this bamboo.)\n\nAt least how much MP is needed to achieve the objective?\n\nConstraints\n\n3 \\leq N \\leq 8\n\n1 \\leq C < B < A \\leq 1000\n\n1 \\leq l_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C\nl_1\nl_2\n:\nl_N\n\nOutput\n\nPrint the minimum amount of MP needed to achieve the objective.\n\nSample Input 1\n\n5 100 90 80\n98\n40\n30\n21\n80\n\nSample Output 1\n\n23\n\nWe are obtaining three bamboos of lengths 100, 90, 80 from five bamboos 98, 40, 30, 21, 80. We already have a bamboo of length 80, and we can obtain bamboos of lengths 100, 90 by using the magics as follows at the total cost of 23 MP, which is optimal.\n\nUse Extension Magic twice on the bamboo of length 98 to obtain a bamboo of length 100. (MP consumed: 2)\n\nUse Composition Magic on the bamboos of lengths 40, 30 to obtain a bamboo of length 70. (MP consumed: 10)\n\nUse Shortening Magic once on the bamboo of length 21 to obtain a bamboo of length 20. (MP consumed: 1)\n\nUse Composition Magic on the bamboo of length 70 obtained in step 2 and the bamboo of length 20 obtained in step 3 to obtain a bamboo of length 90. (MP consumed: 10)\n\nSample Input 2\n\n8 100 90 80\n100\n100\n90\n90\n90\n80\n80\n80\n\nSample Output 2\n\n0\n\nIf we already have all bamboos of the desired lengths, the amount of MP needed is 0. As seen here, we do not necessarily need to use all the bamboos.\n\nSample Input 3\n\n8 1000 800 100\n300\n333\n400\n444\n500\n555\n600\n666\n\nSample Output 3\n\n243", "sample_input": "5 100 90 80\n98\n40\n30\n21\n80\n"}, "reference_outputs": ["23\n"], "source_document_id": "p03111", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou have N bamboos. The lengths (in centimeters) of these are l_1, l_2, ..., l_N, respectively.\n\nYour objective is to use some of these bamboos (possibly all) to obtain three bamboos of length A, B, C. For that, you can use the following three kinds of magics any number:\n\nExtension Magic: Consumes 1 MP (magic point). Choose one bamboo and increase its length by 1.\n\nShortening Magic: Consumes 1 MP. Choose one bamboo of length at least 2 and decrease its length by 1.\n\nComposition Magic: Consumes 10 MP. Choose two bamboos and combine them into one bamboo. The length of this new bamboo is equal to the sum of the lengths of the two bamboos combined. (Afterwards, further magics can be used on this bamboo.)\n\nAt least how much MP is needed to achieve the objective?\n\nConstraints\n\n3 \\leq N \\leq 8\n\n1 \\leq C < B < A \\leq 1000\n\n1 \\leq l_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C\nl_1\nl_2\n:\nl_N\n\nOutput\n\nPrint the minimum amount of MP needed to achieve the objective.\n\nSample Input 1\n\n5 100 90 80\n98\n40\n30\n21\n80\n\nSample Output 1\n\n23\n\nWe are obtaining three bamboos of lengths 100, 90, 80 from five bamboos 98, 40, 30, 21, 80. We already have a bamboo of length 80, and we can obtain bamboos of lengths 100, 90 by using the magics as follows at the total cost of 23 MP, which is optimal.\n\nUse Extension Magic twice on the bamboo of length 98 to obtain a bamboo of length 100. (MP consumed: 2)\n\nUse Composition Magic on the bamboos of lengths 40, 30 to obtain a bamboo of length 70. (MP consumed: 10)\n\nUse Shortening Magic once on the bamboo of length 21 to obtain a bamboo of length 20. (MP consumed: 1)\n\nUse Composition Magic on the bamboo of length 70 obtained in step 2 and the bamboo of length 20 obtained in step 3 to obtain a bamboo of length 90. (MP consumed: 10)\n\nSample Input 2\n\n8 100 90 80\n100\n100\n90\n90\n90\n80\n80\n80\n\nSample Output 2\n\n0\n\nIf we already have all bamboos of the desired lengths, the amount of MP needed is 0. As seen here, we do not necessarily need to use all the bamboos.\n\nSample Input 3\n\n8 1000 800 100\n300\n333\n400\n444\n500\n555\n600\n666\n\nSample Output 3\n\n243", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2647, "cpu_time_ms": 102, "memory_kb": 880}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s852592786", "group_id": "codeNet:p03112", "input_text": "local function comp(a, b)\n return a < b\nend\n\nlocal function lower_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if not comp(ary[1], x) then return 1 end\n if comp(ary[num], x) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = (min + max) // 2\n if comp(ary[mid], x) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal a, b, q = io.read(\"*n\", \"*n\", \"*n\")\nlocal s, t = {}, {}\nfor i = 1, a do\n s[i] = io.read(\"*n\")\nend\nfor i = 1, b do\n t[i] = io.read(\"*n\")\nend\nlocal mab, mmi = math.abs, math.min\nfor iq = 1, q do\n local x = io.read(\"*n\")\n ap = lower_bound(s, x)\n bp = lower_bound(t, x)\n local al = 1 < ap and s[ap - 1] or false\n local bl = 1 < bp and t[bp - 1] or false\n local ar = ap <= a and s[ap] or false\n local br = bp <= b and t[bp] or false\n local ret = 1000000007 * 100\n if al and bl then\n ret = mmi(ret, mab(x - al) + mab(al - bl), mab(x - bl) + mab(bl - al))\n end\n if al and br then\n ret = mmi(ret, mab(x - al) + mab(al - br), mab(x - br) + mab(br - al))\n end\n if ar and bl then\n ret = mmi(ret, mab(x - ar) + mab(ar - bl), mab(x - bl) + mab(bl - ar))\n end\n if ar and br then\n ret = mmi(ret, mab(x - ar) + mab(ar - br), mab(x - br) + mab(br - ar))\n end\n print(ret)\nend\n", "language": "Lua", "metadata": {"date": 1597424385, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03112.html", "problem_id": "p03112", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03112/input.txt", "sample_output_relpath": "derived/input_output/data/p03112/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03112/Lua/s852592786.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s852592786", "user_id": "u120582723"}, "prompt_components": {"gold_output": "350\n1400\n301\n399\n", "input_to_evaluate": "local function comp(a, b)\n return a < b\nend\n\nlocal function lower_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if not comp(ary[1], x) then return 1 end\n if comp(ary[num], x) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = (min + max) // 2\n if comp(ary[mid], x) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal a, b, q = io.read(\"*n\", \"*n\", \"*n\")\nlocal s, t = {}, {}\nfor i = 1, a do\n s[i] = io.read(\"*n\")\nend\nfor i = 1, b do\n t[i] = io.read(\"*n\")\nend\nlocal mab, mmi = math.abs, math.min\nfor iq = 1, q do\n local x = io.read(\"*n\")\n ap = lower_bound(s, x)\n bp = lower_bound(t, x)\n local al = 1 < ap and s[ap - 1] or false\n local bl = 1 < bp and t[bp - 1] or false\n local ar = ap <= a and s[ap] or false\n local br = bp <= b and t[bp] or false\n local ret = 1000000007 * 100\n if al and bl then\n ret = mmi(ret, mab(x - al) + mab(al - bl), mab(x - bl) + mab(bl - al))\n end\n if al and br then\n ret = mmi(ret, mab(x - al) + mab(al - br), mab(x - br) + mab(br - al))\n end\n if ar and bl then\n ret = mmi(ret, mab(x - ar) + mab(ar - bl), mab(x - bl) + mab(bl - ar))\n end\n if ar and br then\n ret = mmi(ret, mab(x - ar) + mab(ar - br), mab(x - br) + mab(br - ar))\n end\n print(ret)\nend\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nAlong a road running in an east-west direction, there are A shrines and B temples.\nThe i-th shrine from the west is located at a distance of s_i meters from the west end of the road, and the i-th temple from the west is located at a distance of t_i meters from the west end of the road.\n\nAnswer the following Q queries:\n\nQuery i (1 \\leq i \\leq Q): If we start from a point at a distance of x_i meters from the west end of the road and freely travel along the road, what is the minimum distance that needs to be traveled in order to visit one shrine and one temple? (It is allowed to pass by more shrines and temples than required.)\n\nConstraints\n\n1 \\leq A, B \\leq 10^5\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq s_1 < s_2 < ... < s_A \\leq 10^{10}\n\n1 \\leq t_1 < t_2 < ... < t_B \\leq 10^{10}\n\n1 \\leq x_i \\leq 10^{10}\n\ns_1, ..., s_A, t_1, ..., t_B, x_1, ..., x_Q are all different.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B Q\ns_1\n:\ns_A\nt_1\n:\nt_B\nx_1\n:\nx_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\n2 3 4\n100\n600\n400\n900\n1000\n150\n2000\n899\n799\n\nSample Output 1\n\n350\n1400\n301\n399\n\nThere are two shrines and three temples. The shrines are located at distances of 100, 600 meters from the west end of the road, and the temples are located at distances of 400, 900, 1000 meters from the west end of the road.\n\nQuery 1: If we start from a point at a distance of 150 meters from the west end of the road, the optimal move is first to walk 50 meters west to visit a shrine, then to walk 300 meters east to visit a temple.\n\nQuery 2: If we start from a point at a distance of 2000 meters from the west end of the road, the optimal move is first to walk 1000 meters west to visit a temple, then to walk 400 meters west to visit a shrine. We will pass by another temple on the way, but it is fine.\n\nQuery 3: If we start from a point at a distance of 899 meters from the west end of the road, the optimal move is first to walk 1 meter east to visit a temple, then to walk 300 meters west to visit a shrine.\n\nQuery 4: If we start from a point at a distance of 799 meters from the west end of the road, the optimal move is first to walk 199 meters west to visit a shrine, then to walk 200 meters west to visit a temple.\n\nSample Input 2\n\n1 1 3\n1\n10000000000\n2\n9999999999\n5000000000\n\nSample Output 2\n\n10000000000\n10000000000\n14999999998\n\nThe road is quite long, and we may need to travel a distance that does not fit into a 32-bit integer.", "sample_input": "2 3 4\n100\n600\n400\n900\n1000\n150\n2000\n899\n799\n"}, "reference_outputs": ["350\n1400\n301\n399\n"], "source_document_id": "p03112", "source_text": "Score : 400 points\n\nProblem Statement\n\nAlong a road running in an east-west direction, there are A shrines and B temples.\nThe i-th shrine from the west is located at a distance of s_i meters from the west end of the road, and the i-th temple from the west is located at a distance of t_i meters from the west end of the road.\n\nAnswer the following Q queries:\n\nQuery i (1 \\leq i \\leq Q): If we start from a point at a distance of x_i meters from the west end of the road and freely travel along the road, what is the minimum distance that needs to be traveled in order to visit one shrine and one temple? (It is allowed to pass by more shrines and temples than required.)\n\nConstraints\n\n1 \\leq A, B \\leq 10^5\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq s_1 < s_2 < ... < s_A \\leq 10^{10}\n\n1 \\leq t_1 < t_2 < ... < t_B \\leq 10^{10}\n\n1 \\leq x_i \\leq 10^{10}\n\ns_1, ..., s_A, t_1, ..., t_B, x_1, ..., x_Q are all different.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B Q\ns_1\n:\ns_A\nt_1\n:\nt_B\nx_1\n:\nx_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\n2 3 4\n100\n600\n400\n900\n1000\n150\n2000\n899\n799\n\nSample Output 1\n\n350\n1400\n301\n399\n\nThere are two shrines and three temples. The shrines are located at distances of 100, 600 meters from the west end of the road, and the temples are located at distances of 400, 900, 1000 meters from the west end of the road.\n\nQuery 1: If we start from a point at a distance of 150 meters from the west end of the road, the optimal move is first to walk 50 meters west to visit a shrine, then to walk 300 meters east to visit a temple.\n\nQuery 2: If we start from a point at a distance of 2000 meters from the west end of the road, the optimal move is first to walk 1000 meters west to visit a temple, then to walk 400 meters west to visit a shrine. We will pass by another temple on the way, but it is fine.\n\nQuery 3: If we start from a point at a distance of 899 meters from the west end of the road, the optimal move is first to walk 1 meter east to visit a temple, then to walk 300 meters west to visit a shrine.\n\nQuery 4: If we start from a point at a distance of 799 meters from the west end of the road, the optimal move is first to walk 199 meters west to visit a shrine, then to walk 200 meters west to visit a temple.\n\nSample Input 2\n\n1 1 3\n1\n10000000000\n2\n9999999999\n5000000000\n\nSample Output 2\n\n10000000000\n10000000000\n14999999998\n\nThe road is quite long, and we may need to travel a distance that does not fit into a 32-bit integer.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1304, "cpu_time_ms": 702, "memory_kb": 11968}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s976062233", "group_id": "codeNet:p03126", "input_text": "local ior = io.input()\nlocal n, m = ior:read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, m do t[i] = 0 end\nfor i = 1, n do\n local k = ior:read(\"*n\")\n for j = 1, k do\n local a = ior:read(\"*n\")\n t[a] = t[a] + 1\n end\nend\nlocal cnt = 0\nfor i = 1, m do\n if(t[i] == n) then cnt = cnt + 1 end\nend\nprint(cnt)\n", "language": "Lua", "metadata": {"date": 1558360016, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03126.html", "problem_id": "p03126", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03126/input.txt", "sample_output_relpath": "derived/input_output/data/p03126/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03126/Lua/s976062233.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s976062233", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local ior = io.input()\nlocal n, m = ior:read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, m do t[i] = 0 end\nfor i = 1, n do\n local k = ior:read(\"*n\")\n for j = 1, k do\n local a = ior:read(\"*n\")\n t[a] = t[a] + 1\n end\nend\nlocal cnt = 0\nfor i = 1, m do\n if(t[i] == n) then cnt = cnt + 1 end\nend\nprint(cnt)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nKatsusando loves omelette rice.\n\nBesides, he loves crème brûlée, tenderloin steak and so on, and believes that these foods are all loved by everyone.\n\nTo prove that hypothesis, he conducted a survey on M kinds of foods and asked N people whether they like these foods or not.\n\nThe i-th person answered that he/she only likes the A_{i1}-th, A_{i2}-th, ..., A_{iK_i}-th food.\n\nFind the number of the foods liked by all the N people.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 30\n\n1 \\leq K_i \\leq M\n\n1 \\leq A_{ij} \\leq M\n\nFor each i (1 \\leq i \\leq N), A_{i1}, A_{i2}, ..., A_{iK_i} are distinct.\n\nConstraints\n\nInput is given from Standard Input in the following format:\n\nN M\nK_1 A_{11} A_{12} ... A_{1K_1}\nK_2 A_{21} A_{22} ... A_{2K_2}\n:\nK_N A_{N1} A_{N2} ... A_{NK_N}\n\nOutput\n\nPrint the number of the foods liked by all the N people.\n\nSample Input 1\n\n3 4\n2 1 3\n3 1 2 3\n2 3 2\n\nSample Output 1\n\n1\n\nAs only the third food is liked by all the three people, 1 should be printed.\n\nSample Input 2\n\n5 5\n4 2 3 4 5\n4 1 3 4 5\n4 1 2 4 5\n4 1 2 3 5\n4 1 2 3 4\n\nSample Output 2\n\n0\n\nKatsusando's hypothesis turned out to be wrong.\n\nSample Input 3\n\n1 30\n3 5 10 30\n\nSample Output 3\n\n3", "sample_input": "3 4\n2 1 3\n3 1 2 3\n2 3 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03126", "source_text": "Score : 200 points\n\nProblem Statement\n\nKatsusando loves omelette rice.\n\nBesides, he loves crème brûlée, tenderloin steak and so on, and believes that these foods are all loved by everyone.\n\nTo prove that hypothesis, he conducted a survey on M kinds of foods and asked N people whether they like these foods or not.\n\nThe i-th person answered that he/she only likes the A_{i1}-th, A_{i2}-th, ..., A_{iK_i}-th food.\n\nFind the number of the foods liked by all the N people.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 30\n\n1 \\leq K_i \\leq M\n\n1 \\leq A_{ij} \\leq M\n\nFor each i (1 \\leq i \\leq N), A_{i1}, A_{i2}, ..., A_{iK_i} are distinct.\n\nConstraints\n\nInput is given from Standard Input in the following format:\n\nN M\nK_1 A_{11} A_{12} ... A_{1K_1}\nK_2 A_{21} A_{22} ... A_{2K_2}\n:\nK_N A_{N1} A_{N2} ... A_{NK_N}\n\nOutput\n\nPrint the number of the foods liked by all the N people.\n\nSample Input 1\n\n3 4\n2 1 3\n3 1 2 3\n2 3 2\n\nSample Output 1\n\n1\n\nAs only the third food is liked by all the three people, 1 should be printed.\n\nSample Input 2\n\n5 5\n4 2 3 4 5\n4 1 3 4 5\n4 1 2 4 5\n4 1 2 3 5\n4 1 2 3 4\n\nSample Output 2\n\n0\n\nKatsusando's hypothesis turned out to be wrong.\n\nSample Input 3\n\n1 30\n3 5 10 30\n\nSample Output 3\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s513445098", "group_id": "codeNet:p03127", "input_text": "N=io.read(\"n\")\nA={}\nfor i=1,N do\n A[i]=io.read(\"n\")\nend\nfunction mod()\n while A[#A-1]~=0 do\n table.sort(A)\n local index=0\n for i=1,#A do\n if A[i]~=0 then\n if A[i]==1 then\n return 1\n end\n index=i\n break\n end\n end\n for i=index,#A-1 do\n A[i+1]=A[i+1]%A[i]\n end\n end\n return A[#A]\nend\nprint(mod())", "language": "Lua", "metadata": {"date": 1551494421, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s513445098.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s513445098", "user_id": "u015229643"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "N=io.read(\"n\")\nA={}\nfor i=1,N do\n A[i]=io.read(\"n\")\nend\nfunction mod()\n while A[#A-1]~=0 do\n table.sort(A)\n local index=0\n for i=1,#A do\n if A[i]~=0 then\n if A[i]==1 then\n return 1\n end\n index=i\n break\n end\n end\n for i=index,#A-1 do\n A[i+1]=A[i+1]%A[i]\n end\n end\n return A[#A]\nend\nprint(mod())", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 457, "cpu_time_ms": 92, "memory_kb": 2424}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s502163853", "group_id": "codeNet:p03128", "input_text": "local n, m = io.read(\"*n\", \"*n\")\nlocal a = {}\nfor i = 1, 9 do a[i] = false end\nlocal num_to_line = {2, 5, 5, 4, 5, 6, 3, 7, 6}\nlocal topval = {0, 0, 0, 0, 0, 0, 0}\nfor i = 1, m do\n local tmp = io.read(\"*n\")\n a[tmp] = true\n local line = num_to_line[tmp]\n topval[line] = math.max(topval[line], tmp)\nend\nlocal r = {}\nlocal ins = table.insert\nif a[1] then\n if n % 2 == 1 then\n local tmp = {7, 5, 3, 2, 8}\n for i = 1, 5 do\n if a[tmp[i]] then\n ins(r, tmp[i])\n n = n - num_to_line[tmp[i]]\n break\n end\n end\n end\n for i = 1, n / 2 do ins(r, 1) end\nelseif a[7] then\n if n % 3 == 1 then\n if a[4] then ins(r, 4) n = n - 4\n elseif a[8] then ins(r, 8) n = n - 7\n else ins(r, topval[5]) ins(r, topval[5]) n = n - 10\n end\n elseif n % 3 == 2 then\n if 0 < topval[5] then ins(r, topval[5]) n = n - 5\n elseif a[4] then ins(r, 4) ins(r, 4) n = n - 8\n else ins(r, 8) ins(r, 8) n = n - 14\n end\n end\n for i = 1, n / 3 do ins(r, 7) end\nelseif a[4] then\n if n % 4 == 1 then\n if 0 < topval[5] then ins(r, topval[5]) n = n - 5\n elseif 0 < topval[6] then ins(r, topval[6]) ins(r, 8) n = n - 13\n else ins(r, 8) ins(r, 8) ins(r, 8) n = n - 21\n end\n elseif n % 4 == 2 then\n if 0 < topval[6] then ins(r, topval[6]) n = n - 6\n elseif 0 < topval[5] then ins(r, topval[5]) ins(r, topval[5]) n = n - 10\n else ins(r, 8) ins(r, 8) n = n - 14\n end\n elseif n % 4 == 3 then\n if a[9] and 0 < topval[5] then ins(r, 9) ins(r, topval[5]) n = n - 11\n elseif a[8] then ins(r, 8) n = n - 7\n elseif a[6] then ins(r, 6) ins(r, topval[5]) n = n - 11\n else ins(r, topval[5]) ins(r, topval[5]) ins(r, topval[5]) n = n - 15\n end\n end\n for i = 1, n / 4 do ins(r, 4) end\nelseif 0 < topval[5] then\n if n % 5 == 1 then\n if 0 < topval[6] then ins(r, topval[6]) n = n - 6\n else ins(r, 8) ins(r, 8) ins(r, 8) n = n - 21\n end\n elseif n % 5 == 2 then\n if a[9] then ins(r, 9) ins(r, 9) n = n - 12\n elseif a[8] then ins(r, 8) n = n - 7\n else ins(r, 6) ins(r, 6) n = n - 12\n end\n elseif n % 5 == 3 then\n if 0 < topval[6] and a[8] then ins(r, topval[6]) ins(r, 8) n = n - 13\n elseif 0 < topval[6] then ins(r, topval[6]) ins(r, topval[6]) ins(r, topval[6]) n = n - 18\n else ins(r, 8) ins(r, 8) ins(r, 8) ins(r, 8) n = n - 28\n end\n elseif n % 5 == 4 then\n if a[8] then ins(r, 8) ins(r, 8) n = n - 14\n else\n for i = 1, 4 do ins(r, topval[6]) end\n end\n n = n - 24\n end\n for i = 1, n / 5 do ins(r, topval[5]) end\nelseif 0 < topval[6] then\n for i = 1, n % 6 do ins(r, 8) end\n n = n - 7 * (n % 6)\n for i = 1, n / 6 do ins(r, topval[6]) end\nelse\n for i = 1, n / 7 do ins(r, 8) end\nend\ntable.sort(r, function(a, b) return a > b end)\nprint(table.concat(r, \"\"))\n", "language": "Lua", "metadata": {"date": 1566102314, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s502163853.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s502163853", "user_id": "u120582723"}, "prompt_components": {"gold_output": "777773\n", "input_to_evaluate": "local n, m = io.read(\"*n\", \"*n\")\nlocal a = {}\nfor i = 1, 9 do a[i] = false end\nlocal num_to_line = {2, 5, 5, 4, 5, 6, 3, 7, 6}\nlocal topval = {0, 0, 0, 0, 0, 0, 0}\nfor i = 1, m do\n local tmp = io.read(\"*n\")\n a[tmp] = true\n local line = num_to_line[tmp]\n topval[line] = math.max(topval[line], tmp)\nend\nlocal r = {}\nlocal ins = table.insert\nif a[1] then\n if n % 2 == 1 then\n local tmp = {7, 5, 3, 2, 8}\n for i = 1, 5 do\n if a[tmp[i]] then\n ins(r, tmp[i])\n n = n - num_to_line[tmp[i]]\n break\n end\n end\n end\n for i = 1, n / 2 do ins(r, 1) end\nelseif a[7] then\n if n % 3 == 1 then\n if a[4] then ins(r, 4) n = n - 4\n elseif a[8] then ins(r, 8) n = n - 7\n else ins(r, topval[5]) ins(r, topval[5]) n = n - 10\n end\n elseif n % 3 == 2 then\n if 0 < topval[5] then ins(r, topval[5]) n = n - 5\n elseif a[4] then ins(r, 4) ins(r, 4) n = n - 8\n else ins(r, 8) ins(r, 8) n = n - 14\n end\n end\n for i = 1, n / 3 do ins(r, 7) end\nelseif a[4] then\n if n % 4 == 1 then\n if 0 < topval[5] then ins(r, topval[5]) n = n - 5\n elseif 0 < topval[6] then ins(r, topval[6]) ins(r, 8) n = n - 13\n else ins(r, 8) ins(r, 8) ins(r, 8) n = n - 21\n end\n elseif n % 4 == 2 then\n if 0 < topval[6] then ins(r, topval[6]) n = n - 6\n elseif 0 < topval[5] then ins(r, topval[5]) ins(r, topval[5]) n = n - 10\n else ins(r, 8) ins(r, 8) n = n - 14\n end\n elseif n % 4 == 3 then\n if a[9] and 0 < topval[5] then ins(r, 9) ins(r, topval[5]) n = n - 11\n elseif a[8] then ins(r, 8) n = n - 7\n elseif a[6] then ins(r, 6) ins(r, topval[5]) n = n - 11\n else ins(r, topval[5]) ins(r, topval[5]) ins(r, topval[5]) n = n - 15\n end\n end\n for i = 1, n / 4 do ins(r, 4) end\nelseif 0 < topval[5] then\n if n % 5 == 1 then\n if 0 < topval[6] then ins(r, topval[6]) n = n - 6\n else ins(r, 8) ins(r, 8) ins(r, 8) n = n - 21\n end\n elseif n % 5 == 2 then\n if a[9] then ins(r, 9) ins(r, 9) n = n - 12\n elseif a[8] then ins(r, 8) n = n - 7\n else ins(r, 6) ins(r, 6) n = n - 12\n end\n elseif n % 5 == 3 then\n if 0 < topval[6] and a[8] then ins(r, topval[6]) ins(r, 8) n = n - 13\n elseif 0 < topval[6] then ins(r, topval[6]) ins(r, topval[6]) ins(r, topval[6]) n = n - 18\n else ins(r, 8) ins(r, 8) ins(r, 8) ins(r, 8) n = n - 28\n end\n elseif n % 5 == 4 then\n if a[8] then ins(r, 8) ins(r, 8) n = n - 14\n else\n for i = 1, 4 do ins(r, topval[6]) end\n end\n n = n - 24\n end\n for i = 1, n / 5 do ins(r, topval[5]) end\nelseif 0 < topval[6] then\n for i = 1, n % 6 do ins(r, 8) end\n n = n - 7 * (n % 6)\n for i = 1, n / 6 do ins(r, topval[6]) end\nelse\n for i = 1, n / 7 do ins(r, 8) end\nend\ntable.sort(r, function(a, b) return a > b end)\nprint(table.concat(r, \"\"))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFind the largest integer that can be formed with exactly N matchsticks, under the following conditions:\n\nEvery digit in the integer must be one of the digits A_1, A_2, ..., A_M (1 \\leq A_i \\leq 9).\n\nThe number of matchsticks used to form digits 1, 2, 3, 4, 5, 6, 7, 8, 9 should be 2, 5, 5, 4, 5, 6, 3, 7, 6, respectively.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^4\n\n1 \\leq M \\leq 9\n\n1 \\leq A_i \\leq 9\n\nA_i are all different.\n\nThere exists an integer that can be formed by exactly N matchsticks under the conditions.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_M\n\nOutput\n\nPrint the largest integer that can be formed with exactly N matchsticks under the conditions in the problem statement.\n\nSample Input 1\n\n20 4\n3 7 8 4\n\nSample Output 1\n\n777773\n\nThe integer 777773 can be formed with 3 + 3 + 3 + 3 + 3 + 5 = 20 matchsticks, and this is the largest integer that can be formed by 20 matchsticks under the conditions.\n\nSample Input 2\n\n101 9\n9 8 7 6 5 4 3 2 1\n\nSample Output 2\n\n71111111111111111111111111111111111111111111111111\n\nThe output may not fit into a 64-bit integer type.\n\nSample Input 3\n\n15 3\n5 4 6\n\nSample Output 3\n\n654", "sample_input": "20 4\n3 7 8 4\n"}, "reference_outputs": ["777773\n"], "source_document_id": "p03128", "source_text": "Score : 400 points\n\nProblem Statement\n\nFind the largest integer that can be formed with exactly N matchsticks, under the following conditions:\n\nEvery digit in the integer must be one of the digits A_1, A_2, ..., A_M (1 \\leq A_i \\leq 9).\n\nThe number of matchsticks used to form digits 1, 2, 3, 4, 5, 6, 7, 8, 9 should be 2, 5, 5, 4, 5, 6, 3, 7, 6, respectively.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^4\n\n1 \\leq M \\leq 9\n\n1 \\leq A_i \\leq 9\n\nA_i are all different.\n\nThere exists an integer that can be formed by exactly N matchsticks under the conditions.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_M\n\nOutput\n\nPrint the largest integer that can be formed with exactly N matchsticks under the conditions in the problem statement.\n\nSample Input 1\n\n20 4\n3 7 8 4\n\nSample Output 1\n\n777773\n\nThe integer 777773 can be formed with 3 + 3 + 3 + 3 + 3 + 5 = 20 matchsticks, and this is the largest integer that can be formed by 20 matchsticks under the conditions.\n\nSample Input 2\n\n101 9\n9 8 7 6 5 4 3 2 1\n\nSample Output 2\n\n71111111111111111111111111111111111111111111111111\n\nThe output may not fit into a 64-bit integer type.\n\nSample Input 3\n\n15 3\n5 4 6\n\nSample Output 3\n\n654", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2762, "cpu_time_ms": 6, "memory_kb": 264}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s992079574", "group_id": "codeNet:p03135", "input_text": "t, x = io.read(\"*n\", \"n\")\nprint(t / x)", "language": "Lua", "metadata": {"date": 1579366387, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03135.html", "problem_id": "p03135", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03135/input.txt", "sample_output_relpath": "derived/input_output/data/p03135/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03135/Lua/s992079574.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s992079574", "user_id": "u720483676"}, "prompt_components": {"gold_output": "2.6666666667\n", "input_to_evaluate": "t, x = io.read(\"*n\", \"n\")\nprint(t / x)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn order to pass the entrance examination tomorrow, Taro has to study for T more hours.\n\nFortunately, he can leap to World B where time passes X times as fast as it does in our world (World A).\n\nWhile (X \\times t) hours pass in World B, t hours pass in World A.\n\nHow many hours will pass in World A while Taro studies for T hours in World B?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq T \\leq 100\n\n1 \\leq X \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT X\n\nOutput\n\nPrint the number of hours that will pass in World A.\n\nThe output will be regarded as correct when its absolute or relative error from the judge's output is at most 10^{-3}.\n\nSample Input 1\n\n8 3\n\nSample Output 1\n\n2.6666666667\n\nWhile Taro studies for eight hours in World B where time passes three times as fast, 2.6666... hours will pass in World A.\n\nNote that an absolute or relative error of at most 10^{-3} is allowed.\n\nSample Input 2\n\n99 1\n\nSample Output 2\n\n99.0000000000\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n0.0100000000", "sample_input": "8 3\n"}, "reference_outputs": ["2.6666666667\n"], "source_document_id": "p03135", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn order to pass the entrance examination tomorrow, Taro has to study for T more hours.\n\nFortunately, he can leap to World B where time passes X times as fast as it does in our world (World A).\n\nWhile (X \\times t) hours pass in World B, t hours pass in World A.\n\nHow many hours will pass in World A while Taro studies for T hours in World B?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq T \\leq 100\n\n1 \\leq X \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT X\n\nOutput\n\nPrint the number of hours that will pass in World A.\n\nThe output will be regarded as correct when its absolute or relative error from the judge's output is at most 10^{-3}.\n\nSample Input 1\n\n8 3\n\nSample Output 1\n\n2.6666666667\n\nWhile Taro studies for eight hours in World B where time passes three times as fast, 2.6666... hours will pass in World A.\n\nNote that an absolute or relative error of at most 10^{-3} is allowed.\n\nSample Input 2\n\n99 1\n\nSample Output 2\n\n99.0000000000\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n0.0100000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 38, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s227900202", "group_id": "codeNet:p03135", "input_text": "a,b=io.read(\"*n\",\"*n\")\nprint(a/b)", "language": "Lua", "metadata": {"date": 1557890516, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03135.html", "problem_id": "p03135", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03135/input.txt", "sample_output_relpath": "derived/input_output/data/p03135/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03135/Lua/s227900202.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s227900202", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2.6666666667\n", "input_to_evaluate": "a,b=io.read(\"*n\",\"*n\")\nprint(a/b)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn order to pass the entrance examination tomorrow, Taro has to study for T more hours.\n\nFortunately, he can leap to World B where time passes X times as fast as it does in our world (World A).\n\nWhile (X \\times t) hours pass in World B, t hours pass in World A.\n\nHow many hours will pass in World A while Taro studies for T hours in World B?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq T \\leq 100\n\n1 \\leq X \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT X\n\nOutput\n\nPrint the number of hours that will pass in World A.\n\nThe output will be regarded as correct when its absolute or relative error from the judge's output is at most 10^{-3}.\n\nSample Input 1\n\n8 3\n\nSample Output 1\n\n2.6666666667\n\nWhile Taro studies for eight hours in World B where time passes three times as fast, 2.6666... hours will pass in World A.\n\nNote that an absolute or relative error of at most 10^{-3} is allowed.\n\nSample Input 2\n\n99 1\n\nSample Output 2\n\n99.0000000000\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n0.0100000000", "sample_input": "8 3\n"}, "reference_outputs": ["2.6666666667\n"], "source_document_id": "p03135", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn order to pass the entrance examination tomorrow, Taro has to study for T more hours.\n\nFortunately, he can leap to World B where time passes X times as fast as it does in our world (World A).\n\nWhile (X \\times t) hours pass in World B, t hours pass in World A.\n\nHow many hours will pass in World A while Taro studies for T hours in World B?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq T \\leq 100\n\n1 \\leq X \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT X\n\nOutput\n\nPrint the number of hours that will pass in World A.\n\nThe output will be regarded as correct when its absolute or relative error from the judge's output is at most 10^{-3}.\n\nSample Input 1\n\n8 3\n\nSample Output 1\n\n2.6666666667\n\nWhile Taro studies for eight hours in World B where time passes three times as fast, 2.6666... hours will pass in World A.\n\nNote that an absolute or relative error of at most 10^{-3} is allowed.\n\nSample Input 2\n\n99 1\n\nSample Output 2\n\n99.0000000000\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n0.0100000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 33, "cpu_time_ms": 4, "memory_kb": 500}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s668316457", "group_id": "codeNet:p03136", "input_text": "local N = io.read(\"n\")\nlocal L = {}\nlocal max_len = 0\nlocal sum = 0\nfor i=1,N do\n L[i] = io.read(\"n\")\n max_len = math.max(L[i], max_len)\n sum = sum + L[i]\nend\nsum = sum - max_len\nprint(max_len < sum and \"Yes\" or \"No\")", "language": "Lua", "metadata": {"date": 1559792998, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03136.html", "problem_id": "p03136", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03136/input.txt", "sample_output_relpath": "derived/input_output/data/p03136/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03136/Lua/s668316457.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s668316457", "user_id": "u162773977"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local N = io.read(\"n\")\nlocal L = {}\nlocal max_len = 0\nlocal sum = 0\nfor i=1,N do\n L[i] = io.read(\"n\")\n max_len = math.max(L[i], max_len)\n sum = sum + L[i]\nend\nsum = sum - max_len\nprint(max_len < sum and \"Yes\" or \"No\")", "problem_context": "Score : 200 points\n\nProblem Statement\n\nDetermine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.\n\nYou can use the following theorem:\n\nTheorem: an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the lengths of the other N-1 sides.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10\n\n1 \\leq L_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nOutput\n\nIf an N-sided polygon satisfying the condition can be drawn, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\n3 8 5 1\n\nSample Output 1\n\nYes\n\nSince 8 < 9 = 3 + 5 + 1, it follows from the theorem that such a polygon can be drawn on a plane.\n\nSample Input 2\n\n4\n3 8 4 1\n\nSample Output 2\n\nNo\n\nSince 8 \\geq 8 = 3 + 4 + 1, it follows from the theorem that such a polygon cannot be drawn on a plane.\n\nSample Input 3\n\n10\n1 8 10 5 8 12 34 100 11 3\n\nSample Output 3\n\nNo", "sample_input": "4\n3 8 5 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03136", "source_text": "Score : 200 points\n\nProblem Statement\n\nDetermine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.\n\nYou can use the following theorem:\n\nTheorem: an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the lengths of the other N-1 sides.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10\n\n1 \\leq L_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nOutput\n\nIf an N-sided polygon satisfying the condition can be drawn, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\n3 8 5 1\n\nSample Output 1\n\nYes\n\nSince 8 < 9 = 3 + 5 + 1, it follows from the theorem that such a polygon can be drawn on a plane.\n\nSample Input 2\n\n4\n3 8 4 1\n\nSample Output 2\n\nNo\n\nSince 8 \\geq 8 = 3 + 4 + 1, it follows from the theorem that such a polygon cannot be drawn on a plane.\n\nSample Input 3\n\n10\n1 8 10 5 8 12 34 100 11 3\n\nSample Output 3\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 226, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s317470856", "group_id": "codeNet:p03136", "input_text": "local n = io.read(\"*n\")\nlocal sum = 0\nlocal max = 0\nfor i = 1, n do\n local k = io.read(\"*n\")\n sum, max = sum + k, math.max(max, k)\nend\nprint(max * 2 < sum and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1557890682, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03136.html", "problem_id": "p03136", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03136/input.txt", "sample_output_relpath": "derived/input_output/data/p03136/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03136/Lua/s317470856.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s317470856", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal sum = 0\nlocal max = 0\nfor i = 1, n do\n local k = io.read(\"*n\")\n sum, max = sum + k, math.max(max, k)\nend\nprint(max * 2 < sum and \"Yes\" or \"No\")\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nDetermine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.\n\nYou can use the following theorem:\n\nTheorem: an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the lengths of the other N-1 sides.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10\n\n1 \\leq L_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nOutput\n\nIf an N-sided polygon satisfying the condition can be drawn, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\n3 8 5 1\n\nSample Output 1\n\nYes\n\nSince 8 < 9 = 3 + 5 + 1, it follows from the theorem that such a polygon can be drawn on a plane.\n\nSample Input 2\n\n4\n3 8 4 1\n\nSample Output 2\n\nNo\n\nSince 8 \\geq 8 = 3 + 4 + 1, it follows from the theorem that such a polygon cannot be drawn on a plane.\n\nSample Input 3\n\n10\n1 8 10 5 8 12 34 100 11 3\n\nSample Output 3\n\nNo", "sample_input": "4\n3 8 5 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03136", "source_text": "Score : 200 points\n\nProblem Statement\n\nDetermine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.\n\nYou can use the following theorem:\n\nTheorem: an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the lengths of the other N-1 sides.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10\n\n1 \\leq L_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nOutput\n\nIf an N-sided polygon satisfying the condition can be drawn, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\n3 8 5 1\n\nSample Output 1\n\nYes\n\nSince 8 < 9 = 3 + 5 + 1, it follows from the theorem that such a polygon can be drawn on a plane.\n\nSample Input 2\n\n4\n3 8 4 1\n\nSample Output 2\n\nNo\n\nSince 8 \\geq 8 = 3 + 4 + 1, it follows from the theorem that such a polygon cannot be drawn on a plane.\n\nSample Input 3\n\n10\n1 8 10 5 8 12 34 100 11 3\n\nSample Output 3\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s643309278", "group_id": "codeNet:p03136", "input_text": "N=io.read(\"n\")\nt={}\nm=0\ns=0\nfor i=1,N do \n t[i]=io.read(\"n\")\n s=s+t[i]\n if mm then \n print(\"Yes\")\n else\n print(\"No\")\nend", "language": "Lua", "metadata": {"date": 1550000248, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03136.html", "problem_id": "p03136", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03136/input.txt", "sample_output_relpath": "derived/input_output/data/p03136/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03136/Lua/s643309278.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s643309278", "user_id": "u015229643"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "N=io.read(\"n\")\nt={}\nm=0\ns=0\nfor i=1,N do \n t[i]=io.read(\"n\")\n s=s+t[i]\n if mm then \n print(\"Yes\")\n else\n print(\"No\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nDetermine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.\n\nYou can use the following theorem:\n\nTheorem: an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the lengths of the other N-1 sides.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10\n\n1 \\leq L_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nOutput\n\nIf an N-sided polygon satisfying the condition can be drawn, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\n3 8 5 1\n\nSample Output 1\n\nYes\n\nSince 8 < 9 = 3 + 5 + 1, it follows from the theorem that such a polygon can be drawn on a plane.\n\nSample Input 2\n\n4\n3 8 4 1\n\nSample Output 2\n\nNo\n\nSince 8 \\geq 8 = 3 + 4 + 1, it follows from the theorem that such a polygon cannot be drawn on a plane.\n\nSample Input 3\n\n10\n1 8 10 5 8 12 34 100 11 3\n\nSample Output 3\n\nNo", "sample_input": "4\n3 8 5 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03136", "source_text": "Score : 200 points\n\nProblem Statement\n\nDetermine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.\n\nYou can use the following theorem:\n\nTheorem: an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the lengths of the other N-1 sides.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10\n\n1 \\leq L_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nOutput\n\nIf an N-sided polygon satisfying the condition can be drawn, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\n3 8 5 1\n\nSample Output 1\n\nYes\n\nSince 8 < 9 = 3 + 5 + 1, it follows from the theorem that such a polygon can be drawn on a plane.\n\nSample Input 2\n\n4\n3 8 4 1\n\nSample Output 2\n\nNo\n\nSince 8 \\geq 8 = 3 + 4 + 1, it follows from the theorem that such a polygon cannot be drawn on a plane.\n\nSample Input 3\n\n10\n1 8 10 5 8 12 34 100 11 3\n\nSample Output 3\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s745611107", "group_id": "codeNet:p03137", "input_text": "n,m=io.read(\"*n\",\"*n\",\"*l\")\nif n>=m then\n print(0)\n return\nend\n\nx={}\nfor i=1,m do\n x[i]=io.read(\"*n\")\nend\ntable.sort(x)\n\nl={}\nfor i=1,m-1 do\n table.insert(l,x[i+1]-x[i])\nend\ntable.sort(l)\n\ndistance=0\nfor i=1,m-n do\n distance=distance+l[i]\nend\nprint(distance)", "language": "Lua", "metadata": {"date": 1588845529, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03137.html", "problem_id": "p03137", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03137/input.txt", "sample_output_relpath": "derived/input_output/data/p03137/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03137/Lua/s745611107.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s745611107", "user_id": "u045238009"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "n,m=io.read(\"*n\",\"*n\",\"*l\")\nif n>=m then\n print(0)\n return\nend\n\nx={}\nfor i=1,m do\n x[i]=io.read(\"*n\")\nend\ntable.sort(x)\n\nl={}\nfor i=1,m-1 do\n table.insert(l,x[i+1]-x[i])\nend\ntable.sort(l)\n\ndistance=0\nfor i=1,m-n do\n distance=distance+l[i]\nend\nprint(distance)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe will play a one-player game using a number line and N pieces.\n\nFirst, we place each of these pieces at some integer coordinate.\n\nHere, multiple pieces can be placed at the same coordinate.\n\nOur objective is to visit all of the M coordinates X_1, X_2, ..., X_M with these pieces, by repeating the following move:\n\nMove: Choose a piece and let x be its coordinate. Put that piece at coordinate x+1 or x-1.\n\nNote that the coordinates where we initially place the pieces are already regarded as visited.\n\nFind the minimum number of moves required to achieve the objective.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n-10^5 \\leq X_i \\leq 10^5\n\nX_1, X_2, ..., X_M are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nX_1 X_2 ... X_M\n\nOutput\n\nFind the minimum number of moves required to achieve the objective.\n\nSample Input 1\n\n2 5\n10 12 1 2 14\n\nSample Output 1\n\n5\n\nThe objective can be achieved in five moves as follows, and this is the minimum number of moves required.\n\nInitially, put the two pieces at coordinates 1 and 10.\n\nMove the piece at coordinate 1 to 2.\n\nMove the piece at coordinate 10 to 11.\n\nMove the piece at coordinate 11 to 12.\n\nMove the piece at coordinate 12 to 13.\n\nMove the piece at coordinate 13 to 14.\n\nSample Input 2\n\n3 7\n-10 -3 0 9 -100 2 17\n\nSample Output 2\n\n19\n\nSample Input 3\n\n100 1\n-100000\n\nSample Output 3\n\n0", "sample_input": "2 5\n10 12 1 2 14\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03137", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe will play a one-player game using a number line and N pieces.\n\nFirst, we place each of these pieces at some integer coordinate.\n\nHere, multiple pieces can be placed at the same coordinate.\n\nOur objective is to visit all of the M coordinates X_1, X_2, ..., X_M with these pieces, by repeating the following move:\n\nMove: Choose a piece and let x be its coordinate. Put that piece at coordinate x+1 or x-1.\n\nNote that the coordinates where we initially place the pieces are already regarded as visited.\n\nFind the minimum number of moves required to achieve the objective.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n-10^5 \\leq X_i \\leq 10^5\n\nX_1, X_2, ..., X_M are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nX_1 X_2 ... X_M\n\nOutput\n\nFind the minimum number of moves required to achieve the objective.\n\nSample Input 1\n\n2 5\n10 12 1 2 14\n\nSample Output 1\n\n5\n\nThe objective can be achieved in five moves as follows, and this is the minimum number of moves required.\n\nInitially, put the two pieces at coordinates 1 and 10.\n\nMove the piece at coordinate 1 to 2.\n\nMove the piece at coordinate 10 to 11.\n\nMove the piece at coordinate 11 to 12.\n\nMove the piece at coordinate 12 to 13.\n\nMove the piece at coordinate 13 to 14.\n\nSample Input 2\n\n3 7\n-10 -3 0 9 -100 2 17\n\nSample Output 2\n\n19\n\nSample Input 3\n\n100 1\n-100000\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 273, "cpu_time_ms": 171, "memory_kb": 4472}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s323970725", "group_id": "codeNet:p03137", "input_text": "local n, m = io.read(\"*n\", \"*n\")\nlocal a = {}\nfor i = 1, m do\n table.insert(a, io.read(\"*n\"))\nend\nif(m <= n) then print(0) else\n table.sort(a)\n local ret = a[#a] - a[1]\n local diff = {}\n for i = 2, m do\n diff[i - 1] = a[i] - a[i - 1]\n end\n table.sort(diff, function(x, y) return x > y end)\n for i = 1, n - 1 do\n ret = ret - diff[i]\n end\n print(ret)\nend\n", "language": "Lua", "metadata": {"date": 1555865828, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03137.html", "problem_id": "p03137", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03137/input.txt", "sample_output_relpath": "derived/input_output/data/p03137/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03137/Lua/s323970725.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s323970725", "user_id": "u120582723"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local n, m = io.read(\"*n\", \"*n\")\nlocal a = {}\nfor i = 1, m do\n table.insert(a, io.read(\"*n\"))\nend\nif(m <= n) then print(0) else\n table.sort(a)\n local ret = a[#a] - a[1]\n local diff = {}\n for i = 2, m do\n diff[i - 1] = a[i] - a[i - 1]\n end\n table.sort(diff, function(x, y) return x > y end)\n for i = 1, n - 1 do\n ret = ret - diff[i]\n end\n print(ret)\nend\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe will play a one-player game using a number line and N pieces.\n\nFirst, we place each of these pieces at some integer coordinate.\n\nHere, multiple pieces can be placed at the same coordinate.\n\nOur objective is to visit all of the M coordinates X_1, X_2, ..., X_M with these pieces, by repeating the following move:\n\nMove: Choose a piece and let x be its coordinate. Put that piece at coordinate x+1 or x-1.\n\nNote that the coordinates where we initially place the pieces are already regarded as visited.\n\nFind the minimum number of moves required to achieve the objective.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n-10^5 \\leq X_i \\leq 10^5\n\nX_1, X_2, ..., X_M are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nX_1 X_2 ... X_M\n\nOutput\n\nFind the minimum number of moves required to achieve the objective.\n\nSample Input 1\n\n2 5\n10 12 1 2 14\n\nSample Output 1\n\n5\n\nThe objective can be achieved in five moves as follows, and this is the minimum number of moves required.\n\nInitially, put the two pieces at coordinates 1 and 10.\n\nMove the piece at coordinate 1 to 2.\n\nMove the piece at coordinate 10 to 11.\n\nMove the piece at coordinate 11 to 12.\n\nMove the piece at coordinate 12 to 13.\n\nMove the piece at coordinate 13 to 14.\n\nSample Input 2\n\n3 7\n-10 -3 0 9 -100 2 17\n\nSample Output 2\n\n19\n\nSample Input 3\n\n100 1\n-100000\n\nSample Output 3\n\n0", "sample_input": "2 5\n10 12 1 2 14\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03137", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe will play a one-player game using a number line and N pieces.\n\nFirst, we place each of these pieces at some integer coordinate.\n\nHere, multiple pieces can be placed at the same coordinate.\n\nOur objective is to visit all of the M coordinates X_1, X_2, ..., X_M with these pieces, by repeating the following move:\n\nMove: Choose a piece and let x be its coordinate. Put that piece at coordinate x+1 or x-1.\n\nNote that the coordinates where we initially place the pieces are already regarded as visited.\n\nFind the minimum number of moves required to achieve the objective.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n-10^5 \\leq X_i \\leq 10^5\n\nX_1, X_2, ..., X_M are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nX_1 X_2 ... X_M\n\nOutput\n\nFind the minimum number of moves required to achieve the objective.\n\nSample Input 1\n\n2 5\n10 12 1 2 14\n\nSample Output 1\n\n5\n\nThe objective can be achieved in five moves as follows, and this is the minimum number of moves required.\n\nInitially, put the two pieces at coordinates 1 and 10.\n\nMove the piece at coordinate 1 to 2.\n\nMove the piece at coordinate 10 to 11.\n\nMove the piece at coordinate 11 to 12.\n\nMove the piece at coordinate 12 to 13.\n\nMove the piece at coordinate 13 to 14.\n\nSample Input 2\n\n3 7\n-10 -3 0 9 -100 2 17\n\nSample Output 2\n\n19\n\nSample Input 3\n\n100 1\n-100000\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 236, "memory_kb": 4472}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s771265861", "group_id": "codeNet:p03145", "input_text": "local a=io.read(\"n\")\nlocal b=io.read(\"n\")\nprint(a*b//2)", "language": "Lua", "metadata": {"date": 1548873444, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03145.html", "problem_id": "p03145", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03145/input.txt", "sample_output_relpath": "derived/input_output/data/p03145/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03145/Lua/s771265861.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s771265861", "user_id": "u015229643"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "local a=io.read(\"n\")\nlocal b=io.read(\"n\")\nprint(a*b//2)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a right triangle ABC with ∠ABC=90°.\n\nGiven the lengths of the three sides, |AB|,|BC| and |CA|, find the area of the right triangle ABC.\n\nIt is guaranteed that the area of the triangle ABC is an integer.\n\nConstraints\n\n1 \\leq |AB|,|BC|,|CA| \\leq 100\n\nAll values in input are integers.\n\nThe area of the triangle ABC is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\n|AB| |BC| |CA|\n\nOutput\n\nPrint the area of the triangle ABC.\n\nSample Input 1\n\n3 4 5\n\nSample Output 1\n\n6\n\nThis triangle has an area of 6.\n\nSample Input 2\n\n5 12 13\n\nSample Output 2\n\n30\n\nThis triangle has an area of 30.\n\nSample Input 3\n\n45 28 53\n\nSample Output 3\n\n630\n\nThis triangle has an area of 630.", "sample_input": "3 4 5\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03145", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a right triangle ABC with ∠ABC=90°.\n\nGiven the lengths of the three sides, |AB|,|BC| and |CA|, find the area of the right triangle ABC.\n\nIt is guaranteed that the area of the triangle ABC is an integer.\n\nConstraints\n\n1 \\leq |AB|,|BC|,|CA| \\leq 100\n\nAll values in input are integers.\n\nThe area of the triangle ABC is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\n|AB| |BC| |CA|\n\nOutput\n\nPrint the area of the triangle ABC.\n\nSample Input 1\n\n3 4 5\n\nSample Output 1\n\n6\n\nThis triangle has an area of 6.\n\nSample Input 2\n\n5 12 13\n\nSample Output 2\n\n30\n\nThis triangle has an area of 30.\n\nSample Input 3\n\n45 28 53\n\nSample Output 3\n\n630\n\nThis triangle has an area of 630.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s179592766", "group_id": "codeNet:p03146", "input_text": "local s = io.read(\"*n\")\nlocal t = {}\nt[s] = 1\nlocal p = 1\nlocal cur = s\nwhile true do\n p = p + 1\n local nxt = cur % 2 == 0 and cur // 2 or 3 * cur + 1\n if t[nxt] then\n print(p)\n break\n else\n t[nxt] = p\n end\n cur = nxt\nend\n", "language": "Lua", "metadata": {"date": 1584280529, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03146.html", "problem_id": "p03146", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03146/input.txt", "sample_output_relpath": "derived/input_output/data/p03146/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03146/Lua/s179592766.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s179592766", "user_id": "u120582723"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local s = io.read(\"*n\")\nlocal t = {}\nt[s] = 1\nlocal p = 1\nlocal cur = s\nwhile true do\n p = p + 1\n local nxt = cur % 2 == 0 and cur // 2 or 3 * cur + 1\n if t[nxt] then\n print(p)\n break\n else\n t[nxt] = p\n end\n cur = nxt\nend\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "sample_input": "8\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03146", "source_text": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s798579447", "group_id": "codeNet:p03146", "input_text": "local s=io.read(\"n\")\nt={}\nt[1]=s\nfor i=2,1000000 do\n if t[i-1]%2==0 then\n t[i]=t[i-1]/2\n else\n t[i]=t[i-1]*3+1\n end\n if t[i]==1 then\n print(i+1)\n break\n end\n end", "language": "Lua", "metadata": {"date": 1548882256, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03146.html", "problem_id": "p03146", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03146/input.txt", "sample_output_relpath": "derived/input_output/data/p03146/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03146/Lua/s798579447.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s798579447", "user_id": "u015229643"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local s=io.read(\"n\")\nt={}\nt[1]=s\nfor i=2,1000000 do\n if t[i-1]%2==0 then\n t[i]=t[i-1]/2\n else\n t[i]=t[i-1]*3+1\n end\n if t[i]==1 then\n print(i+1)\n break\n end\n end", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "sample_input": "8\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03146", "source_text": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s169480418", "group_id": "codeNet:p03146", "input_text": "local s = io.read(\"n\")\nlocal i = 1\nwhile true do\n if (s == 4 or s == 1 or s == 2) then\n print(i + 3)\n break\n end\n i = i + 1\n if (s % 2 == 0) then\n s = s // 2\n else\n s = s * 3 + 1\n end\nend", "language": "Lua", "metadata": {"date": 1548868501, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03146.html", "problem_id": "p03146", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03146/input.txt", "sample_output_relpath": "derived/input_output/data/p03146/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03146/Lua/s169480418.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s169480418", "user_id": "u200201528"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local s = io.read(\"n\")\nlocal i = 1\nwhile true do\n if (s == 4 or s == 1 or s == 2) then\n print(i + 3)\n break\n end\n i = i + 1\n if (s % 2 == 0) then\n s = s // 2\n else\n s = s * 3 + 1\n end\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "sample_input": "8\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03146", "source_text": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 20, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s785203064", "group_id": "codeNet:p03146", "input_text": "local _i={}\nfor i=1,1 do\n local a=io.read()\n _i[i]={}\n for s in string.gmatch(a,\"%S+\")do\n _i[i][#_i[i]+1]=s\n end\nend\n\nlocal s=tonumber(_i[1][1])\nif(s==1 or s==2)then\n print(4)\n return\nend\nlocal i=1\nwhile true do\n if(s==4)then\n \tprint(i+3)\n \treturn\n elseif(s%2==0)then\n \ts=s*.5\n else\n \ts=3*s+1\n end\n i=i+1\nend", "language": "Lua", "metadata": {"date": 1548094752, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03146.html", "problem_id": "p03146", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03146/input.txt", "sample_output_relpath": "derived/input_output/data/p03146/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03146/Lua/s785203064.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s785203064", "user_id": "u726173718"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local _i={}\nfor i=1,1 do\n local a=io.read()\n _i[i]={}\n for s in string.gmatch(a,\"%S+\")do\n _i[i][#_i[i]+1]=s\n end\nend\n\nlocal s=tonumber(_i[1][1])\nif(s==1 or s==2)then\n print(4)\n return\nend\nlocal i=1\nwhile true do\n if(s==4)then\n \tprint(i+3)\n \treturn\n elseif(s%2==0)then\n \ts=s*.5\n else\n \ts=3*s+1\n end\n i=i+1\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "sample_input": "8\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03146", "source_text": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 338, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s822396225", "group_id": "codeNet:p03147", "input_text": "local N=io.read(\"n\")\nh={}\nfor i=1,N do \n h[i]=io.read(\"n\")\n end\na=1\ns=0\nwhile a<=N-s do\n if h[a]==h[a+1] then\n for i=a,N-1-s do \n h[i]=h[i+1]\n end\n s=s+1\n else\n a=a+1\n end\n end\nif N-s==1 then \n print(h[1]) \nelseif N-s==2 then \n if h[1]>h[2] then\n print(h[1])\n else print(h[2])\n end\n else\n\nD=0\nd=0\nif h[1]>h[2] then\n D=D+h[1]\n end\nif h[N-s]>h[N-s-1] then\n D=D+h[N-s]\n end\nfor i=2,N-s-1 do \n if h[i]>h[i-1] and h[i]>h[i+1] then\n D=D+h[i]\n elseif h[i]h[2] then\n print(h[1])\n else print(h[2])\n end\n else\n\nD=0\nd=0\nif h[1]>h[2] then\n D=D+h[1]\n end\nif h[N-s]>h[N-s-1] then\n D=D+h[N-s]\n end\nfor i=2,N-s-1 do \n if h[i]>h[i-1] and h[i]>h[i+1] then\n D=D+h[i]\n elseif h[i]h[2] then\n D=D+h[1]\n end\nif h[N-s]>h[N-s-1] then\n D=D+h[N-s]\n end\nfor i=2,N-s-1 do \n if h[i]>h[i-1] and h[i]>h[i+1] then\n D=D+h[i]\n elseif h[i]h[2] then\n D=D+h[1]\n end\nif h[N-s]>h[N-s-1] then\n D=D+h[N-s]\n end\nfor i=2,N-s-1 do \n if h[i]>h[i-1] and h[i]>h[i+1] then\n D=D+h[i]\n elseif h[i]h[2] then\n D=D+h[1]\n end\nif h[N-s]>h[N-s-1] then\n D=D+h[N-s]\n end\nfor i=2,N-s-1 do \n if h[i]>h[i-1] and h[i]>h[i+1] then\n D=D+h[i]\n elseif h[i]h[2] then\n D=D+h[1]\n end\nif h[N-s]>h[N-s-1] then\n D=D+h[N-s]\n end\nfor i=2,N-s-1 do \n if h[i]>h[i-1] and h[i]>h[i+1] then\n D=D+h[i]\n elseif h[i] y[2] end)\n--for _,sushi_t in pairs(sushi_types) do\n-- table.sort(sushi_t, function (x, y) return x[2] > y[2] end)\n--end\n\n-- maximaize base score\nlocal base_score = 0\nlocal used = {}\nfor i=1,K do\n local tuple = sushi_list[i]\n base_score = base_score + tuple[2]\n if used[tuple[1]] == nil then\n used[tuple[1]] = 0\n end\n used[tuple[1]] = used[tuple[1]] + 1\n tuple[3] = true\nend\nlocal not_used_sushis = {}\nlocal not_used_sushis_appeared = {}\nfor i=K+1,N do\n local tuple = sushi_list[i]\n if used[tuple[1]] == nil then\n if not_used_sushis_appeared[tuple[1]] then\n -- never use this one\n else\n not_used_sushis_appeared[tuple[1]] = true\n table.insert(not_used_sushis, tuple)\n end\n end\nend\nlocal ntypes = 0\nfor k,_ in pairs(used) do\n ntypes = ntypes + 1\nend\nlocal bonus_score = ntypes * ntypes\nlocal score = base_score + bonus_score\n\n\nif false then\n print(\"maximized base\")\n for i,v in ipairs(sushi_list) do\n print(v[1],v[2],v[3])\n end\n print(\"not used sushis\")\n for i,v in ipairs(not_used_sushis) do\n print(v[1],v[2],v[3])\n end\n print(\"--\")\nend\n\n\n-- try increase bonus\nlocal discard_i = K\nlocal take_i = 1\nlocal max_score = score\nwhile true do\n -- discard least tasty one (constraint: keep ntypes)\n local discard_tuple = sushi_list[discard_i]\n if used[discard_tuple[1]] >= 2 then\n used[discard_tuple[1]] = used[discard_tuple[1]] - 1\n local take_tuple = not_used_sushis[take_i]\n take_i = take_i + 1\n local score_temp = (score - discard_tuple[2] + take_tuple[2]) - ntypes * ntypes + (ntypes + 1) * (ntypes + 1)\n if score_temp > max_score then\n max_score = score_temp\n end\n discard_tuple[3] = false\n take_tuple[3] = true\n score = score_temp\n ntypes = ntypes + 1\n if take_i > #not_used_sushis then\n break\n end\n else\n -- keep ntypes\n end\n discard_i = discard_i - 1\n if discard_i == 0 then\n break\n end\nend\n\nprint(max_score)\n\n", "language": "Lua", "metadata": {"date": 1552351769, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03148.html", "problem_id": "p03148", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03148/input.txt", "sample_output_relpath": "derived/input_output/data/p03148/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03148/Lua/s334781049.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s334781049", "user_id": "u162773977"}, "prompt_components": {"gold_output": "26\n", "input_to_evaluate": "local N, K = io.read(\"n\", \"n\")\nlocal sushi_list = {}\n--local sushi_types = {}\nfor i=1,N do\n local t, d = io.read(\"n\", \"n\")\n local tuple = {t, d, false} -- 3rd element: used flag\n --local tuple = {t, d}\n sushi_list[i] = tuple\n --if not sushi_types[t] then\n -- sushi_types[t] = {}\n --end\n --table.insert(sushi_types[t], tuple)\nend\n\n-- sort order by deliciousness (most tasty sushi first)\ntable.sort(sushi_list, function (x, y) return x[2] > y[2] end)\n--for _,sushi_t in pairs(sushi_types) do\n-- table.sort(sushi_t, function (x, y) return x[2] > y[2] end)\n--end\n\n-- maximaize base score\nlocal base_score = 0\nlocal used = {}\nfor i=1,K do\n local tuple = sushi_list[i]\n base_score = base_score + tuple[2]\n if used[tuple[1]] == nil then\n used[tuple[1]] = 0\n end\n used[tuple[1]] = used[tuple[1]] + 1\n tuple[3] = true\nend\nlocal not_used_sushis = {}\nlocal not_used_sushis_appeared = {}\nfor i=K+1,N do\n local tuple = sushi_list[i]\n if used[tuple[1]] == nil then\n if not_used_sushis_appeared[tuple[1]] then\n -- never use this one\n else\n not_used_sushis_appeared[tuple[1]] = true\n table.insert(not_used_sushis, tuple)\n end\n end\nend\nlocal ntypes = 0\nfor k,_ in pairs(used) do\n ntypes = ntypes + 1\nend\nlocal bonus_score = ntypes * ntypes\nlocal score = base_score + bonus_score\n\n\nif false then\n print(\"maximized base\")\n for i,v in ipairs(sushi_list) do\n print(v[1],v[2],v[3])\n end\n print(\"not used sushis\")\n for i,v in ipairs(not_used_sushis) do\n print(v[1],v[2],v[3])\n end\n print(\"--\")\nend\n\n\n-- try increase bonus\nlocal discard_i = K\nlocal take_i = 1\nlocal max_score = score\nwhile true do\n -- discard least tasty one (constraint: keep ntypes)\n local discard_tuple = sushi_list[discard_i]\n if used[discard_tuple[1]] >= 2 then\n used[discard_tuple[1]] = used[discard_tuple[1]] - 1\n local take_tuple = not_used_sushis[take_i]\n take_i = take_i + 1\n local score_temp = (score - discard_tuple[2] + take_tuple[2]) - ntypes * ntypes + (ntypes + 1) * (ntypes + 1)\n if score_temp > max_score then\n max_score = score_temp\n end\n discard_tuple[3] = false\n take_tuple[3] = true\n score = score_temp\n ntypes = ntypes + 1\n if take_i > #not_used_sushis then\n break\n end\n else\n -- keep ntypes\n end\n discard_i = discard_i - 1\n if discard_i == 0 then\n break\n end\nend\n\nprint(max_score)\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N pieces of sushi. Each piece has two parameters: \"kind of topping\" t_i and \"deliciousness\" d_i.\nYou are choosing K among these N pieces to eat.\nYour \"satisfaction\" here will be calculated as follows:\n\nThe satisfaction is the sum of the \"base total deliciousness\" and the \"variety bonus\".\n\nThe base total deliciousness is the sum of the deliciousness of the pieces you eat.\n\nThe variety bonus is x*x, where x is the number of different kinds of toppings of the pieces you eat.\n\nYou want to have as much satisfaction as possible.\nFind this maximum satisfaction.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 10^5\n\n1 \\leq t_i \\leq N\n\n1 \\leq d_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nt_1 d_1\nt_2 d_2\n.\n.\n.\nt_N d_N\n\nOutput\n\nPrint the maximum satisfaction that you can obtain.\n\nSample Input 1\n\n5 3\n1 9\n1 7\n2 6\n2 5\n3 1\n\nSample Output 1\n\n26\n\nIf you eat Sushi 1,2 and 3:\n\nThe base total deliciousness is 9+7+6=22.\n\nThe variety bonus is 2*2=4.\n\nThus, your satisfaction will be 26, which is optimal.\n\nSample Input 2\n\n7 4\n1 1\n2 1\n3 1\n4 6\n4 5\n4 5\n4 5\n\nSample Output 2\n\n25\n\nIt is optimal to eat Sushi 1,2,3 and 4.\n\nSample Input 3\n\n6 5\n5 1000000000\n2 990000000\n3 980000000\n6 970000000\n6 960000000\n4 950000000\n\nSample Output 3\n\n4900000016\n\nNote that the output may not fit into a 32-bit integer type.", "sample_input": "5 3\n1 9\n1 7\n2 6\n2 5\n3 1\n"}, "reference_outputs": ["26\n"], "source_document_id": "p03148", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N pieces of sushi. Each piece has two parameters: \"kind of topping\" t_i and \"deliciousness\" d_i.\nYou are choosing K among these N pieces to eat.\nYour \"satisfaction\" here will be calculated as follows:\n\nThe satisfaction is the sum of the \"base total deliciousness\" and the \"variety bonus\".\n\nThe base total deliciousness is the sum of the deliciousness of the pieces you eat.\n\nThe variety bonus is x*x, where x is the number of different kinds of toppings of the pieces you eat.\n\nYou want to have as much satisfaction as possible.\nFind this maximum satisfaction.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 10^5\n\n1 \\leq t_i \\leq N\n\n1 \\leq d_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nt_1 d_1\nt_2 d_2\n.\n.\n.\nt_N d_N\n\nOutput\n\nPrint the maximum satisfaction that you can obtain.\n\nSample Input 1\n\n5 3\n1 9\n1 7\n2 6\n2 5\n3 1\n\nSample Output 1\n\n26\n\nIf you eat Sushi 1,2 and 3:\n\nThe base total deliciousness is 9+7+6=22.\n\nThe variety bonus is 2*2=4.\n\nThus, your satisfaction will be 26, which is optimal.\n\nSample Input 2\n\n7 4\n1 1\n2 1\n3 1\n4 6\n4 5\n4 5\n4 5\n\nSample Output 2\n\n25\n\nIt is optimal to eat Sushi 1,2,3 and 4.\n\nSample Input 3\n\n6 5\n5 1000000000\n2 990000000\n3 980000000\n6 970000000\n6 960000000\n4 950000000\n\nSample Output 3\n\n4900000016\n\nNote that the output may not fit into a 32-bit integer type.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2549, "cpu_time_ms": 351, "memory_kb": 20968}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s284375474", "group_id": "codeNet:p03164", "input_text": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\nlocal function array(dimension, default_val) local n=dimension local m={default_val and {__index=function()return default_val end}}for i=2,n do m[i]={__index=function(p, k)local c=setmetatable({},m[i-1])rawset(p,k,c)return c end}end return setmetatable({},m[n])end\n----\nlocal N, W = read.nn()\nlocal w, v = {}, {}\nfor i=1,N do\n w[i], v[i] = read.nn()\nend\nlocal tbl = array(2, 10^10)\ntbl[0][0] = 0\nfor i=0,N-1 do\n local nw, nv = w[i+1], v[i+1]\n for j=0,100000 do\n if tbl[i+1][j] > tbl[i][j] then\n tbl[i+1][j] = tbl[i][j]\n end\n if tbl[i+1][j+nv] > tbl[i][j] + nw then\n tbl[i+1][j+nv] = tbl[i][j] + nw\n end\n end\nend\nlocal ans = 0\nfor j=0,100000 do\n if tbl[N][j] <= W then\n ans = math.max(ans, j)\n end\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1581807383, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s284375474.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s284375474", "user_id": "u162773977"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\nlocal function array(dimension, default_val) local n=dimension local m={default_val and {__index=function()return default_val end}}for i=2,n do m[i]={__index=function(p, k)local c=setmetatable({},m[i-1])rawset(p,k,c)return c end}end return setmetatable({},m[n])end\n----\nlocal N, W = read.nn()\nlocal w, v = {}, {}\nfor i=1,N do\n w[i], v[i] = read.nn()\nend\nlocal tbl = array(2, 10^10)\ntbl[0][0] = 0\nfor i=0,N-1 do\n local nw, nv = w[i+1], v[i+1]\n for j=0,100000 do\n if tbl[i+1][j] > tbl[i][j] then\n tbl[i+1][j] = tbl[i][j]\n end\n if tbl[i+1][j+nv] > tbl[i][j] + nw then\n tbl[i+1][j+nv] = tbl[i][j] + nw\n end\n end\nend\nlocal ans = 0\nfor j=0,100000 do\n if tbl[N][j] <= W then\n ans = math.max(ans, j)\n end\nend\nprint(ans)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1332, "cpu_time_ms": 2104, "memory_kb": 18548}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s571624909", "group_id": "codeNet:p03166", "input_text": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\nlocal function array(dimension, default_val) local n=dimension local m={}if default_val~=nil then m[1]={__index=function()return default_val end}end for i=2,n do m[i]={__index=function(p, k)local c=setmetatable({},m[i-1])rawset(p,k,c)return c end}end return setmetatable({},m[n])end\nlocal unpack = table.unpack or unpack\nlocal insert = table.insert or insert\nlocal max = math.max\n----\nlocal N, M = read.nn()\nlocal adj_mat = array(2, nil)\nlocal rev_adj_mat = array(2, nil)\nfor i=1,M do\n local x, y = read.nn()\n adj_mat[x][y] = true\n rev_adj_mat[y][x] = true\nend\nlocal function indeg_zero(n)\n for k, v in pairs(rev_adj_mat[n]) do\n if v then\n return false\n end\n end\n return true\nend\n\nlocal toposorted = {}\nlocal function make_queue()\n local q = {}\n local front = 1\n local back = #q + 1\n local function push(v)\n q[back] = v\n back = back + 1\n end\n local function pop()\n local r = q[front]\n front = front + 1\n return r\n end\n local function empty()\n return back - front == 0\n end\n return push, pop, empty\nend\nlocal push, pop, empty = make_queue()\nfor n=1,N do\n if indeg_zero(n) then\n push(n)\n end\nend\n\nlocal lp_from = array(1, 0)\nlocal ans = 0\nwhile not empty() do\n local n = pop()\n insert(toposorted, n)\n for m in pairs(adj_mat[n]) do\n rev_adj_mat[m][n] = nil\n if indeg_zero(m) then\n push(m)\n --lp_from[m] = max(lp_from[m], lp_from[n] + 1)\n lp_from[m] = lp_from[n] + 1\n ans = max(ans, lp_from[m])\n end\n end\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1581974625, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03166.html", "problem_id": "p03166", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03166/input.txt", "sample_output_relpath": "derived/input_output/data/p03166/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03166/Lua/s571624909.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s571624909", "user_id": "u162773977"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\nlocal function array(dimension, default_val) local n=dimension local m={}if default_val~=nil then m[1]={__index=function()return default_val end}end for i=2,n do m[i]={__index=function(p, k)local c=setmetatable({},m[i-1])rawset(p,k,c)return c end}end return setmetatable({},m[n])end\nlocal unpack = table.unpack or unpack\nlocal insert = table.insert or insert\nlocal max = math.max\n----\nlocal N, M = read.nn()\nlocal adj_mat = array(2, nil)\nlocal rev_adj_mat = array(2, nil)\nfor i=1,M do\n local x, y = read.nn()\n adj_mat[x][y] = true\n rev_adj_mat[y][x] = true\nend\nlocal function indeg_zero(n)\n for k, v in pairs(rev_adj_mat[n]) do\n if v then\n return false\n end\n end\n return true\nend\n\nlocal toposorted = {}\nlocal function make_queue()\n local q = {}\n local front = 1\n local back = #q + 1\n local function push(v)\n q[back] = v\n back = back + 1\n end\n local function pop()\n local r = q[front]\n front = front + 1\n return r\n end\n local function empty()\n return back - front == 0\n end\n return push, pop, empty\nend\nlocal push, pop, empty = make_queue()\nfor n=1,N do\n if indeg_zero(n) then\n push(n)\n end\nend\n\nlocal lp_from = array(1, 0)\nlocal ans = 0\nwhile not empty() do\n local n = pop()\n insert(toposorted, n)\n for m in pairs(adj_mat[n]) do\n rev_adj_mat[m][n] = nil\n if indeg_zero(m) then\n push(m)\n --lp_from[m] = max(lp_from[m], lp_from[n] + 1)\n lp_from[m] = lp_from[n] + 1\n ans = max(ans, lp_from[m])\n end\n end\nend\nprint(ans)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a directed graph G with N vertices and M edges.\nThe vertices are numbered 1, 2, \\ldots, N, and for each i (1 \\leq i \\leq M), the i-th directed edge goes from Vertex x_i to y_i.\nG does not contain directed cycles.\n\nFind the length of the longest directed path in G.\nHere, the length of a directed path is the number of edges in it.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq x_i, y_i \\leq N\n\nAll pairs (x_i, y_i) are distinct.\n\nG does not contain directed cycles.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nx_1 y_1\nx_2 y_2\n:\nx_M y_M\n\nOutput\n\nPrint the length of the longest directed path in G.\n\nSample Input 1\n\n4 5\n1 2\n1 3\n3 2\n2 4\n3 4\n\nSample Output 1\n\n3\n\nThe red directed path in the following figure is the longest:\n\nSample Input 2\n\n6 3\n2 3\n4 5\n5 6\n\nSample Output 2\n\n2\n\nThe red directed path in the following figure is the longest:\n\nSample Input 3\n\n5 8\n5 3\n2 3\n2 4\n5 2\n5 1\n1 4\n4 3\n1 3\n\nSample Output 3\n\n3\n\nThe red directed path in the following figure is one of the longest:", "sample_input": "4 5\n1 2\n1 3\n3 2\n2 4\n3 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03166", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a directed graph G with N vertices and M edges.\nThe vertices are numbered 1, 2, \\ldots, N, and for each i (1 \\leq i \\leq M), the i-th directed edge goes from Vertex x_i to y_i.\nG does not contain directed cycles.\n\nFind the length of the longest directed path in G.\nHere, the length of a directed path is the number of edges in it.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq x_i, y_i \\leq N\n\nAll pairs (x_i, y_i) are distinct.\n\nG does not contain directed cycles.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nx_1 y_1\nx_2 y_2\n:\nx_M y_M\n\nOutput\n\nPrint the length of the longest directed path in G.\n\nSample Input 1\n\n4 5\n1 2\n1 3\n3 2\n2 4\n3 4\n\nSample Output 1\n\n3\n\nThe red directed path in the following figure is the longest:\n\nSample Input 2\n\n6 3\n2 3\n4 5\n5 6\n\nSample Output 2\n\n2\n\nThe red directed path in the following figure is the longest:\n\nSample Input 3\n\n5 8\n5 3\n2 3\n2 4\n5 2\n5 1\n1 4\n4 3\n1 3\n\nSample Output 3\n\n3\n\nThe red directed path in the following figure is one of the longest:", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2166, "cpu_time_ms": 584, "memory_kb": 54476}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s133896271", "group_id": "codeNet:p03170", "input_text": "r=io.read n,k=r(\"n\",\"n\")r()A=r()d={}for i=0,k do for a in A:gmatch\"%d+\"do d[i+a]=not d[i]and 1 end end print(d[k]and\"First\"or\"Second\")", "language": "Lua", "metadata": {"date": 1600699563, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s133896271.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s133896271", "user_id": "u045238009"}, "prompt_components": {"gold_output": "First\n", "input_to_evaluate": "r=io.read n,k=r(\"n\",\"n\")r()A=r()d={}for i=0,k do for a in A:gmatch\"%d+\"do d[i+a]=not d[i]and 1 end end print(d[k]and\"First\"or\"Second\")", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1893, "memory_kb": 14968}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s463407180", "group_id": "codeNet:p03170", "input_text": "local n,k=io.read(\"n\",\"n\")\nlocal a={}\nfor i=1,n do\n a[i]=io.read(\"n\")\nend\n\nlocal dp={}\nfor i=0,k do\n if not dp[i] then\n for j=1,n do\n dp[i+a[j]]=true\n end\n end\nend\nprint(dp[k] and \"First\" or \"Second\")", "language": "Lua", "metadata": {"date": 1600686878, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s463407180.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s463407180", "user_id": "u045238009"}, "prompt_components": {"gold_output": "First\n", "input_to_evaluate": "local n,k=io.read(\"n\",\"n\")\nlocal a={}\nfor i=1,n do\n a[i]=io.read(\"n\")\nend\n\nlocal dp={}\nfor i=0,k do\n if not dp[i] then\n for j=1,n do\n dp[i+a[j]]=true\n end\n end\nend\nprint(dp[k] and \"First\" or \"Second\")", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 21, "memory_kb": 6172}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s253433005", "group_id": "codeNet:p03170", "input_text": "local n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = io.read(\"*n\")\nend\nlocal dp = {}\nlocal box = {}\nlocal bzero = false\nfor i = 1, k do\n bzero = false\n for j = 1, n do\n box[j] = false\n end\n for j = 1, n do\n if t[j] < i then\n local v = dp[i - t[j]]\n if v == 0 then bzero = true\n else box[v] = true\n end\n elseif t[j] == i then\n bzero = true\n else\n break\n end\n end\n if not bzero then dp[i] = 0\n else\n for j = 1, n do\n if not box[j] then dp[i] = j break end\n end\n end\nend\nprint(dp[k] == 0 and \"Second\" or \"First\")\n", "language": "Lua", "metadata": {"date": 1587387072, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s253433005.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s253433005", "user_id": "u120582723"}, "prompt_components": {"gold_output": "First\n", "input_to_evaluate": "local n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = io.read(\"*n\")\nend\nlocal dp = {}\nlocal box = {}\nlocal bzero = false\nfor i = 1, k do\n bzero = false\n for j = 1, n do\n box[j] = false\n end\n for j = 1, n do\n if t[j] < i then\n local v = dp[i - t[j]]\n if v == 0 then bzero = true\n else box[v] = true\n end\n elseif t[j] == i then\n bzero = true\n else\n break\n end\n end\n if not bzero then dp[i] = 0\n else\n for j = 1, n do\n if not box[j] then dp[i] = j break end\n end\n end\nend\nprint(dp[k] == 0 and \"Second\" or \"First\")\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 592, "cpu_time_ms": 114, "memory_kb": 1536}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s204024600", "group_id": "codeNet:p03171", "input_text": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\nlocal function array(dimension, default_val) local n=dimension local m={}if default_val~=nil then m[1]={__index=function()return default_val end}end for i=2,n do m[i]={__index=function(p, k)local c=setmetatable({},m[i-1])rawset(p,k,c)return c end}end return setmetatable({},m[n])end\nlocal function tostringx(o)if type(o) == 'table' then local keys = {}for k in pairs(o) do table.insert(keys, k) end table.sort(keys)local inside = {}for i=1,#keys do local k = keys[i]local v = o[k]if type(k) == 'string' then k = string.format('%q', k)end table.insert(inside, '['..k..'] = ' .. tostringx(v))end return '{' .. table.concat(inside, ', ') .. '}'else if type(o) == 'string' then o = string.format('%q', o)end return tostring(o)end end\n----\nlocal N = read.n()\nlocal A = read.N(N)\nlocal t = array(2)\nfor i=1,N do\n t[i][i] = A[i]\nend\nlocal function rec(i, j)\n if t[i][j] then\n return t[i][j]\n end\n local ri = A[j] - rec(i, j-1)\n local le = A[i] - rec(i+1, j)\n local ret = math.max(ri, le)\n t[i][j] = ret\n return ret\nend\nprint(rec(1, N))", "language": "Lua", "metadata": {"date": 1582420094, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s204024600.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s204024600", "user_id": "u162773977"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "local read = setmetatable({}, {__index = function(t, k) local a = {} for i=1,#k do table.insert(a, '*'..string.sub(k, i, i)) end local r = io.read local u = table.unpack or unpack return function() return r(u(a)) end end})\nread.N = function(N) local t={} for i=1,N do t[i]=read.n() end return t end\nstring.totable = function(s) local t={} local u=string.sub for i=1,#s do t[i] = u(s, i, i) end return t end\nstring.split = function(s) local t={} for w in string.gmatch(s, \"[^%s]+\") do table.insert(t, w) end return (table.unpack or unpack)(t) end\nlocal function array(dimension, default_val) local n=dimension local m={}if default_val~=nil then m[1]={__index=function()return default_val end}end for i=2,n do m[i]={__index=function(p, k)local c=setmetatable({},m[i-1])rawset(p,k,c)return c end}end return setmetatable({},m[n])end\nlocal function tostringx(o)if type(o) == 'table' then local keys = {}for k in pairs(o) do table.insert(keys, k) end table.sort(keys)local inside = {}for i=1,#keys do local k = keys[i]local v = o[k]if type(k) == 'string' then k = string.format('%q', k)end table.insert(inside, '['..k..'] = ' .. tostringx(v))end return '{' .. table.concat(inside, ', ') .. '}'else if type(o) == 'string' then o = string.format('%q', o)end return tostring(o)end end\n----\nlocal N = read.n()\nlocal A = read.N(N)\nlocal t = array(2)\nfor i=1,N do\n t[i][i] = A[i]\nend\nlocal function rec(i, j)\n if t[i][j] then\n return t[i][j]\n end\n local ri = A[j] - rec(i, j-1)\n local le = A[i] - rec(i+1, j)\n local ret = math.max(ri, le)\n t[i][j] = ret\n return ret\nend\nprint(rec(1, 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1605, "cpu_time_ms": 652, "memory_kb": 82688}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s201090010", "group_id": "codeNet:p03172", "input_text": "local n,k=io.read(\"n\",\"n\")\nlocal a={}\nfor i=1,n do\n a[i]=io.read(\"n\")\nend\n\nlocal dp={}\nfor i=1,n+1 do\n dp[i]={}\n dp[i][1]=1\n for j=2,k+1 do\n dp[i][j]=0\n end\nend\n\nlocal mod=1000000007\nfor i=1,n do\n for j=2,k+1 do\n if j-1-a[i]>0 then\n dp[i+1][j]=(dp[i+1][j-1]+dp[i][j]-dp[i][j-1-a[i]])%mod\n else\n dp[i+1][j]=(dp[i+1][j-1]+dp[i][j])%mod\n end\n end\nend\nprint(dp[n+1][k+1])", "language": "Lua", "metadata": {"date": 1600690617, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s201090010.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s201090010", "user_id": "u045238009"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local n,k=io.read(\"n\",\"n\")\nlocal a={}\nfor i=1,n do\n a[i]=io.read(\"n\")\nend\n\nlocal dp={}\nfor i=1,n+1 do\n dp[i]={}\n dp[i][1]=1\n for j=2,k+1 do\n dp[i][j]=0\n end\nend\n\nlocal mod=1000000007\nfor i=1,n do\n for j=2,k+1 do\n if j-1-a[i]>0 then\n dp[i+1][j]=(dp[i+1][j-1]+dp[i][j]-dp[i][j-1-a[i]])%mod\n else\n dp[i+1][j]=(dp[i+1][j-1]+dp[i][j])%mod\n end\n end\nend\nprint(dp[n+1][k+1])", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 438, "cpu_time_ms": 242, "memory_kb": 106484}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s736898236", "group_id": "codeNet:p03172", "input_text": "local mod = 1000000007\nlocal function badd(x, y) return (x + y) % mod end\nlocal function bsub(x, y) return y <= x and x - y or x + mod - y end\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal dp1, dp2 = {1}, {0}\nfor i = 2, k + 1 do\n dp1[i] = 0\n dp2[i] = 0\nend\nfor i = 1, n do\n local src = i % 2 == 1 and dp1 or dp2\n local dst = i % 2 == 1 and dp2 or dp1\n for j = 1, k + 1 do\n dst[j] = 0\n end\n local a = io.read(\"*n\") + 1\n local sum = 0\n for j = 1, k + 1 do\n sum = badd(sum, src[j])\n if a < j then\n sum = bsub(sum, src[j - a])\n end\n dst[j] = badd(dst[j], sum)\n end\nend\nlocal ret = n % 2 == 1 and dp2 or dp1\nprint(ret[k + 1])\n", "language": "Lua", "metadata": {"date": 1587489045, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s736898236.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s736898236", "user_id": "u120582723"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local mod = 1000000007\nlocal function badd(x, y) return (x + y) % mod end\nlocal function bsub(x, y) return y <= x and x - y or x + mod - y end\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal dp1, dp2 = {1}, {0}\nfor i = 2, k + 1 do\n dp1[i] = 0\n dp2[i] = 0\nend\nfor i = 1, n do\n local src = i % 2 == 1 and dp1 or dp2\n local dst = i % 2 == 1 and dp2 or dp1\n for j = 1, k + 1 do\n dst[j] = 0\n end\n local a = io.read(\"*n\") + 1\n local sum = 0\n for j = 1, k + 1 do\n sum = badd(sum, src[j])\n if a < j then\n sum = bsub(sum, src[j - a])\n end\n dst[j] = badd(dst[j], sum)\n end\nend\nlocal ret = n % 2 == 1 and dp2 or dp1\nprint(ret[k + 1])\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 199, "memory_kb": 2560}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s573928944", "group_id": "codeNet:p03176", "input_text": "local BIT={}\n\nlocal update=function(a,b)\n if a==0 then\n return\n end\n while a<=#BIT do\n BIT[a]=math.max(BIT[a],b)\n a=a+(a&-a)\n end\nend\n\nlocal getmax=function(a)\n local sum=0\n while a>0 do\n sum=math.max(BIT[a],sum)\n a=a-(a&-a)\n end\n return sum\nend\n\n----------\n\nlocal n=io.read(\"n\")\nlocal h,a={},{}\nfor i=1,n do\n h[i]=io.read(\"n\")\nend\nfor i=1,n do\n a[i]=io.read(\"n\")\nend\n\nfor i=1,n do\n BIT[i]=0\nend\nfor i=1,n do\n update(h[i],getmax(h[i])+a[i])\nend\n\nprint(getmax(n))", "language": "Lua", "metadata": {"date": 1600742736, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03176.html", "problem_id": "p03176", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03176/input.txt", "sample_output_relpath": "derived/input_output/data/p03176/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03176/Lua/s573928944.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s573928944", "user_id": "u045238009"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "local BIT={}\n\nlocal update=function(a,b)\n if a==0 then\n return\n end\n while a<=#BIT do\n BIT[a]=math.max(BIT[a],b)\n a=a+(a&-a)\n end\nend\n\nlocal getmax=function(a)\n local sum=0\n while a>0 do\n sum=math.max(BIT[a],sum)\n a=a-(a&-a)\n end\n return sum\nend\n\n----------\n\nlocal n=io.read(\"n\")\nlocal h,a={},{}\nfor i=1,n do\n h[i]=io.read(\"n\")\nend\nfor i=1,n do\n a[i]=io.read(\"n\")\nend\n\nfor i=1,n do\n BIT[i]=0\nend\nfor i=1,n do\n update(h[i],getmax(h[i])+a[i])\nend\n\nprint(getmax(n))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N flowers arranged in a row.\nFor each i (1 \\leq i \\leq N), the height and the beauty of the i-th flower from the left is h_i and a_i, respectively.\nHere, h_1, h_2, \\ldots, h_N are all distinct.\n\nTaro is pulling out some flowers so that the following condition is met:\n\nThe heights of the remaining flowers are monotonically increasing from left to right.\n\nFind the maximum possible sum of the beauties of the remaining flowers.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 × 10^5\n\n1 \\leq h_i \\leq N\n\nh_1, h_2, \\ldots, h_N are all distinct.\n\n1 \\leq a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\na_1 a_2 \\ldots a_N\n\nOutput\n\nPrint the maximum possible sum of the beauties of the remaining flowers.\n\nSample Input 1\n\n4\n3 1 4 2\n10 20 30 40\n\nSample Output 1\n\n60\n\nWe should keep the second and fourth flowers from the left.\nThen, the heights would be 1, 2 from left to right, which is monotonically increasing, and the sum of the beauties would be 20 + 40 = 60.\n\nSample Input 2\n\n1\n1\n10\n\nSample Output 2\n\n10\n\nThe condition is met already at the beginning.\n\nSample Input 3\n\n5\n1 2 3 4 5\n1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 4\n\n9\n4 2 5 8 3 6 1 7 9\n6 8 8 4 6 3 5 7 5\n\nSample Output 4\n\n31\n\nWe should keep the second, third, sixth, eighth and ninth flowers from the left.", "sample_input": "4\n3 1 4 2\n10 20 30 40\n"}, "reference_outputs": ["60\n"], "source_document_id": "p03176", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N flowers arranged in a row.\nFor each i (1 \\leq i \\leq N), the height and the beauty of the i-th flower from the left is h_i and a_i, respectively.\nHere, h_1, h_2, \\ldots, h_N are all distinct.\n\nTaro is pulling out some flowers so that the following condition is met:\n\nThe heights of the remaining flowers are monotonically increasing from left to right.\n\nFind the maximum possible sum of the beauties of the remaining flowers.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 × 10^5\n\n1 \\leq h_i \\leq N\n\nh_1, h_2, \\ldots, h_N are all distinct.\n\n1 \\leq a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\na_1 a_2 \\ldots a_N\n\nOutput\n\nPrint the maximum possible sum of the beauties of the remaining flowers.\n\nSample Input 1\n\n4\n3 1 4 2\n10 20 30 40\n\nSample Output 1\n\n60\n\nWe should keep the second and fourth flowers from the left.\nThen, the heights would be 1, 2 from left to right, which is monotonically increasing, and the sum of the beauties would be 20 + 40 = 60.\n\nSample Input 2\n\n1\n1\n10\n\nSample Output 2\n\n10\n\nThe condition is met already at the beginning.\n\nSample Input 3\n\n5\n1 2 3 4 5\n1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 4\n\n9\n4 2 5 8 3 6 1 7 9\n6 8 8 4 6 3 5 7 5\n\nSample Output 4\n\n31\n\nWe should keep the second, third, sixth, eighth and ninth flowers from the left.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 533, "cpu_time_ms": 612, "memory_kb": 14596}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s908359323", "group_id": "codeNet:p03180", "input_text": "local mmi, mma = math.min, math.max\nlocal bls, brs = bit.lshift, bit.rshift\nlocal bor = bit.bor\nlocal mfl, mce = math.floor, math.ceil\nlocal n = io.read(\"*n\")\nlocal edge = {}\nfor i = 1, n do\n edge[i] = {}\n for j = 1, n do\n edge[i][j] = io.read(\"*n\")\n end\nend\nif n == 1 then\n print(0)\n os.exit()\nelseif n == 2 then\n print(mma(0, edge[1][2]))\n os.exit()\nend\n\nlocal all = bls(1, n)\nlocal bdp = {}\nlocal inf = 1000000007 * 1000\nfor i = 1, all - 1 do\n bdp[i] = -inf\nend\n\nlocal edgesum = {}\nfor it = 1, all - 1 do\n local tmp = it\n local box = {}\n for j = n, 1, -1 do\n if tmp % 2 == 1 then\n table.insert(box, j)\n end\n tmp = brs(tmp, 1)\n end\n local c = 0\n for i = 1, #box - 1 do\n for j = i + 1 , #box do\n c = c + edge[box[i]][box[j]]\n end\n end\n edgesum[it] = c\nend\n\nlocal base = 0\ndo\n -- use 1 and others\n local tot1 = bls(1, n - 1)\n base = base + tot1\n for it = 0, tot1 - 1 do\n local dst = base + it\n bdp[dst] = edgesum[dst]\n end\nend\nlocal map_devide_or1, map_devide_or2 = {}, {}\nfor it = 0, 3^(n - 3) - 1 do\n local tmpit = it\n local a, b = 0, 0\n local mul = 1\n for j = 4, n do\n if tmpit % 3 == 2 then\n a = a + mul\n elseif tmpit % 3 == 1 then\n b = b + mul\n end\n mul = mul * 2\n tmpit = mfl(tmpit / 3)\n end\n map_devide_or1[it + 1], map_devide_or2[it + 1] = a, b\nend\n--use i\nfor i = 2, n do\n local totrem = 3^(n - i)\n local basei = 2^(n - i)\n for it = 0, totrem - 1 do\n local add_from_i = 0\n local marge_src = 0\n if i == 2 then\n if 2 * (3^(n - 3)) <= it then\n marge_src = marge_src + 2^(n - 3)\n it = it - 2 * (3^(n - 3))\n elseif 3^(n - 3) <= it then\n add_from_i = add_from_i + 2^(n - 3)\n it = it - (3^(n - 3))\n end\n end\n add_from_i = add_from_i + basei + map_devide_or1[it + 1]\n marge_src = marge_src + base + map_devide_or2[it + 1]\n local dst = bor(add_from_i, marge_src)\n bdp[dst] = mma(bdp[dst], bdp[marge_src] + edgesum[add_from_i])\n end\n base = base + basei\nend\nprint(bdp[all - 1])\n", "language": "Lua", "metadata": {"date": 1587522746, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03180.html", "problem_id": "p03180", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03180/input.txt", "sample_output_relpath": "derived/input_output/data/p03180/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03180/Lua/s908359323.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s908359323", "user_id": "u120582723"}, "prompt_components": {"gold_output": "20\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal bls, brs = bit.lshift, bit.rshift\nlocal bor = bit.bor\nlocal mfl, mce = math.floor, math.ceil\nlocal n = io.read(\"*n\")\nlocal edge = {}\nfor i = 1, n do\n edge[i] = {}\n for j = 1, n do\n edge[i][j] = io.read(\"*n\")\n end\nend\nif n == 1 then\n print(0)\n os.exit()\nelseif n == 2 then\n print(mma(0, edge[1][2]))\n os.exit()\nend\n\nlocal all = bls(1, n)\nlocal bdp = {}\nlocal inf = 1000000007 * 1000\nfor i = 1, all - 1 do\n bdp[i] = -inf\nend\n\nlocal edgesum = {}\nfor it = 1, all - 1 do\n local tmp = it\n local box = {}\n for j = n, 1, -1 do\n if tmp % 2 == 1 then\n table.insert(box, j)\n end\n tmp = brs(tmp, 1)\n end\n local c = 0\n for i = 1, #box - 1 do\n for j = i + 1 , #box do\n c = c + edge[box[i]][box[j]]\n end\n end\n edgesum[it] = c\nend\n\nlocal base = 0\ndo\n -- use 1 and others\n local tot1 = bls(1, n - 1)\n base = base + tot1\n for it = 0, tot1 - 1 do\n local dst = base + it\n bdp[dst] = edgesum[dst]\n end\nend\nlocal map_devide_or1, map_devide_or2 = {}, {}\nfor it = 0, 3^(n - 3) - 1 do\n local tmpit = it\n local a, b = 0, 0\n local mul = 1\n for j = 4, n do\n if tmpit % 3 == 2 then\n a = a + mul\n elseif tmpit % 3 == 1 then\n b = b + mul\n end\n mul = mul * 2\n tmpit = mfl(tmpit / 3)\n end\n map_devide_or1[it + 1], map_devide_or2[it + 1] = a, b\nend\n--use i\nfor i = 2, n do\n local totrem = 3^(n - i)\n local basei = 2^(n - i)\n for it = 0, totrem - 1 do\n local add_from_i = 0\n local marge_src = 0\n if i == 2 then\n if 2 * (3^(n - 3)) <= it then\n marge_src = marge_src + 2^(n - 3)\n it = it - 2 * (3^(n - 3))\n elseif 3^(n - 3) <= it then\n add_from_i = add_from_i + 2^(n - 3)\n it = it - (3^(n - 3))\n end\n end\n add_from_i = add_from_i + basei + map_devide_or1[it + 1]\n marge_src = marge_src + base + map_devide_or2[it + 1]\n local dst = bor(add_from_i, marge_src)\n bdp[dst] = mma(bdp[dst], bdp[marge_src] + edgesum[add_from_i])\n end\n base = base + basei\nend\nprint(bdp[all - 1])\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N rabbits, numbered 1, 2, \\ldots, N.\n\nFor each i, j (1 \\leq i, j \\leq N), the compatibility of Rabbit i and j is described by an integer a_{i, j}.\nHere, a_{i, i} = 0 for each i (1 \\leq i \\leq N), and a_{i, j} = a_{j, i} for each i and j (1 \\leq i, j \\leq N).\n\nTaro is dividing the N rabbits into some number of groups.\nHere, each rabbit must belong to exactly one group.\nAfter grouping, for each i and j (1 \\leq i < j \\leq N), Taro earns a_{i, j} points if Rabbit i and j belong to the same group.\n\nFind Taro's maximum possible total score.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 16\n\n|a_{i, j}| \\leq 10^9\n\na_{i, i} = 0\n\na_{i, j} = a_{j, i}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_{1, 1} \\ldots a_{1, N}\n:\na_{N, 1} \\ldots a_{N, N}\n\nOutput\n\nPrint Taro's maximum possible total score.\n\nSample Input 1\n\n3\n0 10 20\n10 0 -100\n20 -100 0\n\nSample Output 1\n\n20\n\nThe rabbits should be divided as \\{1, 3\\}, \\{2\\}.\n\nSample Input 2\n\n2\n0 -10\n-10 0\n\nSample Output 2\n\n0\n\nThe rabbits should be divided as \\{1\\}, \\{2\\}.\n\nSample Input 3\n\n4\n0 1000000000 1000000000 1000000000\n1000000000 0 1000000000 1000000000\n1000000000 1000000000 0 -1\n1000000000 1000000000 -1 0\n\nSample Output 3\n\n4999999999\n\nThe rabbits should be divided as \\{1, 2, 3, 4\\}.\nNote that the answer may not fit into a 32-bit integer type.\n\nSample Input 4\n\n16\n0 5 -4 -5 -8 -4 7 2 -4 0 7 0 2 -3 7 7\n5 0 8 -9 3 5 2 -7 2 -7 0 -1 -4 1 -1 9\n-4 8 0 -9 8 9 3 1 4 9 6 6 -6 1 8 9\n-5 -9 -9 0 -7 6 4 -1 9 -3 -5 0 1 2 -4 1\n-8 3 8 -7 0 -5 -9 9 1 -9 -6 -3 -8 3 4 3\n-4 5 9 6 -5 0 -6 1 -2 2 0 -5 -2 3 1 2\n7 2 3 4 -9 -6 0 -2 -2 -9 -3 9 -2 9 2 -5\n2 -7 1 -1 9 1 -2 0 -6 0 -6 6 4 -1 -7 8\n-4 2 4 9 1 -2 -2 -6 0 8 -6 -2 -4 8 7 7\n0 -7 9 -3 -9 2 -9 0 8 0 0 1 -3 3 -6 -6\n7 0 6 -5 -6 0 -3 -6 -6 0 0 5 7 -1 -5 3\n0 -1 6 0 -3 -5 9 6 -2 1 5 0 -2 7 -8 0\n2 -4 -6 1 -8 -2 -2 4 -4 -3 7 -2 0 -9 7 1\n-3 1 1 2 3 3 9 -1 8 3 -1 7 -9 0 -6 -8\n7 -1 8 -4 4 1 2 -7 7 -6 -5 -8 7 -6 0 -9\n7 9 9 1 3 2 -5 8 7 -6 3 0 1 -8 -9 0\n\nSample Output 4\n\n132", "sample_input": "3\n0 10 20\n10 0 -100\n20 -100 0\n"}, "reference_outputs": ["20\n"], "source_document_id": "p03180", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N rabbits, numbered 1, 2, \\ldots, N.\n\nFor each i, j (1 \\leq i, j \\leq N), the compatibility of Rabbit i and j is described by an integer a_{i, j}.\nHere, a_{i, i} = 0 for each i (1 \\leq i \\leq N), and a_{i, j} = a_{j, i} for each i and j (1 \\leq i, j \\leq N).\n\nTaro is dividing the N rabbits into some number of groups.\nHere, each rabbit must belong to exactly one group.\nAfter grouping, for each i and j (1 \\leq i < j \\leq N), Taro earns a_{i, j} points if Rabbit i and j belong to the same group.\n\nFind Taro's maximum possible total score.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 16\n\n|a_{i, j}| \\leq 10^9\n\na_{i, i} = 0\n\na_{i, j} = a_{j, i}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_{1, 1} \\ldots a_{1, N}\n:\na_{N, 1} \\ldots a_{N, N}\n\nOutput\n\nPrint Taro's maximum possible total score.\n\nSample Input 1\n\n3\n0 10 20\n10 0 -100\n20 -100 0\n\nSample Output 1\n\n20\n\nThe rabbits should be divided as \\{1, 3\\}, \\{2\\}.\n\nSample Input 2\n\n2\n0 -10\n-10 0\n\nSample Output 2\n\n0\n\nThe rabbits should be divided as \\{1\\}, \\{2\\}.\n\nSample Input 3\n\n4\n0 1000000000 1000000000 1000000000\n1000000000 0 1000000000 1000000000\n1000000000 1000000000 0 -1\n1000000000 1000000000 -1 0\n\nSample Output 3\n\n4999999999\n\nThe rabbits should be divided as \\{1, 2, 3, 4\\}.\nNote that the answer may not fit into a 32-bit integer type.\n\nSample Input 4\n\n16\n0 5 -4 -5 -8 -4 7 2 -4 0 7 0 2 -3 7 7\n5 0 8 -9 3 5 2 -7 2 -7 0 -1 -4 1 -1 9\n-4 8 0 -9 8 9 3 1 4 9 6 6 -6 1 8 9\n-5 -9 -9 0 -7 6 4 -1 9 -3 -5 0 1 2 -4 1\n-8 3 8 -7 0 -5 -9 9 1 -9 -6 -3 -8 3 4 3\n-4 5 9 6 -5 0 -6 1 -2 2 0 -5 -2 3 1 2\n7 2 3 4 -9 -6 0 -2 -2 -9 -3 9 -2 9 2 -5\n2 -7 1 -1 9 1 -2 0 -6 0 -6 6 4 -1 -7 8\n-4 2 4 9 1 -2 -2 -6 0 8 -6 -2 -4 8 7 7\n0 -7 9 -3 -9 2 -9 0 8 0 0 1 -3 3 -6 -6\n7 0 6 -5 -6 0 -3 -6 -6 0 0 5 7 -1 -5 3\n0 -1 6 0 -3 -5 9 6 -2 1 5 0 -2 7 -8 0\n2 -4 -6 1 -8 -2 -2 4 -4 -3 7 -2 0 -9 7 1\n-3 1 1 2 3 3 9 -1 8 3 -1 7 -9 0 -6 -8\n7 -1 8 -4 4 1 2 -7 7 -6 -5 -8 7 -6 0 -9\n7 9 9 1 3 2 -5 8 7 -6 3 0 1 -8 -9 0\n\nSample Output 4\n\n132", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2035, "cpu_time_ms": 628, "memory_kb": 37744}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s010193855", "group_id": "codeNet:p03193", "input_text": "N, H, W = io.read(\"*n\",\"*n\",\"*n\")\nio.read()\n\nc = 0\n\nfor v = 1, N do\n A, B = io.read(\"*n\",\"*n\")\n io.read()\n \n if A >= H and B >= W then\n c = c + 1\n end\nend\n\nprint(c)", "language": "Lua", "metadata": {"date": 1545531734, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s010193855.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s010193855", "user_id": "u374892957"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "N, H, W = io.read(\"*n\",\"*n\",\"*n\")\nio.read()\n\nc = 0\n\nfor v = 1, N do\n A, B = io.read(\"*n\",\"*n\")\n io.read()\n \n if A >= H and B >= W then\n c = c + 1\n end\nend\n\nprint(c)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s819522724", "group_id": "codeNet:p03194", "input_text": "N, P = io.read(\"*n\",\"*n\")\nio.read()\n\ni = 3\na = 1\n\nwhile P % (2^N) == 0 and P ~= 0 do\n P = P // (2^N)\n a = a * 2\nend\n\nwhile i^N <= P do\n while P % (i^N) == 0 and P ~= 0 do\n P = P // (i^N)\n a = a * i\n end\n \n i = i + 2\nend\n\nprint(a)\n", "language": "Lua", "metadata": {"date": 1545536840, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s819522724.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s819522724", "user_id": "u374892957"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "N, P = io.read(\"*n\",\"*n\")\nio.read()\n\ni = 3\na = 1\n\nwhile P % (2^N) == 0 and P ~= 0 do\n P = P // (2^N)\n a = a * 2\nend\n\nwhile i^N <= P do\n while P % (i^N) == 0 and P ~= 0 do\n P = P // (i^N)\n a = a * i\n end\n \n i = i + 2\nend\n\nprint(a)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 242, "cpu_time_ms": 2103, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s397960236", "group_id": "codeNet:p03196", "input_text": "local n,p=io.read(\"n\",\"n\")\nlocal x=math.floor(p^(1/n))\nfor i=x+1,1,-1 do\n if p%(i^n)==0 then\n print(i)\n return\n end\nend\n", "language": "Lua", "metadata": {"date": 1591023059, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03196.html", "problem_id": "p03196", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03196/input.txt", "sample_output_relpath": "derived/input_output/data/p03196/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03196/Lua/s397960236.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s397960236", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n,p=io.read(\"n\",\"n\")\nlocal x=math.floor(p^(1/n))\nfor i=x+1,1,-1 do\n if p%(i^n)==0 then\n print(i)\n return\n end\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": "p03196", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers a_1, a_2, ..., a_N not less than 1.\nThe values of a_1, a_2, ..., a_N are not known, but it is known that a_1 \\times a_2 \\times ... \\times a_N = P.\n\nFind the maximum possible greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\n1 \\leq N \\leq 10^{12}\n\n1 \\leq P \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 24\n\nSample Output 1\n\n2\n\nThe greatest common divisor would be 2 when, for example, a_1=2, a_2=6 and a_3=2.\n\nSample Input 2\n\n5 1\n\nSample Output 2\n\n1\n\nAs a_i are positive integers, the only possible case is a_1 = a_2 = a_3 = a_4 = a_5 = 1.\n\nSample Input 3\n\n1 111\n\nSample Output 3\n\n111\n\nSample Input 4\n\n4 972439611840\n\nSample Output 4\n\n206", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 47, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s493244421", "group_id": "codeNet:p03196", "input_text": "local n,p=io.read(\"n\",\"n\")\nlocal x=0\nfor i=1,p^(1/5) do\n if p%(i^n)==0 then\n x=i\n end\nend\nprint(x)", "language": "Lua", "metadata": {"date": 1591021626, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03196.html", "problem_id": "p03196", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03196/input.txt", "sample_output_relpath": "derived/input_output/data/p03196/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03196/Lua/s493244421.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s493244421", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n,p=io.read(\"n\",\"n\")\nlocal x=0\nfor i=1,p^(1/5) do\n if p%(i^n)==0 then\n x=i\n end\nend\nprint(x)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers a_1, a_2, ..., a_N not less than 1.\nThe values of a_1, a_2, ..., a_N are not known, but it is known that a_1 \\times a_2 \\times ... \\times a_N = P.\n\nFind the maximum possible greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\n1 \\leq N \\leq 10^{12}\n\n1 \\leq P \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 24\n\nSample Output 1\n\n2\n\nThe greatest common divisor would be 2 when, for example, a_1=2, a_2=6 and a_3=2.\n\nSample Input 2\n\n5 1\n\nSample Output 2\n\n1\n\nAs a_i are positive integers, the only possible case is a_1 = a_2 = a_3 = a_4 = a_5 = 1.\n\nSample Input 3\n\n1 111\n\nSample Output 3\n\n111\n\nSample Input 4\n\n4 972439611840\n\nSample Output 4\n\n206", "sample_input": "3 24\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03196", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers a_1, a_2, ..., a_N not less than 1.\nThe values of a_1, a_2, ..., a_N are not known, but it is known that a_1 \\times a_2 \\times ... \\times a_N = P.\n\nFind the maximum possible greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\n1 \\leq N \\leq 10^{12}\n\n1 \\leq P \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 24\n\nSample Output 1\n\n2\n\nThe greatest common divisor would be 2 when, for example, a_1=2, a_2=6 and a_3=2.\n\nSample Input 2\n\n5 1\n\nSample Output 2\n\n1\n\nAs a_i are positive integers, the only possible case is a_1 = a_2 = a_3 = a_4 = a_5 = 1.\n\nSample Input 3\n\n1 111\n\nSample Output 3\n\n111\n\nSample Input 4\n\n4 972439611840\n\nSample Output 4\n\n206", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 111, "cpu_time_ms": 10, "memory_kb": 880}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s176120224", "group_id": "codeNet:p03200", "input_text": "-- 左黒右白\nlocal b = string.byte(\"B\")\n\nlocal s = io.read()\nlocal s_len = s:len()\nlocal s_bool_t = {}\nfor i = 1, s_len do\n\tif s:byte(i) == b then\n\t\ts_bool_t[i] = true\n\telse\n\t\ts_bool_t[i] = false\n\tend\nend\n\nlocal count_sum = 0\nlocal count = 1\nwhile count > 0 do\n\tcount = 0\n\tfor i = 1, s_len - 1 do\n\t\tif s_bool_t[i] and not s_bool_t[i + 1] then\n\t\t\ts_bool_t[i] = false\n\t\t\ts_bool_t[i + 1] = true\n\t\t\tcount = count + 1\n\t\tend\n\tend\n\tcount_sum = count_sum + count\nend\n\nprint(count_sum)\n", "language": "Lua", "metadata": {"date": 1598915599, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s176120224.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s176120224", "user_id": "u793881115"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "-- 左黒右白\nlocal b = string.byte(\"B\")\n\nlocal s = io.read()\nlocal s_len = s:len()\nlocal s_bool_t = {}\nfor i = 1, s_len do\n\tif s:byte(i) == b then\n\t\ts_bool_t[i] = true\n\telse\n\t\ts_bool_t[i] = false\n\tend\nend\n\nlocal count_sum = 0\nlocal count = 1\nwhile count > 0 do\n\tcount = 0\n\tfor i = 1, s_len - 1 do\n\t\tif s_bool_t[i] and not s_bool_t[i + 1] then\n\t\t\ts_bool_t[i] = false\n\t\t\ts_bool_t[i + 1] = true\n\t\t\tcount = count + 1\n\t\tend\n\tend\n\tcount_sum = count_sum + count\nend\n\nprint(count_sum)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N Reversi pieces arranged in a row. (A Reversi piece is a disc with a black side and a white side.)\nThe state of each piece is represented by a string S of length N.\nIf S_i=B, the i-th piece from the left is showing black;\nIf S_i=W, the i-th piece from the left is showing white.\n\nConsider performing the following operation:\n\nChoose i (1 \\leq i < N) such that the i-th piece from the left is showing black and the (i+1)-th piece from the left is showing white, then flip both of those pieces. That is, the i-th piece from the left is now showing white and the (i+1)-th piece from the left is now showing black.\n\nFind the maximum possible number of times this operation can be performed.\n\nConstraints\n\n1 \\leq |S| \\leq 2\\times 10^5\n\nS_i=B or W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum possible number of times the operation can be performed.\n\nSample Input 1\n\nBBW\n\nSample Output 1\n\n2\n\nThe operation can be performed twice, as follows:\n\nFlip the second and third pieces from the left.\n\nFlip the first and second pieces from the left.\n\nSample Input 2\n\nBWBWBW\n\nSample Output 2\n\n6", "sample_input": "BBW\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03200", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N Reversi pieces arranged in a row. (A Reversi piece is a disc with a black side and a white side.)\nThe state of each piece is represented by a string S of length N.\nIf S_i=B, the i-th piece from the left is showing black;\nIf S_i=W, the i-th piece from the left is showing white.\n\nConsider performing the following operation:\n\nChoose i (1 \\leq i < N) such that the i-th piece from the left is showing black and the (i+1)-th piece from the left is showing white, then flip both of those pieces. That is, the i-th piece from the left is now showing white and the (i+1)-th piece from the left is now showing black.\n\nFind the maximum possible number of times this operation can be performed.\n\nConstraints\n\n1 \\leq |S| \\leq 2\\times 10^5\n\nS_i=B or W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum possible number of times the operation can be performed.\n\nSample Input 1\n\nBBW\n\nSample Output 1\n\n2\n\nThe operation can be performed twice, as follows:\n\nFlip the second and third pieces from the left.\n\nFlip the first and second pieces from the left.\n\nSample Input 2\n\nBWBWBW\n\nSample Output 2\n\n6", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 480, "cpu_time_ms": 2205, "memory_kb": 6892}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s289068347", "group_id": "codeNet:p03200", "input_text": "local s = io.read()\nlocal t = {}\nlocal n = #s\nfor i = 1, n do\n table.insert(t, s:sub(i, i) == \"B\")\nend\nlocal cnt = 0\nlocal curcnt = 0\nfor i = n, 1, -1 do\n if t[i] then\n cnt = cnt + curcnt\n t[i] = false\n else\n curcnt = curcnt + 1\n end\nend\nprint(cnt)\n", "language": "Lua", "metadata": {"date": 1559527636, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s289068347.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s289068347", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local s = io.read()\nlocal t = {}\nlocal n = #s\nfor i = 1, n do\n table.insert(t, s:sub(i, i) == \"B\")\nend\nlocal cnt = 0\nlocal curcnt = 0\nfor i = n, 1, -1 do\n if t[i] then\n cnt = cnt + curcnt\n t[i] = false\n else\n curcnt = curcnt + 1\n end\nend\nprint(cnt)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N Reversi pieces arranged in a row. (A Reversi piece is a disc with a black side and a white side.)\nThe state of each piece is represented by a string S of length N.\nIf S_i=B, the i-th piece from the left is showing black;\nIf S_i=W, the i-th piece from the left is showing white.\n\nConsider performing the following operation:\n\nChoose i (1 \\leq i < N) such that the i-th piece from the left is showing black and the (i+1)-th piece from the left is showing white, then flip both of those pieces. That is, the i-th piece from the left is now showing white and the (i+1)-th piece from the left is now showing black.\n\nFind the maximum possible number of times this operation can be performed.\n\nConstraints\n\n1 \\leq |S| \\leq 2\\times 10^5\n\nS_i=B or W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum possible number of times the operation can be performed.\n\nSample Input 1\n\nBBW\n\nSample Output 1\n\n2\n\nThe operation can be performed twice, as follows:\n\nFlip the second and third pieces from the left.\n\nFlip the first and second pieces from the left.\n\nSample Input 2\n\nBWBWBW\n\nSample Output 2\n\n6", "sample_input": "BBW\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03200", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N Reversi pieces arranged in a row. (A Reversi piece is a disc with a black side and a white side.)\nThe state of each piece is represented by a string S of length N.\nIf S_i=B, the i-th piece from the left is showing black;\nIf S_i=W, the i-th piece from the left is showing white.\n\nConsider performing the following operation:\n\nChoose i (1 \\leq i < N) such that the i-th piece from the left is showing black and the (i+1)-th piece from the left is showing white, then flip both of those pieces. That is, the i-th piece from the left is now showing white and the (i+1)-th piece from the left is now showing black.\n\nFind the maximum possible number of times this operation can be performed.\n\nConstraints\n\n1 \\leq |S| \\leq 2\\times 10^5\n\nS_i=B or W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum possible number of times the operation can be performed.\n\nSample Input 1\n\nBBW\n\nSample Output 1\n\n2\n\nThe operation can be performed twice, as follows:\n\nFlip the second and third pieces from the left.\n\nFlip the first and second pieces from the left.\n\nSample Input 2\n\nBWBWBW\n\nSample Output 2\n\n6", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 262, "cpu_time_ms": 83, "memory_kb": 5420}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s215392468", "group_id": "codeNet:p03200", "input_text": "S = {}\n\nfor w in string.gmatch(io.read(), \"%a\") do\n table.insert(S,w)\nend\n\nC = 0\nmc = 0\nbf = 0\n\nfor i=2, #S do\n p = table.concat(S,\"\",i-1,i);\n if p == \"BW\" then\n mc = mc + 1\n C = C + bf\n bf = 0\n C = C + mc\n else\n if p ~= \"WB\" then\n mc = 0\n \n if p == \"WW\" then\n C = C + 1\n end\n end\n\n if p == \"BB\" then\n bf = 1\n else\n bf = 0\n end\n end\nend\n\nprint(C)\n", "language": "Lua", "metadata": {"date": 1544933741, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s215392468.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s215392468", "user_id": "u374892957"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "S = {}\n\nfor w in string.gmatch(io.read(), \"%a\") do\n table.insert(S,w)\nend\n\nC = 0\nmc = 0\nbf = 0\n\nfor i=2, #S do\n p = table.concat(S,\"\",i-1,i);\n if p == \"BW\" then\n mc = mc + 1\n C = C + bf\n bf = 0\n C = C + mc\n else\n if p ~= \"WB\" then\n mc = 0\n \n if p == \"WW\" then\n C = C + 1\n end\n end\n\n if p == \"BB\" then\n bf = 1\n else\n bf = 0\n end\n end\nend\n\nprint(C)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N Reversi pieces arranged in a row. (A Reversi piece is a disc with a black side and a white side.)\nThe state of each piece is represented by a string S of length N.\nIf S_i=B, the i-th piece from the left is showing black;\nIf S_i=W, the i-th piece from the left is showing white.\n\nConsider performing the following operation:\n\nChoose i (1 \\leq i < N) such that the i-th piece from the left is showing black and the (i+1)-th piece from the left is showing white, then flip both of those pieces. That is, the i-th piece from the left is now showing white and the (i+1)-th piece from the left is now showing black.\n\nFind the maximum possible number of times this operation can be performed.\n\nConstraints\n\n1 \\leq |S| \\leq 2\\times 10^5\n\nS_i=B or W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum possible number of times the operation can be performed.\n\nSample Input 1\n\nBBW\n\nSample Output 1\n\n2\n\nThe operation can be performed twice, as follows:\n\nFlip the second and third pieces from the left.\n\nFlip the first and second pieces from the left.\n\nSample Input 2\n\nBWBWBW\n\nSample Output 2\n\n6", "sample_input": "BBW\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03200", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N Reversi pieces arranged in a row. (A Reversi piece is a disc with a black side and a white side.)\nThe state of each piece is represented by a string S of length N.\nIf S_i=B, the i-th piece from the left is showing black;\nIf S_i=W, the i-th piece from the left is showing white.\n\nConsider performing the following operation:\n\nChoose i (1 \\leq i < N) such that the i-th piece from the left is showing black and the (i+1)-th piece from the left is showing white, then flip both of those pieces. That is, the i-th piece from the left is now showing white and the (i+1)-th piece from the left is now showing black.\n\nFind the maximum possible number of times this operation can be performed.\n\nConstraints\n\n1 \\leq |S| \\leq 2\\times 10^5\n\nS_i=B or W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum possible number of times the operation can be performed.\n\nSample Input 1\n\nBBW\n\nSample Output 1\n\n2\n\nThe operation can be performed twice, as follows:\n\nFlip the second and third pieces from the left.\n\nFlip the first and second pieces from the left.\n\nSample Input 2\n\nBWBWBW\n\nSample Output 2\n\n6", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 416, "cpu_time_ms": 194, "memory_kb": 5420}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s662396658", "group_id": "codeNet:p03200", "input_text": "S = {}\n\nfor w in string.gmatch(io.read(), \"%a\") do\n table.insert(S,w)\nend\n\nC = 0\nmc = 0\nbf = 0\n\nfor i=2, #S do\n p = table.concat(S,\"\",i-1,i);\n if p == \"BW\" then\n mc = mc + 1\n C = C + bf\n bf = 0\n else\n if p ~= \"WB\" then\n mc = 0\n \n if p == \"WW\" then\n C = C + 1\n end\n end\n\n if p == \"BB\" then\n bf = 1\n else\n bf = 0\n end\n end\n\n C = C + mc\nend\n\nprint(C)\n", "language": "Lua", "metadata": {"date": 1544933405, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s662396658.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s662396658", "user_id": "u374892957"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "S = {}\n\nfor w in string.gmatch(io.read(), \"%a\") do\n table.insert(S,w)\nend\n\nC = 0\nmc = 0\nbf = 0\n\nfor i=2, #S do\n p = table.concat(S,\"\",i-1,i);\n if p == \"BW\" then\n mc = mc + 1\n C = C + bf\n bf = 0\n else\n if p ~= \"WB\" then\n mc = 0\n \n if p == \"WW\" then\n C = C + 1\n end\n end\n\n if p == \"BB\" then\n bf = 1\n else\n bf = 0\n end\n end\n\n C = C + mc\nend\n\nprint(C)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N Reversi pieces arranged in a row. (A Reversi piece is a disc with a black side and a white side.)\nThe state of each piece is represented by a string S of length N.\nIf S_i=B, the i-th piece from the left is showing black;\nIf S_i=W, the i-th piece from the left is showing white.\n\nConsider performing the following operation:\n\nChoose i (1 \\leq i < N) such that the i-th piece from the left is showing black and the (i+1)-th piece from the left is showing white, then flip both of those pieces. That is, the i-th piece from the left is now showing white and the (i+1)-th piece from the left is now showing black.\n\nFind the maximum possible number of times this operation can be performed.\n\nConstraints\n\n1 \\leq |S| \\leq 2\\times 10^5\n\nS_i=B or W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum possible number of times the operation can be performed.\n\nSample Input 1\n\nBBW\n\nSample Output 1\n\n2\n\nThe operation can be performed twice, as follows:\n\nFlip the second and third pieces from the left.\n\nFlip the first and second pieces from the left.\n\nSample Input 2\n\nBWBWBW\n\nSample Output 2\n\n6", "sample_input": "BBW\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03200", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N Reversi pieces arranged in a row. (A Reversi piece is a disc with a black side and a white side.)\nThe state of each piece is represented by a string S of length N.\nIf S_i=B, the i-th piece from the left is showing black;\nIf S_i=W, the i-th piece from the left is showing white.\n\nConsider performing the following operation:\n\nChoose i (1 \\leq i < N) such that the i-th piece from the left is showing black and the (i+1)-th piece from the left is showing white, then flip both of those pieces. That is, the i-th piece from the left is now showing white and the (i+1)-th piece from the left is now showing black.\n\nFind the maximum possible number of times this operation can be performed.\n\nConstraints\n\n1 \\leq |S| \\leq 2\\times 10^5\n\nS_i=B or W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum possible number of times the operation can be performed.\n\nSample Input 1\n\nBBW\n\nSample Output 1\n\n2\n\nThe operation can be performed twice, as follows:\n\nFlip the second and third pieces from the left.\n\nFlip the first and second pieces from the left.\n\nSample Input 2\n\nBWBWBW\n\nSample Output 2\n\n6", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 205, "memory_kb": 5420}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s405849911", "group_id": "codeNet:p03201", "input_text": "local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max\nlocal function lower_bound(ary, x, num)\n if num == 0 then return 1 end\n if(x <= ary[1].val) then return 1 end\n if(ary[num].val < x) then return num + 1 end\n local min, max = 1, num\n while(1 < max - min) do\n local mid = mfl((min + max) / 2)\n if(ary[mid].val < x) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\nlocal function upper_bound(ary, x, num)\n if num == 0 then return 1 end\n if(x < ary[1].val) then return 1 end\n if(ary[num].val <= x) then return num + 1 end\n local min, max = 1, num\n while(1 < max - min) do\n local mid = mfl((min + max) / 2)\n if(ary[mid].val <= x) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\nlocal n = io.read(\"*n\", \"*l\")\nlocal t = {}\nlocal str = io.read()\nfor v in str:gmatch(\"%d+\") do\n local tmp = {}\n tmp.val = tonumber(v)\n tmp.used = false\n table.insert(t, tmp)\nend\ntable.sort(t, function(x, y) return x.val < y.val end)\nlocal cnt = 0\nfor i = n, 2, -1 do\n if not t[i].used then\n t[i].used = true\n local v = t[i].val\n local mul = 2\n while mul <= v do\n mul = mul * 2\n end\n v = mul - v\n local lb, ub = lower_bound(t, v, i - 1), upper_bound(t, v, i - 1)\n for j = ub - 1, lb, -1 do\n if not t[j].used then\n cnt = cnt + 1\n t[j].used = true\n break\n end\n end\n end\nend\nprint(cnt)\n", "language": "Lua", "metadata": {"date": 1563416396, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s405849911.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s405849911", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max\nlocal function lower_bound(ary, x, num)\n if num == 0 then return 1 end\n if(x <= ary[1].val) then return 1 end\n if(ary[num].val < x) then return num + 1 end\n local min, max = 1, num\n while(1 < max - min) do\n local mid = mfl((min + max) / 2)\n if(ary[mid].val < x) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\nlocal function upper_bound(ary, x, num)\n if num == 0 then return 1 end\n if(x < ary[1].val) then return 1 end\n if(ary[num].val <= x) then return num + 1 end\n local min, max = 1, num\n while(1 < max - min) do\n local mid = mfl((min + max) / 2)\n if(ary[mid].val <= x) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\nlocal n = io.read(\"*n\", \"*l\")\nlocal t = {}\nlocal str = io.read()\nfor v in str:gmatch(\"%d+\") do\n local tmp = {}\n tmp.val = tonumber(v)\n tmp.used = false\n table.insert(t, tmp)\nend\ntable.sort(t, function(x, y) return x.val < y.val end)\nlocal cnt = 0\nfor i = n, 2, -1 do\n if not t[i].used then\n t[i].used = true\n local v = t[i].val\n local mul = 2\n while mul <= v do\n mul = mul * 2\n end\n v = mul - v\n local lb, ub = lower_bound(t, v, i - 1), upper_bound(t, v, i - 1)\n for j = ub - 1, lb, -1 do\n if not t[j].used then\n cnt = cnt + 1\n t[j].used = true\n break\n end\n end\n end\nend\nprint(cnt)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nTakahashi has N balls with positive integers written on them. The integer written on the i-th ball is A_i.\nHe would like to form some number of pairs such that the sum of the integers written on each pair of balls is a power of 2.\nNote that a ball cannot belong to multiple pairs.\nFind the maximum possible number of pairs that can be formed.\n\nHere, a positive integer is said to be a power of 2 when it can be written as 2^t using some non-negative integer t.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible number of pairs such that the sum of the integers written on each pair of balls is a power of 2.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n1\n\nWe can form one pair whose sum of the written numbers is 4 by pairing the first and third balls.\nNote that we cannot pair the second ball with itself.\n\nSample Input 2\n\n5\n3 11 14 5 13\n\nSample Output 2\n\n2", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03201", "source_text": "Score : 600 points\n\nProblem Statement\n\nTakahashi has N balls with positive integers written on them. The integer written on the i-th ball is A_i.\nHe would like to form some number of pairs such that the sum of the integers written on each pair of balls is a power of 2.\nNote that a ball cannot belong to multiple pairs.\nFind the maximum possible number of pairs that can be formed.\n\nHere, a positive integer is said to be a power of 2 when it can be written as 2^t using some non-negative integer t.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible number of pairs such that the sum of the integers written on each pair of balls is a power of 2.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n1\n\nWe can form one pair whose sum of the written numbers is 4 by pairing the first and third balls.\nNote that we cannot pair the second ball with itself.\n\nSample Input 2\n\n5\n3 11 14 5 13\n\nSample Output 2\n\n2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1437, "cpu_time_ms": 595, "memory_kb": 27356}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s796400672", "group_id": "codeNet:p03202", "input_text": "local mfl = math.floor\nlocal n = io.read(\"*n\")\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\nend\n\nlocal function solve(x)\n if x == 1 then\n for i = 1, n - 1 do\n if a[i + 1] <= a[i] then return false end\n end\n return true\n end\n local tasks = {}\n local ok = true\n for i = 1, n do\n if 0 == #tasks or tasks[#tasks][1] < a[i] then\n table.insert(tasks, {a[i], 1})\n else\n while 0 < #tasks and a[i] < tasks[#tasks][1] do\n table.remove(tasks)\n end\n if 0 == #tasks then\n table.insert(tasks, {a[i], 2})\n elseif tasks[#tasks][1] == a[i] then\n tasks[#tasks][2] = tasks[#tasks][2] + 1\n else\n table.insert(tasks, {a[i], 2})\n end\n while 0 < #tasks do\n if x < tasks[#tasks][2] then\n local pos = tasks[#tasks][1]\n if pos == 1 then\n ok = false\n break\n else\n table.remove(tasks)\n if 0 < #tasks and tasks[#tasks][1] == pos - 1 then\n tasks[#tasks][2] = tasks[#tasks][2] + 1\n else\n table.insert(tasks, {pos - 1, 2})\n break\n end\n end\n else\n break\n end\n end\n if 0 == #tasks or tasks[#tasks][1] < a[i] then\n table.insert(tasks, {a[i], 1})\n end\n end\n if not ok then break end\n end\n return ok\nend\n\nlocal min, max = 0, n\nwhile 1 < max - min do\n local mid = mfl((max + min) / 2)\n if solve(mid) then\n max = mid\n else\n min = mid\n end\nend\nprint(max)\n", "language": "Lua", "metadata": {"date": 1582212226, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s796400672.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s796400672", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local mfl = math.floor\nlocal n = io.read(\"*n\")\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\nend\n\nlocal function solve(x)\n if x == 1 then\n for i = 1, n - 1 do\n if a[i + 1] <= a[i] then return false end\n end\n return true\n end\n local tasks = {}\n local ok = true\n for i = 1, n do\n if 0 == #tasks or tasks[#tasks][1] < a[i] then\n table.insert(tasks, {a[i], 1})\n else\n while 0 < #tasks and a[i] < tasks[#tasks][1] do\n table.remove(tasks)\n end\n if 0 == #tasks then\n table.insert(tasks, {a[i], 2})\n elseif tasks[#tasks][1] == a[i] then\n tasks[#tasks][2] = tasks[#tasks][2] + 1\n else\n table.insert(tasks, {a[i], 2})\n end\n while 0 < #tasks do\n if x < tasks[#tasks][2] then\n local pos = tasks[#tasks][1]\n if pos == 1 then\n ok = false\n break\n else\n table.remove(tasks)\n if 0 < #tasks and tasks[#tasks][1] == pos - 1 then\n tasks[#tasks][2] = tasks[#tasks][2] + 1\n else\n table.insert(tasks, {pos - 1, 2})\n break\n end\n end\n else\n break\n end\n end\n if 0 == #tasks or tasks[#tasks][1] < a[i] then\n table.insert(tasks, {a[i], 1})\n end\n end\n if not ok then break end\n end\n return ok\nend\n\nlocal min, max = 0, n\nwhile 1 < max - min do\n local mid = mfl((max + min) / 2)\n if solve(mid) then\n max = mid\n else\n min = mid\n end\nend\nprint(max)\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nThere are N strings arranged in a row.\nIt is known that, for any two adjacent strings, the string to the left is lexicographically smaller than the string to the right.\nThat is, S_1 max then\n max = p\n end\nend\nprint(total - max//2)", "language": "Lua", "metadata": {"date": 1548963235, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03207.html", "problem_id": "p03207", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03207/input.txt", "sample_output_relpath": "derived/input_output/data/p03207/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03207/Lua/s103705020.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s103705020", "user_id": "u200201528"}, "prompt_components": {"gold_output": "15950\n", "input_to_evaluate": "local n = io.read(\"n\")\nlocal max = 0\nlocal total = 0\nfor i = 1, n do\n local p = io.read(\"n\")\n total = total + p\n if p > max then\n max = p\n end\nend\nprint(total - max//2)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn some other world, today is the day before Christmas Eve.\n\nMr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \\leq i \\leq N) is p_i yen (the currency of Japan).\n\nHe has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay?\n\nConstraints\n\n2 \\leq N \\leq 10\n\n100 \\leq p_i \\leq 10000\n\np_i is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\np_1\np_2\n:\np_N\n\nOutput\n\nPrint the total amount Mr. Takaha will pay.\n\nSample Input 1\n\n3\n4980\n7980\n6980\n\nSample Output 1\n\n15950\n\nThe 7980-yen item gets the discount and the total is 4980 + 7980 / 2 + 6980 = 15950 yen.\n\nNote that outputs such as 15950.0 will be judged as Wrong Answer.\n\nSample Input 2\n\n4\n4320\n4320\n4320\n4320\n\nSample Output 2\n\n15120\n\nOnly one of the four items gets the discount and the total is 4320 / 2 + 4320 + 4320 + 4320 = 15120 yen.", "sample_input": "3\n4980\n7980\n6980\n"}, "reference_outputs": ["15950\n"], "source_document_id": "p03207", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn some other world, today is the day before Christmas Eve.\n\nMr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \\leq i \\leq N) is p_i yen (the currency of Japan).\n\nHe has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay?\n\nConstraints\n\n2 \\leq N \\leq 10\n\n100 \\leq p_i \\leq 10000\n\np_i is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\np_1\np_2\n:\np_N\n\nOutput\n\nPrint the total amount Mr. Takaha will pay.\n\nSample Input 1\n\n3\n4980\n7980\n6980\n\nSample Output 1\n\n15950\n\nThe 7980-yen item gets the discount and the total is 4980 + 7980 / 2 + 6980 = 15950 yen.\n\nNote that outputs such as 15950.0 will be judged as Wrong Answer.\n\nSample Input 2\n\n4\n4320\n4320\n4320\n4320\n\nSample Output 2\n\n15120\n\nOnly one of the four items gets the discount and the total is 4320 / 2 + 4320 + 4320 + 4320 = 15120 yen.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 175, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s208304861", "group_id": "codeNet:p03208", "input_text": "n=io.read(\"n\")\nk=io.read(\"n\")\nh={}\nfor i=1,n do \n h[i]=io.read(\"n\")\nend\ntable.sort(h)\nt={}\nfor i=1,n-k+1 do\n t[i]=t[k]-t[i]\n k=k+1\nend\ntalbe.sort(t)\nprint(t[1])\n ", "language": "Lua", "metadata": {"date": 1548981460, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s208304861.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s208304861", "user_id": "u015229643"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "n=io.read(\"n\")\nk=io.read(\"n\")\nh={}\nfor i=1,n do \n h[i]=io.read(\"n\")\nend\ntable.sort(h)\nt={}\nfor i=1,n-k+1 do\n t[i]=t[k]-t[i]\n k=k+1\nend\ntalbe.sort(t)\nprint(t[1])\n ", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIn some other world, today is Christmas Eve.\n\nThere are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \\leq i \\leq N) is h_i meters.\n\nHe decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible.\n\nMore specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}?\n\nConstraints\n\n2 \\leq K < N \\leq 10^5\n\n1 \\leq h_i \\leq 10^9\n\nh_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1\nh_2\n:\nh_N\n\nOutput\n\nPrint the minimum possible value of h_{max} - h_{min}.\n\nSample Input 1\n\n5 3\n10\n15\n11\n14\n12\n\nSample Output 1\n\n2\n\nIf we decorate the first, third and fifth trees, h_{max} = 12, h_{min} = 10 so h_{max} - h_{min} = 2. This is optimal.\n\nSample Input 2\n\n5 3\n5\n7\n5\n7\n7\n\nSample Output 2\n\n0\n\nIf we decorate the second, fourth and fifth trees, h_{max} = 7, h_{min} = 7 so h_{max} - h_{min} = 0. This is optimal.\n\nThere are not too many trees in these sample inputs, but note that there can be at most one hundred thousand trees (we just can't put a sample with a hundred thousand lines here).", "sample_input": "5 3\n10\n15\n11\n14\n12\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03208", "source_text": "Score : 300 points\n\nProblem Statement\n\nIn some other world, today is Christmas Eve.\n\nThere are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \\leq i \\leq N) is h_i meters.\n\nHe decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible.\n\nMore specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}?\n\nConstraints\n\n2 \\leq K < N \\leq 10^5\n\n1 \\leq h_i \\leq 10^9\n\nh_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1\nh_2\n:\nh_N\n\nOutput\n\nPrint the minimum possible value of h_{max} - h_{min}.\n\nSample Input 1\n\n5 3\n10\n15\n11\n14\n12\n\nSample Output 1\n\n2\n\nIf we decorate the first, third and fifth trees, h_{max} = 12, h_{min} = 10 so h_{max} - h_{min} = 2. This is optimal.\n\nSample Input 2\n\n5 3\n5\n7\n5\n7\n7\n\nSample Output 2\n\n0\n\nIf we decorate the second, fourth and fifth trees, h_{max} = 7, h_{min} = 7 so h_{max} - h_{min} = 0. This is optimal.\n\nThere are not too many trees in these sample inputs, but note that there can be at most one hundred thousand trees (we just can't put a sample with a hundred thousand lines here).", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 92, "memory_kb": 2424}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s709181804", "group_id": "codeNet:p03208", "input_text": "local n = io.read(\"n\")\nlocal k = io.read(\"n\")\nlocal list = {}\nfor i = 1, n do\n list[i] = io.read(\"n\")\nend\ntable.sort(list)\nlocal min = nil\nfor i = 1, n - k + 1 do\n local d = list[i + k - 1] - list[i]\n if not min or d < min then\n min = d\n end\nend\nprint(min)", "language": "Lua", "metadata": {"date": 1548963470, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s709181804.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s709181804", "user_id": "u200201528"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n = io.read(\"n\")\nlocal k = io.read(\"n\")\nlocal list = {}\nfor i = 1, n do\n list[i] = io.read(\"n\")\nend\ntable.sort(list)\nlocal min = nil\nfor i = 1, n - k + 1 do\n local d = list[i + k - 1] - list[i]\n if not min or d < min then\n min = d\n end\nend\nprint(min)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 96, "memory_kb": 2424}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s637520753", "group_id": "codeNet:p03209", "input_text": "local function memoize(f)\n local cache = {}\n local function key(...)\n local args = {...}\n local k = tostring(args[1])\n for i=2,#args do\n k = k .. \"*\" .. tostring(args[i])\n end\n return k\n end\n return function(...)\n local k = key(...)\n if cache[k] then\n return cache[k]\n end\n local r = f(...)\n cache[k] = r\n return r\n end\nend\n\nlocal thickness\nthickness = memoize(function(n)\n if n == 0 then\n return 1\n else\n return 2 * thickness(n-1) + 3\n end\nend)\n\nlocal patties\npatties = memoize(function (n, x)\n if n == 0 then\n return 1\n end\n local th_upper = thickness(n-1)\n if x == 1 then\n return 0\n elseif x <= th_upper + 1 then\n return patties(n-1, x-1)\n elseif x == th_upper + 2 then\n return 1 + patties(n-1, th_upper)\n else\n return 1 + patties(n-1, th_upper) + patties(n-1, x-2-th_upper)\n end\nend)\n\nlocal N, X = io.read(\"n\", \"n\")\nprint(patties(N,X))\n", "language": "Lua", "metadata": {"date": 1553907894, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s637520753.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s637520753", "user_id": "u162773977"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local function memoize(f)\n local cache = {}\n local function key(...)\n local args = {...}\n local k = tostring(args[1])\n for i=2,#args do\n k = k .. \"*\" .. tostring(args[i])\n end\n return k\n end\n return function(...)\n local k = key(...)\n if cache[k] then\n return cache[k]\n end\n local r = f(...)\n cache[k] = r\n return r\n end\nend\n\nlocal thickness\nthickness = memoize(function(n)\n if n == 0 then\n return 1\n else\n return 2 * thickness(n-1) + 3\n end\nend)\n\nlocal patties\npatties = memoize(function (n, x)\n if n == 0 then\n return 1\n end\n local th_upper = thickness(n-1)\n if x == 1 then\n return 0\n elseif x <= th_upper + 1 then\n return patties(n-1, x-1)\n elseif x == th_upper + 2 then\n return 1 + patties(n-1, th_upper)\n else\n return 1 + patties(n-1, th_upper) + patties(n-1, x-2-th_upper)\n end\nend)\n\nlocal N, X = io.read(\"n\", \"n\")\nprint(patties(N,X))\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1036, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s561449496", "group_id": "codeNet:p03209", "input_text": "n=io.read(\"n\")\nx=io.read(\"n\")\nf={0}\nfor i=1,n do\n\tw={}\n\ttable.insert(w,1)\n\tfor i=1,#f do\n\t\ttable.insert(w,f[i])\n\tend\n\ttable.insert(w,0)\n\tfor i=1,#f do\n\t\ttable.insert(w,f[i])\n\tend\n\ttable.insert(w,1)\n\tf=w\nend\ns=0\nfor i=1,x do\n\tif w[i]==0 then\n\t\ts=s+1\n\tend\nend\nprint(s)\n", "language": "Lua", "metadata": {"date": 1548992379, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s561449496.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s561449496", "user_id": "u015229643"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "n=io.read(\"n\")\nx=io.read(\"n\")\nf={0}\nfor i=1,n do\n\tw={}\n\ttable.insert(w,1)\n\tfor i=1,#f do\n\t\ttable.insert(w,f[i])\n\tend\n\ttable.insert(w,0)\n\tfor i=1,#f do\n\t\ttable.insert(w,f[i])\n\tend\n\ttable.insert(w,1)\n\tf=w\nend\ns=0\nfor i=1,x do\n\tif w[i]==0 then\n\t\ts=s+1\n\tend\nend\nprint(s)\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2108, "memory_kb": 129124}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s565209883", "group_id": "codeNet:p03209", "input_text": "-- local n = io.read(\"n\")\n-- local k = io.read(\"n\")\nlocal n, k = 50, 4321098765432109\nlocal g = {[0] = {1, 1}}\nfor i = 1, n do\n\tlocal c0 = g[i - 1][1]\n\tlocal p0 = g[i - 1][2]\n\tlocal c = c0 * 2 + 3\n\tlocal p = p0 * 2 + 1\n\tg[i] = {c, p}\nend\nlocal function f(_n, _k)\n\tif _k <= 0 then\n\t\treturn 0\n\tend\n\tif _n <= 0 then\n\t\treturn 1\n\tend\n\tlocal c = g[_n][1]\n\tlocal hc = (g[_n][1] + 1) // 2\n\tif _k >= c then\n\t\treturn g[_n][2]\n\telseif _k == hc then\n\t\treturn f(_n - 1, _k - 2) + 1\n\telseif _k < hc then\n\t\treturn f(_n - 1, _k - 1)\n\telse\n\t\treturn g[_n - 1][2] + 1 + f(_n - 1, _k - hc)\n\tend\nend\nprint(f(n, k))", "language": "Lua", "metadata": {"date": 1548984227, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s565209883.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s565209883", "user_id": "u200201528"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "-- local n = io.read(\"n\")\n-- local k = io.read(\"n\")\nlocal n, k = 50, 4321098765432109\nlocal g = {[0] = {1, 1}}\nfor i = 1, n do\n\tlocal c0 = g[i - 1][1]\n\tlocal p0 = g[i - 1][2]\n\tlocal c = c0 * 2 + 3\n\tlocal p = p0 * 2 + 1\n\tg[i] = {c, p}\nend\nlocal function f(_n, _k)\n\tif _k <= 0 then\n\t\treturn 0\n\tend\n\tif _n <= 0 then\n\t\treturn 1\n\tend\n\tlocal c = g[_n][1]\n\tlocal hc = (g[_n][1] + 1) // 2\n\tif _k >= c then\n\t\treturn g[_n][2]\n\telseif _k == hc then\n\t\treturn f(_n - 1, _k - 2) + 1\n\telseif _k < hc then\n\t\treturn f(_n - 1, _k - 1)\n\telse\n\t\treturn g[_n - 1][2] + 1 + f(_n - 1, _k - hc)\n\tend\nend\nprint(f(n, k))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s311212853", "group_id": "codeNet:p03209", "input_text": "local n = io.read(\"n\")\nlocal k = io.read(\"n\")\n--local n, k = 50, 4321098765432109\nlocal g = {[0] = {1, 1}}\nfor i = 1, n do\n\tlocal c0 = g[i - 1][1]\n\tlocal p0 = g[i - 1][2]\n\tlocal c = c0 * 2 + 3\n\tlocal p = p0 * 2 + 1\n\tg[i] = {c, p}\nend\nlocal function f(_n, _k)\n\tif _k <= 0 then\n\t\treturn 0\n\tend\n\tif _n <= 0 then\n\t\treturn 1\n\tend\n\tlocal c = g[_n][1]\n\tlocal hc = (g[_n][1] + 1) // 2\n\tif _k >= c then\n\t\treturn g[_n][2]\n\telseif _k == hc then\n\t\treturn f(_n - 1, _k - 2) + 1\n\telseif _k < hc then\n\t\treturn f(_n - 1, _k - 1)\n\telse\n\t\treturn f(_n - 1, _k - 1) + 1 + f(_n - 1, _k - hc)\n\tend\nend\nprint(f(n, k))", "language": "Lua", "metadata": {"date": 1548983164, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s311212853.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s311212853", "user_id": "u200201528"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local n = io.read(\"n\")\nlocal k = io.read(\"n\")\n--local n, k = 50, 4321098765432109\nlocal g = {[0] = {1, 1}}\nfor i = 1, n do\n\tlocal c0 = g[i - 1][1]\n\tlocal p0 = g[i - 1][2]\n\tlocal c = c0 * 2 + 3\n\tlocal p = p0 * 2 + 1\n\tg[i] = {c, p}\nend\nlocal function f(_n, _k)\n\tif _k <= 0 then\n\t\treturn 0\n\tend\n\tif _n <= 0 then\n\t\treturn 1\n\tend\n\tlocal c = g[_n][1]\n\tlocal hc = (g[_n][1] + 1) // 2\n\tif _k >= c then\n\t\treturn g[_n][2]\n\telseif _k == hc then\n\t\treturn f(_n - 1, _k - 2) + 1\n\telseif _k < hc then\n\t\treturn f(_n - 1, _k - 1)\n\telse\n\t\treturn f(_n - 1, _k - 1) + 1 + f(_n - 1, _k - hc)\n\tend\nend\nprint(f(n, k))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Lua:s117424622", "group_id": "codeNet:p03210", "input_text": "X=io.read(\"n\")\nif X==3 or X==5 or X==7 then\n print(\"YES\")\n else \n print(\"NO\")\nend\n", "language": "Lua", "metadata": {"date": 1550015500, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03210.html", "problem_id": "p03210", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03210/input.txt", "sample_output_relpath": "derived/input_output/data/p03210/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03210/Lua/s117424622.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s117424622", "user_id": "u015229643"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "X=io.read(\"n\")\nif X==3 or X==5 or X==7 then\n print(\"YES\")\n else \n print(\"NO\")\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nShichi-Go-San (literally \"Seven-Five-Three\") is a traditional event in a certain country to celebrate the growth of seven-, five- and three-year-old children.\n\nTakahashi is now X years old. Will his growth be celebrated in Shichi-Go-San this time?\n\nConstraints\n\n1 ≤ X ≤ 9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf Takahashi's growth will be celebrated, print YES; if it will not, print NO.\n\nSample Input 1\n\n5\n\nSample Output 1\n\nYES\n\nThe growth of a five-year-old child will be celebrated.\n\nSample Input 2\n\n6\n\nSample Output 2\n\nNO\n\nSee you next year.", "sample_input": "5\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03210", "source_text": "Score : 100 points\n\nProblem Statement\n\nShichi-Go-San (literally \"Seven-Five-Three\") is a traditional event in a certain country to celebrate the growth of seven-, five- and three-year-old children.\n\nTakahashi is now X years old. Will his growth be celebrated in Shichi-Go-San this time?\n\nConstraints\n\n1 ≤ X ≤ 9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf Takahashi's growth will be celebrated, print YES; if it will not, print NO.\n\nSample Input 1\n\n5\n\nSample Output 1\n\nYES\n\nThe growth of a five-year-old child will be celebrated.\n\nSample Input 2\n\n6\n\nSample Output 2\n\nNO\n\nSee you next year.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s334870042", "group_id": "codeNet:p03210", "input_text": "print(({nil,nil,\"YES\",nil,\"YES\",nil,\"YES\"})[io.read(\"n\")] or \"NO\")", "language": "Lua", "metadata": {"date": 1544033375, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03210.html", "problem_id": "p03210", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03210/input.txt", "sample_output_relpath": "derived/input_output/data/p03210/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03210/Lua/s334870042.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s334870042", "user_id": "u196363050"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "print(({nil,nil,\"YES\",nil,\"YES\",nil,\"YES\"})[io.read(\"n\")] or \"NO\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nShichi-Go-San (literally \"Seven-Five-Three\") is a traditional event in a certain country to celebrate the growth of seven-, five- and three-year-old children.\n\nTakahashi is now X years old. Will his growth be celebrated in Shichi-Go-San this time?\n\nConstraints\n\n1 ≤ X ≤ 9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf Takahashi's growth will be celebrated, print YES; if it will not, print NO.\n\nSample Input 1\n\n5\n\nSample Output 1\n\nYES\n\nThe growth of a five-year-old child will be celebrated.\n\nSample Input 2\n\n6\n\nSample Output 2\n\nNO\n\nSee you next year.", "sample_input": "5\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03210", "source_text": "Score : 100 points\n\nProblem Statement\n\nShichi-Go-San (literally \"Seven-Five-Three\") is a traditional event in a certain country to celebrate the growth of seven-, five- and three-year-old children.\n\nTakahashi is now X years old. Will his growth be celebrated in Shichi-Go-San this time?\n\nConstraints\n\n1 ≤ X ≤ 9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf Takahashi's growth will be celebrated, print YES; if it will not, print NO.\n\nSample Input 1\n\n5\n\nSample Output 1\n\nYES\n\nThe growth of a five-year-old child will be celebrated.\n\nSample Input 2\n\n6\n\nSample Output 2\n\nNO\n\nSee you next year.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 66, "cpu_time_ms": 7, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s469385035", "group_id": "codeNet:p03212", "input_text": "local n=io.read(\"n\")\nlocal t={3,5,7}\nlocal i=1\nwhile t[#t]<=n do\n for j=3,7,2 do\n t[#t+1]=t[i]*10+j\n end\n i=i+1\nend\nlocal counter=0\nfor i=1,#t do\n local three=false\n local five=false\n local seven=false\n local copy=t[i]\n while copy>0 do\n if copy%10==3 then three=true\n elseif copy%10==5 then five=true\n elseif copy%10==7 then seven=true\n end\n copy=math.floor(copy/10)\n end\n if three and five and seven and t[i]<=n then\n counter=counter+1\n end\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1593649309, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s469385035.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s469385035", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal t={3,5,7}\nlocal i=1\nwhile t[#t]<=n do\n for j=3,7,2 do\n t[#t+1]=t[i]*10+j\n end\n i=i+1\nend\nlocal counter=0\nfor i=1,#t do\n local three=false\n local five=false\n local seven=false\n local copy=t[i]\n while copy>0 do\n if copy%10==3 then three=true\n elseif copy%10==5 then five=true\n elseif copy%10==7 then seven=true\n end\n copy=math.floor(copy/10)\n end\n if three and five and seven and t[i]<=n then\n counter=counter+1\n end\nend\nprint(counter)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 542, "cpu_time_ms": 16, "memory_kb": 2920}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s679486093", "group_id": "codeNet:p03212", "input_text": "local n = io.read(\"n\")\n-- local n = 3600\nlocal total = 0\nlocal value_stack = {0}\nlocal mark_stack = {0}\nwhile true do\n\tlocal len = #value_stack\n\tlocal value = value_stack[len]\n\tlocal mark = mark_stack[len]\n\tif not value then\n\t\tbreak\n\tend\n\ttable.remove(value_stack, len)\n\ttable.remove(mark_stack, len)\n\tif value <= n then\n\t\tif mark == 7 then\n\t\t\ttotal = total + 1\n\t\tend\n\t\ttable.insert(value_stack, value * 10 + 3)\n\t\ttable.insert(mark_stack, mark | 1)\n\t\ttable.insert(value_stack, value * 10 + 5)\n\t\ttable.insert(mark_stack, mark | 2)\n\t\ttable.insert(value_stack, value * 10 + 7)\n\t\ttable.insert(mark_stack, mark | 4)\n\tend\nend\nprint(total)", "language": "Lua", "metadata": {"date": 1550350982, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s679486093.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s679486093", "user_id": "u200201528"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local n = io.read(\"n\")\n-- local n = 3600\nlocal total = 0\nlocal value_stack = {0}\nlocal mark_stack = {0}\nwhile true do\n\tlocal len = #value_stack\n\tlocal value = value_stack[len]\n\tlocal mark = mark_stack[len]\n\tif not value then\n\t\tbreak\n\tend\n\ttable.remove(value_stack, len)\n\ttable.remove(mark_stack, len)\n\tif value <= n then\n\t\tif mark == 7 then\n\t\t\ttotal = total + 1\n\t\tend\n\t\ttable.insert(value_stack, value * 10 + 3)\n\t\ttable.insert(mark_stack, mark | 1)\n\t\ttable.insert(value_stack, value * 10 + 5)\n\t\ttable.insert(mark_stack, mark | 2)\n\t\ttable.insert(value_stack, value * 10 + 7)\n\t\ttable.insert(mark_stack, mark | 4)\n\tend\nend\nprint(total)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 632, "cpu_time_ms": 56, "memory_kb": 504}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s565983374", "group_id": "codeNet:p03212", "input_text": "local n = io.read(\"n\")\n-- local n = 999999999\nlocal total = 0\nlocal stack = {{0,0}}\nwhile true do\n\tlocal len = #stack\n\tlocal one = stack[len]\n\tif not one then\n\t\tbreak\n\tend\n\tlocal value, mark = one[1], one[2]\n\ttable.remove(stack, len)\n\tif value <= n then\n\t\tif mark == 7 then\n\t\t\ttotal = total + 1\n\t\tend\n\t\ttable.insert(stack, {value * 10 + 3, mark | 1})\n\t\ttable.insert(stack, {value * 10 + 5, mark | 2})\n\t\ttable.insert(stack, {value * 10 + 7, mark | 4})\n\tend\nend\nprint(total)", "language": "Lua", "metadata": {"date": 1550350570, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s565983374.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s565983374", "user_id": "u200201528"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local n = io.read(\"n\")\n-- local n = 999999999\nlocal total = 0\nlocal stack = {{0,0}}\nwhile true do\n\tlocal len = #stack\n\tlocal one = stack[len]\n\tif not one then\n\t\tbreak\n\tend\n\tlocal value, mark = one[1], one[2]\n\ttable.remove(stack, len)\n\tif value <= n then\n\t\tif mark == 7 then\n\t\t\ttotal = total + 1\n\t\tend\n\t\ttable.insert(stack, {value * 10 + 3, mark | 1})\n\t\ttable.insert(stack, {value * 10 + 5, mark | 2})\n\t\ttable.insert(stack, {value * 10 + 7, mark | 4})\n\tend\nend\nprint(total)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 48, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s467656239", "group_id": "codeNet:p03213", "input_text": "local mfl, mce, msq = math.floor, math.ceil, math.sqrt\nlocal n = io.read(\"*n\")\n\nlocal function getprimes(x)\n local primes = {}\n local allnums = {}\n for i = 1, x do allnums[i] = true end\n for i = 2, x do\n if(allnums[i]) then\n table.insert(primes, i)\n local lim = mfl(x / i)\n for j = 2, lim do\n allnums[j * i] = false\n end\n end\n end\n return primes\nend\n\nlocal primes = getprimes(47)\nlocal t = {}\nfor i = 1, 47 do\n t[i] = 0\nend\nfor i = 1, #primes do\n local p = primes[i]\n local ctot = 0\n local c = mfl(n / p)\n while 0 < c do\n ctot = ctot + c\n c = mfl(c / p)\n end\n t[p] = ctot\nend\n\nlocal ov74, ov24, ov14, ov4, ov2 = 0, 0, 0, 0, 0\nfor i = 1, 47 do\n if 74 <= t[i] then ov74 = ov74 + 1 end\n if 24 <= t[i] then ov24 = ov24 + 1 end\n if 14 <= t[i] then ov14 = ov14 + 1 end\n if 4 <= t[i] then ov4 = ov4 + 1 end\n if 2 <= t[i] then ov2 = ov2 + 1 end\nend\nlocal ret = ov74 + ov24 * (ov2 - 1) + ov14 * (ov4 - 1) + mfl(ov4 * (ov4 - 1) / 2) * (ov2 - 2)\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1559413758, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s467656239.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s467656239", "user_id": "u120582723"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "local mfl, mce, msq = math.floor, math.ceil, math.sqrt\nlocal n = io.read(\"*n\")\n\nlocal function getprimes(x)\n local primes = {}\n local allnums = {}\n for i = 1, x do allnums[i] = true end\n for i = 2, x do\n if(allnums[i]) then\n table.insert(primes, i)\n local lim = mfl(x / i)\n for j = 2, lim do\n allnums[j * i] = false\n end\n end\n end\n return primes\nend\n\nlocal primes = getprimes(47)\nlocal t = {}\nfor i = 1, 47 do\n t[i] = 0\nend\nfor i = 1, #primes do\n local p = primes[i]\n local ctot = 0\n local c = mfl(n / p)\n while 0 < c do\n ctot = ctot + c\n c = mfl(c / p)\n end\n t[p] = ctot\nend\n\nlocal ov74, ov24, ov14, ov4, ov2 = 0, 0, 0, 0, 0\nfor i = 1, 47 do\n if 74 <= t[i] then ov74 = ov74 + 1 end\n if 24 <= t[i] then ov24 = ov24 + 1 end\n if 14 <= t[i] then ov14 = ov14 + 1 end\n if 4 <= t[i] then ov4 = ov4 + 1 end\n if 2 <= t[i] then ov2 = ov2 + 1 end\nend\nlocal ret = ov74 + ov24 * (ov2 - 1) + ov14 * (ov4 - 1) + mfl(ov4 * (ov4 - 1) / 2) * (ov2 - 2)\nprint(ret)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given an integer N. Among the divisors of N! (= 1 \\times 2 \\times ... \\times N), how many Shichi-Go numbers (literally \"Seven-Five numbers\") are there?\n\nHere, a Shichi-Go number is a positive integer that has exactly 75 divisors.\n\nNote\n\nWhen a positive integer A divides a positive integer B, A is said to a divisor of B.\nFor example, 6 has four divisors: 1, 2, 3 and 6.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of the Shichi-Go numbers that are divisors of N!.\n\nSample Input 1\n\n9\n\nSample Output 1\n\n0\n\nThere are no Shichi-Go numbers among the divisors of 9! = 1 \\times 2 \\times ... \\times 9 = 362880.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1\n\nThere is one Shichi-Go number among the divisors of 10! = 3628800: 32400.\n\nSample Input 3\n\n100\n\nSample Output 3\n\n543", "sample_input": "9\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03213", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given an integer N. Among the divisors of N! (= 1 \\times 2 \\times ... \\times N), how many Shichi-Go numbers (literally \"Seven-Five numbers\") are there?\n\nHere, a Shichi-Go number is a positive integer that has exactly 75 divisors.\n\nNote\n\nWhen a positive integer A divides a positive integer B, A is said to a divisor of B.\nFor example, 6 has four divisors: 1, 2, 3 and 6.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of the Shichi-Go numbers that are divisors of N!.\n\nSample Input 1\n\n9\n\nSample Output 1\n\n0\n\nThere are no Shichi-Go numbers among the divisors of 9! = 1 \\times 2 \\times ... \\times 9 = 362880.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1\n\nThere is one Shichi-Go number among the divisors of 10! = 3628800: 32400.\n\nSample Input 3\n\n100\n\nSample Output 3\n\n543", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1003, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s899482593", "group_id": "codeNet:p03216", "input_text": "local mfl = math.floor\n\nlocal function comp(a, b)\n return a < b\nend\n\nlocal function lower_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if not comp(ary[1], x) then return 1 end\n if comp(ary[num], x) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if comp(ary[mid], x) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal m_cnt = {}\nlocal d_pos = {}\nlocal c_pos = {}\nlocal ss = \"\"\nlocal mc = 0LL\nfor i = 1, n do\n ss = s:sub(i, i)\n if ss == \"D\" then\n table.insert(d_pos, i)\n elseif ss == \"C\" then\n table.insert(c_pos, i)\n elseif ss == \"M\" then\n mc = mc + 1LL\n end\n m_cnt[i] = mc\nend\nlocal m_sum_per_c = {}\nfor i = 1, #c_pos do\n local ic = c_pos[i]\n if i == 1 then\n m_sum_per_c[i] = m_cnt[ic]\n else\n m_sum_per_c[i] = m_sum_per_c[i - 1] + m_cnt[ic]\n end\nend\n\nlocal function llprint(llnumber)\n local str = tostring(llnumber):gsub(\"LL\", \"\")\n print(str)\nend\n\nlocal c_froms = {}\nfor id = 1, #d_pos do\n c_froms[id] = lower_bound(c_pos, d_pos[id])\nend\nlocal q = io.read(\"*n\")\nfor i = 1, q do\n local k = io.read(\"*n\")\n local ret = 0LL\n for id = 1, #d_pos do\n local dp = d_pos[id]\n local c_from = c_froms[id]\n local c_to = lower_bound(c_pos, dp + k) - 1\n if 1 <= c_to then\n ret = ret + m_sum_per_c[c_to] - (c_to - c_from + 1) * m_cnt[dp]\n if 1 < c_from then\n ret = ret - m_sum_per_c[c_from - 1]\n end\n end\n end\n llprint(ret)\nend\n", "language": "Lua", "metadata": {"date": 1571458425, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03216.html", "problem_id": "p03216", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03216/input.txt", "sample_output_relpath": "derived/input_output/data/p03216/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03216/Lua/s899482593.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s899482593", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local mfl = math.floor\n\nlocal function comp(a, b)\n return a < b\nend\n\nlocal function lower_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if not comp(ary[1], x) then return 1 end\n if comp(ary[num], x) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if comp(ary[mid], x) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal m_cnt = {}\nlocal d_pos = {}\nlocal c_pos = {}\nlocal ss = \"\"\nlocal mc = 0LL\nfor i = 1, n do\n ss = s:sub(i, i)\n if ss == \"D\" then\n table.insert(d_pos, i)\n elseif ss == \"C\" then\n table.insert(c_pos, i)\n elseif ss == \"M\" then\n mc = mc + 1LL\n end\n m_cnt[i] = mc\nend\nlocal m_sum_per_c = {}\nfor i = 1, #c_pos do\n local ic = c_pos[i]\n if i == 1 then\n m_sum_per_c[i] = m_cnt[ic]\n else\n m_sum_per_c[i] = m_sum_per_c[i - 1] + m_cnt[ic]\n end\nend\n\nlocal function llprint(llnumber)\n local str = tostring(llnumber):gsub(\"LL\", \"\")\n print(str)\nend\n\nlocal c_froms = {}\nfor id = 1, #d_pos do\n c_froms[id] = lower_bound(c_pos, d_pos[id])\nend\nlocal q = io.read(\"*n\")\nfor i = 1, q do\n local k = io.read(\"*n\")\n local ret = 0LL\n for id = 1, #d_pos do\n local dp = d_pos[id]\n local c_from = c_froms[id]\n local c_to = lower_bound(c_pos, dp + k) - 1\n if 1 <= c_to then\n ret = ret + m_sum_per_c[c_to] - (c_to - c_from + 1) * m_cnt[dp]\n if 1 < c_from then\n ret = ret - m_sum_per_c[c_from - 1]\n end\n end\n end\n llprint(ret)\nend\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nIn Dwango Co., Ltd., there is a content distribution system named 'Dwango Media Cluster', and it is called 'DMC' for short.\n\nThe name 'DMC' sounds cool for Niwango-kun, so he starts to define DMC-ness of a string.\n\nGiven a string S of length N and an integer k (k \\geq 3),\nhe defines the k-DMC number of S as the number of triples (a, b, c) of integers that satisfy the following conditions:\n\n0 \\leq a < b < c \\leq N - 1\n\nS[a] = D\n\nS[b] = M\n\nS[c] = C\n\nc-a < k\n\nHere S[a] is the a-th character of the string S. Indexing is zero-based, that is, 0 \\leq a \\leq N - 1 holds.\n\nFor a string S and Q integers k_0, k_1, ..., k_{Q-1}, calculate the k_i-DMC number of S for each i (0 \\leq i \\leq Q-1).\n\nConstraints\n\n3 \\leq N \\leq 10^6\n\nS consists of uppercase English letters\n\n1 \\leq Q \\leq 75\n\n3 \\leq k_i \\leq N\n\nAll numbers given in input are integers\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\nQ\nk_{0} k_{1} ... k_{Q-1}\n\nOutput\n\nPrint Q lines.\nThe i-th line should contain the k_i-DMC number of the string S.\n\nSample Input 1\n\n18\nDWANGOMEDIACLUSTER\n1\n18\n\nSample Output 1\n\n1\n\n(a,b,c) = (0, 6, 11) satisfies the conditions.\n\nStrangely, Dwango Media Cluster does not have so much DMC-ness by his definition.\n\nSample Input 2\n\n18\nDDDDDDMMMMMCCCCCCC\n1\n18\n\nSample Output 2\n\n210\n\nThe number of triples can be calculated as 6\\times 5\\times 7.\n\nSample Input 3\n\n54\nDIALUPWIDEAREANETWORKGAMINGOPERATIONCORPORATIONLIMITED\n3\n20 30 40\n\nSample Output 3\n\n0\n1\n2\n\n(a, b, c) = (0, 23, 36), (8, 23, 36) satisfy the conditions except the last one, namely, c-a < k_i.\n\nBy the way, DWANGO is an acronym for \"Dial-up Wide Area Network Gaming Operation\".\n\nSample Output 4\n\n30\nDMCDMCDMCDMCDMCDMCDMCDMCDMCDMC\n4\n5 10 15 20\n\nSample Output 4\n\n10\n52\n110\n140", "sample_input": "18\nDWANGOMEDIACLUSTER\n1\n18\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03216", "source_text": "Score : 600 points\n\nProblem Statement\n\nIn Dwango Co., Ltd., there is a content distribution system named 'Dwango Media Cluster', and it is called 'DMC' for short.\n\nThe name 'DMC' sounds cool for Niwango-kun, so he starts to define DMC-ness of a string.\n\nGiven a string S of length N and an integer k (k \\geq 3),\nhe defines the k-DMC number of S as the number of triples (a, b, c) of integers that satisfy the following conditions:\n\n0 \\leq a < b < c \\leq N - 1\n\nS[a] = D\n\nS[b] = M\n\nS[c] = C\n\nc-a < k\n\nHere S[a] is the a-th character of the string S. Indexing is zero-based, that is, 0 \\leq a \\leq N - 1 holds.\n\nFor a string S and Q integers k_0, k_1, ..., k_{Q-1}, calculate the k_i-DMC number of S for each i (0 \\leq i \\leq Q-1).\n\nConstraints\n\n3 \\leq N \\leq 10^6\n\nS consists of uppercase English letters\n\n1 \\leq Q \\leq 75\n\n3 \\leq k_i \\leq N\n\nAll numbers given in input are integers\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\nQ\nk_{0} k_{1} ... k_{Q-1}\n\nOutput\n\nPrint Q lines.\nThe i-th line should contain the k_i-DMC number of the string S.\n\nSample Input 1\n\n18\nDWANGOMEDIACLUSTER\n1\n18\n\nSample Output 1\n\n1\n\n(a,b,c) = (0, 6, 11) satisfies the conditions.\n\nStrangely, Dwango Media Cluster does not have so much DMC-ness by his definition.\n\nSample Input 2\n\n18\nDDDDDDMMMMMCCCCCCC\n1\n18\n\nSample Output 2\n\n210\n\nThe number of triples can be calculated as 6\\times 5\\times 7.\n\nSample Input 3\n\n54\nDIALUPWIDEAREANETWORKGAMINGOPERATIONCORPORATIONLIMITED\n3\n20 30 40\n\nSample Output 3\n\n0\n1\n2\n\n(a, b, c) = (0, 23, 36), (8, 23, 36) satisfy the conditions except the last one, namely, c-a < k_i.\n\nBy the way, DWANGO is an acronym for \"Dial-up Wide Area Network Gaming Operation\".\n\nSample Output 4\n\n30\nDMCDMCDMCDMCDMCDMCDMCDMCDMCDMC\n4\n5 10 15 20\n\nSample Output 4\n\n10\n52\n110\n140", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1558, "cpu_time_ms": 2662, "memory_kb": 122200}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s227402414", "group_id": "codeNet:p03219", "input_text": "X=io.read(\"n\")\nY=io.read(\"n\")\nprint(X+Y/2)", "language": "Lua", "metadata": {"date": 1550090926, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03219.html", "problem_id": "p03219", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03219/input.txt", "sample_output_relpath": "derived/input_output/data/p03219/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03219/Lua/s227402414.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s227402414", "user_id": "u015229643"}, "prompt_components": {"gold_output": "110\n", "input_to_evaluate": "X=io.read(\"n\")\nY=io.read(\"n\")\nprint(X+Y/2)", "problem_context": "Score: 100 points\n\nProblem Statement\n\nThere is a train going from Station A to Station B that costs X yen (the currency of Japan).\n\nAlso, there is a bus going from Station B to Station C that costs Y yen.\n\nJoisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.\n\nHow much does it cost to travel from Station A to Station C if she uses this ticket?\n\nConstraints\n\n1 \\leq X,Y \\leq 100\n\nY is an even number.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf it costs x yen to travel from Station A to Station C, print x.\n\nSample Input 1\n\n81 58\n\nSample Output 1\n\n110\n\nThe train fare is 81 yen.\n\nThe train fare is 58 ⁄ 2=29 yen with the 50% discount.\n\nThus, it costs 110 yen to travel from Station A to Station C.\n\nSample Input 2\n\n4 54\n\nSample Output 2\n\n31", "sample_input": "81 58\n"}, "reference_outputs": ["110\n"], "source_document_id": "p03219", "source_text": "Score: 100 points\n\nProblem Statement\n\nThere is a train going from Station A to Station B that costs X yen (the currency of Japan).\n\nAlso, there is a bus going from Station B to Station C that costs Y yen.\n\nJoisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.\n\nHow much does it cost to travel from Station A to Station C if she uses this ticket?\n\nConstraints\n\n1 \\leq X,Y \\leq 100\n\nY is an even number.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf it costs x yen to travel from Station A to Station C, print x.\n\nSample Input 1\n\n81 58\n\nSample Output 1\n\n110\n\nThe train fare is 81 yen.\n\nThe train fare is 58 ⁄ 2=29 yen with the 50% discount.\n\nThus, it costs 110 yen to travel from Station A to Station C.\n\nSample Input 2\n\n4 54\n\nSample Output 2\n\n31", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 42, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s450027365", "group_id": "codeNet:p03220", "input_text": "local n = tonumber(io.read())\nlocal inp = io.read()\nlocal T,a\nfor i=1,string.len(inp),1 do\n if inp:sub(i,i)==' ' then\n T = tonumber(inp:sub(1,i-1))\n a = tonumber(inp:sub(i+1,string.len(inp)))\n end\nend\nlocal hline = io.read()\nh={}\nstring.gsub(hline,\"(%S+)\", function (v) table.insert(h,tonumber(v)) end)\nt={}\nfor i=1,n,1 do\n t[i]=T-0.006*h[i]\nend\nres = 1\nti = t[1]\nfor i=1,n,1 do\n if math.abs(a-ti)>math.abs(a-t[i]) then\n res = i\n ti = t[i]\n end\nend\nprint(res)", "language": "Lua", "metadata": {"date": 1544409807, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03220.html", "problem_id": "p03220", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03220/input.txt", "sample_output_relpath": "derived/input_output/data/p03220/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03220/Lua/s450027365.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s450027365", "user_id": "u030685402"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local n = tonumber(io.read())\nlocal inp = io.read()\nlocal T,a\nfor i=1,string.len(inp),1 do\n if inp:sub(i,i)==' ' then\n T = tonumber(inp:sub(1,i-1))\n a = tonumber(inp:sub(i+1,string.len(inp)))\n end\nend\nlocal hline = io.read()\nh={}\nstring.gsub(hline,\"(%S+)\", function (v) table.insert(h,tonumber(v)) end)\nt={}\nfor i=1,n,1 do\n t[i]=T-0.006*h[i]\nend\nres = 1\nti = t[1]\nfor i=1,n,1 do\n if math.abs(a-ti)>math.abs(a-t[i]) then\n res = i\n ti = t[i]\n end\nend\nprint(res)", "problem_context": "Score: 200 points\n\nProblem Statement\n\nA country decides to build a palace.\n\nIn this country, the average temperature of a point at an elevation of x meters is T-x \\times 0.006 degrees Celsius.\n\nThere are N places proposed for the place. The elevation of Place i is H_i meters.\n\nAmong them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there.\n\nPrint the index of the place where the palace should be built.\n\nIt is guaranteed that the solution is unique.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\n0 \\leq T \\leq 50\n\n-60 \\leq A \\leq T\n\n0 \\leq H_i \\leq 10^5\n\nAll values in input are integers.\n\nThe solution is unique.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nT A\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the index of the place where the palace should be built.\n\nSample Input 1\n\n2\n12 5\n1000 2000\n\nSample Output 1\n\n1\n\nThe average temperature of Place 1 is 12-1000 \\times 0.006=6 degrees Celsius.\n\nThe average temperature of Place 2 is 12-2000 \\times 0.006=0 degrees Celsius.\n\nThus, the palace should be built at Place 1.\n\nSample Input 2\n\n3\n21 -11\n81234 94124 52141\n\nSample Output 2\n\n3", "sample_input": "2\n12 5\n1000 2000\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03220", "source_text": "Score: 200 points\n\nProblem Statement\n\nA country decides to build a palace.\n\nIn this country, the average temperature of a point at an elevation of x meters is T-x \\times 0.006 degrees Celsius.\n\nThere are N places proposed for the place. The elevation of Place i is H_i meters.\n\nAmong them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there.\n\nPrint the index of the place where the palace should be built.\n\nIt is guaranteed that the solution is unique.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\n0 \\leq T \\leq 50\n\n-60 \\leq A \\leq T\n\n0 \\leq H_i \\leq 10^5\n\nAll values in input are integers.\n\nThe solution is unique.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nT A\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the index of the place where the palace should be built.\n\nSample Input 1\n\n2\n12 5\n1000 2000\n\nSample Output 1\n\n1\n\nThe average temperature of Place 1 is 12-1000 \\times 0.006=6 degrees Celsius.\n\nThe average temperature of Place 2 is 12-2000 \\times 0.006=0 degrees Celsius.\n\nThus, the palace should be built at Place 1.\n\nSample Input 2\n\n3\n21 -11\n81234 94124 52141\n\nSample Output 2\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 376}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s027691417", "group_id": "codeNet:p03222", "input_text": "local mod = 1000000007\n\nlocal function bmul(x, y) return (x * y) % mod end\nlocal function badd(x, y) return (x + y) % mod end\n\nlocal h, w, k = io.read(\"*n\", \"*n\", \"*n\")\nif w == 1 then\n print(1)\nelse\n local t = {1}\n for i = 2, w do t[i] = 0 end\n local tot = 2^(w - 1)\n local map = {}\n for i = 1, w do\n map[i] = {}\n for j = 1, w do\n map[i][j] = 0\n end\n end\n for it = 0, tot - 1 do\n local valid = true\n local flag = {}\n for i = 1, w - 1 do\n flag[i] = it % 2 == 1\n it = it // 2\n end\n for i = 1, w - 2 do\n if flag[i] and flag[i + 1] then\n valid = false\n end\n end\n if valid then\n for i = 1, w do\n if i == 1 then\n if flag[1] then\n map[1][2] = map[1][2] + 1\n else\n map[1][1] = map[1][1] + 1\n end\n elseif i == w then\n if flag[w - 1] then\n map[w][w - 1] = map[w][w - 1] + 1\n else\n map[w][w] = map[w][w] + 1\n end\n else\n if flag[i] then\n map[i][i + 1] = map[i][i + 1] + 1\n elseif flag[i - 1] then\n map[i][i - 1] = map[i][i - 1] + 1\n else\n map[i][i] = map[i][i] + 1\n end\n end\n end\n end\n end\n for ih = 1, h do\n local nt = {}\n for i = 1, w do nt[i] = 0 end\n for src = 1, w do\n for dst = 1, w do\n nt[dst] = badd(nt[dst], bmul(t[src], map[src][dst]))\n end\n end\n for i = 1, w do t[i] = nt[i] end\n end\n print(t[k])\nend\n", "language": "Lua", "metadata": {"date": 1581892269, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03222.html", "problem_id": "p03222", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03222/input.txt", "sample_output_relpath": "derived/input_output/data/p03222/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03222/Lua/s027691417.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s027691417", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local mod = 1000000007\n\nlocal function bmul(x, y) return (x * y) % mod end\nlocal function badd(x, y) return (x + y) % mod end\n\nlocal h, w, k = io.read(\"*n\", \"*n\", \"*n\")\nif w == 1 then\n print(1)\nelse\n local t = {1}\n for i = 2, w do t[i] = 0 end\n local tot = 2^(w - 1)\n local map = {}\n for i = 1, w do\n map[i] = {}\n for j = 1, w do\n map[i][j] = 0\n end\n end\n for it = 0, tot - 1 do\n local valid = true\n local flag = {}\n for i = 1, w - 1 do\n flag[i] = it % 2 == 1\n it = it // 2\n end\n for i = 1, w - 2 do\n if flag[i] and flag[i + 1] then\n valid = false\n end\n end\n if valid then\n for i = 1, w do\n if i == 1 then\n if flag[1] then\n map[1][2] = map[1][2] + 1\n else\n map[1][1] = map[1][1] + 1\n end\n elseif i == w then\n if flag[w - 1] then\n map[w][w - 1] = map[w][w - 1] + 1\n else\n map[w][w] = map[w][w] + 1\n end\n else\n if flag[i] then\n map[i][i + 1] = map[i][i + 1] + 1\n elseif flag[i - 1] then\n map[i][i - 1] = map[i][i - 1] + 1\n else\n map[i][i] = map[i][i] + 1\n end\n end\n end\n end\n end\n for ih = 1, h do\n local nt = {}\n for i = 1, w do nt[i] = 0 end\n for src = 1, w do\n for dst = 1, w do\n nt[dst] = badd(nt[dst], bmul(t[src], map[src][dst]))\n end\n end\n for i = 1, w do t[i] = nt[i] end\n end\n print(t[k])\nend\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nAmidakuji is a traditional method of lottery in Japan.\n\nTo make an amidakuji, we first draw W parallel vertical lines, and then draw horizontal lines that connect them. The length of each vertical line is H+1 [cm], and the endpoints of the horizontal lines must be at 1, 2, 3, ..., or H [cm] from the top of a vertical line.\n\nA valid amidakuji is an amidakuji that satisfies the following conditions:\n\nNo two horizontal lines share an endpoint.\n\nThe two endpoints of each horizontal lines must be at the same height.\n\nA horizontal line must connect adjacent vertical lines.\n\nFind the number of the valid amidakuji that satisfy the following condition, modulo 1\\ 000\\ 000\\ 007: if we trace the path from the top of the leftmost vertical line to the bottom, always following horizontal lines when we encounter them, we reach the bottom of the K-th vertical line from the left.\n\nFor example, in the following amidakuji, we will reach the bottom of the fourth vertical line from the left.\n\nConstraints\n\nH is an integer between 1 and 100 (inclusive).\n\nW is an integer between 1 and 8 (inclusive).\n\nK is an integer between 1 and W (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\n\nOutput\n\nPrint the number of the amidakuji that satisfy the condition, modulo 1\\ 000\\ 000\\ 007.\n\nSample Input 1\n\n1 3 2\n\nSample Output 1\n\n1\n\nOnly the following one amidakuji satisfies the condition:\n\nSample Input 2\n\n1 3 1\n\nSample Output 2\n\n2\n\nOnly the following two amidakuji satisfy the condition:\n\nSample Input 3\n\n2 3 3\n\nSample Output 3\n\n1\n\nOnly the following one amidakuji satisfies the condition:\n\nSample Input 4\n\n2 3 1\n\nSample Output 4\n\n5\n\nOnly the following five amidakuji satisfy the condition:\n\nSample Input 5\n\n7 1 1\n\nSample Output 5\n\n1\n\nAs there is only one vertical line, we cannot draw any horizontal lines. Thus, there is only one amidakuji that satisfies the condition: the amidakuji with no horizontal lines.\n\nSample Input 6\n\n15 8 5\n\nSample Output 6\n\n437760187\n\nBe sure to print the answer modulo 1\\ 000\\ 000\\ 007.", "sample_input": "1 3 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03222", "source_text": "Score: 400 points\n\nProblem Statement\n\nAmidakuji is a traditional method of lottery in Japan.\n\nTo make an amidakuji, we first draw W parallel vertical lines, and then draw horizontal lines that connect them. The length of each vertical line is H+1 [cm], and the endpoints of the horizontal lines must be at 1, 2, 3, ..., or H [cm] from the top of a vertical line.\n\nA valid amidakuji is an amidakuji that satisfies the following conditions:\n\nNo two horizontal lines share an endpoint.\n\nThe two endpoints of each horizontal lines must be at the same height.\n\nA horizontal line must connect adjacent vertical lines.\n\nFind the number of the valid amidakuji that satisfy the following condition, modulo 1\\ 000\\ 000\\ 007: if we trace the path from the top of the leftmost vertical line to the bottom, always following horizontal lines when we encounter them, we reach the bottom of the K-th vertical line from the left.\n\nFor example, in the following amidakuji, we will reach the bottom of the fourth vertical line from the left.\n\nConstraints\n\nH is an integer between 1 and 100 (inclusive).\n\nW is an integer between 1 and 8 (inclusive).\n\nK is an integer between 1 and W (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\n\nOutput\n\nPrint the number of the amidakuji that satisfy the condition, modulo 1\\ 000\\ 000\\ 007.\n\nSample Input 1\n\n1 3 2\n\nSample Output 1\n\n1\n\nOnly the following one amidakuji satisfies the condition:\n\nSample Input 2\n\n1 3 1\n\nSample Output 2\n\n2\n\nOnly the following two amidakuji satisfy the condition:\n\nSample Input 3\n\n2 3 3\n\nSample Output 3\n\n1\n\nOnly the following one amidakuji satisfies the condition:\n\nSample Input 4\n\n2 3 1\n\nSample Output 4\n\n5\n\nOnly the following five amidakuji satisfy the condition:\n\nSample Input 5\n\n7 1 1\n\nSample Output 5\n\n1\n\nAs there is only one vertical line, we cannot draw any horizontal lines. Thus, there is only one amidakuji that satisfies the condition: the amidakuji with no horizontal lines.\n\nSample Input 6\n\n15 8 5\n\nSample Output 6\n\n437760187\n\nBe sure to print the answer modulo 1\\ 000\\ 000\\ 007.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 880}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s843566931", "group_id": "codeNet:p03222", "input_text": "local mod = 1000000007\nlocal mfl = math.floor\nlocal h, w, K = io.read(\"*n\", \"*n\", \"*n\")\n\nlocal linepat = 1\nfor i = 1, w - 1 do\n linepat = linepat * 2\nend\nlocal linetbl = {}\nfor i = 0, linepat - 1 do\n local lineidx, mul = 0, 1\n local box = {}\n for j = 1, w - 1 do box[j] = false end\n for j = 1, w - 1 do\n if i % 2 == 1 then\n box[j] = true\n lineidx = lineidx + mul\n i = i - 1\n end\n i = i / 2\n mul = mul * 2\n end\n local isok = true\n for j = 1, w - 2 do\n if box[j] and box[j + 1] then isok = false break end\n end\n if isok then table.insert(linetbl, lineidx) end\nend\n-- for i = 1, #linetbl do print(linetbl[i]) end\n\nlocal t, u = {}, {}\nfor i = 1, w do t[i], u[i] = 0, 0 end\nt[1] = 1\nfor i = 1, h do\n for j = 1, w do u[j] = t[j] end\n for j = 2, #linetbl do\n local line_i = linetbl[j]\n local k = 1\n while k <= w - 1 do\n if line_i % 2 == 1 then\n u[k] = (u[k] + t[k + 1]) % mod\n u[k + 1] = (u[k + 1] + t[k]) % mod\n line_i = mfl((line_i - 1) / 4)\n k = k + 2\n if k == w then u[w] = (u[w] + t[w]) % mod end\n else\n u[k] = (u[k] + t[k]) % mod\n if k == w - 1 then u[k + 1] = (u[k + 1] + t[k + 1]) % mod end\n k = k + 1\n line_i = line_i / 2\n end\n end\n end\n for j = 1, w do t[j] = u[j] end\nend\nprint(t[K])\n", "language": "Lua", "metadata": {"date": 1565927600, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03222.html", "problem_id": "p03222", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03222/input.txt", "sample_output_relpath": "derived/input_output/data/p03222/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03222/Lua/s843566931.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s843566931", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local mod = 1000000007\nlocal mfl = math.floor\nlocal h, w, K = io.read(\"*n\", \"*n\", \"*n\")\n\nlocal linepat = 1\nfor i = 1, w - 1 do\n linepat = linepat * 2\nend\nlocal linetbl = {}\nfor i = 0, linepat - 1 do\n local lineidx, mul = 0, 1\n local box = {}\n for j = 1, w - 1 do box[j] = false end\n for j = 1, w - 1 do\n if i % 2 == 1 then\n box[j] = true\n lineidx = lineidx + mul\n i = i - 1\n end\n i = i / 2\n mul = mul * 2\n end\n local isok = true\n for j = 1, w - 2 do\n if box[j] and box[j + 1] then isok = false break end\n end\n if isok then table.insert(linetbl, lineidx) end\nend\n-- for i = 1, #linetbl do print(linetbl[i]) end\n\nlocal t, u = {}, {}\nfor i = 1, w do t[i], u[i] = 0, 0 end\nt[1] = 1\nfor i = 1, h do\n for j = 1, w do u[j] = t[j] end\n for j = 2, #linetbl do\n local line_i = linetbl[j]\n local k = 1\n while k <= w - 1 do\n if line_i % 2 == 1 then\n u[k] = (u[k] + t[k + 1]) % mod\n u[k + 1] = (u[k + 1] + t[k]) % mod\n line_i = mfl((line_i - 1) / 4)\n k = k + 2\n if k == w then u[w] = (u[w] + t[w]) % mod end\n else\n u[k] = (u[k] + t[k]) % mod\n if k == w - 1 then u[k + 1] = (u[k + 1] + t[k + 1]) % mod end\n k = k + 1\n line_i = line_i / 2\n end\n end\n end\n for j = 1, w do t[j] = u[j] end\nend\nprint(t[K])\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nAmidakuji is a traditional method of lottery in Japan.\n\nTo make an amidakuji, we first draw W parallel vertical lines, and then draw horizontal lines that connect them. The length of each vertical line is H+1 [cm], and the endpoints of the horizontal lines must be at 1, 2, 3, ..., or H [cm] from the top of a vertical line.\n\nA valid amidakuji is an amidakuji that satisfies the following conditions:\n\nNo two horizontal lines share an endpoint.\n\nThe two endpoints of each horizontal lines must be at the same height.\n\nA horizontal line must connect adjacent vertical lines.\n\nFind the number of the valid amidakuji that satisfy the following condition, modulo 1\\ 000\\ 000\\ 007: if we trace the path from the top of the leftmost vertical line to the bottom, always following horizontal lines when we encounter them, we reach the bottom of the K-th vertical line from the left.\n\nFor example, in the following amidakuji, we will reach the bottom of the fourth vertical line from the left.\n\nConstraints\n\nH is an integer between 1 and 100 (inclusive).\n\nW is an integer between 1 and 8 (inclusive).\n\nK is an integer between 1 and W (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\n\nOutput\n\nPrint the number of the amidakuji that satisfy the condition, modulo 1\\ 000\\ 000\\ 007.\n\nSample Input 1\n\n1 3 2\n\nSample Output 1\n\n1\n\nOnly the following one amidakuji satisfies the condition:\n\nSample Input 2\n\n1 3 1\n\nSample Output 2\n\n2\n\nOnly the following two amidakuji satisfy the condition:\n\nSample Input 3\n\n2 3 3\n\nSample Output 3\n\n1\n\nOnly the following one amidakuji satisfies the condition:\n\nSample Input 4\n\n2 3 1\n\nSample Output 4\n\n5\n\nOnly the following five amidakuji satisfy the condition:\n\nSample Input 5\n\n7 1 1\n\nSample Output 5\n\n1\n\nAs there is only one vertical line, we cannot draw any horizontal lines. Thus, there is only one amidakuji that satisfies the condition: the amidakuji with no horizontal lines.\n\nSample Input 6\n\n15 8 5\n\nSample Output 6\n\n437760187\n\nBe sure to print the answer modulo 1\\ 000\\ 000\\ 007.", "sample_input": "1 3 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03222", "source_text": "Score: 400 points\n\nProblem Statement\n\nAmidakuji is a traditional method of lottery in Japan.\n\nTo make an amidakuji, we first draw W parallel vertical lines, and then draw horizontal lines that connect them. The length of each vertical line is H+1 [cm], and the endpoints of the horizontal lines must be at 1, 2, 3, ..., or H [cm] from the top of a vertical line.\n\nA valid amidakuji is an amidakuji that satisfies the following conditions:\n\nNo two horizontal lines share an endpoint.\n\nThe two endpoints of each horizontal lines must be at the same height.\n\nA horizontal line must connect adjacent vertical lines.\n\nFind the number of the valid amidakuji that satisfy the following condition, modulo 1\\ 000\\ 000\\ 007: if we trace the path from the top of the leftmost vertical line to the bottom, always following horizontal lines when we encounter them, we reach the bottom of the K-th vertical line from the left.\n\nFor example, in the following amidakuji, we will reach the bottom of the fourth vertical line from the left.\n\nConstraints\n\nH is an integer between 1 and 100 (inclusive).\n\nW is an integer between 1 and 8 (inclusive).\n\nK is an integer between 1 and W (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\n\nOutput\n\nPrint the number of the amidakuji that satisfy the condition, modulo 1\\ 000\\ 000\\ 007.\n\nSample Input 1\n\n1 3 2\n\nSample Output 1\n\n1\n\nOnly the following one amidakuji satisfies the condition:\n\nSample Input 2\n\n1 3 1\n\nSample Output 2\n\n2\n\nOnly the following two amidakuji satisfy the condition:\n\nSample Input 3\n\n2 3 3\n\nSample Output 3\n\n1\n\nOnly the following one amidakuji satisfies the condition:\n\nSample Input 4\n\n2 3 1\n\nSample Output 4\n\n5\n\nOnly the following five amidakuji satisfy the condition:\n\nSample Input 5\n\n7 1 1\n\nSample Output 5\n\n1\n\nAs there is only one vertical line, we cannot draw any horizontal lines. Thus, there is only one amidakuji that satisfies the condition: the amidakuji with no horizontal lines.\n\nSample Input 6\n\n15 8 5\n\nSample Output 6\n\n437760187\n\nBe sure to print the answer modulo 1\\ 000\\ 000\\ 007.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1322, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s700609088", "group_id": "codeNet:p03228", "input_text": "a, b, k = io.read(\"*n\", \"*n\", \"*n\")\nfor i = 1, k do\n if a % 2 == 1 then a = a - 1 end\n a = a // 2\n b = b + a\n if b % 2 == 1 then b = b - 1 end\n b = b // 2\n a = a + b\nend\nprint(a .. \" \" .. b)\n", "language": "Lua", "metadata": {"date": 1594699505, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03228.html", "problem_id": "p03228", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03228/input.txt", "sample_output_relpath": "derived/input_output/data/p03228/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03228/Lua/s700609088.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s700609088", "user_id": "u120582723"}, "prompt_components": {"gold_output": "5 3\n", "input_to_evaluate": "a, b, k = io.read(\"*n\", \"*n\", \"*n\")\nfor i = 1, k do\n if a % 2 == 1 then a = a - 1 end\n a = a // 2\n b = b + a\n if b % 2 == 1 then b = b - 1 end\n b = b // 2\n a = a + b\nend\nprint(a .. \" \" .. b)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn the beginning, Takahashi has A cookies, and Aoki has B cookies.\nThey will perform the following operation alternately, starting from Takahashi:\n\nIf the number of cookies in his hand is odd, eat one of those cookies; if the number is even, do nothing. Then, give one-half of the cookies in his hand to the other person.\n\nFind the numbers of cookies Takahashi and Aoki respectively have after performing K operations in total.\n\nConstraints\n\n1 \\leq A,B \\leq 10^9\n\n1 \\leq K \\leq 100\n\nA,B and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the number of cookies Takahashi has, and the number of cookies Aoki has, in this order, after performing K operations in total.\n\nSample Input 1\n\n5 4 2\n\nSample Output 1\n\n5 3\n\nThe process will go as follows:\n\nIn the beginning, Takahashi and Aoki have 5 and 4 cookies, respectively.\n\nTakahashi eats one cookie and gives two cookies to Aoki. They now have 2 and 6 cookies, respectively.\n\nAoki gives three cookies to Takahashi. They now have 5 and 3 cookies, respectively.\n\nSample Input 2\n\n3 3 3\n\nSample Output 2\n\n1 3\n\nSample Input 3\n\n314159265 358979323 84\n\nSample Output 3\n\n448759046 224379523", "sample_input": "5 4 2\n"}, "reference_outputs": ["5 3\n"], "source_document_id": "p03228", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn the beginning, Takahashi has A cookies, and Aoki has B cookies.\nThey will perform the following operation alternately, starting from Takahashi:\n\nIf the number of cookies in his hand is odd, eat one of those cookies; if the number is even, do nothing. Then, give one-half of the cookies in his hand to the other person.\n\nFind the numbers of cookies Takahashi and Aoki respectively have after performing K operations in total.\n\nConstraints\n\n1 \\leq A,B \\leq 10^9\n\n1 \\leq K \\leq 100\n\nA,B and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the number of cookies Takahashi has, and the number of cookies Aoki has, in this order, after performing K operations in total.\n\nSample Input 1\n\n5 4 2\n\nSample Output 1\n\n5 3\n\nThe process will go as follows:\n\nIn the beginning, Takahashi and Aoki have 5 and 4 cookies, respectively.\n\nTakahashi eats one cookie and gives two cookies to Aoki. They now have 2 and 6 cookies, respectively.\n\nAoki gives three cookies to Takahashi. They now have 5 and 3 cookies, respectively.\n\nSample Input 2\n\n3 3 3\n\nSample Output 2\n\n1 3\n\nSample Input 3\n\n314159265 358979323 84\n\nSample Output 3\n\n448759046 224379523", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 2756}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s601346899", "group_id": "codeNet:p03230", "input_text": "local n = io.read(\"*n\")\nlocal a = 0\nfor i = 1, 1000 do\n if i * (i + 1) == n * 2 then\n a = i\n break\n end\nend\nif a == 0 then\n print(\"No\")\nelse\n print(\"Yes\")\n print(a + 1)\n local t = {}\n for i = 1, a + 1 do\n t[i] = {}\n for j = 1, a do t[i][j] = 0 end\n end\n local cur = 1\n for i = 1, a do\n for j = i, a do\n t[i][j] = cur + j - i\n t[j + 1][i] = cur + j - i\n end\n cur = cur + a + 1 - i\n end\n for i = 1, a + 1 do\n print(a .. \" \" .. table.concat(t[i], \" \"))\n end\nend\n", "language": "Lua", "metadata": {"date": 1566964616, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s601346899.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s601346899", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n3\n2 1 2\n2 3 1\n2 2 3\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal a = 0\nfor i = 1, 1000 do\n if i * (i + 1) == n * 2 then\n a = i\n break\n end\nend\nif a == 0 then\n print(\"No\")\nelse\n print(\"Yes\")\n print(a + 1)\n local t = {}\n for i = 1, a + 1 do\n t[i] = {}\n for j = 1, a do t[i][j] = 0 end\n end\n local cur = 1\n for i = 1, a do\n for j = i, a do\n t[i][j] = cur + j - i\n t[j + 1][i] = cur + j - i\n end\n cur = cur + a + 1 - i\n end\n for i = 1, a + 1 do\n print(a .. \" \" .. table.concat(t[i], \" \"))\n end\nend\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 506, "cpu_time_ms": 123, "memory_kb": 6896}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s901044575", "group_id": "codeNet:p03231", "input_text": "local function gcd(a,b)\n if b>0 then\n return gcd(b,a%b)\n else\n return a\n end\nend\n\nlocal n,m=io.read(\"*n\",\"*n\",\"*l\")\nlocal s=io.read()\nlocal t=io.read()\n\nlocal l=n*m//gcd(n,m)\nlocal ln=m//gcd(n,m)\nlocal lm=n//gcd(n,m)\n\nlocal x={}\nfor i=1,n do\n x[(i-1)*ln+1]=s:sub(i,i)\nend\n\nfor i=1,m do\n if not x[(i-1)*lm+1] then\n x[(i-1)*lm+1]=t:sub(i,i)\n elseif x[(i-1)*lm+1]~=t:sub(i,i) then\n print(-1)\n return\n end\nend\nprint(l)", "language": "Lua", "metadata": {"date": 1590282812, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s901044575.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s901044575", "user_id": "u045238009"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "local function gcd(a,b)\n if b>0 then\n return gcd(b,a%b)\n else\n return a\n end\nend\n\nlocal n,m=io.read(\"*n\",\"*n\",\"*l\")\nlocal s=io.read()\nlocal t=io.read()\n\nlocal l=n*m//gcd(n,m)\nlocal ln=m//gcd(n,m)\nlocal lm=n//gcd(n,m)\n\nlocal x={}\nfor i=1,n do\n x[(i-1)*ln+1]=s:sub(i,i)\nend\n\nfor i=1,m do\n if not x[(i-1)*lm+1] then\n x[(i-1)*lm+1]=t:sub(i,i)\n elseif x[(i-1)*lm+1]~=t:sub(i,i) then\n print(-1)\n return\n end\nend\nprint(l)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 47, "memory_kb": 12892}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s411465012", "group_id": "codeNet:p03231", "input_text": "function gcd(u, v)\n while v ~= 0 do\n u, v = v, u%v\n end\n return u\nend\n\nfunction lcm(u,v)\n return u * v / gcd(u, v)\nend\n\nN, M = string.match(io.read(), \"(%d) (%d)\")\n\nL = lcm(N,M)\nans = L\n\noS = L/N\noT = L/M\n\nX = {}\np = 1\nfor v = 1, N do\n X[p] = io.read(1)\n p = p + oS\nend\nio.read()\n\np = 1\nfor v = 1, M do\n c = io.read(1)\n if not (X[p] == nil or X[p] == c) then\n ans = -1\n break\n end\n p = p + oT\nend\nio.read()\n\nprint(string.format(\"%d\",ans))\n", "language": "Lua", "metadata": {"date": 1539484793, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s411465012.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s411465012", "user_id": "u374892957"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "function gcd(u, v)\n while v ~= 0 do\n u, v = v, u%v\n end\n return u\nend\n\nfunction lcm(u,v)\n return u * v / gcd(u, v)\nend\n\nN, M = string.match(io.read(), \"(%d) (%d)\")\n\nL = lcm(N,M)\nans = L\n\noS = L/N\noT = L/M\n\nX = {}\np = 1\nfor v = 1, N do\n X[p] = io.read(1)\n p = p + oS\nend\nio.read()\n\np = 1\nfor v = 1, M do\n c = io.read(1)\n if not (X[p] == nil or X[p] == c) then\n ans = -1\n break\n end\n p = p + oT\nend\nio.read()\n\nprint(string.format(\"%d\",ans))\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 458, "cpu_time_ms": 10, "memory_kb": 1008}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s650954818", "group_id": "codeNet:p03238", "input_text": "local n = io.read(\"n\")\nif n==1 then\n print('Hello World')\nelse\n local A, B = io.read(\"n\", \"n\")\n print(A+B)\nend", "language": "Lua", "metadata": {"date": 1565542091, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03238.html", "problem_id": "p03238", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03238/input.txt", "sample_output_relpath": "derived/input_output/data/p03238/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03238/Lua/s650954818.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s650954818", "user_id": "u162773977"}, "prompt_components": {"gold_output": "Hello World\n", "input_to_evaluate": "local n = io.read(\"n\")\nif n==1 then\n print('Hello World')\nelse\n local A, B = io.read(\"n\", \"n\")\n print(A+B)\nend", "problem_context": "Score: 100 points\n\nProblem Statement\n\nIn 2020, AtCoder Inc. with an annual sales of more than one billion yen (the currency of Japan) has started a business in programming education.\n\nOne day, there was an exam where a one-year-old child must write a program that prints Hello World, and a two-year-old child must write a program that receives integers A, B and prints A+B.\n\nTakahashi, who is taking this exam, suddenly forgets his age.\n\nHe decides to write a program that first receives his age N (1 or 2) as input, then prints Hello World if N=1, and additionally receives integers A, B and prints A+B if N=2.\n\nWrite this program for him.\n\nConstraints\n\nN is 1 or 2.\n\nA is an integer between 1 and 9 (inclusive).\n\nB is an integer between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in one of the following formats:\n\n1\n\n2\nA\nB\n\nOutput\n\nIf N=1, print Hello World; if N=2, print A+B.\n\nSample Input 1\n\n1\n\nSample Output 1\n\nHello World\n\nAs N=1, Takahashi is one year old. Thus, we should print Hello World.\n\nSample Input 2\n\n2\n3\n5\n\nSample Output 2\n\n8\n\nAs N=2, Takahashi is two years old. Thus, we should print A+B, which is 8 since A=3 and B=5.", "sample_input": "1\n"}, "reference_outputs": ["Hello World\n"], "source_document_id": "p03238", "source_text": "Score: 100 points\n\nProblem Statement\n\nIn 2020, AtCoder Inc. with an annual sales of more than one billion yen (the currency of Japan) has started a business in programming education.\n\nOne day, there was an exam where a one-year-old child must write a program that prints Hello World, and a two-year-old child must write a program that receives integers A, B and prints A+B.\n\nTakahashi, who is taking this exam, suddenly forgets his age.\n\nHe decides to write a program that first receives his age N (1 or 2) as input, then prints Hello World if N=1, and additionally receives integers A, B and prints A+B if N=2.\n\nWrite this program for him.\n\nConstraints\n\nN is 1 or 2.\n\nA is an integer between 1 and 9 (inclusive).\n\nB is an integer between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in one of the following formats:\n\n1\n\n2\nA\nB\n\nOutput\n\nIf N=1, print Hello World; if N=2, print A+B.\n\nSample Input 1\n\n1\n\nSample Output 1\n\nHello World\n\nAs N=1, Takahashi is one year old. Thus, we should print Hello World.\n\nSample Input 2\n\n2\n3\n5\n\nSample Output 2\n\n8\n\nAs N=2, Takahashi is two years old. Thus, we should print A+B, which is 8 since A=3 and B=5.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Lua:s445037503", "group_id": "codeNet:p03238", "input_text": "N=io.read(\"n\")\nif N==1 then \n print(\"Hello world\")\n elseif N==2 then \n \tA=io.read(\"n\")\n \tB=io.read(\"n\")\n \tprint(A+B)\nend", "language": "Lua", "metadata": {"date": 1550100745, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03238.html", "problem_id": "p03238", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03238/input.txt", "sample_output_relpath": "derived/input_output/data/p03238/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03238/Lua/s445037503.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s445037503", "user_id": "u015229643"}, "prompt_components": {"gold_output": "Hello World\n", "input_to_evaluate": "N=io.read(\"n\")\nif N==1 then \n print(\"Hello world\")\n elseif N==2 then \n \tA=io.read(\"n\")\n \tB=io.read(\"n\")\n \tprint(A+B)\nend", "problem_context": "Score: 100 points\n\nProblem Statement\n\nIn 2020, AtCoder Inc. with an annual sales of more than one billion yen (the currency of Japan) has started a business in programming education.\n\nOne day, there was an exam where a one-year-old child must write a program that prints Hello World, and a two-year-old child must write a program that receives integers A, B and prints A+B.\n\nTakahashi, who is taking this exam, suddenly forgets his age.\n\nHe decides to write a program that first receives his age N (1 or 2) as input, then prints Hello World if N=1, and additionally receives integers A, B and prints A+B if N=2.\n\nWrite this program for him.\n\nConstraints\n\nN is 1 or 2.\n\nA is an integer between 1 and 9 (inclusive).\n\nB is an integer between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in one of the following formats:\n\n1\n\n2\nA\nB\n\nOutput\n\nIf N=1, print Hello World; if N=2, print A+B.\n\nSample Input 1\n\n1\n\nSample Output 1\n\nHello World\n\nAs N=1, Takahashi is one year old. Thus, we should print Hello World.\n\nSample Input 2\n\n2\n3\n5\n\nSample Output 2\n\n8\n\nAs N=2, Takahashi is two years old. Thus, we should print A+B, which is 8 since A=3 and B=5.", "sample_input": "1\n"}, "reference_outputs": ["Hello World\n"], "source_document_id": "p03238", "source_text": "Score: 100 points\n\nProblem Statement\n\nIn 2020, AtCoder Inc. with an annual sales of more than one billion yen (the currency of Japan) has started a business in programming education.\n\nOne day, there was an exam where a one-year-old child must write a program that prints Hello World, and a two-year-old child must write a program that receives integers A, B and prints A+B.\n\nTakahashi, who is taking this exam, suddenly forgets his age.\n\nHe decides to write a program that first receives his age N (1 or 2) as input, then prints Hello World if N=1, and additionally receives integers A, B and prints A+B if N=2.\n\nWrite this program for him.\n\nConstraints\n\nN is 1 or 2.\n\nA is an integer between 1 and 9 (inclusive).\n\nB is an integer between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in one of the following formats:\n\n1\n\n2\nA\nB\n\nOutput\n\nIf N=1, print Hello World; if N=2, print A+B.\n\nSample Input 1\n\n1\n\nSample Output 1\n\nHello World\n\nAs N=1, Takahashi is one year old. Thus, we should print Hello World.\n\nSample Input 2\n\n2\n3\n5\n\nSample Output 2\n\n8\n\nAs N=2, Takahashi is two years old. Thus, we should print A+B, which is 8 since A=3 and B=5.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 13, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s648540688", "group_id": "codeNet:p03238", "input_text": "str = io.read()\nif str == \"1\" then\n e1 = \"Hello World\"\n print(e1)\nelse\n a = io.read()\n b = io.read()\n ans = a + b\n print(ans)\nend", "language": "Lua", "metadata": {"date": 1540855730, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03238.html", "problem_id": "p03238", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03238/input.txt", "sample_output_relpath": "derived/input_output/data/p03238/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03238/Lua/s648540688.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s648540688", "user_id": "u017797845"}, "prompt_components": {"gold_output": "Hello World\n", "input_to_evaluate": "str = io.read()\nif str == \"1\" then\n e1 = \"Hello World\"\n print(e1)\nelse\n a = io.read()\n b = io.read()\n ans = a + b\n print(ans)\nend", "problem_context": "Score: 100 points\n\nProblem Statement\n\nIn 2020, AtCoder Inc. with an annual sales of more than one billion yen (the currency of Japan) has started a business in programming education.\n\nOne day, there was an exam where a one-year-old child must write a program that prints Hello World, and a two-year-old child must write a program that receives integers A, B and prints A+B.\n\nTakahashi, who is taking this exam, suddenly forgets his age.\n\nHe decides to write a program that first receives his age N (1 or 2) as input, then prints Hello World if N=1, and additionally receives integers A, B and prints A+B if N=2.\n\nWrite this program for him.\n\nConstraints\n\nN is 1 or 2.\n\nA is an integer between 1 and 9 (inclusive).\n\nB is an integer between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in one of the following formats:\n\n1\n\n2\nA\nB\n\nOutput\n\nIf N=1, print Hello World; if N=2, print A+B.\n\nSample Input 1\n\n1\n\nSample Output 1\n\nHello World\n\nAs N=1, Takahashi is one year old. Thus, we should print Hello World.\n\nSample Input 2\n\n2\n3\n5\n\nSample Output 2\n\n8\n\nAs N=2, Takahashi is two years old. Thus, we should print A+B, which is 8 since A=3 and B=5.", "sample_input": "1\n"}, "reference_outputs": ["Hello World\n"], "source_document_id": "p03238", "source_text": "Score: 100 points\n\nProblem Statement\n\nIn 2020, AtCoder Inc. with an annual sales of more than one billion yen (the currency of Japan) has started a business in programming education.\n\nOne day, there was an exam where a one-year-old child must write a program that prints Hello World, and a two-year-old child must write a program that receives integers A, B and prints A+B.\n\nTakahashi, who is taking this exam, suddenly forgets his age.\n\nHe decides to write a program that first receives his age N (1 or 2) as input, then prints Hello World if N=1, and additionally receives integers A, B and prints A+B if N=2.\n\nWrite this program for him.\n\nConstraints\n\nN is 1 or 2.\n\nA is an integer between 1 and 9 (inclusive).\n\nB is an integer between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in one of the following formats:\n\n1\n\n2\nA\nB\n\nOutput\n\nIf N=1, print Hello World; if N=2, print A+B.\n\nSample Input 1\n\n1\n\nSample Output 1\n\nHello World\n\nAs N=1, Takahashi is one year old. Thus, we should print Hello World.\n\nSample Input 2\n\n2\n3\n5\n\nSample Output 2\n\n8\n\nAs N=2, Takahashi is two years old. Thus, we should print A+B, which is 8 since A=3 and B=5.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 135, "cpu_time_ms": 5, "memory_kb": 752}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s038703897", "group_id": "codeNet:p03239", "input_text": "local n, t = io.read(\"*n\", \"*n\")\nlocal min = nil\nfor i = 1, n do\n local a, b = io.read(\"*n\", \"*n\")\n if b <= t then\n if not min then min = a\n else min = math.min(min, a)\n end\n end\nend\nif min then print(min) else print(\"TLE\") end\n", "language": "Lua", "metadata": {"date": 1560778481, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03239.html", "problem_id": "p03239", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03239/input.txt", "sample_output_relpath": "derived/input_output/data/p03239/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03239/Lua/s038703897.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s038703897", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local n, t = io.read(\"*n\", \"*n\")\nlocal min = nil\nfor i = 1, n do\n local a, b = io.read(\"*n\", \"*n\")\n if b <= t then\n if not min then min = a\n else min = math.min(min, a)\n end\n end\nend\nif min then print(min) else print(\"TLE\") end\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWhen Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.\n\nYou, the smartwatch, has found N routes to his home.\n\nIf Mr. X uses the i-th of these routes, he will get home in time t_i at cost c_i.\n\nFind the smallest cost of a route that takes not longer than time T.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq T \\leq 1000\n\n1 \\leq c_i \\leq 1000\n\n1 \\leq t_i \\leq 1000\n\nThe pairs (c_i, t_i) are distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nc_1 t_1\nc_2 t_2\n:\nc_N t_N\n\nOutput\n\nPrint the smallest cost of a route that takes not longer than time T.\n\nIf there is no route that takes not longer than time T, print TLE instead.\n\nSample Input 1\n\n3 70\n7 60\n1 80\n4 50\n\nSample Output 1\n\n4\n\nThe first route gets him home at cost 7.\n\nThe second route takes longer than time T = 70.\n\nThe third route gets him home at cost 4.\n\nThus, the cost 4 of the third route is the minimum.\n\nSample Input 2\n\n4 3\n1 1000\n2 4\n3 1000\n4 500\n\nSample Output 2\n\nTLE\n\nThere is no route that takes not longer than time T = 3.\n\nSample Input 3\n\n5 9\n25 8\n5 9\n4 10\n1000 1000\n6 1\n\nSample Output 3\n\n5", "sample_input": "3 70\n7 60\n1 80\n4 50\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03239", "source_text": "Score : 200 points\n\nProblem Statement\n\nWhen Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.\n\nYou, the smartwatch, has found N routes to his home.\n\nIf Mr. X uses the i-th of these routes, he will get home in time t_i at cost c_i.\n\nFind the smallest cost of a route that takes not longer than time T.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq T \\leq 1000\n\n1 \\leq c_i \\leq 1000\n\n1 \\leq t_i \\leq 1000\n\nThe pairs (c_i, t_i) are distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nc_1 t_1\nc_2 t_2\n:\nc_N t_N\n\nOutput\n\nPrint the smallest cost of a route that takes not longer than time T.\n\nIf there is no route that takes not longer than time T, print TLE instead.\n\nSample Input 1\n\n3 70\n7 60\n1 80\n4 50\n\nSample Output 1\n\n4\n\nThe first route gets him home at cost 7.\n\nThe second route takes longer than time T = 70.\n\nThe third route gets him home at cost 4.\n\nThus, the cost 4 of the third route is the minimum.\n\nSample Input 2\n\n4 3\n1 1000\n2 4\n3 1000\n4 500\n\nSample Output 2\n\nTLE\n\nThere is no route that takes not longer than time T = 3.\n\nSample Input 3\n\n5 9\n25 8\n5 9\n4 10\n1000 1000\n6 1\n\nSample Output 3\n\n5", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s676285738", "group_id": "codeNet:p03239", "input_text": "N=io.read(\"n\")\nT=io.read(\"n\")\nc={}\nt={}\nfor i=1,N do \n c[i]=io.read(\"n\")\n t[i]=io.read(\"n\")\nend\ns=\"TLE\"\nfor i=1,N do \n if t[i]c[i] then\n s=c[i]\n end\nend\nprint(s)", "language": "Lua", "metadata": {"date": 1550103437, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03239.html", "problem_id": "p03239", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03239/input.txt", "sample_output_relpath": "derived/input_output/data/p03239/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03239/Lua/s676285738.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s676285738", "user_id": "u015229643"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "N=io.read(\"n\")\nT=io.read(\"n\")\nc={}\nt={}\nfor i=1,N do \n c[i]=io.read(\"n\")\n t[i]=io.read(\"n\")\nend\ns=\"TLE\"\nfor i=1,N do \n if t[i]c[i] then\n s=c[i]\n end\nend\nprint(s)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWhen Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.\n\nYou, the smartwatch, has found N routes to his home.\n\nIf Mr. X uses the i-th of these routes, he will get home in time t_i at cost c_i.\n\nFind the smallest cost of a route that takes not longer than time T.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq T \\leq 1000\n\n1 \\leq c_i \\leq 1000\n\n1 \\leq t_i \\leq 1000\n\nThe pairs (c_i, t_i) are distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nc_1 t_1\nc_2 t_2\n:\nc_N t_N\n\nOutput\n\nPrint the smallest cost of a route that takes not longer than time T.\n\nIf there is no route that takes not longer than time T, print TLE instead.\n\nSample Input 1\n\n3 70\n7 60\n1 80\n4 50\n\nSample Output 1\n\n4\n\nThe first route gets him home at cost 7.\n\nThe second route takes longer than time T = 70.\n\nThe third route gets him home at cost 4.\n\nThus, the cost 4 of the third route is the minimum.\n\nSample Input 2\n\n4 3\n1 1000\n2 4\n3 1000\n4 500\n\nSample Output 2\n\nTLE\n\nThere is no route that takes not longer than time T = 3.\n\nSample Input 3\n\n5 9\n25 8\n5 9\n4 10\n1000 1000\n6 1\n\nSample Output 3\n\n5", "sample_input": "3 70\n7 60\n1 80\n4 50\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03239", "source_text": "Score : 200 points\n\nProblem Statement\n\nWhen Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.\n\nYou, the smartwatch, has found N routes to his home.\n\nIf Mr. X uses the i-th of these routes, he will get home in time t_i at cost c_i.\n\nFind the smallest cost of a route that takes not longer than time T.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq T \\leq 1000\n\n1 \\leq c_i \\leq 1000\n\n1 \\leq t_i \\leq 1000\n\nThe pairs (c_i, t_i) are distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nc_1 t_1\nc_2 t_2\n:\nc_N t_N\n\nOutput\n\nPrint the smallest cost of a route that takes not longer than time T.\n\nIf there is no route that takes not longer than time T, print TLE instead.\n\nSample Input 1\n\n3 70\n7 60\n1 80\n4 50\n\nSample Output 1\n\n4\n\nThe first route gets him home at cost 7.\n\nThe second route takes longer than time T = 70.\n\nThe third route gets him home at cost 4.\n\nThus, the cost 4 of the third route is the minimum.\n\nSample Input 2\n\n4 3\n1 1000\n2 4\n3 1000\n4 500\n\nSample Output 2\n\nTLE\n\nThere is no route that takes not longer than time T = 3.\n\nSample Input 3\n\n5 9\n25 8\n5 9\n4 10\n1000 1000\n6 1\n\nSample Output 3\n\n5", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 261, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s977061678", "group_id": "codeNet:p03241", "input_text": "local n = io.read(\"n\")\nlocal m = io.read(\"n\")\nlocal mm = math.ceil(m ^ 0.5)\nlocal max = 0\nfor i = 1, mm do\n\tif m % i == 0 then\n\t\tlocal a = i\n\t\tlocal b = m // a\n\t\tif b >= n then\n\t\t\tmax = math.max(a, max)\n\t\tend\n\t\tif a >= n then\n\t\t\tmax = math.max(b, max)\n\t\tend\n\tend\nend\nprint(max)\n", "language": "Lua", "metadata": {"date": 1550374413, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s977061678.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s977061678", "user_id": "u200201528"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n = io.read(\"n\")\nlocal m = io.read(\"n\")\nlocal mm = math.ceil(m ^ 0.5)\nlocal max = 0\nfor i = 1, mm do\n\tif m % i == 0 then\n\t\tlocal a = i\n\t\tlocal b = m // a\n\t\tif b >= n then\n\t\t\tmax = math.max(a, max)\n\t\tend\n\t\tif a >= n then\n\t\t\tmax = math.max(b, max)\n\t\tend\n\tend\nend\nprint(max)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given integers N and M.\n\nConsider a sequence a of length N consisting of positive integers such that a_1 + a_2 + ... + a_N = M. Find the maximum possible value of the greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\nN \\leq M \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the maximum possible value of the greatest common divisor of a sequence a_1, a_2, ..., a_N that satisfies the condition.\n\nSample Input 1\n\n3 14\n\nSample Output 1\n\n2\n\nConsider the sequence (a_1, a_2, a_3) = (2, 4, 8). Their greatest common divisor is 2, and this is the maximum value.\n\nSample Input 2\n\n10 123\n\nSample Output 2\n\n3\n\nSample Input 3\n\n100000 1000000000\n\nSample Output 3\n\n10000", "sample_input": "3 14\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03241", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given integers N and M.\n\nConsider a sequence a of length N consisting of positive integers such that a_1 + a_2 + ... + a_N = M. Find the maximum possible value of the greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\nN \\leq M \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the maximum possible value of the greatest common divisor of a sequence a_1, a_2, ..., a_N that satisfies the condition.\n\nSample Input 1\n\n3 14\n\nSample Output 1\n\n2\n\nConsider the sequence (a_1, a_2, a_3) = (2, 4, 8). Their greatest common divisor is 2, and this is the maximum value.\n\nSample Input 2\n\n10 123\n\nSample Output 2\n\n3\n\nSample Input 3\n\n100000 1000000000\n\nSample Output 3\n\n10000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s104630836", "group_id": "codeNet:p03241", "input_text": "local n = io.read(\"n\")\nlocal m = io.read(\"n\")\nlocal mm = math.ceil(m ^ 0.5)\nlocal max = 0\nfor i = 1, mm do\n\tif m % i == 0 then\n\t\tlocal a = i\n\t\tlocal b = m // a\n\t\tif b >= n then\n\t\t\tmax = math.max(a, max)\n\t\tend\n\tend\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1550372394, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s104630836.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s104630836", "user_id": "u200201528"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n = io.read(\"n\")\nlocal m = io.read(\"n\")\nlocal mm = math.ceil(m ^ 0.5)\nlocal max = 0\nfor i = 1, mm do\n\tif m % i == 0 then\n\t\tlocal a = i\n\t\tlocal b = m // a\n\t\tif b >= n then\n\t\t\tmax = math.max(a, max)\n\t\tend\n\tend\nend\nprint(max)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 228, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s590388252", "group_id": "codeNet:p03241", "input_text": "function input()\n local inp = io.read()\n local r={}\n string.gsub(inp,\"(%S+)\", function (v) table.insert(r,tonumber(v)) end)\n return r\nend\n\nlocal n,m\nlocal inp = input()\nn = inp[1]\nm = inp[2]\nlocal b={}\nlocal cnt = 1\nlocal i=1\nwhile i*i<=m do\n if m%i==0 then\n b[cnt]=i\n cnt = cnt+1\n b[cnt]=m//i\n cnt = cnt+1\n end\n i=i+1\nend\nlocal res = 1\nfor i=1,cnt-1,1 do\n if b[i]*n<=m then\n res = math.max(res,b[i])\n end\nend\nprint(res)", "language": "Lua", "metadata": {"date": 1544413538, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s590388252.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s590388252", "user_id": "u030685402"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "function input()\n local inp = io.read()\n local r={}\n string.gsub(inp,\"(%S+)\", function (v) table.insert(r,tonumber(v)) end)\n return r\nend\n\nlocal n,m\nlocal inp = input()\nn = inp[1]\nm = inp[2]\nlocal b={}\nlocal cnt = 1\nlocal i=1\nwhile i*i<=m do\n if m%i==0 then\n b[cnt]=i\n cnt = cnt+1\n b[cnt]=m//i\n cnt = cnt+1\n end\n i=i+1\nend\nlocal res = 1\nfor i=1,cnt-1,1 do\n if b[i]*n<=m then\n res = math.max(res,b[i])\n end\nend\nprint(res)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 444, "cpu_time_ms": 3, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s021834556", "group_id": "codeNet:p03242", "input_text": "s=io.read()\nfor i=1,#s do\n\tif s:sub(i,i)=='1' then io.write(9)\n\telse io.write(1) end\nend", "language": "Lua", "metadata": {"date": 1538779271, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s021834556.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s021834556", "user_id": "u781091740"}, "prompt_components": {"gold_output": "991\n", "input_to_evaluate": "s=io.read()\nfor i=1,#s do\n\tif s:sub(i,i)=='1' then io.write(9)\n\telse io.write(1) end\nend", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s458210700", "group_id": "codeNet:p03243", "input_text": "a = io.read(\"*n\")\nprint(math.ceil(a / 111) * 111)", "language": "Lua", "metadata": {"date": 1569497937, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03243.html", "problem_id": "p03243", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03243/input.txt", "sample_output_relpath": "derived/input_output/data/p03243/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03243/Lua/s458210700.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s458210700", "user_id": "u120582723"}, "prompt_components": {"gold_output": "111\n", "input_to_evaluate": "a = io.read(\"*n\")\nprint(math.ceil(a / 111) * 111)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nKurohashi has never participated in AtCoder Beginner Contest (ABC).\n\nThe next ABC to be held is ABC N (the N-th ABC ever held).\nKurohashi wants to make his debut in some ABC x such that all the digits of x in base ten are the same.\n\nWhat is the earliest ABC where Kurohashi can make his debut?\n\nConstraints\n\n100 \\leq N \\leq 999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf the earliest ABC where Kurohashi can make his debut is ABC n, print n.\n\nSample Input 1\n\n111\n\nSample Output 1\n\n111\n\nThe next ABC to be held is ABC 111, where Kurohashi can make his debut.\n\nSample Input 2\n\n112\n\nSample Output 2\n\n222\n\nThe next ABC to be held is ABC 112, which means Kurohashi can no longer participate in ABC 111.\nAmong the ABCs where Kurohashi can make his debut, the earliest one is ABC 222.\n\nSample Input 3\n\n750\n\nSample Output 3\n\n777", "sample_input": "111\n"}, "reference_outputs": ["111\n"], "source_document_id": "p03243", "source_text": "Score : 200 points\n\nProblem Statement\n\nKurohashi has never participated in AtCoder Beginner Contest (ABC).\n\nThe next ABC to be held is ABC N (the N-th ABC ever held).\nKurohashi wants to make his debut in some ABC x such that all the digits of x in base ten are the same.\n\nWhat is the earliest ABC where Kurohashi can make his debut?\n\nConstraints\n\n100 \\leq N \\leq 999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf the earliest ABC where Kurohashi can make his debut is ABC n, print n.\n\nSample Input 1\n\n111\n\nSample Output 1\n\n111\n\nThe next ABC to be held is ABC 111, where Kurohashi can make his debut.\n\nSample Input 2\n\n112\n\nSample Output 2\n\n222\n\nThe next ABC to be held is ABC 112, which means Kurohashi can no longer participate in ABC 111.\nAmong the ABCs where Kurohashi can make his debut, the earliest one is ABC 222.\n\nSample Input 3\n\n750\n\nSample Output 3\n\n777", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 49, "cpu_time_ms": 7, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s488446134", "group_id": "codeNet:p03243", "input_text": "local N = io.read(\"n\")\nfor i=1,9 do\n local x = i*100 + i*10 + i\n if x >= N then\n print(x)\n return\n end\nend\n", "language": "Lua", "metadata": {"date": 1565644781, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03243.html", "problem_id": "p03243", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03243/input.txt", "sample_output_relpath": "derived/input_output/data/p03243/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03243/Lua/s488446134.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s488446134", "user_id": "u162773977"}, "prompt_components": {"gold_output": "111\n", "input_to_evaluate": "local N = io.read(\"n\")\nfor i=1,9 do\n local x = i*100 + i*10 + i\n if x >= N then\n print(x)\n return\n end\nend\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nKurohashi has never participated in AtCoder Beginner Contest (ABC).\n\nThe next ABC to be held is ABC N (the N-th ABC ever held).\nKurohashi wants to make his debut in some ABC x such that all the digits of x in base ten are the same.\n\nWhat is the earliest ABC where Kurohashi can make his debut?\n\nConstraints\n\n100 \\leq N \\leq 999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf the earliest ABC where Kurohashi can make his debut is ABC n, print n.\n\nSample Input 1\n\n111\n\nSample Output 1\n\n111\n\nThe next ABC to be held is ABC 111, where Kurohashi can make his debut.\n\nSample Input 2\n\n112\n\nSample Output 2\n\n222\n\nThe next ABC to be held is ABC 112, which means Kurohashi can no longer participate in ABC 111.\nAmong the ABCs where Kurohashi can make his debut, the earliest one is ABC 222.\n\nSample Input 3\n\n750\n\nSample Output 3\n\n777", "sample_input": "111\n"}, "reference_outputs": ["111\n"], "source_document_id": "p03243", "source_text": "Score : 200 points\n\nProblem Statement\n\nKurohashi has never participated in AtCoder Beginner Contest (ABC).\n\nThe next ABC to be held is ABC N (the N-th ABC ever held).\nKurohashi wants to make his debut in some ABC x such that all the digits of x in base ten are the same.\n\nWhat is the earliest ABC where Kurohashi can make his debut?\n\nConstraints\n\n100 \\leq N \\leq 999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf the earliest ABC where Kurohashi can make his debut is ABC n, print n.\n\nSample Input 1\n\n111\n\nSample Output 1\n\n111\n\nThe next ABC to be held is ABC 111, where Kurohashi can make his debut.\n\nSample Input 2\n\n112\n\nSample Output 2\n\n222\n\nThe next ABC to be held is ABC 112, which means Kurohashi can no longer participate in ABC 111.\nAmong the ABCs where Kurohashi can make his debut, the earliest one is ABC 222.\n\nSample Input 3\n\n750\n\nSample Output 3\n\n777", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s807684414", "group_id": "codeNet:p03243", "input_text": "N=io.read(\"n\")\nfor i=1,9 do \n if 100*i+10*i+i>=N then \n print(100*i+10*i+i)\n end\nend", "language": "Lua", "metadata": {"date": 1550109591, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03243.html", "problem_id": "p03243", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03243/input.txt", "sample_output_relpath": "derived/input_output/data/p03243/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03243/Lua/s807684414.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s807684414", "user_id": "u015229643"}, "prompt_components": {"gold_output": "111\n", "input_to_evaluate": "N=io.read(\"n\")\nfor i=1,9 do \n if 100*i+10*i+i>=N then \n print(100*i+10*i+i)\n end\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nKurohashi has never participated in AtCoder Beginner Contest (ABC).\n\nThe next ABC to be held is ABC N (the N-th ABC ever held).\nKurohashi wants to make his debut in some ABC x such that all the digits of x in base ten are the same.\n\nWhat is the earliest ABC where Kurohashi can make his debut?\n\nConstraints\n\n100 \\leq N \\leq 999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf the earliest ABC where Kurohashi can make his debut is ABC n, print n.\n\nSample Input 1\n\n111\n\nSample Output 1\n\n111\n\nThe next ABC to be held is ABC 111, where Kurohashi can make his debut.\n\nSample Input 2\n\n112\n\nSample Output 2\n\n222\n\nThe next ABC to be held is ABC 112, which means Kurohashi can no longer participate in ABC 111.\nAmong the ABCs where Kurohashi can make his debut, the earliest one is ABC 222.\n\nSample Input 3\n\n750\n\nSample Output 3\n\n777", "sample_input": "111\n"}, "reference_outputs": ["111\n"], "source_document_id": "p03243", "source_text": "Score : 200 points\n\nProblem Statement\n\nKurohashi has never participated in AtCoder Beginner Contest (ABC).\n\nThe next ABC to be held is ABC N (the N-th ABC ever held).\nKurohashi wants to make his debut in some ABC x such that all the digits of x in base ten are the same.\n\nWhat is the earliest ABC where Kurohashi can make his debut?\n\nConstraints\n\n100 \\leq N \\leq 999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf the earliest ABC where Kurohashi can make his debut is ABC n, print n.\n\nSample Input 1\n\n111\n\nSample Output 1\n\n111\n\nThe next ABC to be held is ABC 111, where Kurohashi can make his debut.\n\nSample Input 2\n\n112\n\nSample Output 2\n\n222\n\nThe next ABC to be held is ABC 112, which means Kurohashi can no longer participate in ABC 111.\nAmong the ABCs where Kurohashi can make his debut, the earliest one is ABC 222.\n\nSample Input 3\n\n750\n\nSample Output 3\n\n777", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s111775286", "group_id": "codeNet:p03244", "input_text": "n=io.read(\"*n\",\"*l\")\nv={}\nfor i=1,n do\n x=io.read(\"*n\")\n if i%2==1 then\n if not v[x] then\n v[x]={1,0}\n else\n v[x][1]=v[x][1]+1\n end\n else\n if not v[x] then\n v[x]={0,1}\n else\n v[x][2]=v[x][2]+1\n end\n end\nend\n\nomax={0,0}\nemax={0,0}\nomax2={0,0}\nemax2={0,0}\nfor k,_ in pairs(v) do\n omax={math.max(omax[1],v[k][1]),k}\n emax={math.max(emax[1],v[k][2]),k}\nend\nfor k,_ in pairs(v) do\n if k~=omax[2] then\n omax2={math.max(omax2[1],v[k][1]),k}\n elseif k~=emax[2] then\n emax2={math.max(emax2[1],v[k][2]),k}\n end\nend\n\nif omax[2]==emax[2] then\n print(n-math.max(omax2[1]+emax[1],omax[1]+emax2[1]))\nelse\n print(n-omax[1]-emax[1])\nend", "language": "Lua", "metadata": {"date": 1588496590, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s111775286.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s111775286", "user_id": "u045238009"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "n=io.read(\"*n\",\"*l\")\nv={}\nfor i=1,n do\n x=io.read(\"*n\")\n if i%2==1 then\n if not v[x] then\n v[x]={1,0}\n else\n v[x][1]=v[x][1]+1\n end\n else\n if not v[x] then\n v[x]={0,1}\n else\n v[x][2]=v[x][2]+1\n end\n end\nend\n\nomax={0,0}\nemax={0,0}\nomax2={0,0}\nemax2={0,0}\nfor k,_ in pairs(v) do\n omax={math.max(omax[1],v[k][1]),k}\n emax={math.max(emax[1],v[k][2]),k}\nend\nfor k,_ in pairs(v) do\n if k~=omax[2] then\n omax2={math.max(omax2[1],v[k][1]),k}\n elseif k~=emax[2] then\n emax2={math.max(emax2[1],v[k][2]),k}\n end\nend\n\nif omax[2]==emax[2] then\n print(n-math.max(omax2[1]+emax[1],omax[1]+emax2[1]))\nelse\n print(n-omax[1]-emax[1])\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 752, "cpu_time_ms": 212, "memory_kb": 43232}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s968690642", "group_id": "codeNet:p03252", "input_text": "local S, T = io.read(\"l\",\"l\")\nS={string.byte(S,1,#S)}\nT={string.byte(T,1,#T)}\nlocal origin = {}\nlocal result = {}\nfor i=1,#S do\n if origin[T[i]] == nil then\n origin[T[i]] = S[i];\n end\n if result[S[i]] == nil then\n result[S[i]] = T[i];\n end\n if origin[T[i]] ~= S[i] or result[S[i]] ~= T[i] then\n print(\"No\")\n return\n end\nend\nprint(\"Yes\")\n", "language": "Lua", "metadata": {"date": 1553134444, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s968690642.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s968690642", "user_id": "u162773977"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local S, T = io.read(\"l\",\"l\")\nS={string.byte(S,1,#S)}\nT={string.byte(T,1,#T)}\nlocal origin = {}\nlocal result = {}\nfor i=1,#S do\n if origin[T[i]] == nil then\n origin[T[i]] = S[i];\n end\n if result[S[i]] == nil then\n result[S[i]] = T[i];\n end\n if origin[T[i]] ~= S[i] or result[S[i]] ~= T[i] then\n print(\"No\")\n return\n end\nend\nprint(\"Yes\")\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 383, "cpu_time_ms": 54, "memory_kb": 10044}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s708607167", "group_id": "codeNet:p03252", "input_text": "local S, T = io.read(\"l\",\"l\")\nS={string.byte(S,1,#S)}\nT={string.byte(T,1,#T)}\nlocal source = {}\nfor i=1,#S do\n if source[T[i]] == nil then\n source[T[i]] = S[i];\n elseif source[T[i]] ~= S[i] then\n print(\"No\")\n return\n end\nend\nprint(\"Yes\")\n", "language": "Lua", "metadata": {"date": 1553133591, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s708607167.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s708607167", "user_id": "u162773977"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local S, T = io.read(\"l\",\"l\")\nS={string.byte(S,1,#S)}\nT={string.byte(T,1,#T)}\nlocal source = {}\nfor i=1,#S do\n if source[T[i]] == nil then\n source[T[i]] = S[i];\n elseif source[T[i]] ~= S[i] then\n print(\"No\")\n return\n end\nend\nprint(\"Yes\")\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 268, "cpu_time_ms": 34, "memory_kb": 10044}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s218994185", "group_id": "codeNet:p03252", "input_text": "local a = io.read(\"*l\")\nlocal b = io.read(\"*l\")\nfunction test(a,b)\n local test = string.format(\"[%s]\",a)\n local test2 = string.format(\"[%s]\",b)\n local x = string.gsub(a,test2,\"\")\n local y = string.gsub(b,test,\"\")\n local newTest1 = {}\n local newTest2 = {}\n local num1 = 0\n local num2 = 0\n for i=1,string.len(x) do\n if not newTest1[string.sub(x,i,i)] then\n num1 = num1 + 1\n newTest1[string.sub(x,i,i)] = true\n end\n end\n\n for i=1,string.len(y) do\n if newTest2[string.sub(y,i,i)] then\n\n else\n num2 = num2 + 1\n newTest2[string.sub(y,i,i)] = true\n end\n\n end\n if math.abs(num1-num2)%2 == 0 then\n print(\"Yes\")\n else\n print(\"No\")\n end\n\nend\ntest(a,b)", "language": "Lua", "metadata": {"date": 1543003196, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s218994185.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s218994185", "user_id": "u863370423"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local a = io.read(\"*l\")\nlocal b = io.read(\"*l\")\nfunction test(a,b)\n local test = string.format(\"[%s]\",a)\n local test2 = string.format(\"[%s]\",b)\n local x = string.gsub(a,test2,\"\")\n local y = string.gsub(b,test,\"\")\n local newTest1 = {}\n local newTest2 = {}\n local num1 = 0\n local num2 = 0\n for i=1,string.len(x) do\n if not newTest1[string.sub(x,i,i)] then\n num1 = num1 + 1\n newTest1[string.sub(x,i,i)] = true\n end\n end\n\n for i=1,string.len(y) do\n if newTest2[string.sub(y,i,i)] then\n\n else\n num2 = num2 + 1\n newTest2[string.sub(y,i,i)] = true\n end\n\n end\n if math.abs(num1-num2)%2 == 0 then\n print(\"Yes\")\n else\n print(\"No\")\n end\n\nend\ntest(a,b)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 1264}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s238737477", "group_id": "codeNet:p03253", "input_text": "local mfl, mce = math.floor, math.ceil\nlocal mod = 1000000007\nlocal function badd(x, y) return (x + y) % mod end\nlocal function bmul(x, y) return (x * y) % mod end\n\nlocal function getprimes(x)\n local primes = {}\n local allnums = {}\n for i = 1, x do allnums[i] = true end\n for i = 2, x do\n if allnums[i] then\n table.insert(primes, i)\n local lim = mfl(x / i)\n for j = 2, lim do\n allnums[j * i] = false\n end\n end\n end\n return primes\nend\nlocal primes = getprimes(31623)\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\n\nlocal fact = {1}\nfor i = 2, 100100 do\n fact[i] = bmul(fact[i - 1], i)\nend\n\nlocal function getComb(n, k)\n return bmul(fact[n], modinv(bmul(fact[k], fact[n - k])))\nend\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal tm = m\nlocal ret = 1\nfor i = 1, #primes do\n local p = primes[i]\n if tm < p * p then break end\n local cnt = 0\n while tm % p == 0 do\n tm = tm // p\n cnt = cnt + 1\n end\n if 0 < cnt then\n ret = bmul(ret, getComb(n + cnt - 1, n - 1))\n end\nend\nif tm ~= 1 then\n ret = bmul(ret, n)\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1584803316, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s238737477.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s238737477", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local mfl, mce = math.floor, math.ceil\nlocal mod = 1000000007\nlocal function badd(x, y) return (x + y) % mod end\nlocal function bmul(x, y) return (x * y) % mod end\n\nlocal function getprimes(x)\n local primes = {}\n local allnums = {}\n for i = 1, x do allnums[i] = true end\n for i = 2, x do\n if allnums[i] then\n table.insert(primes, i)\n local lim = mfl(x / i)\n for j = 2, lim do\n allnums[j * i] = false\n end\n end\n end\n return primes\nend\nlocal primes = getprimes(31623)\n\nlocal function modpow(src, pow)\n local res = 1\n while 0 < pow do\n if pow % 2 == 1 then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\n\nlocal fact = {1}\nfor i = 2, 100100 do\n fact[i] = bmul(fact[i - 1], i)\nend\n\nlocal function getComb(n, k)\n return bmul(fact[n], modinv(bmul(fact[k], fact[n - k])))\nend\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal tm = m\nlocal ret = 1\nfor i = 1, #primes do\n local p = primes[i]\n if tm < p * p then break end\n local cnt = 0\n while tm % p == 0 do\n tm = tm // p\n cnt = cnt + 1\n end\n if 0 < cnt then\n ret = bmul(ret, getComb(n + cnt - 1, n - 1))\n end\nend\nif tm ~= 1 then\n ret = bmul(ret, n)\nend\nprint(ret)\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1300, "cpu_time_ms": 22, "memory_kb": 3568}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s989898059", "group_id": "codeNet:p03253", "input_text": "local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max\nlocal mod = 1000000007\nlocal function getprimes(x)\n local primes = {}\n local allnums = {}\n for i = 1, x do allnums[i] = true end\n for i = 2, x do\n if(allnums[i]) then\n table.insert(primes, i)\n local lim = mfl(x / i)\n for j = 2, lim do\n allnums[j * i] = false\n end\n end\n end\n return primes\nend\n\nlocal function getdivisorparts(x, primes)\n local prime_num = #primes\n local tmp = {}\n local lim = mce(msq(x))\n local primepos = 1\n local dv = primes[primepos]\n while(primepos <= prime_num and dv <= lim) do\n if(x % dv == 0) then\n local asdf = {}\n asdf.p = dv\n asdf.cnt = 1\n x = x / dv\n while(x % dv == 0) do\n x = x / dv\n asdf.cnt = asdf.cnt + 1\n end\n table.insert(tmp, asdf)\n lim = mce(msq(x))\n end\n if(primepos == prime_num) then break end\n primepos = primepos + 1\n dv = primes[primepos]\n end\n if(x ~= 1) then\n local asdf = {}\n asdf.p, asdf.cnt = x, 1\n table.insert(tmp, asdf)\n end\n return tmp\nend\nlocal function bmul(x, y)\n local x1, y1 = x % 10000, y % 10000\n local x2, y2 = mfl(x / 10000) % 10000, mfl(y / 10000) % 10000\n local x3, y3 = mfl(x / 100000000), mfl(y / 100000000)\n local ret = (x1 * y1 + (x1 * y2 + x2 * y1) * 10000) % mod\n ret = (ret + (x1 * y3 + x2 * y2 + x3 * y1) * 10000 % mod * 10000 % mod) % mod\n ret = (ret + (x2 * y3 + x3 * y2) * 10000 % mod * 10000 % mod * 10000) % mod\n ret = (ret + x3 * y3 * 930000007) % mod\n return ret\nend\nlocal function bmul(x, y)\n local x1, y1 = x % 10000, y % 10000\n local x2, y2 = mfl(x / 10000) % 10000, mfl(y / 10000) % 10000\n local x3, y3 = mfl(x / 100000000), mfl(y / 100000000)\n local ret = (x1 * y1 + (x1 * y2 + x2 * y1) * 10000) % mod\n ret = (ret + (x1 * y3 + x2 * y2 + x3 * y1) * 10000 % mod * 10000 % mod) % mod\n ret = (ret + (x2 * y3 + x3 * y2) * 10000 % mod * 10000 % mod * 10000) % mod\n ret = (ret + x3 * y3 * 930000007) % mod\n return ret\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while (0 < pow) do\n if (pow % 2 == 1) then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res;\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\n\nlocal function getConv(n, k)\n local ret = 1\n for i = 1, k do\n ret = bmul(ret, n + 1 - i)\n ret = bmul(ret, modinv(i))\n end\n return ret\nend\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal primes = getprimes(mce(msq(m)))\nlocal divisorparts = getdivisorparts(m, primes)\nlocal pat = 1\nfor i = 1, #divisorparts do\n local c = divisorparts[i].cnt\n pat = bmul(pat, getConv(n + c - 1, c))\nend\nprint(pat)\n", "language": "Lua", "metadata": {"date": 1558581620, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s989898059.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s989898059", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max\nlocal mod = 1000000007\nlocal function getprimes(x)\n local primes = {}\n local allnums = {}\n for i = 1, x do allnums[i] = true end\n for i = 2, x do\n if(allnums[i]) then\n table.insert(primes, i)\n local lim = mfl(x / i)\n for j = 2, lim do\n allnums[j * i] = false\n end\n end\n end\n return primes\nend\n\nlocal function getdivisorparts(x, primes)\n local prime_num = #primes\n local tmp = {}\n local lim = mce(msq(x))\n local primepos = 1\n local dv = primes[primepos]\n while(primepos <= prime_num and dv <= lim) do\n if(x % dv == 0) then\n local asdf = {}\n asdf.p = dv\n asdf.cnt = 1\n x = x / dv\n while(x % dv == 0) do\n x = x / dv\n asdf.cnt = asdf.cnt + 1\n end\n table.insert(tmp, asdf)\n lim = mce(msq(x))\n end\n if(primepos == prime_num) then break end\n primepos = primepos + 1\n dv = primes[primepos]\n end\n if(x ~= 1) then\n local asdf = {}\n asdf.p, asdf.cnt = x, 1\n table.insert(tmp, asdf)\n end\n return tmp\nend\nlocal function bmul(x, y)\n local x1, y1 = x % 10000, y % 10000\n local x2, y2 = mfl(x / 10000) % 10000, mfl(y / 10000) % 10000\n local x3, y3 = mfl(x / 100000000), mfl(y / 100000000)\n local ret = (x1 * y1 + (x1 * y2 + x2 * y1) * 10000) % mod\n ret = (ret + (x1 * y3 + x2 * y2 + x3 * y1) * 10000 % mod * 10000 % mod) % mod\n ret = (ret + (x2 * y3 + x3 * y2) * 10000 % mod * 10000 % mod * 10000) % mod\n ret = (ret + x3 * y3 * 930000007) % mod\n return ret\nend\nlocal function bmul(x, y)\n local x1, y1 = x % 10000, y % 10000\n local x2, y2 = mfl(x / 10000) % 10000, mfl(y / 10000) % 10000\n local x3, y3 = mfl(x / 100000000), mfl(y / 100000000)\n local ret = (x1 * y1 + (x1 * y2 + x2 * y1) * 10000) % mod\n ret = (ret + (x1 * y3 + x2 * y2 + x3 * y1) * 10000 % mod * 10000 % mod) % mod\n ret = (ret + (x2 * y3 + x3 * y2) * 10000 % mod * 10000 % mod * 10000) % mod\n ret = (ret + x3 * y3 * 930000007) % mod\n return ret\nend\n\nlocal function modpow(src, pow)\n local res = 1\n while (0 < pow) do\n if (pow % 2 == 1) then\n res = bmul(res, src)\n pow = pow - 1\n end\n src = bmul(src, src)\n pow = mfl(pow / 2)\n end\n return res;\nend\n\nlocal function modinv(src)\n return modpow(src, mod - 2)\nend\n\nlocal function getConv(n, k)\n local ret = 1\n for i = 1, k do\n ret = bmul(ret, n + 1 - i)\n ret = bmul(ret, modinv(i))\n end\n return ret\nend\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal primes = getprimes(mce(msq(m)))\nlocal divisorparts = getdivisorparts(m, primes)\nlocal pat = 1\nfor i = 1, #divisorparts do\n local c = divisorparts[i].cnt\n pat = bmul(pat, getConv(n + c - 1, c))\nend\nprint(pat)\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2711, "cpu_time_ms": 2, "memory_kb": 640}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s817844227", "group_id": "codeNet:p03254", "input_text": "local read = io.read\nlocal N, x = read(\"*n\", \"*n\")\nlocal a = {}\n\nlocal sum = 0\nfor i = 1, N do\n\ta[i] = read(\"*n\")\n\tsum = sum + a[i]\nend\nif sum == x then\n\tprint(N)\n\tos.exit()\nend\nsum = nil\n\nlocal out = 0\ntable.sort(a)\nfor i = 1, N do\n\tlocal pre_x = x - a[i]\n\tif pre_x < 0 then\n\t\tout = i - 1\n\t\tbreak\n\telseif i == N then\n\t\tout = N - 1\n\t\tbreak\n\tend\n\tx = pre_x\nend\n\nprint(out)\n", "language": "Lua", "metadata": {"date": 1594319400, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p03254.html", "problem_id": "p03254", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03254/input.txt", "sample_output_relpath": "derived/input_output/data/p03254/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03254/Lua/s817844227.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s817844227", "user_id": "u793881115"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local read = io.read\nlocal N, x = read(\"*n\", \"*n\")\nlocal a = {}\n\nlocal sum = 0\nfor i = 1, N do\n\ta[i] = read(\"*n\")\n\tsum = sum + a[i]\nend\nif sum == x then\n\tprint(N)\n\tos.exit()\nend\nsum = nil\n\nlocal out = 0\ntable.sort(a)\nfor i = 1, N do\n\tlocal pre_x = x - a[i]\n\tif pre_x < 0 then\n\t\tout = i - 1\n\t\tbreak\n\telseif i == N then\n\t\tout = N - 1\n\t\tbreak\n\tend\n\tx = pre_x\nend\n\nprint(out)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N children, numbered 1, 2, ..., N.\n\nSnuke has decided to distribute x sweets among them.\nHe needs to give out all the x sweets, but some of the children may get zero sweets.\n\nFor each i (1 \\leq i \\leq N), Child i will be happy if he/she gets exactly a_i sweets.\nSnuke is trying to maximize the number of happy children by optimally distributing the sweets.\nFind the maximum possible number of happy children.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n1 \\leq x \\leq 10^9\n\n1 \\leq a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN x\na_1 a_2 ... a_N\n\nOutput\n\nPrint the maximum possible number of happy children.\n\nSample Input 1\n\n3 70\n20 30 10\n\nSample Output 1\n\n2\n\nOne optimal way to distribute sweets is (20, 30, 20).\n\nSample Input 2\n\n3 10\n20 30 10\n\nSample Output 2\n\n1\n\nThe optimal way to distribute sweets is (0, 0, 10).\n\nSample Input 3\n\n4 1111\n1 10 100 1000\n\nSample Output 3\n\n4\n\nThe optimal way to distribute sweets is (1, 10, 100, 1000).\n\nSample Input 4\n\n2 10\n20 20\n\nSample Output 4\n\n0\n\nNo children will be happy, no matter how the sweets are distributed.", "sample_input": "3 70\n20 30 10\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03254", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N children, numbered 1, 2, ..., N.\n\nSnuke has decided to distribute x sweets among them.\nHe needs to give out all the x sweets, but some of the children may get zero sweets.\n\nFor each i (1 \\leq i \\leq N), Child i will be happy if he/she gets exactly a_i sweets.\nSnuke is trying to maximize the number of happy children by optimally distributing the sweets.\nFind the maximum possible number of happy children.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n1 \\leq x \\leq 10^9\n\n1 \\leq a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN x\na_1 a_2 ... a_N\n\nOutput\n\nPrint the maximum possible number of happy children.\n\nSample Input 1\n\n3 70\n20 30 10\n\nSample Output 1\n\n2\n\nOne optimal way to distribute sweets is (20, 30, 20).\n\nSample Input 2\n\n3 10\n20 30 10\n\nSample Output 2\n\n1\n\nThe optimal way to distribute sweets is (0, 0, 10).\n\nSample Input 3\n\n4 1111\n1 10 100 1000\n\nSample Output 3\n\n4\n\nThe optimal way to distribute sweets is (1, 10, 100, 1000).\n\nSample Input 4\n\n2 10\n20 20\n\nSample Output 4\n\n0\n\nNo children will be happy, no matter how the sweets are distributed.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 372, "cpu_time_ms": 4, "memory_kb": 2732}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s451926122", "group_id": "codeNet:p03254", "input_text": "n = io.read()\nx = io.read()\nlocal a = {}\nlocal sum = 0\nlocal result = 0\nfor i=1,n do\n\ta[i] = io.read()\nend\n\n\nfor i=1,n-1 do\n\tfor j=i+1 ,n do\n\t\tif a[i] > a[j] then\n\t\t\ta[i],a[j] = a[j],a[i]\n\t\tend\n\tend\nend\n\nfor i=1,n do\n\tif sum + a[i] <= x then\n\t\tsum = sum + a[i]\n\t\tresult = result + 1\n\tend\nend\n\nprint(result)", "language": "Lua", "metadata": {"date": 1542341432, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03254.html", "problem_id": "p03254", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03254/input.txt", "sample_output_relpath": "derived/input_output/data/p03254/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03254/Lua/s451926122.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s451926122", "user_id": "u089230684"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "n = io.read()\nx = io.read()\nlocal a = {}\nlocal sum = 0\nlocal result = 0\nfor i=1,n do\n\ta[i] = io.read()\nend\n\n\nfor i=1,n-1 do\n\tfor j=i+1 ,n do\n\t\tif a[i] > a[j] then\n\t\t\ta[i],a[j] = a[j],a[i]\n\t\tend\n\tend\nend\n\nfor i=1,n do\n\tif sum + a[i] <= x then\n\t\tsum = sum + a[i]\n\t\tresult = result + 1\n\tend\nend\n\nprint(result)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N children, numbered 1, 2, ..., N.\n\nSnuke has decided to distribute x sweets among them.\nHe needs to give out all the x sweets, but some of the children may get zero sweets.\n\nFor each i (1 \\leq i \\leq N), Child i will be happy if he/she gets exactly a_i sweets.\nSnuke is trying to maximize the number of happy children by optimally distributing the sweets.\nFind the maximum possible number of happy children.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n1 \\leq x \\leq 10^9\n\n1 \\leq a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN x\na_1 a_2 ... a_N\n\nOutput\n\nPrint the maximum possible number of happy children.\n\nSample Input 1\n\n3 70\n20 30 10\n\nSample Output 1\n\n2\n\nOne optimal way to distribute sweets is (20, 30, 20).\n\nSample Input 2\n\n3 10\n20 30 10\n\nSample Output 2\n\n1\n\nThe optimal way to distribute sweets is (0, 0, 10).\n\nSample Input 3\n\n4 1111\n1 10 100 1000\n\nSample Output 3\n\n4\n\nThe optimal way to distribute sweets is (1, 10, 100, 1000).\n\nSample Input 4\n\n2 10\n20 20\n\nSample Output 4\n\n0\n\nNo children will be happy, no matter how the sweets are distributed.", "sample_input": "3 70\n20 30 10\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03254", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N children, numbered 1, 2, ..., N.\n\nSnuke has decided to distribute x sweets among them.\nHe needs to give out all the x sweets, but some of the children may get zero sweets.\n\nFor each i (1 \\leq i \\leq N), Child i will be happy if he/she gets exactly a_i sweets.\nSnuke is trying to maximize the number of happy children by optimally distributing the sweets.\nFind the maximum possible number of happy children.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n1 \\leq x \\leq 10^9\n\n1 \\leq a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN x\na_1 a_2 ... a_N\n\nOutput\n\nPrint the maximum possible number of happy children.\n\nSample Input 1\n\n3 70\n20 30 10\n\nSample Output 1\n\n2\n\nOne optimal way to distribute sweets is (20, 30, 20).\n\nSample Input 2\n\n3 10\n20 30 10\n\nSample Output 2\n\n1\n\nThe optimal way to distribute sweets is (0, 0, 10).\n\nSample Input 3\n\n4 1111\n1 10 100 1000\n\nSample Output 3\n\n4\n\nThe optimal way to distribute sweets is (1, 10, 100, 1000).\n\nSample Input 4\n\n2 10\n20 20\n\nSample Output 4\n\n0\n\nNo children will be happy, no matter how the sweets are distributed.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 306, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s221300523", "group_id": "codeNet:p03263", "input_text": "local h,w=io.read(\"n\",\"n\")\nlocal a={}\nfor i=1,h do\n a[i]={}\n for j=1,w do\n a[i][j]=io.read(\"n\")\n end\nend\n\nlocal bit=require(\"bit\")\nlocal operation={}\nfor i=1,h do\n for j=1,w do\n if bit.band(a[i][j],1)>0 then\n if j0 then\n if j 1 or N <= 0 then\n print(v)\n break\n end\n N = N - 1\nend\n", "language": "Lua", "metadata": {"date": 1534643157, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s731860282.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s731860282", "user_id": "u374892957"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "S = tostring(io.read(\"*n\"))\nN = io.read(\"*n\")\n\nfor v in string.gmatch(S, \"%d\") do\n if tonumber(v) > 1 or N <= 0 then\n print(v)\n break\n end\n N = N - 1\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 63, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s579075649", "group_id": "codeNet:p03284", "input_text": "local n, k = io.read(\"*n\", \"*n\")\nprint(n % k == 0 and 0 or 1)\n", "language": "Lua", "metadata": {"date": 1559568517, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s579075649.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s579075649", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local n, k = io.read(\"*n\", \"*n\")\nprint(n % k == 0 and 0 or 1)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s977930239", "group_id": "codeNet:p03284", "input_text": "N=io.read(\"n\")\nK=io.read(\"n\")\nif N%K~=0 then\n print(1)\n else\n print(0)\nend", "language": "Lua", "metadata": {"date": 1550347004, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s977930239.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s977930239", "user_id": "u015229643"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "N=io.read(\"n\")\nK=io.read(\"n\")\nif N%K~=0 then\n print(1)\n else\n print(0)\nend", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 77, "cpu_time_ms": 8, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s175090959", "group_id": "codeNet:p03285", "input_text": "local N = io.read(\"*n\")\n\nlocal max_7 = math.modf(N / 7)\n\nlocal isYes = false\nfor i = 0, max_7 do\n\tlocal without_7 = N - 7 * i\n\tif without_7 % 4 == 0 then\n\t\tisYes = true\n\t\tbreak\n\tend\nend\n\nprint(isYes and \"Yes\" or \"No\")", "language": "Lua", "metadata": {"date": 1588289075, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s175090959.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s175090959", "user_id": "u793881115"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local N = io.read(\"*n\")\n\nlocal max_7 = math.modf(N / 7)\n\nlocal isYes = false\nfor i = 0, max_7 do\n\tlocal without_7 = N - 7 * i\n\tif without_7 % 4 == 0 then\n\t\tisYes = true\n\t\tbreak\n\tend\nend\n\nprint(isYes and \"Yes\" or \"No\")", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 217, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s190813815", "group_id": "codeNet:p03285", "input_text": "local n = io.read(\"*n\")\nif n % 4 == 0 then\n print(\"Yes\")\nelseif n % 4 == 1 then\n print(21 <= n and \"Yes\" or \"No\")\nelseif n % 4 == 2 then\n print(14 <= n and \"Yes\" or \"No\")\nelse\n print(7 <= n and \"Yes\" or \"No\")\nend\n", "language": "Lua", "metadata": {"date": 1559568401, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s190813815.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s190813815", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local n = io.read(\"*n\")\nif n % 4 == 0 then\n print(\"Yes\")\nelseif n % 4 == 1 then\n print(21 <= n and \"Yes\" or \"No\")\nelseif n % 4 == 2 then\n print(14 <= n and \"Yes\" or \"No\")\nelse\n print(7 <= n and \"Yes\" or \"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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 217, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s306593802", "group_id": "codeNet:p03285", "input_text": "N = io.read(\"*n\")\n\nans = \"No\"\n\nfor v = 0, 6 do\n t = N - 4*v\n if t >= 0 and t % 7 == 0 then\n ans = \"Yes\"\n break\n end\nend\n\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1534037596, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s306593802.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s306593802", "user_id": "u374892957"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "N = io.read(\"*n\")\n\nans = \"No\"\n\nfor v = 0, 6 do\n t = N - 4*v\n if t >= 0 and t % 7 == 0 then\n ans = \"Yes\"\n break\n end\nend\n\nprint(ans)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 508}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s784488930", "group_id": "codeNet:p03286", "input_text": "local DBG = false\nlocal function dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nlocal function baseneg2_tostr(t)\n if #t == 0 then\n return \"0\"\n else\n local r = {}\n for i=#t,1,-1 do\n table.insert(r, t[i])\n end\n return table.concat(r, \"\")\n end\nend\n\nlocal function baseneg2_to_dec(t)\n if #t == 0 then\n return 0\n else\n local n = 0\n for i=0,#t-1 do\n n = n + t[i+1]*(-2)^i\n end\n return math.floor(n)\n end\nend\n\nlocal function dec_to_baseneg2(n)\n dbgpr(\"dec_to_baseneg2\", n)\n local t = {}\n local i = 1\n while n ~= 0 do\n local b = math.floor((-2)^i)\n local bb = math.floor((-2)^(i-1))\n dbgpr(\"ibnbb\", i, b, n, bb)\n local q, r = math.abs(n // b) - 1, nil\n while true do\n dbgpr(\"rem\", n, q, b*q, b*-q, bb)\n if n == b * q then\n q = q\n r = 0\n break\n elseif n == b * q + bb then\n q = q\n r = 1\n break\n elseif n == b * -q then\n q = -q\n r = 0\n break\n elseif n == b * -q + bb then\n q = -q\n r = 1\n break\n end\n q = q + 1\n end\n local rr = r * bb\n dbgpr(\"r rr\", r, rr)\n n = n - rr\n dbgpr(\"newn\", n)\n table.insert(t, r)\n i = i + 1\n end\n return t\nend\n\nlocal function test(n)\n local t = dec_to_baseneg2(n)\n --print(\"res\", n, baseneg2_tostr(t))\n assert(n == baseneg2_to_dec(t))\nend\n\n\ntest(0)\ntest(1)\ntest(-2)\ntest(-1)\ntest(-9)\ntest(123456789)\n\nprint(baseneg2_tostr(dec_to_baseneg2(io.read(\"n\"))))\n", "language": "Lua", "metadata": {"date": 1573880476, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03286.html", "problem_id": "p03286", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03286/input.txt", "sample_output_relpath": "derived/input_output/data/p03286/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03286/Lua/s784488930.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s784488930", "user_id": "u162773977"}, "prompt_components": {"gold_output": "1011\n", "input_to_evaluate": "local DBG = false\nlocal function dbgpr(...)\n if DBG then\n io.write(\"[dbg]\")\n print(...)\n end\nend\n\nlocal function baseneg2_tostr(t)\n if #t == 0 then\n return \"0\"\n else\n local r = {}\n for i=#t,1,-1 do\n table.insert(r, t[i])\n end\n return table.concat(r, \"\")\n end\nend\n\nlocal function baseneg2_to_dec(t)\n if #t == 0 then\n return 0\n else\n local n = 0\n for i=0,#t-1 do\n n = n + t[i+1]*(-2)^i\n end\n return math.floor(n)\n end\nend\n\nlocal function dec_to_baseneg2(n)\n dbgpr(\"dec_to_baseneg2\", n)\n local t = {}\n local i = 1\n while n ~= 0 do\n local b = math.floor((-2)^i)\n local bb = math.floor((-2)^(i-1))\n dbgpr(\"ibnbb\", i, b, n, bb)\n local q, r = math.abs(n // b) - 1, nil\n while true do\n dbgpr(\"rem\", n, q, b*q, b*-q, bb)\n if n == b * q then\n q = q\n r = 0\n break\n elseif n == b * q + bb then\n q = q\n r = 1\n break\n elseif n == b * -q then\n q = -q\n r = 0\n break\n elseif n == b * -q + bb then\n q = -q\n r = 1\n break\n end\n q = q + 1\n end\n local rr = r * bb\n dbgpr(\"r rr\", r, rr)\n n = n - rr\n dbgpr(\"newn\", n)\n table.insert(t, r)\n i = i + 1\n end\n return t\nend\n\nlocal function test(n)\n local t = dec_to_baseneg2(n)\n --print(\"res\", n, baseneg2_tostr(t))\n assert(n == baseneg2_to_dec(t))\nend\n\n\ntest(0)\ntest(1)\ntest(-2)\ntest(-1)\ntest(-9)\ntest(123456789)\n\nprint(baseneg2_tostr(dec_to_baseneg2(io.read(\"n\"))))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven an integer N, find the base -2 representation of N.\n\nHere, S is the base -2 representation of N when the following are all satisfied:\n\nS is a string consisting of 0 and 1.\n\nUnless S = 0, the initial character of S is 1.\n\nLet S = S_k S_{k-1} ... S_0, then S_0 \\times (-2)^0 + S_1 \\times (-2)^1 + ... + S_k \\times (-2)^k = N.\n\nIt can be proved that, for any integer M, the base -2 representation of M is uniquely determined.\n\nConstraints\n\nEvery value in input is integer.\n\n-10^9 \\leq N \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the base -2 representation of N.\n\nSample Input 1\n\n-9\n\nSample Output 1\n\n1011\n\nAs (-2)^0 + (-2)^1 + (-2)^3 = 1 + (-2) + (-8) = -9, 1011 is the base -2 representation of -9.\n\nSample Input 2\n\n123456789\n\nSample Output 2\n\n11000101011001101110100010101\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "sample_input": "-9\n"}, "reference_outputs": ["1011\n"], "source_document_id": "p03286", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven an integer N, find the base -2 representation of N.\n\nHere, S is the base -2 representation of N when the following are all satisfied:\n\nS is a string consisting of 0 and 1.\n\nUnless S = 0, the initial character of S is 1.\n\nLet S = S_k S_{k-1} ... S_0, then S_0 \\times (-2)^0 + S_1 \\times (-2)^1 + ... + S_k \\times (-2)^k = N.\n\nIt can be proved that, for any integer M, the base -2 representation of M is uniquely determined.\n\nConstraints\n\nEvery value in input is integer.\n\n-10^9 \\leq N \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the base -2 representation of N.\n\nSample Input 1\n\n-9\n\nSample Output 1\n\n1011\n\nAs (-2)^0 + (-2)^1 + (-2)^3 = 1 + (-2) + (-8) = -9, 1011 is the base -2 representation of -9.\n\nSample Input 2\n\n123456789\n\nSample Output 2\n\n11000101011001101110100010101\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1786, "cpu_time_ms": 4, "memory_kb": 508}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s958164604", "group_id": "codeNet:p03287", "input_text": "N=io.read(\"n\")\nM=io.read(\"n\")\nc={}\nfor i=1,N do\n c[i]=io.read(\"n\")\nend\nres=0\nfor i=1,N do\n k=0\n for j=i,N do\n k=k+c[j]\n if k%M==0 then \n res=res+1\n end\n end\nend\nprint(res)\n\n", "language": "Lua", "metadata": {"date": 1550368365, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s958164604.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s958164604", "user_id": "u015229643"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "N=io.read(\"n\")\nM=io.read(\"n\")\nc={}\nfor i=1,N do\n c[i]=io.read(\"n\")\nend\nres=0\nfor i=1,N do\n k=0\n for j=i,N do\n k=k+c[j]\n if k%M==0 then \n res=res+1\n end\n end\nend\nprint(res)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 2424}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s428679657", "group_id": "codeNet:p03288", "input_text": "a = io.read(\"*n\")\nif a < 1200 then\n print(\"ABC\")\nelseif a < 2800 then\n print(\"ARC\")\nelse\n print(\"AGC\")\nend", "language": "Lua", "metadata": {"date": 1566300407, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s428679657.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s428679657", "user_id": "u120582723"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "a = io.read(\"*n\")\nif a < 1200 then\n print(\"ABC\")\nelseif a < 2800 then\n print(\"ARC\")\nelse\n print(\"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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 109, "cpu_time_ms": 3, "memory_kb": 376}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s702078614", "group_id": "codeNet:p03289", "input_text": "s = io.read()\nn = #s\nc = 0\nr = s:sub(1, 1) == \"A\"\nfor i = 3, n - 1 do\n if s:sub(i, i) == \"C\" then\n c = c + 1\n end\nend\nif c ~= 1 then r = false end\nfor i = 2, n do\n ss = s:sub(i, i)\n if ss:byte() < 96 and ss ~= \"C\" then\n r = false\n end\nend\nprint(r and \"AC\" or \"WA\")\n", "language": "Lua", "metadata": {"date": 1566360376, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s702078614.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s702078614", "user_id": "u120582723"}, "prompt_components": {"gold_output": "AC\n", "input_to_evaluate": "s = io.read()\nn = #s\nc = 0\nr = s:sub(1, 1) == \"A\"\nfor i = 3, n - 1 do\n if s:sub(i, i) == \"C\" then\n c = c + 1\n end\nend\nif c ~= 1 then r = false end\nfor i = 2, n do\n ss = s:sub(i, i)\n if ss:byte() < 96 and ss ~= \"C\" then\n r = false\n end\nend\nprint(r and \"AC\" or \"WA\")\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s043904538", "group_id": "codeNet:p03290", "input_text": "d, g = io.read(\"*n\", \"*n\")\ng = g / 100\npsum = 0\np, c = {}, {}\nfor i = 1, d do\n p[i], c[i] = io.read(\"*n\", \"*n\")\n c[i], psum = c[i] / 100, psum + p[i]\nend\nt = {}\ncurrentmax = 0\nignoremax = psum + 1\nfor i = 0, psum do t[i] = 0 end\n\nfor i_d = 1, d do\n searchmax = currentmax + p[i_d]\n for summed_count = searchmax, 0, -1 do\n i_count_min = math.max(0, summed_count - currentmax)\n i_count_max = math.min(summed_count, p[i_d])\n for i_count = i_count_min, i_count_max do\n i_score = i_count * i_d\n if(i_count == p[i_d]) then i_score = i_score + c[i_d] end\n t[summed_count] = math.max(t[summed_count], t[summed_count - i_count] + i_score)\n end\n end\n currentmax = searchmax\nend\nfor i = 1, psum do\n if(g <= t[i]) then print(i) break end\nend\n", "language": "Lua", "metadata": {"date": 1555015646, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s043904538.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s043904538", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "d, g = io.read(\"*n\", \"*n\")\ng = g / 100\npsum = 0\np, c = {}, {}\nfor i = 1, d do\n p[i], c[i] = io.read(\"*n\", \"*n\")\n c[i], psum = c[i] / 100, psum + p[i]\nend\nt = {}\ncurrentmax = 0\nignoremax = psum + 1\nfor i = 0, psum do t[i] = 0 end\n\nfor i_d = 1, d do\n searchmax = currentmax + p[i_d]\n for summed_count = searchmax, 0, -1 do\n i_count_min = math.max(0, summed_count - currentmax)\n i_count_max = math.min(summed_count, p[i_d])\n for i_count = i_count_min, i_count_max do\n i_score = i_count * i_d\n if(i_count == p[i_d]) then i_score = i_score + c[i_d] end\n t[summed_count] = math.max(t[summed_count], t[summed_count - i_count] + i_score)\n end\n end\n currentmax = searchmax\nend\nfor i = 1, psum do\n if(g <= t[i]) then print(i) break end\nend\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s730904322", "group_id": "codeNet:p03292", "input_text": "t={}\nfor i=1,3 do\n t[i]=io.read(\"n\")\nend\ntable.sort(t)\nprint(t[3]-t[1])", "language": "Lua", "metadata": {"date": 1550526078, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s730904322.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s730904322", "user_id": "u015229643"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "t={}\nfor i=1,3 do\n t[i]=io.read(\"n\")\nend\ntable.sort(t)\nprint(t[3]-t[1])", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 72, "cpu_time_ms": 7, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s264995245", "group_id": "codeNet:p03292", "input_text": "local a, b, c = string.match(io.read(), \"(%d+) (%d+) (%d+)\")\na, b, c = tonumber(a), tonumber(b), tonumber(c)\n\nlocal arr = {\n a, b, c\n}\n\nlocal max = 0\nlocal min = 0\n\nfor i = 1, 3 do\n if max == 0 then\n max = arr[i]\n elseif arr[i] > max then\n max = arr[i]\n end\n\n if min == 0 then\n min = arr[i]\n elseif arr[i] < min then\n min = arr[i]\n end\nend\n\nlocal output = max - min\n\nprint(tostring(output))", "language": "Lua", "metadata": {"date": 1532222101, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s264995245.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s264995245", "user_id": "u467107062"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local a, b, c = string.match(io.read(), \"(%d+) (%d+) (%d+)\")\na, b, c = tonumber(a), tonumber(b), tonumber(c)\n\nlocal arr = {\n a, b, c\n}\n\nlocal max = 0\nlocal min = 0\n\nfor i = 1, 3 do\n if max == 0 then\n max = arr[i]\n elseif arr[i] > max then\n max = arr[i]\n end\n\n if min == 0 then\n min = arr[i]\n elseif arr[i] < min then\n min = arr[i]\n end\nend\n\nlocal output = max - min\n\nprint(tostring(output))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s110771594", "group_id": "codeNet:p03293", "input_text": "\nlocal a, b = io.read(\"*l\"), io.read(\"*l\")\n\nlocal x = string.len(a)\nlocal sum = 0\n\nfor i = 1, math.huge do\n\n if a == b then\n print(\"Yes\")\n break\n else\n a = string.sub(a, -1) .. string.sub(a, 1, -2)\n end\n sum = sum + 1\n if sum == x then\n print(\"No\")\n break\n end\n\nend", "language": "Lua", "metadata": {"date": 1532224236, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s110771594.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s110771594", "user_id": "u467107062"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "\nlocal a, b = io.read(\"*l\"), io.read(\"*l\")\n\nlocal x = string.len(a)\nlocal sum = 0\n\nfor i = 1, math.huge do\n\n if a == b then\n print(\"Yes\")\n break\n else\n a = string.sub(a, -1) .. string.sub(a, 1, -2)\n end\n sum = sum + 1\n if sum == x then\n print(\"No\")\n break\n end\n\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 67, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s683795872", "group_id": "codeNet:p03297", "input_text": "function M(n,t)\n for i,v in pairs(t) do\n if n == v then\n return true\n end\n end\n return false\nend\n\nT = io.read(\"*n\")\n\nA = {}\nB = {}\nC = {}\nD = {}\n\n\nfor v = 1,T do\n table.insert(A, io.read(\"*n\"))\n table.insert(B, io.read(\"*n\"))\n table.insert(C, io.read(\"*n\"))\n table.insert(D, io.read(\"*n\"))\nend\n\nfor v = 1,T do\n local j = A[v]\n local W = {}\n local ret = \"No\"\n\n while j >= 0 do\n if M(j, W) then\n ret = \"Yes\"\n break\n else\n table.insert(W, j)\n end\n\n if j >= B[v] then\n j = j % B[v]\n else\n break\n end\n\n if j <= C[v] then\n j = j + D[v]\n else\n break\n end\n end\n\n print(ret)\nend", "language": "Lua", "metadata": {"date": 1531624522, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s683795872.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s683795872", "user_id": "u374892957"}, "prompt_components": {"gold_output": "No\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\n", "input_to_evaluate": "function M(n,t)\n for i,v in pairs(t) do\n if n == v then\n return true\n end\n end\n return false\nend\n\nT = io.read(\"*n\")\n\nA = {}\nB = {}\nC = {}\nD = {}\n\n\nfor v = 1,T do\n table.insert(A, io.read(\"*n\"))\n table.insert(B, io.read(\"*n\"))\n table.insert(C, io.read(\"*n\"))\n table.insert(D, io.read(\"*n\"))\nend\n\nfor v = 1,T do\n local j = A[v]\n local W = {}\n local ret = \"No\"\n\n while j >= 0 do\n if M(j, W) then\n ret = \"Yes\"\n break\n else\n table.insert(W, j)\n end\n\n if j >= B[v] then\n j = j % B[v]\n else\n break\n end\n\n if j <= C[v] then\n j = j + D[v]\n else\n break\n end\n end\n\n print(ret)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s004894812", "group_id": "codeNet:p03298", "input_text": "local n=io.read(\"n\",\"l\")\nlocal s=io.read()\n\nlocal precheck=true\nlocal t={s:byte(1,2*n)}\ntable.sort(t)\nfor i=1,2*n-1,2 do\n if t[i]~=t[i+1] then\n precheck=false\n end\nend\nif not precheck then\n print(0)\n return\nend\n\nlocal rmap={}\nlocal bmap={}\nfor bit=0,(1<0 then\n local r=i+1\n local b=i+1+n\n r1=r1..\" \"..s:byte(r)\n b2=s:byte(b)..\" \"..b2\n else\n local r=i+1\n local b=i+1+n\n b1=s:byte(b)..\" \"..b1\n r2=r2..\" \"..s:byte(r)\n end\n end\n local rkey=r1..\"/\"..r2\n local bkey=b1..\"/\"..b2\n rmap[rkey]=(rmap[rkey] or 0)+1\n bmap[bkey]=(bmap[bkey] or 0)+1\nend\n\nlocal combination=0\nfor k,_ in pairs(rmap) do\n combination=combination+rmap[k]*(bmap[k] or 0)\nend\nprint(combination)", "language": "Lua", "metadata": {"date": 1598347302, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03298.html", "problem_id": "p03298", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03298/input.txt", "sample_output_relpath": "derived/input_output/data/p03298/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03298/Lua/s004894812.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s004894812", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local n=io.read(\"n\",\"l\")\nlocal s=io.read()\n\nlocal precheck=true\nlocal t={s:byte(1,2*n)}\ntable.sort(t)\nfor i=1,2*n-1,2 do\n if t[i]~=t[i+1] then\n precheck=false\n end\nend\nif not precheck then\n print(0)\n return\nend\n\nlocal rmap={}\nlocal bmap={}\nfor bit=0,(1<0 then\n local r=i+1\n local b=i+1+n\n r1=r1..\" \"..s:byte(r)\n b2=s:byte(b)..\" \"..b2\n else\n local r=i+1\n local b=i+1+n\n b1=s:byte(b)..\" \"..b1\n r2=r2..\" \"..s:byte(r)\n end\n end\n local rkey=r1..\"/\"..r2\n local bkey=b1..\"/\"..b2\n rmap[rkey]=(rmap[rkey] or 0)+1\n bmap[bkey]=(bmap[bkey] or 0)+1\nend\n\nlocal combination=0\nfor k,_ in pairs(rmap) do\n combination=combination+rmap[k]*(bmap[k] or 0)\nend\nprint(combination)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string S of length 2N consisting of lowercase English letters.\n\nThere are 2^{2N} ways to color each character in S red or blue. Among these ways, how many satisfy the following condition?\n\nThe string obtained by reading the characters painted red from left to right is equal to the string obtained by reading the characters painted blue from right to left.\n\nConstraints\n\n1 \\leq N \\leq 18\n\nThe length of S is 2N.\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 number of ways to paint the string that satisfy the condition.\n\nSample Input 1\n\n4\ncabaacba\n\nSample Output 1\n\n4\n\nThere are four ways to paint the string, as follows:\n\ncabaacba\n\ncabaacba\n\ncabaacba\n\ncabaacba\n\nSample Input 2\n\n11\nmippiisssisssiipsspiim\n\nSample Output 2\n\n504\n\nSample Input 3\n\n4\nabcdefgh\n\nSample Output 3\n\n0\n\nSample Input 4\n\n18\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n\nSample Output 4\n\n9075135300\n\nThe answer may not be representable as a 32-bit integer.", "sample_input": "4\ncabaacba\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03298", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string S of length 2N consisting of lowercase English letters.\n\nThere are 2^{2N} ways to color each character in S red or blue. Among these ways, how many satisfy the following condition?\n\nThe string obtained by reading the characters painted red from left to right is equal to the string obtained by reading the characters painted blue from right to left.\n\nConstraints\n\n1 \\leq N \\leq 18\n\nThe length of S is 2N.\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 number of ways to paint the string that satisfy the condition.\n\nSample Input 1\n\n4\ncabaacba\n\nSample Output 1\n\n4\n\nThere are four ways to paint the string, as follows:\n\ncabaacba\n\ncabaacba\n\ncabaacba\n\ncabaacba\n\nSample Input 2\n\n11\nmippiisssisssiipsspiim\n\nSample Output 2\n\n504\n\nSample Input 3\n\n4\nabcdefgh\n\nSample Output 3\n\n0\n\nSample Input 4\n\n18\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n\nSample Output 4\n\n9075135300\n\nThe answer may not be representable as a 32-bit integer.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 910, "cpu_time_ms": 3311, "memory_kb": 105304}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s610061577", "group_id": "codeNet:p03298", "input_text": "local n=io.read(\"n\",\"l\")\nlocal s=io.read()\n\nlocal precheck=true\nlocal t={s:byte(1,2*n)}\ntable.sort(t)\nfor i=1,2*n-1,2 do\n if t[i]~=t[i+1] then\n precheck=false\n end\nend\nif not precheck then\n print(0)\n return\nend\n\nlocal rmap={}\nlocal bmap={}\nfor bit=0,(1<0 then\n local r=i+1\n local b=i+1+n\n r1=r1..s:sub(r,r)\n b2=s:sub(b,b)..b2\n else\n local r=i+1\n local b=i+1+n\n b1=s:sub(b,b)..b1\n r2=r2..s:sub(r,r)\n end\n end\n local rkey=r1..\" \"..r2\n local bkey=b1..\" \"..b2\n rmap[rkey]=(rmap[rkey] or 0)+1\n bmap[bkey]=(bmap[bkey] or 0)+1\nend\n\nlocal combination=0\nfor k,_ in pairs(rmap) do\n combination=combination+rmap[k]*(bmap[k] or 0)\nend\nprint(combination)", "language": "Lua", "metadata": {"date": 1598347015, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03298.html", "problem_id": "p03298", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03298/input.txt", "sample_output_relpath": "derived/input_output/data/p03298/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03298/Lua/s610061577.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s610061577", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local n=io.read(\"n\",\"l\")\nlocal s=io.read()\n\nlocal precheck=true\nlocal t={s:byte(1,2*n)}\ntable.sort(t)\nfor i=1,2*n-1,2 do\n if t[i]~=t[i+1] then\n precheck=false\n end\nend\nif not precheck then\n print(0)\n return\nend\n\nlocal rmap={}\nlocal bmap={}\nfor bit=0,(1<0 then\n local r=i+1\n local b=i+1+n\n r1=r1..s:sub(r,r)\n b2=s:sub(b,b)..b2\n else\n local r=i+1\n local b=i+1+n\n b1=s:sub(b,b)..b1\n r2=r2..s:sub(r,r)\n end\n end\n local rkey=r1..\" \"..r2\n local bkey=b1..\" \"..b2\n rmap[rkey]=(rmap[rkey] or 0)+1\n bmap[bkey]=(bmap[bkey] or 0)+1\nend\n\nlocal combination=0\nfor k,_ in pairs(rmap) do\n combination=combination+rmap[k]*(bmap[k] or 0)\nend\nprint(combination)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string S of length 2N consisting of lowercase English letters.\n\nThere are 2^{2N} ways to color each character in S red or blue. Among these ways, how many satisfy the following condition?\n\nThe string obtained by reading the characters painted red from left to right is equal to the string obtained by reading the characters painted blue from right to left.\n\nConstraints\n\n1 \\leq N \\leq 18\n\nThe length of S is 2N.\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 number of ways to paint the string that satisfy the condition.\n\nSample Input 1\n\n4\ncabaacba\n\nSample Output 1\n\n4\n\nThere are four ways to paint the string, as follows:\n\ncabaacba\n\ncabaacba\n\ncabaacba\n\ncabaacba\n\nSample Input 2\n\n11\nmippiisssisssiipsspiim\n\nSample Output 2\n\n504\n\nSample Input 3\n\n4\nabcdefgh\n\nSample Output 3\n\n0\n\nSample Input 4\n\n18\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n\nSample Output 4\n\n9075135300\n\nThe answer may not be representable as a 32-bit integer.", "sample_input": "4\ncabaacba\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03298", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string S of length 2N consisting of lowercase English letters.\n\nThere are 2^{2N} ways to color each character in S red or blue. Among these ways, how many satisfy the following condition?\n\nThe string obtained by reading the characters painted red from left to right is equal to the string obtained by reading the characters painted blue from right to left.\n\nConstraints\n\n1 \\leq N \\leq 18\n\nThe length of S is 2N.\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 number of ways to paint the string that satisfy the condition.\n\nSample Input 1\n\n4\ncabaacba\n\nSample Output 1\n\n4\n\nThere are four ways to paint the string, as follows:\n\ncabaacba\n\ncabaacba\n\ncabaacba\n\ncabaacba\n\nSample Input 2\n\n11\nmippiisssisssiipsspiim\n\nSample Output 2\n\n504\n\nSample Input 3\n\n4\nabcdefgh\n\nSample Output 3\n\n0\n\nSample Input 4\n\n18\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n\nSample Output 4\n\n9075135300\n\nThe answer may not be representable as a 32-bit integer.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2653, "memory_kb": 76976}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s870093146", "group_id": "codeNet:p03298", "input_text": "local mfl = math.floor\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal tot = 1\nfor i = 1, n do\n tot = tot * 2\nend\nlocal first_str_by_ruse = {}\nfor i = 0, n do\n first_str_by_ruse[i] = {}\nend\nfor i = 0, tot - 1 do\n local left = 1\n local right = n\n local t = {}\n for j = 1, n do\n t[j] = 0\n end\n local ruse = 0\n for j = 1, n do\n if i % 2 == 0 then\n t[left] = s:sub(j, j)\n ruse = ruse + 1\n left = left + 1\n else\n t[right] = s:sub(j, j)\n right = right - 1\n end\n i = mfl(i / 2)\n end\n local str = table.concat(t)\n if first_str_by_ruse[ruse][str] then\n first_str_by_ruse[ruse][str] = first_str_by_ruse[ruse][str] + 1\n else\n first_str_by_ruse[ruse][str] = 1\n end\nend\nlocal ret = 0\nfor i = 0, tot - 1 do\n local left = 1\n local right = n\n local t = {}\n for j = 1, n do\n t[j] = 0\n end\n local ruse = 0\n for j = n, 1, -1 do\n if i % 2 == 0 then\n t[left] = s:sub(j + n, j + n)\n ruse = ruse + 1\n left = left + 1\n else\n t[right] = s:sub(j + n, j + n)\n right = right - 1\n end\n i = mfl(i / 2)\n end\n local str = table.concat(t)\n if first_str_by_ruse[ruse][str] then\n ret = ret + first_str_by_ruse[ruse][str]\n end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1573050352, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03298.html", "problem_id": "p03298", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03298/input.txt", "sample_output_relpath": "derived/input_output/data/p03298/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03298/Lua/s870093146.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s870093146", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local mfl = math.floor\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal tot = 1\nfor i = 1, n do\n tot = tot * 2\nend\nlocal first_str_by_ruse = {}\nfor i = 0, n do\n first_str_by_ruse[i] = {}\nend\nfor i = 0, tot - 1 do\n local left = 1\n local right = n\n local t = {}\n for j = 1, n do\n t[j] = 0\n end\n local ruse = 0\n for j = 1, n do\n if i % 2 == 0 then\n t[left] = s:sub(j, j)\n ruse = ruse + 1\n left = left + 1\n else\n t[right] = s:sub(j, j)\n right = right - 1\n end\n i = mfl(i / 2)\n end\n local str = table.concat(t)\n if first_str_by_ruse[ruse][str] then\n first_str_by_ruse[ruse][str] = first_str_by_ruse[ruse][str] + 1\n else\n first_str_by_ruse[ruse][str] = 1\n end\nend\nlocal ret = 0\nfor i = 0, tot - 1 do\n local left = 1\n local right = n\n local t = {}\n for j = 1, n do\n t[j] = 0\n end\n local ruse = 0\n for j = n, 1, -1 do\n if i % 2 == 0 then\n t[left] = s:sub(j + n, j + n)\n ruse = ruse + 1\n left = left + 1\n else\n t[right] = s:sub(j + n, j + n)\n right = right - 1\n end\n i = mfl(i / 2)\n end\n local str = table.concat(t)\n if first_str_by_ruse[ruse][str] then\n ret = ret + first_str_by_ruse[ruse][str]\n end\nend\nprint(ret)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string S of length 2N consisting of lowercase English letters.\n\nThere are 2^{2N} ways to color each character in S red or blue. Among these ways, how many satisfy the following condition?\n\nThe string obtained by reading the characters painted red from left to right is equal to the string obtained by reading the characters painted blue from right to left.\n\nConstraints\n\n1 \\leq N \\leq 18\n\nThe length of S is 2N.\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 number of ways to paint the string that satisfy the condition.\n\nSample Input 1\n\n4\ncabaacba\n\nSample Output 1\n\n4\n\nThere are four ways to paint the string, as follows:\n\ncabaacba\n\ncabaacba\n\ncabaacba\n\ncabaacba\n\nSample Input 2\n\n11\nmippiisssisssiipsspiim\n\nSample Output 2\n\n504\n\nSample Input 3\n\n4\nabcdefgh\n\nSample Output 3\n\n0\n\nSample Input 4\n\n18\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n\nSample Output 4\n\n9075135300\n\nThe answer may not be representable as a 32-bit integer.", "sample_input": "4\ncabaacba\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03298", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string S of length 2N consisting of lowercase English letters.\n\nThere are 2^{2N} ways to color each character in S red or blue. Among these ways, how many satisfy the following condition?\n\nThe string obtained by reading the characters painted red from left to right is equal to the string obtained by reading the characters painted blue from right to left.\n\nConstraints\n\n1 \\leq N \\leq 18\n\nThe length of S is 2N.\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 number of ways to paint the string that satisfy the condition.\n\nSample Input 1\n\n4\ncabaacba\n\nSample Output 1\n\n4\n\nThere are four ways to paint the string, as follows:\n\ncabaacba\n\ncabaacba\n\ncabaacba\n\ncabaacba\n\nSample Input 2\n\n11\nmippiisssisssiipsspiim\n\nSample Output 2\n\n504\n\nSample Input 3\n\n4\nabcdefgh\n\nSample Output 3\n\n0\n\nSample Input 4\n\n18\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n\nSample Output 4\n\n9075135300\n\nThe answer may not be representable as a 32-bit integer.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1228, "cpu_time_ms": 1165, "memory_kb": 33128}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s408058328", "group_id": "codeNet:p03302", "input_text": "a, b = io.read(\"*n\", \"*n\")\nif a + b == 15 then print(\"+\")\nelseif a * b == 15 then print(\"*\")\nelse print(\"x\")\nend", "language": "Lua", "metadata": {"date": 1582088754, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03302.html", "problem_id": "p03302", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03302/input.txt", "sample_output_relpath": "derived/input_output/data/p03302/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03302/Lua/s408058328.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s408058328", "user_id": "u120582723"}, "prompt_components": {"gold_output": "+\n", "input_to_evaluate": "a, b = io.read(\"*n\", \"*n\")\nif a + b == 15 then print(\"+\")\nelseif a * b == 15 then print(\"*\")\nelse print(\"x\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers a and b.\nDetermine if a+b=15 or a\\times b=15 or neither holds.\n\nNote that a+b=15 and a\\times b=15 do not hold at the same time.\n\nConstraints\n\n1 \\leq a,b \\leq 15\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf a+b=15, print +;\nif a\\times b=15, print *;\nif neither holds, print x.\n\nSample Input 1\n\n4 11\n\nSample Output 1\n\n+\n\n4+11=15.\n\nSample Input 2\n\n3 5\n\nSample Output 2\n\n*\n\n3\\times 5=15.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\nx\n\n1+1=2 and 1\\times 1=1, neither of which is 15.", "sample_input": "4 11\n"}, "reference_outputs": ["+\n"], "source_document_id": "p03302", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers a and b.\nDetermine if a+b=15 or a\\times b=15 or neither holds.\n\nNote that a+b=15 and a\\times b=15 do not hold at the same time.\n\nConstraints\n\n1 \\leq a,b \\leq 15\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf a+b=15, print +;\nif a\\times b=15, print *;\nif neither holds, print x.\n\nSample Input 1\n\n4 11\n\nSample Output 1\n\n+\n\n4+11=15.\n\nSample Input 2\n\n3 5\n\nSample Output 2\n\n*\n\n3\\times 5=15.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\nx\n\n1+1=2 and 1\\times 1=1, neither of which is 15.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s117939793", "group_id": "codeNet:p03304", "input_text": "local n, m, d = io.read(\"*n\", \"*n\", \"*n\")\nlocal mul = 1 / n\nif d ~= 0 then\n mul = 2 * (n - d) / n / n\nend\nprint(string.format(\"%.10f\", mul * (m - 1)))\n", "language": "Lua", "metadata": {"date": 1560482258, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03304.html", "problem_id": "p03304", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03304/input.txt", "sample_output_relpath": "derived/input_output/data/p03304/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03304/Lua/s117939793.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s117939793", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1.0000000000\n", "input_to_evaluate": "local n, m, d = io.read(\"*n\", \"*n\", \"*n\")\nlocal mul = 1 / n\nif d ~= 0 then\n mul = 2 * (n - d) / n / n\nend\nprint(string.format(\"%.10f\", mul * (m - 1)))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nLet us define the beauty of a sequence (a_1,... ,a_n) as the number of pairs of two adjacent elements in it whose absolute differences are d.\nFor example, when d=1, the beauty of the sequence (3, 2, 3, 10, 9) is 3.\n\nThere are a total of n^m sequences of length m where each element is an integer between 1 and n (inclusive).\nFind the beauty of each of these n^m sequences, and print the average of those values.\n\nConstraints\n\n0 \\leq d < n \\leq 10^9\n\n2 \\leq m \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m d\n\nOutput\n\nPrint the average of the beauties of the sequences of length m where each element is an integer between 1 and n.\nThe output will be judged correct if the absolute or relative error is at most 10^{-6}.\n\nSample Input 1\n\n2 3 1\n\nSample Output 1\n\n1.0000000000\n\nThe beauty of (1,1,1) is 0.\n\nThe beauty of (1,1,2) is 1.\n\nThe beauty of (1,2,1) is 2.\n\nThe beauty of (1,2,2) is 1.\n\nThe beauty of (2,1,1) is 1.\n\nThe beauty of (2,1,2) is 2.\n\nThe beauty of (2,2,1) is 1.\n\nThe beauty of (2,2,2) is 0.\n\nThe answer is the average of these values: (0+1+2+1+1+2+1+0)/8=1.\n\nSample Input 2\n\n1000000000 180707 0\n\nSample Output 2\n\n0.0001807060", "sample_input": "2 3 1\n"}, "reference_outputs": ["1.0000000000\n"], "source_document_id": "p03304", "source_text": "Score : 300 points\n\nProblem Statement\n\nLet us define the beauty of a sequence (a_1,... ,a_n) as the number of pairs of two adjacent elements in it whose absolute differences are d.\nFor example, when d=1, the beauty of the sequence (3, 2, 3, 10, 9) is 3.\n\nThere are a total of n^m sequences of length m where each element is an integer between 1 and n (inclusive).\nFind the beauty of each of these n^m sequences, and print the average of those values.\n\nConstraints\n\n0 \\leq d < n \\leq 10^9\n\n2 \\leq m \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m d\n\nOutput\n\nPrint the average of the beauties of the sequences of length m where each element is an integer between 1 and n.\nThe output will be judged correct if the absolute or relative error is at most 10^{-6}.\n\nSample Input 1\n\n2 3 1\n\nSample Output 1\n\n1.0000000000\n\nThe beauty of (1,1,1) is 0.\n\nThe beauty of (1,1,2) is 1.\n\nThe beauty of (1,2,1) is 2.\n\nThe beauty of (1,2,2) is 1.\n\nThe beauty of (2,1,1) is 1.\n\nThe beauty of (2,1,2) is 2.\n\nThe beauty of (2,2,1) is 1.\n\nThe beauty of (2,2,2) is 0.\n\nThe answer is the average of these values: (0+1+2+1+1+2+1+0)/8=1.\n\nSample Input 2\n\n1000000000 180707 0\n\nSample Output 2\n\n0.0001807060", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s182436587", "group_id": "codeNet:p03305", "input_text": "local n, m = io.read(\"*n\", \"*n\")\nlocal s, t = io.read(\"*n\", \"*n\")\nlocal edge = {}\nfor i = 1, n do edge[i] = {} end\nfor i = 1, m do\n local u, v = io.read(\"*n\", \"*n\")\n local a, b = io.read(\"*n\", \"*n\")\n edge[u][v] = {a, b}\n edge[v][u] = {a, b}\nend\n\n\nlocal function getlength(start_idx, ci)\n local taskstate = {}\n for i = 1, n do taskstate[i] = false end\n local tasks = {}\n local tasknum = 0\n local done = 0\n\n local len = {}\n local inf = -1\n for i = 1, n do len[i] = inf end\n len[start_idx] = 0\n\n local function addtask(idx)\n if not taskstate[idx] then\n taskstate[idx] = true\n tasknum = tasknum + 1\n tasks[tasknum] = idx\n end\n end\n addtask(start_idx)\n\n while done < tasknum do\n local tmp = {}\n done = done + 1\n local src = tasks[done]\n taskstate[src] = false\n for dst, cost in pairs(edge[src]) do\n if len[dst] < 0 or len[src] + cost[ci] < len[dst] then\n len[dst] = len[src] + cost[ci]\n table.insert(tmp, dst)\n end\n end\n table.sort(tmp, function(a, b) return len[a] < len[b] end)\n for i = 1, #tmp do addtask(tmp[i]) end\n end\n return len\nend\n\nlocal yen = getlength(s, 1)\nlocal snk = getlength(t, 2)\nlocal ret = {}\nfor i = 1, n - 1 do ret[i] = 0 end\nret[n] = yen[n] + snk[n]\nlocal mmi = math.min\nfor i = n - 1, 1, -1 do\n ret[i] = mmi(ret[i + 1], yen[i] + snk[i])\nend\nfor i = 1, n do\n local a = 1000000000000000LL\n a = a - ret[i]\n local str = tostring(a):gsub(\"LL\", \"\")\n print(str)\nend\n", "language": "Lua", "metadata": {"date": 1566069525, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03305.html", "problem_id": "p03305", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03305/input.txt", "sample_output_relpath": "derived/input_output/data/p03305/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03305/Lua/s182436587.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s182436587", "user_id": "u120582723"}, "prompt_components": {"gold_output": "999999999999998\n999999999999989\n999999999999979\n999999999999897\n", "input_to_evaluate": "local n, m = io.read(\"*n\", \"*n\")\nlocal s, t = io.read(\"*n\", \"*n\")\nlocal edge = {}\nfor i = 1, n do edge[i] = {} end\nfor i = 1, m do\n local u, v = io.read(\"*n\", \"*n\")\n local a, b = io.read(\"*n\", \"*n\")\n edge[u][v] = {a, b}\n edge[v][u] = {a, b}\nend\n\n\nlocal function getlength(start_idx, ci)\n local taskstate = {}\n for i = 1, n do taskstate[i] = false end\n local tasks = {}\n local tasknum = 0\n local done = 0\n\n local len = {}\n local inf = -1\n for i = 1, n do len[i] = inf end\n len[start_idx] = 0\n\n local function addtask(idx)\n if not taskstate[idx] then\n taskstate[idx] = true\n tasknum = tasknum + 1\n tasks[tasknum] = idx\n end\n end\n addtask(start_idx)\n\n while done < tasknum do\n local tmp = {}\n done = done + 1\n local src = tasks[done]\n taskstate[src] = false\n for dst, cost in pairs(edge[src]) do\n if len[dst] < 0 or len[src] + cost[ci] < len[dst] then\n len[dst] = len[src] + cost[ci]\n table.insert(tmp, dst)\n end\n end\n table.sort(tmp, function(a, b) return len[a] < len[b] end)\n for i = 1, #tmp do addtask(tmp[i]) end\n end\n return len\nend\n\nlocal yen = getlength(s, 1)\nlocal snk = getlength(t, 2)\nlocal ret = {}\nfor i = 1, n - 1 do ret[i] = 0 end\nret[n] = yen[n] + snk[n]\nlocal mmi = math.min\nfor i = n - 1, 1, -1 do\n ret[i] = mmi(ret[i + 1], yen[i] + snk[i])\nend\nfor i = 1, n do\n local a = 1000000000000000LL\n a = a - ret[i]\n local str = tostring(a):gsub(\"LL\", \"\")\n print(str)\nend\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nKenkoooo is planning a trip in Republic of Snuke.\nIn this country, there are n cities and m trains running.\nThe cities are numbered 1 through n, and the i-th train connects City u_i and v_i bidirectionally.\nAny city can be reached from any city by changing trains.\n\nTwo currencies are used in the country: yen and snuuk.\nAny train fare can be paid by both yen and snuuk.\nThe fare of the i-th train is a_i yen if paid in yen, and b_i snuuk if paid in snuuk.\n\nIn a city with a money exchange office, you can change 1 yen into 1 snuuk.\nHowever, when you do a money exchange, you have to change all your yen into snuuk.\nThat is, if Kenkoooo does a money exchange when he has X yen, he will then have X snuuk.\nCurrently, there is a money exchange office in every city, but the office in City i will shut down in i years and can never be used in and after that year.\n\nKenkoooo is planning to depart City s with 10^{15} yen in his pocket and head for City t, and change his yen into snuuk in some city while traveling.\nIt is acceptable to do the exchange in City s or City t.\n\nKenkoooo would like to have as much snuuk as possible when he reaches City t by making the optimal choices for the route to travel and the city to do the exchange.\nFor each i=0,...,n-1, find the maximum amount of snuuk that Kenkoooo has when he reaches City t if he goes on a trip from City s to City t after i years.\nYou can assume that the trip finishes within the year.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\n1 \\leq m \\leq 10^5\n\n1 \\leq s,t \\leq n\n\ns \\neq t\n\n1 \\leq u_i < v_i \\leq n\n\n1 \\leq a_i,b_i \\leq 10^9\n\nIf i\\neq j, then u_i \\neq u_j or v_i \\neq v_j.\n\nAny city can be reached from any city by changing trains.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m s t\nu_1 v_1 a_1 b_1\n:\nu_m v_m a_m b_m\n\nOutput\n\nPrint n lines.\nIn the i-th line, print the maximum amount of snuuk that Kenkoooo has when he reaches City t if he goes on a trip from City s to City t after i-1 years.\n\nSample Input 1\n\n4 3 2 3\n1 4 1 100\n1 2 1 10\n1 3 20 1\n\nSample Output 1\n\n999999999999998\n999999999999989\n999999999999979\n999999999999897\n\nAfter 0 years, it is optimal to do the exchange in City 1.\n\nAfter 1 years, it is optimal to do the exchange in City 2.\n\nNote that City 1 can still be visited even after the exchange office is closed.\nAlso note that, if it was allowed to keep 1 yen when do the exchange in City 2 and change the remaining yen into snuuk, we could reach City 3 with 999999999999998 snuuk, but this is NOT allowed.\n\nAfter 2 years, it is optimal to do the exchange in City 3.\n\nAfter 3 years, it is optimal to do the exchange in City 4.\nNote that the same train can be used multiple times.\n\nSample Input 2\n\n8 12 3 8\n2 8 685087149 857180777\n6 7 298270585 209942236\n2 4 346080035 234079976\n2 5 131857300 22507157\n4 8 30723332 173476334\n2 6 480845267 448565596\n1 4 181424400 548830121\n4 5 57429995 195056405\n7 8 160277628 479932440\n1 6 475692952 203530153\n3 5 336869679 160714712\n2 7 389775999 199123879\n\nSample Output 2\n\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994", "sample_input": "4 3 2 3\n1 4 1 100\n1 2 1 10\n1 3 20 1\n"}, "reference_outputs": ["999999999999998\n999999999999989\n999999999999979\n999999999999897\n"], "source_document_id": "p03305", "source_text": "Score : 400 points\n\nProblem Statement\n\nKenkoooo is planning a trip in Republic of Snuke.\nIn this country, there are n cities and m trains running.\nThe cities are numbered 1 through n, and the i-th train connects City u_i and v_i bidirectionally.\nAny city can be reached from any city by changing trains.\n\nTwo currencies are used in the country: yen and snuuk.\nAny train fare can be paid by both yen and snuuk.\nThe fare of the i-th train is a_i yen if paid in yen, and b_i snuuk if paid in snuuk.\n\nIn a city with a money exchange office, you can change 1 yen into 1 snuuk.\nHowever, when you do a money exchange, you have to change all your yen into snuuk.\nThat is, if Kenkoooo does a money exchange when he has X yen, he will then have X snuuk.\nCurrently, there is a money exchange office in every city, but the office in City i will shut down in i years and can never be used in and after that year.\n\nKenkoooo is planning to depart City s with 10^{15} yen in his pocket and head for City t, and change his yen into snuuk in some city while traveling.\nIt is acceptable to do the exchange in City s or City t.\n\nKenkoooo would like to have as much snuuk as possible when he reaches City t by making the optimal choices for the route to travel and the city to do the exchange.\nFor each i=0,...,n-1, find the maximum amount of snuuk that Kenkoooo has when he reaches City t if he goes on a trip from City s to City t after i years.\nYou can assume that the trip finishes within the year.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\n1 \\leq m \\leq 10^5\n\n1 \\leq s,t \\leq n\n\ns \\neq t\n\n1 \\leq u_i < v_i \\leq n\n\n1 \\leq a_i,b_i \\leq 10^9\n\nIf i\\neq j, then u_i \\neq u_j or v_i \\neq v_j.\n\nAny city can be reached from any city by changing trains.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m s t\nu_1 v_1 a_1 b_1\n:\nu_m v_m a_m b_m\n\nOutput\n\nPrint n lines.\nIn the i-th line, print the maximum amount of snuuk that Kenkoooo has when he reaches City t if he goes on a trip from City s to City t after i-1 years.\n\nSample Input 1\n\n4 3 2 3\n1 4 1 100\n1 2 1 10\n1 3 20 1\n\nSample Output 1\n\n999999999999998\n999999999999989\n999999999999979\n999999999999897\n\nAfter 0 years, it is optimal to do the exchange in City 1.\n\nAfter 1 years, it is optimal to do the exchange in City 2.\n\nNote that City 1 can still be visited even after the exchange office is closed.\nAlso note that, if it was allowed to keep 1 yen when do the exchange in City 2 and change the remaining yen into snuuk, we could reach City 3 with 999999999999998 snuuk, but this is NOT allowed.\n\nAfter 2 years, it is optimal to do the exchange in City 3.\n\nAfter 3 years, it is optimal to do the exchange in City 4.\nNote that the same train can be used multiple times.\n\nSample Input 2\n\n8 12 3 8\n2 8 685087149 857180777\n6 7 298270585 209942236\n2 4 346080035 234079976\n2 5 131857300 22507157\n4 8 30723332 173476334\n2 6 480845267 448565596\n1 4 181424400 548830121\n4 5 57429995 195056405\n7 8 160277628 479932440\n1 6 475692952 203530153\n3 5 336869679 160714712\n2 7 389775999 199123879\n\nSample Output 2\n\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1471, "cpu_time_ms": 548, "memory_kb": 55880}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s445139340", "group_id": "codeNet:p03306", "input_text": "local mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n for i = 1, mul do self.stage[stagenum][i] = i end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mmi(r, mce((l - 1) / sz) * sz)\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)\n l = newr + 1\n end\n if sz <= r + 1 - l then\n ret = self.func(ret, self.stage[stage][mce(l / sz)])\n l = l + sz\n end\n if l <= r then\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n end\n end\n return ret\nend\nSegTree.update = function(self, idx)\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\nend\nSegTree.top = function(self) return self.stage[1][1] end\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal edge = {}\nlocal updated = {}\nlocal vmin, vmax = {}, {}\nfor i = 1, n do\n edge[i] = {}\n updated[i] = true\n vmin[i] = 1\n vmax[i] = 1000000000 - 1\nend\nupdated[n + 1] = false\nvmin[n + 1], vmax[n + 1] = 1, 1000000000 - 1\nfor i = 1, m do\n local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n edge[a][b] = c\n edge[b][a] = c\n vmax[a] = c - 1\n vmax[b] = c - 1\nend\nlocal function merge(a, b)\n if not updated[a] and not updated[b] then return n + 1\n elseif not updated[a] then return b\n elseif not updated[b] then return a end\n return vmax[a] - vmin[a] < vmax[b] - vmin[b] and a or b\nend\nlocal st = SegTree.new(n, merge, n + 1)\nwhile true do\n local src = st:top()\n if n < src then break end\n updated[src] = false\n st:update(src)\n local srcmin, srcmax = vmin[src], vmax[src]\n for dst, sum in pairs(edge[src]) do\n local f = false\n if vmin[dst] < sum - srcmax then\n vmin[dst] = sum - srcmax\n f = true\n end\n if sum - srcmin < vmax[dst] then\n vmax[dst] = sum - srcmin\n f = true\n end\n if f then\n updated[dst] = true\n st:update(dst)\n end\n end\nend\nprint(math.max(0, vmax[1] - vmin[1] + 1))\n", "language": "Lua", "metadata": {"date": 1583011332, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03306.html", "problem_id": "p03306", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03306/input.txt", "sample_output_relpath": "derived/input_output/data/p03306/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03306/Lua/s445139340.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s445139340", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n for i = 1, mul do self.stage[stagenum][i] = i end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mmi(r, mce((l - 1) / sz) * sz)\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)\n l = newr + 1\n end\n if sz <= r + 1 - l then\n ret = self.func(ret, self.stage[stage][mce(l / sz)])\n l = l + sz\n end\n if l <= r then\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n end\n end\n return ret\nend\nSegTree.update = function(self, idx)\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\nend\nSegTree.top = function(self) return self.stage[1][1] end\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal edge = {}\nlocal updated = {}\nlocal vmin, vmax = {}, {}\nfor i = 1, n do\n edge[i] = {}\n updated[i] = true\n vmin[i] = 1\n vmax[i] = 1000000000 - 1\nend\nupdated[n + 1] = false\nvmin[n + 1], vmax[n + 1] = 1, 1000000000 - 1\nfor i = 1, m do\n local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n edge[a][b] = c\n edge[b][a] = c\n vmax[a] = c - 1\n vmax[b] = c - 1\nend\nlocal function merge(a, b)\n if not updated[a] and not updated[b] then return n + 1\n elseif not updated[a] then return b\n elseif not updated[b] then return a end\n return vmax[a] - vmin[a] < vmax[b] - vmin[b] and a or b\nend\nlocal st = SegTree.new(n, merge, n + 1)\nwhile true do\n local src = st:top()\n if n < src then break end\n updated[src] = false\n st:update(src)\n local srcmin, srcmax = vmin[src], vmax[src]\n for dst, sum in pairs(edge[src]) do\n local f = false\n if vmin[dst] < sum - srcmax then\n vmin[dst] = sum - srcmax\n f = true\n end\n if sum - srcmin < vmax[dst] then\n vmax[dst] = sum - srcmin\n f = true\n end\n if f then\n updated[dst] = true\n st:update(dst)\n end\n end\nend\nprint(math.max(0, vmax[1] - vmin[1] + 1))\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nKenkoooo found a simple connected graph.\nThe vertices are numbered 1 through n.\nThe i-th edge connects Vertex u_i and v_i, and has a fixed integer s_i.\n\nKenkoooo is trying to write a positive integer in each vertex so that the following condition is satisfied:\n\nFor every edge i, the sum of the positive integers written in Vertex u_i and v_i is equal to s_i.\n\nFind the number of such ways to write positive integers in the vertices.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\n1 \\leq m \\leq 10^5\n\n1 \\leq u_i < v_i \\leq n\n\n2 \\leq s_i \\leq 10^9\n\nIf i\\neq j, then u_i \\neq u_j or v_i \\neq v_j.\n\nThe graph is connected.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m\nu_1 v_1 s_1\n:\nu_m v_m s_m\n\nOutput\n\nPrint the number of ways to write positive integers in the vertices so that the condition is satisfied.\n\nSample Input 1\n\n3 3\n1 2 3\n2 3 5\n1 3 4\n\nSample Output 1\n\n1\n\nThe condition will be satisfied if we write 1,2 and 3 in vertices 1,2 and 3, respectively.\nThere is no other way to satisfy the condition, so the answer is 1.\n\nSample Input 2\n\n4 3\n1 2 6\n2 3 7\n3 4 5\n\nSample Output 2\n\n3\n\nLet a,b,c and d be the numbers to write in vertices 1,2,3 and 4, respectively.\nThere are three quadruples (a,b,c,d) that satisfy the condition:\n\n(a,b,c,d)=(1,5,2,3)\n\n(a,b,c,d)=(2,4,3,2)\n\n(a,b,c,d)=(3,3,4,1)\n\nSample Input 3\n\n8 7\n1 2 1000000000\n2 3 2\n3 4 1000000000\n4 5 2\n5 6 1000000000\n6 7 2\n7 8 1000000000\n\nSample Output 3\n\n0", "sample_input": "3 3\n1 2 3\n2 3 5\n1 3 4\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03306", "source_text": "Score : 600 points\n\nProblem Statement\n\nKenkoooo found a simple connected graph.\nThe vertices are numbered 1 through n.\nThe i-th edge connects Vertex u_i and v_i, and has a fixed integer s_i.\n\nKenkoooo is trying to write a positive integer in each vertex so that the following condition is satisfied:\n\nFor every edge i, the sum of the positive integers written in Vertex u_i and v_i is equal to s_i.\n\nFind the number of such ways to write positive integers in the vertices.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\n1 \\leq m \\leq 10^5\n\n1 \\leq u_i < v_i \\leq n\n\n2 \\leq s_i \\leq 10^9\n\nIf i\\neq j, then u_i \\neq u_j or v_i \\neq v_j.\n\nThe graph is connected.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m\nu_1 v_1 s_1\n:\nu_m v_m s_m\n\nOutput\n\nPrint the number of ways to write positive integers in the vertices so that the condition is satisfied.\n\nSample Input 1\n\n3 3\n1 2 3\n2 3 5\n1 3 4\n\nSample Output 1\n\n1\n\nThe condition will be satisfied if we write 1,2 and 3 in vertices 1,2 and 3, respectively.\nThere is no other way to satisfy the condition, so the answer is 1.\n\nSample Input 2\n\n4 3\n1 2 6\n2 3 7\n3 4 5\n\nSample Output 2\n\n3\n\nLet a,b,c and d be the numbers to write in vertices 1,2,3 and 4, respectively.\nThere are three quadruples (a,b,c,d) that satisfy the condition:\n\n(a,b,c,d)=(1,5,2,3)\n\n(a,b,c,d)=(2,4,3,2)\n\n(a,b,c,d)=(3,3,4,1)\n\nSample Input 3\n\n8 7\n1 2 1000000000\n2 3 2\n3 4 1000000000\n4 5 2\n5 6 1000000000\n6 7 2\n7 8 1000000000\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3275, "cpu_time_ms": 2108, "memory_kb": 19060}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s841359087", "group_id": "codeNet:p03307", "input_text": "N=io.read(\"n\")\nif N%2==0 then\n print(N)\n else \n print(2*N)\nend", "language": "Lua", "metadata": {"date": 1550533279, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s841359087.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s841359087", "user_id": "u015229643"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "N=io.read(\"n\")\nif N%2==0 then\n print(N)\n else \n print(2*N)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 65, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s292553489", "group_id": "codeNet:p03307", "input_text": "n=io.read(\"*n\")\nif n%2==0 then print(n)\nelse print(n*2) end", "language": "Lua", "metadata": {"date": 1530837371, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s292553489.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s292553489", "user_id": "u781091740"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "n=io.read(\"*n\")\nif n%2==0 then print(n)\nelse print(n*2) end", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 59, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s096049539", "group_id": "codeNet:p03308", "input_text": "n = io.read(\"*n\")\na = {}\nfor i = 1, n do a[i] = io.read(\"*n\") end\ntable.sort(a)\nprint(a[n] - a[1])\n", "language": "Lua", "metadata": {"date": 1594602105, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s096049539.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s096049539", "user_id": "u120582723"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "n = io.read(\"*n\")\na = {}\nfor i = 1, n do a[i] = io.read(\"*n\") end\ntable.sort(a)\nprint(a[n] - a[1])\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an integer sequence A of length N.\nFind the maximum absolute difference of two elements (with different indices) in A.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum absolute difference of two elements (with different indices) in A.\n\nSample Input 1\n\n4\n1 4 6 3\n\nSample Output 1\n\n5\n\nThe maximum absolute difference of two elements is A_3-A_1=6-1=5.\n\nSample Input 2\n\n2\n1000000000 1\n\nSample Output 2\n\n999999999\n\nSample Input 3\n\n5\n1 1 1 1 1\n\nSample Output 3\n\n0", "sample_input": "4\n1 4 6 3\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03308", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an integer sequence A of length N.\nFind the maximum absolute difference of two elements (with different indices) in A.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum absolute difference of two elements (with different indices) in A.\n\nSample Input 1\n\n4\n1 4 6 3\n\nSample Output 1\n\n5\n\nThe maximum absolute difference of two elements is A_3-A_1=6-1=5.\n\nSample Input 2\n\n2\n1000000000 1\n\nSample Output 2\n\n999999999\n\nSample Input 3\n\n5\n1 1 1 1 1\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 99, "cpu_time_ms": 5, "memory_kb": 2752}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s357125472", "group_id": "codeNet:p03308", "input_text": "N=io.read(\"n\")\nt={}\nfor i=1,N do\n t[i]=io.read(\"n\")\nend\ntable.sort(t)\nprint(t[#t]-t[1])", "language": "Lua", "metadata": {"date": 1550533483, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s357125472.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s357125472", "user_id": "u015229643"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "N=io.read(\"n\")\nt={}\nfor i=1,N do\n t[i]=io.read(\"n\")\nend\ntable.sort(t)\nprint(t[#t]-t[1])", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s992793046", "group_id": "codeNet:p03308", "input_text": "local n = tonumber(io.read());\nlocal input = {}\n\nfor v in string.gmatch(io.read(), \"(%d+)\") do\n table.insert(input, tonumber(v));\nend\n\ntable.sort(input, function(a, b)\n return a < b;\nend)\n\nlocal result = input[#input] - input[1];\nprint(result);\n", "language": "Lua", "metadata": {"date": 1530492107, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s992793046.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s992793046", "user_id": "u061001716"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local n = tonumber(io.read());\nlocal input = {}\n\nfor v in string.gmatch(io.read(), \"(%d+)\") do\n table.insert(input, tonumber(v));\nend\n\ntable.sort(input, function(a, b)\n return a < b;\nend)\n\nlocal result = input[#input] - input[1];\nprint(result);\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an integer sequence A of length N.\nFind the maximum absolute difference of two elements (with different indices) in A.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum absolute difference of two elements (with different indices) in A.\n\nSample Input 1\n\n4\n1 4 6 3\n\nSample Output 1\n\n5\n\nThe maximum absolute difference of two elements is A_3-A_1=6-1=5.\n\nSample Input 2\n\n2\n1000000000 1\n\nSample Output 2\n\n999999999\n\nSample Input 3\n\n5\n1 1 1 1 1\n\nSample Output 3\n\n0", "sample_input": "4\n1 4 6 3\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03308", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an integer sequence A of length N.\nFind the maximum absolute difference of two elements (with different indices) in A.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum absolute difference of two elements (with different indices) in A.\n\nSample Input 1\n\n4\n1 4 6 3\n\nSample Output 1\n\n5\n\nThe maximum absolute difference of two elements is A_3-A_1=6-1=5.\n\nSample Input 2\n\n2\n1000000000 1\n\nSample Output 2\n\n999999999\n\nSample Input 3\n\n5\n1 1 1 1 1\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 251, "cpu_time_ms": 124, "memory_kb": 1008}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s805831068", "group_id": "codeNet:p03309", "input_text": "local n = io.read(\"*n\")\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\") - i\nend\ntable.sort(a)\nlocal hn = (n + 1) // 2\nlocal pos = a[hn]\nlocal ret = 0\nfor i = 1, hn do\n ret = ret + pos - a[i]\nend\nfor i = hn + 1, n do\n ret = ret + a[i] - pos\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1584970783, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s805831068.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s805831068", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\") - i\nend\ntable.sort(a)\nlocal hn = (n + 1) // 2\nlocal pos = a[hn]\nlocal ret = 0\nfor i = 1, hn do\n ret = ret + pos - a[i]\nend\nfor i = hn + 1, n do\n ret = ret + a[i] - pos\nend\nprint(ret)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will freely choose an integer b.\nHere, he will get sad if A_i and b+i are far from each other.\nMore specifically, the sadness of Snuke is calculated as follows:\n\nabs(A_1 - (b+1)) + abs(A_2 - (b+2)) + ... + abs(A_N - (b+N))\n\nHere, abs(x) is a function that returns the absolute value of x.\n\nFind the minimum possible sadness of Snuke.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible sadness of Snuke.\n\nSample Input 1\n\n5\n2 2 3 5 5\n\nSample Output 1\n\n2\n\nIf we choose b=0, the sadness of Snuke would be abs(2-(0+1))+abs(2-(0+2))+abs(3-(0+3))+abs(5-(0+4))+abs(5-(0+5))=2.\nAny choice of b does not make the sadness of Snuke less than 2, so the answer is 2.\n\nSample Input 2\n\n9\n1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n6\n6 5 4 3 2 1\n\nSample Output 3\n\n18\n\nSample Input 4\n\n7\n1 1 1 1 2 3 4\n\nSample Output 4\n\n6", "sample_input": "5\n2 2 3 5 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03309", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will freely choose an integer b.\nHere, he will get sad if A_i and b+i are far from each other.\nMore specifically, the sadness of Snuke is calculated as follows:\n\nabs(A_1 - (b+1)) + abs(A_2 - (b+2)) + ... + abs(A_N - (b+N))\n\nHere, abs(x) is a function that returns the absolute value of x.\n\nFind the minimum possible sadness of Snuke.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible sadness of Snuke.\n\nSample Input 1\n\n5\n2 2 3 5 5\n\nSample Output 1\n\n2\n\nIf we choose b=0, the sadness of Snuke would be abs(2-(0+1))+abs(2-(0+2))+abs(3-(0+3))+abs(5-(0+4))+abs(5-(0+5))=2.\nAny choice of b does not make the sadness of Snuke less than 2, so the answer is 2.\n\nSample Input 2\n\n9\n1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n6\n6 5 4 3 2 1\n\nSample Output 3\n\n18\n\nSample Input 4\n\n7\n1 1 1 1 2 3 4\n\nSample Output 4\n\n6", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 261, "cpu_time_ms": 198, "memory_kb": 4472}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s247164993", "group_id": "codeNet:p03309", "input_text": "function median(list)\n table.sort(list)\n local center = math.floor(#list / 2)\n if #list % 2 == 0 then\n return (list[center] + list[center + 1]) / 2\n else\n return list[center + 1]\n end\nend\n\nfunction sad(A, b)\n local acc = 0\n for i, v in ipairs(A) do\n acc = acc + math.abs(v - (b + i))\n end\n return acc\nend\n\nlocal N = tonumber(io.read())\nlocal A = {}\nfor n in io.read():gmatch('%d+') do\n table.insert(A, tonumber(n))\nend\n\nlocal B = {}\nfor i, v in ipairs(A) do\n table.insert(B, (v - i))\nend\nlocal result = sad(A, median(B))\nio.write(result)\n", "language": "Lua", "metadata": {"date": 1531334330, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s247164993.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s247164993", "user_id": "u629781446"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "function median(list)\n table.sort(list)\n local center = math.floor(#list / 2)\n if #list % 2 == 0 then\n return (list[center] + list[center + 1]) / 2\n else\n return list[center + 1]\n end\nend\n\nfunction sad(A, b)\n local acc = 0\n for i, v in ipairs(A) do\n acc = acc + math.abs(v - (b + i))\n end\n return acc\nend\n\nlocal N = tonumber(io.read())\nlocal A = {}\nfor n in io.read():gmatch('%d+') do\n table.insert(A, tonumber(n))\nend\n\nlocal B = {}\nfor i, v in ipairs(A) do\n table.insert(B, (v - i))\nend\nlocal result = sad(A, median(B))\nio.write(result)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will freely choose an integer b.\nHere, he will get sad if A_i and b+i are far from each other.\nMore specifically, the sadness of Snuke is calculated as follows:\n\nabs(A_1 - (b+1)) + abs(A_2 - (b+2)) + ... + abs(A_N - (b+N))\n\nHere, abs(x) is a function that returns the absolute value of x.\n\nFind the minimum possible sadness of Snuke.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible sadness of Snuke.\n\nSample Input 1\n\n5\n2 2 3 5 5\n\nSample Output 1\n\n2\n\nIf we choose b=0, the sadness of Snuke would be abs(2-(0+1))+abs(2-(0+2))+abs(3-(0+3))+abs(5-(0+4))+abs(5-(0+5))=2.\nAny choice of b does not make the sadness of Snuke less than 2, so the answer is 2.\n\nSample Input 2\n\n9\n1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n6\n6 5 4 3 2 1\n\nSample Output 3\n\n18\n\nSample Input 4\n\n7\n1 1 1 1 2 3 4\n\nSample Output 4\n\n6", "sample_input": "5\n2 2 3 5 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03309", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will freely choose an integer b.\nHere, he will get sad if A_i and b+i are far from each other.\nMore specifically, the sadness of Snuke is calculated as follows:\n\nabs(A_1 - (b+1)) + abs(A_2 - (b+2)) + ... + abs(A_N - (b+N))\n\nHere, abs(x) is a function that returns the absolute value of x.\n\nFind the minimum possible sadness of Snuke.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible sadness of Snuke.\n\nSample Input 1\n\n5\n2 2 3 5 5\n\nSample Output 1\n\n2\n\nIf we choose b=0, the sadness of Snuke would be abs(2-(0+1))+abs(2-(0+2))+abs(3-(0+3))+abs(5-(0+4))+abs(5-(0+5))=2.\nAny choice of b does not make the sadness of Snuke less than 2, so the answer is 2.\n\nSample Input 2\n\n9\n1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n6\n6 5 4 3 2 1\n\nSample Output 3\n\n18\n\nSample Input 4\n\n7\n1 1 1 1 2 3 4\n\nSample Output 4\n\n6", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 357, "memory_kb": 20180}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s218793277", "group_id": "codeNet:p03311", "input_text": "local n=io.read(\"n\")\nlocal a={}\nfor i=1,n do\n a[i]=io.read(\"n\")-i\nend\ntable.sort(a)\n\nif n%2==1 then\n local median=a[n//2+1]\n local sadness=0\n for i=1,n do\n sadness=sadness+math.abs(a[i]-median)\n end\n print(sadness)\nelse\n local median1=a[n//2]\n local sadness1=0\n local median2=a[n//2+1]\n local sadness2=0\n for i=1,n do\n sadness1=sadness1+math.abs(a[i]-median1)\n sadness2=sadness2+math.abs(a[i]-median2)\n end\n print(math.min(sadness1,sadness2))\nend", "language": "Lua", "metadata": {"date": 1594520523, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03311.html", "problem_id": "p03311", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03311/input.txt", "sample_output_relpath": "derived/input_output/data/p03311/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03311/Lua/s218793277.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s218793277", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal a={}\nfor i=1,n do\n a[i]=io.read(\"n\")-i\nend\ntable.sort(a)\n\nif n%2==1 then\n local median=a[n//2+1]\n local sadness=0\n for i=1,n do\n sadness=sadness+math.abs(a[i]-median)\n end\n print(sadness)\nelse\n local median1=a[n//2]\n local sadness1=0\n local median2=a[n//2+1]\n local sadness2=0\n for i=1,n do\n sadness1=sadness1+math.abs(a[i]-median1)\n sadness2=sadness2+math.abs(a[i]-median2)\n end\n print(math.min(sadness1,sadness2))\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": "p03311", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 506, "cpu_time_ms": 181, "memory_kb": 6376}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s385163399", "group_id": "codeNet:p03313", "input_text": "local function bdp_prepare(n)\n local tot = 1\n local alltask = {}\n local stagetask = {}\n for i = 1, n do\n tot = tot * 2\n stagetask[i] = {}\n end\n local a = {}\n local a0 = io.read(\"*n\")\n for i = 1, tot - 1 do\n a[i] = io.read(\"*n\")\n if a[i] < a0 then\n alltask[i] = {tot, i}\n else\n alltask[i] = {i, tot}\n end\n end\n a[tot] = a0\n for i = 1, tot - 1 do\n local ti = i\n local cnt = 0\n for j = 1, n do\n if ti % 2 == 1 then\n cnt = cnt + 1\n ti = ti - 1\n end\n ti = ti / 2\n end\n table.insert(stagetask[cnt], i)\n end\n return tot, a, alltask, stagetask\nend\n\nlocal function bdp_walk(a, alltask, src, dst)\n local dst1 = alltask[dst][1]\n local dst2 = alltask[dst][2]\n local src1 = alltask[src][1]\n local src2 = alltask[src][2]\n local tmp = {dst1, dst2, src1, src2}\n table.sort(tmp, function(x, y) return a[x] > a[y] end)\n for i = 4, 2, -1 do\n if tmp[i] == tmp[i - 1] then\n table.remove(tmp, i)\n end\n end\n alltask[dst][1] = tmp[1]\n alltask[dst][2] = tmp[2]\nend\n\nlocal function bdp_doall(n, a, alltask, stagetask)\n for stage = 1, n - 1 do\n local stlen = #stagetask[stage]\n for i_stagetask = 1, stlen do\n local used = stagetask[stage][i_stagetask]\n local mul = 1\n local tmp = used\n for j = 1, n do\n if tmp % 2 == 0 then\n bdp_walk(a, alltask, used, used + mul)\n else\n tmp = tmp - 1\n end\n tmp = tmp / 2\n mul = mul * 2\n end\n end\n end\nend\n\nlocal n = io.read(\"*n\")\nlocal tot, a, alltask, stagetask = bdp_prepare(n)\nbdp_doall(n, a, alltask, stagetask)\nlocal prv = 0\nfor i = 1, tot - 1 do\n local cur = a[alltask[i][1]] + a[alltask[i][2]]\n if cur < prv then cur = prv end\n print(cur)\n prv = cur\nend\n", "language": "Lua", "metadata": {"date": 1570646011, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03313.html", "problem_id": "p03313", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03313/input.txt", "sample_output_relpath": "derived/input_output/data/p03313/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03313/Lua/s385163399.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s385163399", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n4\n5\n", "input_to_evaluate": "local function bdp_prepare(n)\n local tot = 1\n local alltask = {}\n local stagetask = {}\n for i = 1, n do\n tot = tot * 2\n stagetask[i] = {}\n end\n local a = {}\n local a0 = io.read(\"*n\")\n for i = 1, tot - 1 do\n a[i] = io.read(\"*n\")\n if a[i] < a0 then\n alltask[i] = {tot, i}\n else\n alltask[i] = {i, tot}\n end\n end\n a[tot] = a0\n for i = 1, tot - 1 do\n local ti = i\n local cnt = 0\n for j = 1, n do\n if ti % 2 == 1 then\n cnt = cnt + 1\n ti = ti - 1\n end\n ti = ti / 2\n end\n table.insert(stagetask[cnt], i)\n end\n return tot, a, alltask, stagetask\nend\n\nlocal function bdp_walk(a, alltask, src, dst)\n local dst1 = alltask[dst][1]\n local dst2 = alltask[dst][2]\n local src1 = alltask[src][1]\n local src2 = alltask[src][2]\n local tmp = {dst1, dst2, src1, src2}\n table.sort(tmp, function(x, y) return a[x] > a[y] end)\n for i = 4, 2, -1 do\n if tmp[i] == tmp[i - 1] then\n table.remove(tmp, i)\n end\n end\n alltask[dst][1] = tmp[1]\n alltask[dst][2] = tmp[2]\nend\n\nlocal function bdp_doall(n, a, alltask, stagetask)\n for stage = 1, n - 1 do\n local stlen = #stagetask[stage]\n for i_stagetask = 1, stlen do\n local used = stagetask[stage][i_stagetask]\n local mul = 1\n local tmp = used\n for j = 1, n do\n if tmp % 2 == 0 then\n bdp_walk(a, alltask, used, used + mul)\n else\n tmp = tmp - 1\n end\n tmp = tmp / 2\n mul = mul * 2\n end\n end\n end\nend\n\nlocal n = io.read(\"*n\")\nlocal tot, a, alltask, stagetask = bdp_prepare(n)\nbdp_doall(n, a, alltask, stagetask)\nlocal prv = 0\nfor i = 1, tot - 1 do\n local cur = a[alltask[i][1]] + a[alltask[i][2]]\n if cur < prv then cur = prv end\n print(cur)\n prv = cur\nend\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nThere is an integer sequence of length 2^N: A_0, A_1, ..., A_{2^N-1}. (Note that the sequence is 0-indexed.)\n\nFor every integer K satisfying 1 \\leq K \\leq 2^N-1, solve the following problem:\n\nLet i and j be integers. Find the maximum value of A_i + A_j where 0 \\leq i < j \\leq 2^N-1 and (i or j) \\leq K.\nHere, or denotes the bitwise OR.\n\nConstraints\n\n1 \\leq N \\leq 18\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_0 A_1 ... A_{2^N-1}\n\nOutput\n\nPrint 2^N-1 lines.\nIn the i-th line, print the answer of the problem above for K=i.\n\nSample Input 1\n\n2\n1 2 3 1\n\nSample Output 1\n\n3\n4\n5\n\nFor K=1, the only possible pair of i and j is (i,j)=(0,1), so the answer is A_0+A_1=1+2=3.\n\nFor K=2, the possible pairs of i and j are (i,j)=(0,1),(0,2).\nWhen (i,j)=(0,2), A_i+A_j=1+3=4. This is the maximum value, so the answer is 4.\n\nFor K=3, the possible pairs of i and j are (i,j)=(0,1),(0,2),(0,3),(1,2),(1,3),(2,3) .\nWhen (i,j)=(1,2), A_i+A_j=2+3=5. This is the maximum value, so the answer is 5.\n\nSample Input 2\n\n3\n10 71 84 33 6 47 23 25\n\nSample Output 2\n\n81\n94\n155\n155\n155\n155\n155\n\nSample Input 3\n\n4\n75 26 45 72 81 47 97 97 2 2 25 82 84 17 56 32\n\nSample Output 3\n\n101\n120\n147\n156\n156\n178\n194\n194\n194\n194\n194\n194\n194\n194\n194", "sample_input": "2\n1 2 3 1\n"}, "reference_outputs": ["3\n4\n5\n"], "source_document_id": "p03313", "source_text": "Score : 700 points\n\nProblem Statement\n\nThere is an integer sequence of length 2^N: A_0, A_1, ..., A_{2^N-1}. (Note that the sequence is 0-indexed.)\n\nFor every integer K satisfying 1 \\leq K \\leq 2^N-1, solve the following problem:\n\nLet i and j be integers. Find the maximum value of A_i + A_j where 0 \\leq i < j \\leq 2^N-1 and (i or j) \\leq K.\nHere, or denotes the bitwise OR.\n\nConstraints\n\n1 \\leq N \\leq 18\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_0 A_1 ... A_{2^N-1}\n\nOutput\n\nPrint 2^N-1 lines.\nIn the i-th line, print the answer of the problem above for K=i.\n\nSample Input 1\n\n2\n1 2 3 1\n\nSample Output 1\n\n3\n4\n5\n\nFor K=1, the only possible pair of i and j is (i,j)=(0,1), so the answer is A_0+A_1=1+2=3.\n\nFor K=2, the possible pairs of i and j are (i,j)=(0,1),(0,2).\nWhen (i,j)=(0,2), A_i+A_j=1+3=4. This is the maximum value, so the answer is 4.\n\nFor K=3, the possible pairs of i and j are (i,j)=(0,1),(0,2),(0,3),(1,2),(1,3),(2,3) .\nWhen (i,j)=(1,2), A_i+A_j=2+3=5. This is the maximum value, so the answer is 5.\n\nSample Input 2\n\n3\n10 71 84 33 6 47 23 25\n\nSample Output 2\n\n81\n94\n155\n155\n155\n155\n155\n\nSample Input 3\n\n4\n75 26 45 72 81 47 97 97 2 2 25 82 84 17 56 32\n\nSample Output 3\n\n101\n120\n147\n156\n156\n178\n194\n194\n194\n194\n194\n194\n194\n194\n194", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1767, "cpu_time_ms": 2107, "memory_kb": 62632}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s996239902", "group_id": "codeNet:p03315", "input_text": "s = io.read()\nr = -4\nfor i = 1, 4 do\n a = string.sub(s, i, i)\n if(a == \"+\") then\n r = r + 2\n end\nend\nprint(r)", "language": "Lua", "metadata": {"date": 1555202866, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03315.html", "problem_id": "p03315", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03315/input.txt", "sample_output_relpath": "derived/input_output/data/p03315/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03315/Lua/s996239902.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s996239902", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "s = io.read()\nr = -4\nfor i = 1, 4 do\n a = string.sub(s, i, i)\n if(a == \"+\") then\n r = r + 2\n end\nend\nprint(r)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is always an integer in Takahashi's mind.\n\nInitially, the integer in Takahashi's mind is 0. Takahashi is now going to eat four symbols, each of which is + or -. When he eats +, the integer in his mind increases by 1; when he eats -, the integer in his mind decreases by 1.\n\nThe symbols Takahashi is going to eat are given to you as a string S. The i-th character in S is the i-th symbol for him to eat.\n\nFind the integer in Takahashi's mind after he eats all the symbols.\n\nConstraints\n\nThe length of S is 4.\n\nEach character in S is + or -.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the integer in Takahashi's mind after he eats all the symbols.\n\nSample Input 1\n\n+-++\n\nSample Output 1\n\n2\n\nInitially, the integer in Takahashi's mind is 0.\n\nThe first integer for him to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe second integer to eat is -. After eating it, the integer in his mind becomes 0.\n\nThe third integer to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe fourth integer to eat is +. After eating it, the integer in his mind becomes 2.\n\nThus, the integer in Takahashi's mind after he eats all the symbols is 2.\n\nSample Input 2\n\n-+--\n\nSample Output 2\n\n-2\n\nSample Input 3\n\n----\n\nSample Output 3\n\n-4", "sample_input": "+-++\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03315", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is always an integer in Takahashi's mind.\n\nInitially, the integer in Takahashi's mind is 0. Takahashi is now going to eat four symbols, each of which is + or -. When he eats +, the integer in his mind increases by 1; when he eats -, the integer in his mind decreases by 1.\n\nThe symbols Takahashi is going to eat are given to you as a string S. The i-th character in S is the i-th symbol for him to eat.\n\nFind the integer in Takahashi's mind after he eats all the symbols.\n\nConstraints\n\nThe length of S is 4.\n\nEach character in S is + or -.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the integer in Takahashi's mind after he eats all the symbols.\n\nSample Input 1\n\n+-++\n\nSample Output 1\n\n2\n\nInitially, the integer in Takahashi's mind is 0.\n\nThe first integer for him to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe second integer to eat is -. After eating it, the integer in his mind becomes 0.\n\nThe third integer to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe fourth integer to eat is +. After eating it, the integer in his mind becomes 2.\n\nThus, the integer in Takahashi's mind after he eats all the symbols is 2.\n\nSample Input 2\n\n-+--\n\nSample Output 2\n\n-2\n\nSample Input 3\n\n----\n\nSample Output 3\n\n-4", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s813613343", "group_id": "codeNet:p03315", "input_text": "a,x=io.read():gsub(\"%+\",\"\")\nprint(x-#a)", "language": "Lua", "metadata": {"date": 1551992254, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03315.html", "problem_id": "p03315", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03315/input.txt", "sample_output_relpath": "derived/input_output/data/p03315/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03315/Lua/s813613343.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s813613343", "user_id": "u837412668"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "a,x=io.read():gsub(\"%+\",\"\")\nprint(x-#a)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is always an integer in Takahashi's mind.\n\nInitially, the integer in Takahashi's mind is 0. Takahashi is now going to eat four symbols, each of which is + or -. When he eats +, the integer in his mind increases by 1; when he eats -, the integer in his mind decreases by 1.\n\nThe symbols Takahashi is going to eat are given to you as a string S. The i-th character in S is the i-th symbol for him to eat.\n\nFind the integer in Takahashi's mind after he eats all the symbols.\n\nConstraints\n\nThe length of S is 4.\n\nEach character in S is + or -.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the integer in Takahashi's mind after he eats all the symbols.\n\nSample Input 1\n\n+-++\n\nSample Output 1\n\n2\n\nInitially, the integer in Takahashi's mind is 0.\n\nThe first integer for him to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe second integer to eat is -. After eating it, the integer in his mind becomes 0.\n\nThe third integer to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe fourth integer to eat is +. After eating it, the integer in his mind becomes 2.\n\nThus, the integer in Takahashi's mind after he eats all the symbols is 2.\n\nSample Input 2\n\n-+--\n\nSample Output 2\n\n-2\n\nSample Input 3\n\n----\n\nSample Output 3\n\n-4", "sample_input": "+-++\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03315", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is always an integer in Takahashi's mind.\n\nInitially, the integer in Takahashi's mind is 0. Takahashi is now going to eat four symbols, each of which is + or -. When he eats +, the integer in his mind increases by 1; when he eats -, the integer in his mind decreases by 1.\n\nThe symbols Takahashi is going to eat are given to you as a string S. The i-th character in S is the i-th symbol for him to eat.\n\nFind the integer in Takahashi's mind after he eats all the symbols.\n\nConstraints\n\nThe length of S is 4.\n\nEach character in S is + or -.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the integer in Takahashi's mind after he eats all the symbols.\n\nSample Input 1\n\n+-++\n\nSample Output 1\n\n2\n\nInitially, the integer in Takahashi's mind is 0.\n\nThe first integer for him to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe second integer to eat is -. After eating it, the integer in his mind becomes 0.\n\nThe third integer to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe fourth integer to eat is +. After eating it, the integer in his mind becomes 2.\n\nThus, the integer in Takahashi's mind after he eats all the symbols is 2.\n\nSample Input 2\n\n-+--\n\nSample Output 2\n\n-2\n\nSample Input 3\n\n----\n\nSample Output 3\n\n-4", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 39, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s456330250", "group_id": "codeNet:p03315", "input_text": "s=io.read()\nprint(#s:gsub(\"-\",\"\")-#s:gsub(\"+\",\"\"))", "language": "Lua", "metadata": {"date": 1529843235, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03315.html", "problem_id": "p03315", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03315/input.txt", "sample_output_relpath": "derived/input_output/data/p03315/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03315/Lua/s456330250.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s456330250", "user_id": "u781091740"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "s=io.read()\nprint(#s:gsub(\"-\",\"\")-#s:gsub(\"+\",\"\"))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is always an integer in Takahashi's mind.\n\nInitially, the integer in Takahashi's mind is 0. Takahashi is now going to eat four symbols, each of which is + or -. When he eats +, the integer in his mind increases by 1; when he eats -, the integer in his mind decreases by 1.\n\nThe symbols Takahashi is going to eat are given to you as a string S. The i-th character in S is the i-th symbol for him to eat.\n\nFind the integer in Takahashi's mind after he eats all the symbols.\n\nConstraints\n\nThe length of S is 4.\n\nEach character in S is + or -.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the integer in Takahashi's mind after he eats all the symbols.\n\nSample Input 1\n\n+-++\n\nSample Output 1\n\n2\n\nInitially, the integer in Takahashi's mind is 0.\n\nThe first integer for him to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe second integer to eat is -. After eating it, the integer in his mind becomes 0.\n\nThe third integer to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe fourth integer to eat is +. After eating it, the integer in his mind becomes 2.\n\nThus, the integer in Takahashi's mind after he eats all the symbols is 2.\n\nSample Input 2\n\n-+--\n\nSample Output 2\n\n-2\n\nSample Input 3\n\n----\n\nSample Output 3\n\n-4", "sample_input": "+-++\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03315", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is always an integer in Takahashi's mind.\n\nInitially, the integer in Takahashi's mind is 0. Takahashi is now going to eat four symbols, each of which is + or -. When he eats +, the integer in his mind increases by 1; when he eats -, the integer in his mind decreases by 1.\n\nThe symbols Takahashi is going to eat are given to you as a string S. The i-th character in S is the i-th symbol for him to eat.\n\nFind the integer in Takahashi's mind after he eats all the symbols.\n\nConstraints\n\nThe length of S is 4.\n\nEach character in S is + or -.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the integer in Takahashi's mind after he eats all the symbols.\n\nSample Input 1\n\n+-++\n\nSample Output 1\n\n2\n\nInitially, the integer in Takahashi's mind is 0.\n\nThe first integer for him to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe second integer to eat is -. After eating it, the integer in his mind becomes 0.\n\nThe third integer to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe fourth integer to eat is +. After eating it, the integer in his mind becomes 2.\n\nThus, the integer in Takahashi's mind after he eats all the symbols is 2.\n\nSample Input 2\n\n-+--\n\nSample Output 2\n\n-2\n\nSample Input 3\n\n----\n\nSample Output 3\n\n-4", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s970253302", "group_id": "codeNet:p03316", "input_text": "function S(n)\n local ret = 0\n while n ~= 0 do\n ret = ret + n % 10\n n = n // 10\n end\n return ret\nend\n\nN = io.read(\"*n\")\n\nif N % S(N) == 0 then\n print(\"Yes\")\nelse\n print(\"No\")\nend\n", "language": "Lua", "metadata": {"date": 1529803156, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03316.html", "problem_id": "p03316", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03316/input.txt", "sample_output_relpath": "derived/input_output/data/p03316/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03316/Lua/s970253302.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s970253302", "user_id": "u374892957"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "function S(n)\n local ret = 0\n while n ~= 0 do\n ret = ret + n % 10\n n = n // 10\n end\n return ret\nend\n\nN = io.read(\"*n\")\n\nif N % S(N) == 0 then\n print(\"Yes\")\nelse\n print(\"No\")\nend\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nLet S(n) denote the sum of the digits in the decimal notation of n.\nFor example, S(101) = 1 + 0 + 1 = 2.\n\nGiven an integer N, determine if S(N) divides N.\n\nConstraints\n\n1 \\leq N \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf S(N) divides N, print Yes; if it does not, print No.\n\nSample Input 1\n\n12\n\nSample Output 1\n\nYes\n\nIn this input, N=12.\nAs S(12) = 1 + 2 = 3, S(N) divides N.\n\nSample Input 2\n\n101\n\nSample Output 2\n\nNo\n\nAs S(101) = 1 + 0 + 1 = 2, S(N) does not divide N.\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\nYes", "sample_input": "12\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03316", "source_text": "Score : 200 points\n\nProblem Statement\n\nLet S(n) denote the sum of the digits in the decimal notation of n.\nFor example, S(101) = 1 + 0 + 1 = 2.\n\nGiven an integer N, determine if S(N) divides N.\n\nConstraints\n\n1 \\leq N \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf S(N) divides N, print Yes; if it does not, print No.\n\nSample Input 1\n\n12\n\nSample Output 1\n\nYes\n\nIn this input, N=12.\nAs S(12) = 1 + 2 = 3, S(N) divides N.\n\nSample Input 2\n\n101\n\nSample Output 2\n\nNo\n\nAs S(101) = 1 + 0 + 1 = 2, S(N) does not divide N.\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s633600231", "group_id": "codeNet:p03317", "input_text": "N, K = io.read(\"*n\", \"*n\")\n\nprint(N // (K - 1))\n", "language": "Lua", "metadata": {"date": 1529803443, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03317.html", "problem_id": "p03317", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03317/input.txt", "sample_output_relpath": "derived/input_output/data/p03317/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03317/Lua/s633600231.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s633600231", "user_id": "u374892957"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "N, K = io.read(\"*n\", \"*n\")\n\nprint(N // (K - 1))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N.\n\nOn this sequence, Snuke can perform the following operation:\n\nChoose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen elements.\n\nSnuke would like to make all the elements in this sequence equal by repeating the operation above some number of times.\nFind the minimum number of operations required.\nIt can be proved that, Under the constraints of this problem, this objective is always achievable.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 100000\n\nA_1, A_2, ..., A_N is a permutation of 1, 2, ..., N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4 3\n2 3 1 4\n\nSample Output 1\n\n2\n\nOne optimal strategy is as follows:\n\nIn the first operation, choose the first, second and third elements. The sequence A becomes 1, 1, 1, 4.\n\nIn the second operation, choose the second, third and fourth elements. The sequence A becomes 1, 1, 1, 1.\n\nSample Input 2\n\n3 3\n1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n8 3\n7 3 1 8 4 6 2 5\n\nSample Output 3\n\n4", "sample_input": "4 3\n2 3 1 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03317", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N.\n\nOn this sequence, Snuke can perform the following operation:\n\nChoose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen elements.\n\nSnuke would like to make all the elements in this sequence equal by repeating the operation above some number of times.\nFind the minimum number of operations required.\nIt can be proved that, Under the constraints of this problem, this objective is always achievable.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 100000\n\nA_1, A_2, ..., A_N is a permutation of 1, 2, ..., N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4 3\n2 3 1 4\n\nSample Output 1\n\n2\n\nOne optimal strategy is as follows:\n\nIn the first operation, choose the first, second and third elements. The sequence A becomes 1, 1, 1, 4.\n\nIn the second operation, choose the second, third and fourth elements. The sequence A becomes 1, 1, 1, 1.\n\nSample Input 2\n\n3 3\n1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n8 3\n7 3 1 8 4 6 2 5\n\nSample Output 3\n\n4", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 105, "memory_kb": 1012}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s745304592", "group_id": "codeNet:p03318", "input_text": "function snuke(k)\n local snuke = 0\n local tmp = k\n while(0 < tmp) do\n local a = tmp % 10\n snuke = snuke + a\n tmp = (tmp - a) / 10\n end\n return k / snuke\nend\n\nk = io.read(\"*n\")\ndig = 1\ncnt = 0\nmin = 1\nres = {}\nwhile(cnt < k) do\n if(dig == 1) then\n for i = 1, 9 do\n cnt = cnt + 1\n print(i)\n table.insert(res, {i, 1})\n if(cnt == k) then break end\n end\n elseif(dig <= 3) then\n -- candidate: 19,29,...,99, 199,299, ..., 999\n base = 0\n mul = 1\n for i = 2, dig do\n base = base * 10 + 9\n mul = mul * 10\n end\n for i = 1, 9 do\n v = base + mul * i\n snk = snuke(v)\n if(min <= snk) then\n cnt = cnt + 1\n min = snk\n print(v)\n table.insert(res, {v, snk})\n if(cnt == k) then break end\n end\n end\n elseif(dig <= 14) then\n -- candidate: 1z9..9, 2z9..9, ..., 9z9..9 z=[0-9]\n base = 0\n mul = 1\n for i = 3, dig do\n base = base * 10 + 9\n mul = mul * 10\n end\n for i = 10, 99 do\n v = base + mul * i\n snk = snuke(v)\n if(min <= snk) then\n cnt = cnt + 1\n min = snk\n print(v)\n table.insert(res, {v, snk})\n if(cnt == k) then break end\n end\n end\n else\n -- candidate: 1xy9..9, 2xy9..9, ..., 9xy9..9 x,y=[0-9]\n base = 0\n mul = 1\n for i = 4, dig do\n base = base * 10 + 9\n mul = mul * 10\n end\n for i = 100, 999 do\n v = base + mul * i\n snk = snuke(v)\n if(min <= snk) then\n cnt = cnt + 1\n min = snk\n print(v)\n table.insert(res, {v, snk})\n if(cnt == k) then break end\n end\n end\n end\n dig = dig + 1\n if(dig == 16) then break end\nend\n", "language": "Lua", "metadata": {"date": 1554955283, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s745304592.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s745304592", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n", "input_to_evaluate": "function snuke(k)\n local snuke = 0\n local tmp = k\n while(0 < tmp) do\n local a = tmp % 10\n snuke = snuke + a\n tmp = (tmp - a) / 10\n end\n return k / snuke\nend\n\nk = io.read(\"*n\")\ndig = 1\ncnt = 0\nmin = 1\nres = {}\nwhile(cnt < k) do\n if(dig == 1) then\n for i = 1, 9 do\n cnt = cnt + 1\n print(i)\n table.insert(res, {i, 1})\n if(cnt == k) then break end\n end\n elseif(dig <= 3) then\n -- candidate: 19,29,...,99, 199,299, ..., 999\n base = 0\n mul = 1\n for i = 2, dig do\n base = base * 10 + 9\n mul = mul * 10\n end\n for i = 1, 9 do\n v = base + mul * i\n snk = snuke(v)\n if(min <= snk) then\n cnt = cnt + 1\n min = snk\n print(v)\n table.insert(res, {v, snk})\n if(cnt == k) then break end\n end\n end\n elseif(dig <= 14) then\n -- candidate: 1z9..9, 2z9..9, ..., 9z9..9 z=[0-9]\n base = 0\n mul = 1\n for i = 3, dig do\n base = base * 10 + 9\n mul = mul * 10\n end\n for i = 10, 99 do\n v = base + mul * i\n snk = snuke(v)\n if(min <= snk) then\n cnt = cnt + 1\n min = snk\n print(v)\n table.insert(res, {v, snk})\n if(cnt == k) then break end\n end\n end\n else\n -- candidate: 1xy9..9, 2xy9..9, ..., 9xy9..9 x,y=[0-9]\n base = 0\n mul = 1\n for i = 4, dig do\n base = base * 10 + 9\n mul = mul * 10\n end\n for i = 100, 999 do\n v = base + mul * i\n snk = snuke(v)\n if(min <= snk) then\n cnt = cnt + 1\n min = snk\n print(v)\n table.insert(res, {v, snk})\n if(cnt == k) then break end\n end\n end\n end\n dig = dig + 1\n if(dig == 16) then break end\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet S(n) denote the sum of the digits in the decimal notation of n.\nFor example, S(123) = 1 + 2 + 3 = 6.\n\nWe will call an integer n a Snuke number when, for all positive integers m such that m > n, \\frac{n}{S(n)} \\leq \\frac{m}{S(m)} holds.\n\nGiven an integer K, list the K smallest Snuke numbers.\n\nConstraints\n\n1 \\leq K\n\nThe K-th smallest Snuke number is not greater than 10^{15}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th smallest Snuke number.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n1\n2\n3\n4\n5\n6\n7\n8\n9\n19", "sample_input": "10\n"}, "reference_outputs": ["1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n"], "source_document_id": "p03318", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet S(n) denote the sum of the digits in the decimal notation of n.\nFor example, S(123) = 1 + 2 + 3 = 6.\n\nWe will call an integer n a Snuke number when, for all positive integers m such that m > n, \\frac{n}{S(n)} \\leq \\frac{m}{S(m)} holds.\n\nGiven an integer K, list the K smallest Snuke numbers.\n\nConstraints\n\n1 \\leq K\n\nThe K-th smallest Snuke number is not greater than 10^{15}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th smallest Snuke number.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n1\n2\n3\n4\n5\n6\n7\n8\n9\n19", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1698, "cpu_time_ms": 4, "memory_kb": 384}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s895096318", "group_id": "codeNet:p03318", "input_text": "v = io.read(\"*n\")\n\nn = 0\na = 1\nfor i=1, v do\n if i >= a*10 then\n a = a*10\n end\n n = n+a\n print(n)\nend\n", "language": "Lua", "metadata": {"date": 1529807825, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s895096318.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s895096318", "user_id": "u374892957"}, "prompt_components": {"gold_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n", "input_to_evaluate": "v = io.read(\"*n\")\n\nn = 0\na = 1\nfor i=1, v do\n if i >= a*10 then\n a = a*10\n end\n n = n+a\n print(n)\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet S(n) denote the sum of the digits in the decimal notation of n.\nFor example, S(123) = 1 + 2 + 3 = 6.\n\nWe will call an integer n a Snuke number when, for all positive integers m such that m > n, \\frac{n}{S(n)} \\leq \\frac{m}{S(m)} holds.\n\nGiven an integer K, list the K smallest Snuke numbers.\n\nConstraints\n\n1 \\leq K\n\nThe K-th smallest Snuke number is not greater than 10^{15}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th smallest Snuke number.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n1\n2\n3\n4\n5\n6\n7\n8\n9\n19", "sample_input": "10\n"}, "reference_outputs": ["1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n"], "source_document_id": "p03318", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet S(n) denote the sum of the digits in the decimal notation of n.\nFor example, S(123) = 1 + 2 + 3 = 6.\n\nWe will call an integer n a Snuke number when, for all positive integers m such that m > n, \\frac{n}{S(n)} \\leq \\frac{m}{S(m)} holds.\n\nGiven an integer K, list the K smallest Snuke numbers.\n\nConstraints\n\n1 \\leq K\n\nThe K-th smallest Snuke number is not greater than 10^{15}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th smallest Snuke number.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n1\n2\n3\n4\n5\n6\n7\n8\n9\n19", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 109, "cpu_time_ms": 41, "memory_kb": 880}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s545747532", "group_id": "codeNet:p03318", "input_text": "v = io.read(\"*n\")\n\nfor i=1, v do\n if i%9 ~= 0 then\n io.write(i%9)\n end\n for j=1, i//9 do\n io.write(9)\n end\n io.write(\"\\n\")\nend\n", "language": "Lua", "metadata": {"date": 1529805640, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s545747532.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s545747532", "user_id": "u374892957"}, "prompt_components": {"gold_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n", "input_to_evaluate": "v = io.read(\"*n\")\n\nfor i=1, v do\n if i%9 ~= 0 then\n io.write(i%9)\n end\n for j=1, i//9 do\n io.write(9)\n end\n io.write(\"\\n\")\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet S(n) denote the sum of the digits in the decimal notation of n.\nFor example, S(123) = 1 + 2 + 3 = 6.\n\nWe will call an integer n a Snuke number when, for all positive integers m such that m > n, \\frac{n}{S(n)} \\leq \\frac{m}{S(m)} holds.\n\nGiven an integer K, list the K smallest Snuke numbers.\n\nConstraints\n\n1 \\leq K\n\nThe K-th smallest Snuke number is not greater than 10^{15}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th smallest Snuke number.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n1\n2\n3\n4\n5\n6\n7\n8\n9\n19", "sample_input": "10\n"}, "reference_outputs": ["1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n"], "source_document_id": "p03318", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet S(n) denote the sum of the digits in the decimal notation of n.\nFor example, S(123) = 1 + 2 + 3 = 6.\n\nWe will call an integer n a Snuke number when, for all positive integers m such that m > n, \\frac{n}{S(n)} \\leq \\frac{m}{S(m)} holds.\n\nGiven an integer K, list the K smallest Snuke numbers.\n\nConstraints\n\n1 \\leq K\n\nThe K-th smallest Snuke number is not greater than 10^{15}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th smallest Snuke number.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n1\n2\n3\n4\n5\n6\n7\n8\n9\n19", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 45, "memory_kb": 880}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s544345011", "group_id": "codeNet:p03323", "input_text": "a,b=io.read():match(\"(.+)%s(.+)\")\nprint(a*1<9 and b*1<9 and\"Yay!\"or\":(\")", "language": "Lua", "metadata": {"date": 1551992019, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s544345011.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s544345011", "user_id": "u837412668"}, "prompt_components": {"gold_output": "Yay!\n", "input_to_evaluate": "a,b=io.read():match(\"(.+)%s(.+)\")\nprint(a*1<9 and b*1<9 and\"Yay!\"or\":(\")", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 72, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s820672926", "group_id": "codeNet:p03323", "input_text": "a, b = io.read(\"*n\",\"*n\")\n\nif a <= 8 and b <= 8 then\n print(\"Yay!\")\nelse\n print(\":(\")\nend", "language": "Lua", "metadata": {"date": 1529199163, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s820672926.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s820672926", "user_id": "u374892957"}, "prompt_components": {"gold_output": "Yay!\n", "input_to_evaluate": "a, b = io.read(\"*n\",\"*n\")\n\nif a <= 8 and b <= 8 then\n print(\"Yay!\")\nelse\n print(\":(\")\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 91, "cpu_time_ms": 125, "memory_kb": 1132}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s471833362", "group_id": "codeNet:p03325", "input_text": "n = io.read(\"*n\")\nc = 0\nfor i = 1, n do\n a = io.read(\"*n\")\n while a % 2 == 0 do\n a, c = a // 2, c + 1\n end\nend\nprint(c)", "language": "Lua", "metadata": {"date": 1598136313, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s471833362.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s471833362", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "n = io.read(\"*n\")\nc = 0\nfor i = 1, n do\n a = io.read(\"*n\")\n while a % 2 == 0 do\n a, c = a // 2, c + 1\n end\nend\nprint(c)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 41, "memory_kb": 2780}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s314127679", "group_id": "codeNet:p03325", "input_text": "N=io.read(\"n\")\nn={}\ns=0\nfor i=1,N do\n n[i]=io.read(\"n\")\n while n[i]%2==0 do\n n[i]=n[i]//2\n s=s+1\n end\nend\nprint(s)", "language": "Lua", "metadata": {"date": 1550616353, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s314127679.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s314127679", "user_id": "u015229643"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "N=io.read(\"n\")\nn={}\ns=0\nfor i=1,N do\n n[i]=io.read(\"n\")\n while n[i]%2==0 do\n n[i]=n[i]//2\n s=s+1\n end\nend\nprint(s)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 58, "memory_kb": 632}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s269928910", "group_id": "codeNet:p03325", "input_text": "io.read();\nlocal count = 0;\n\nfor v in string.gmatch(io.read(), \"(%d+)\") do\n local l = tonumber(v);\n \n while l & 1 == 0 do\n count = count + 1;\n l = l >> 1;\n end\nend\n\nprint(count);\n", "language": "Lua", "metadata": {"date": 1529200095, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s269928910.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s269928910", "user_id": "u061001716"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "io.read();\nlocal count = 0;\n\nfor v in string.gmatch(io.read(), \"(%d+)\") do\n local l = tonumber(v);\n \n while l & 1 == 0 do\n count = count + 1;\n l = l >> 1;\n end\nend\n\nprint(count);\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 160, "memory_kb": 1296}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s585329677", "group_id": "codeNet:p03326", "input_text": "local n, m = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, 8 do\n t[i] = {}\nend\nfor i = 1, n do\n local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n t[1][i] = a + b + c\n t[2][i] = a + b - c\n t[3][i] = a - b + c\n t[4][i] = a - b - c\n t[5][i] = -a + b + c\n t[6][i] = -a + b - c\n t[7][i] = -a - b + c\n t[8][i] = -a - b - c\nend\nlocal ret = 0\nfor i = 1, 8 do\n local tbl = t[i]\n table.sort(tbl, function(x, y) return x > y end)\n local z = 0\n for j = 1, m do\n z = z + tbl[j]\n end\n if i == 1 or ret < z then\n ret = z\n end\nend\nprint(ret)", "language": "Lua", "metadata": {"date": 1598135854, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03326.html", "problem_id": "p03326", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03326/input.txt", "sample_output_relpath": "derived/input_output/data/p03326/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03326/Lua/s585329677.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s585329677", "user_id": "u120582723"}, "prompt_components": {"gold_output": "56\n", "input_to_evaluate": "local n, m = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, 8 do\n t[i] = {}\nend\nfor i = 1, n do\n local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n t[1][i] = a + b + c\n t[2][i] = a + b - c\n t[3][i] = a - b + c\n t[4][i] = a - b - c\n t[5][i] = -a + b + c\n t[6][i] = -a + b - c\n t[7][i] = -a - b + c\n t[8][i] = -a - b - c\nend\nlocal ret = 0\nfor i = 1, 8 do\n local tbl = t[i]\n table.sort(tbl, function(x, y) return x > y end)\n local z = 0\n for j = 1, m do\n z = z + tbl[j]\n end\n if i == 1 or ret < z then\n ret = z\n end\nend\nprint(ret)", "problem_context": "Score: 400 points\n\nProblem Statement\n\nTakahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.\n\nThe shop sells N kinds of cakes.\n\nEach kind of cake has three parameters \"beauty\", \"tastiness\" and \"popularity\". The i-th kind of cake has the beauty of x_i, the tastiness of y_i and the popularity of z_i.\n\nThese values may be zero or negative.\n\nRingo has decided to have M pieces of cakes here. He will choose the set of cakes as follows:\n\nDo not have two or more pieces of the same kind of cake.\n\nUnder the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).\n\nFind the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.\n\nConstraints\n\nN is an integer between 1 and 1 \\ 000 (inclusive).\n\nM is an integer between 0 and N (inclusive).\n\nx_i, y_i, z_i \\ (1 \\leq i \\leq N) are integers between -10 \\ 000 \\ 000 \\ 000 and 10 \\ 000 \\ 000 \\ 000 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nx_1 y_1 z_1\nx_2 y_2 z_2\n: :\nx_N y_N z_N\n\nOutput\n\nPrint the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.\n\nSample Input 1\n\n5 3\n3 1 4\n1 5 9\n2 6 5\n3 5 8\n9 7 9\n\nSample Output 1\n\n56\n\nConsider having the 2-nd, 4-th and 5-th kinds of cakes. The total beauty, tastiness and popularity will be as follows:\n\nBeauty: 1 + 3 + 9 = 13\n\nTastiness: 5 + 5 + 7 = 17\n\nPopularity: 9 + 8 + 9 = 26\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 13 + 17 + 26 = 56. This is the maximum value.\n\nSample Input 2\n\n5 3\n1 -2 3\n-4 5 -6\n7 -8 -9\n-10 11 -12\n13 -14 15\n\nSample Output 2\n\n54\n\nConsider having the 1-st, 3-rd and 5-th kinds of cakes. The total beauty, tastiness and popularity will be as follows:\n\nBeauty: 1 + 7 + 13 = 21\n\nTastiness: (-2) + (-8) + (-14) = -24\n\nPopularity: 3 + (-9) + 15 = 9\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 21 + 24 + 9 = 54. This is the maximum value.\n\nSample Input 3\n\n10 5\n10 -80 21\n23 8 38\n-94 28 11\n-26 -2 18\n-69 72 79\n-26 -86 -54\n-72 -50 59\n21 65 -32\n40 -94 87\n-62 18 82\n\nSample Output 3\n\n638\n\nIf we have the 3-rd, 4-th, 5-th, 7-th and 10-th kinds of cakes, the total beauty, tastiness and popularity will be -323, 66 and 249, respectively.\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 323 + 66 + 249 = 638. This is the maximum value.\n\nSample Input 4\n\n3 2\n2000000000 -9000000000 4000000000\n7000000000 -5000000000 3000000000\n6000000000 -1000000000 8000000000\n\nSample Output 4\n\n30000000000\n\nThe values of the beauty, tastiness and popularity of the cakes and the value to be printed may not fit into 32-bit integers.", "sample_input": "5 3\n3 1 4\n1 5 9\n2 6 5\n3 5 8\n9 7 9\n"}, "reference_outputs": ["56\n"], "source_document_id": "p03326", "source_text": "Score: 400 points\n\nProblem Statement\n\nTakahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.\n\nThe shop sells N kinds of cakes.\n\nEach kind of cake has three parameters \"beauty\", \"tastiness\" and \"popularity\". The i-th kind of cake has the beauty of x_i, the tastiness of y_i and the popularity of z_i.\n\nThese values may be zero or negative.\n\nRingo has decided to have M pieces of cakes here. He will choose the set of cakes as follows:\n\nDo not have two or more pieces of the same kind of cake.\n\nUnder the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).\n\nFind the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.\n\nConstraints\n\nN is an integer between 1 and 1 \\ 000 (inclusive).\n\nM is an integer between 0 and N (inclusive).\n\nx_i, y_i, z_i \\ (1 \\leq i \\leq N) are integers between -10 \\ 000 \\ 000 \\ 000 and 10 \\ 000 \\ 000 \\ 000 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nx_1 y_1 z_1\nx_2 y_2 z_2\n: :\nx_N y_N z_N\n\nOutput\n\nPrint the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.\n\nSample Input 1\n\n5 3\n3 1 4\n1 5 9\n2 6 5\n3 5 8\n9 7 9\n\nSample Output 1\n\n56\n\nConsider having the 2-nd, 4-th and 5-th kinds of cakes. The total beauty, tastiness and popularity will be as follows:\n\nBeauty: 1 + 3 + 9 = 13\n\nTastiness: 5 + 5 + 7 = 17\n\nPopularity: 9 + 8 + 9 = 26\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 13 + 17 + 26 = 56. This is the maximum value.\n\nSample Input 2\n\n5 3\n1 -2 3\n-4 5 -6\n7 -8 -9\n-10 11 -12\n13 -14 15\n\nSample Output 2\n\n54\n\nConsider having the 1-st, 3-rd and 5-th kinds of cakes. The total beauty, tastiness and popularity will be as follows:\n\nBeauty: 1 + 7 + 13 = 21\n\nTastiness: (-2) + (-8) + (-14) = -24\n\nPopularity: 3 + (-9) + 15 = 9\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 21 + 24 + 9 = 54. This is the maximum value.\n\nSample Input 3\n\n10 5\n10 -80 21\n23 8 38\n-94 28 11\n-26 -2 18\n-69 72 79\n-26 -86 -54\n-72 -50 59\n21 65 -32\n40 -94 87\n-62 18 82\n\nSample Output 3\n\n638\n\nIf we have the 3-rd, 4-th, 5-th, 7-th and 10-th kinds of cakes, the total beauty, tastiness and popularity will be -323, 66 and 249, respectively.\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 323 + 66 + 249 = 638. This is the maximum value.\n\nSample Input 4\n\n3 2\n2000000000 -9000000000 4000000000\n7000000000 -5000000000 3000000000\n6000000000 -1000000000 8000000000\n\nSample Output 4\n\n30000000000\n\nThe values of the beauty, tastiness and popularity of the cakes and the value to be printed may not fit into 32-bit integers.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 22, "memory_kb": 2960}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s641371597", "group_id": "codeNet:p03326", "input_text": "N=io.read(\"n\")\nM=io.read(\"n\")\nx,y,z,t={},{},{},{}\nfor i=1,N do\n x[i]=io.read(\"n\")\n y[i]=io.read(\"n\")\n z[i]=io.read(\"n\")\n t[i]=math.abs(x[i])+math.abs(y[i])+math.abs(z[i])\nend\ntable.sort(t,function (a,b) return a>b end)\nmax=0\nfor i=1,M do\n max=max+t[i]\nend\nprint(max)\n\n\n\n ", "language": "Lua", "metadata": {"date": 1550618385, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03326.html", "problem_id": "p03326", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03326/input.txt", "sample_output_relpath": "derived/input_output/data/p03326/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03326/Lua/s641371597.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s641371597", "user_id": "u015229643"}, "prompt_components": {"gold_output": "56\n", "input_to_evaluate": "N=io.read(\"n\")\nM=io.read(\"n\")\nx,y,z,t={},{},{},{}\nfor i=1,N do\n x[i]=io.read(\"n\")\n y[i]=io.read(\"n\")\n z[i]=io.read(\"n\")\n t[i]=math.abs(x[i])+math.abs(y[i])+math.abs(z[i])\nend\ntable.sort(t,function (a,b) return a>b end)\nmax=0\nfor i=1,M do\n max=max+t[i]\nend\nprint(max)\n\n\n\n ", "problem_context": "Score: 400 points\n\nProblem Statement\n\nTakahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.\n\nThe shop sells N kinds of cakes.\n\nEach kind of cake has three parameters \"beauty\", \"tastiness\" and \"popularity\". The i-th kind of cake has the beauty of x_i, the tastiness of y_i and the popularity of z_i.\n\nThese values may be zero or negative.\n\nRingo has decided to have M pieces of cakes here. He will choose the set of cakes as follows:\n\nDo not have two or more pieces of the same kind of cake.\n\nUnder the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).\n\nFind the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.\n\nConstraints\n\nN is an integer between 1 and 1 \\ 000 (inclusive).\n\nM is an integer between 0 and N (inclusive).\n\nx_i, y_i, z_i \\ (1 \\leq i \\leq N) are integers between -10 \\ 000 \\ 000 \\ 000 and 10 \\ 000 \\ 000 \\ 000 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nx_1 y_1 z_1\nx_2 y_2 z_2\n: :\nx_N y_N z_N\n\nOutput\n\nPrint the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.\n\nSample Input 1\n\n5 3\n3 1 4\n1 5 9\n2 6 5\n3 5 8\n9 7 9\n\nSample Output 1\n\n56\n\nConsider having the 2-nd, 4-th and 5-th kinds of cakes. The total beauty, tastiness and popularity will be as follows:\n\nBeauty: 1 + 3 + 9 = 13\n\nTastiness: 5 + 5 + 7 = 17\n\nPopularity: 9 + 8 + 9 = 26\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 13 + 17 + 26 = 56. This is the maximum value.\n\nSample Input 2\n\n5 3\n1 -2 3\n-4 5 -6\n7 -8 -9\n-10 11 -12\n13 -14 15\n\nSample Output 2\n\n54\n\nConsider having the 1-st, 3-rd and 5-th kinds of cakes. The total beauty, tastiness and popularity will be as follows:\n\nBeauty: 1 + 7 + 13 = 21\n\nTastiness: (-2) + (-8) + (-14) = -24\n\nPopularity: 3 + (-9) + 15 = 9\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 21 + 24 + 9 = 54. This is the maximum value.\n\nSample Input 3\n\n10 5\n10 -80 21\n23 8 38\n-94 28 11\n-26 -2 18\n-69 72 79\n-26 -86 -54\n-72 -50 59\n21 65 -32\n40 -94 87\n-62 18 82\n\nSample Output 3\n\n638\n\nIf we have the 3-rd, 4-th, 5-th, 7-th and 10-th kinds of cakes, the total beauty, tastiness and popularity will be -323, 66 and 249, respectively.\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 323 + 66 + 249 = 638. This is the maximum value.\n\nSample Input 4\n\n3 2\n2000000000 -9000000000 4000000000\n7000000000 -5000000000 3000000000\n6000000000 -1000000000 8000000000\n\nSample Output 4\n\n30000000000\n\nThe values of the beauty, tastiness and popularity of the cakes and the value to be printed may not fit into 32-bit integers.", "sample_input": "5 3\n3 1 4\n1 5 9\n2 6 5\n3 5 8\n9 7 9\n"}, "reference_outputs": ["56\n"], "source_document_id": "p03326", "source_text": "Score: 400 points\n\nProblem Statement\n\nTakahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.\n\nThe shop sells N kinds of cakes.\n\nEach kind of cake has three parameters \"beauty\", \"tastiness\" and \"popularity\". The i-th kind of cake has the beauty of x_i, the tastiness of y_i and the popularity of z_i.\n\nThese values may be zero or negative.\n\nRingo has decided to have M pieces of cakes here. He will choose the set of cakes as follows:\n\nDo not have two or more pieces of the same kind of cake.\n\nUnder the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).\n\nFind the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.\n\nConstraints\n\nN is an integer between 1 and 1 \\ 000 (inclusive).\n\nM is an integer between 0 and N (inclusive).\n\nx_i, y_i, z_i \\ (1 \\leq i \\leq N) are integers between -10 \\ 000 \\ 000 \\ 000 and 10 \\ 000 \\ 000 \\ 000 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nx_1 y_1 z_1\nx_2 y_2 z_2\n: :\nx_N y_N z_N\n\nOutput\n\nPrint the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.\n\nSample Input 1\n\n5 3\n3 1 4\n1 5 9\n2 6 5\n3 5 8\n9 7 9\n\nSample Output 1\n\n56\n\nConsider having the 2-nd, 4-th and 5-th kinds of cakes. The total beauty, tastiness and popularity will be as follows:\n\nBeauty: 1 + 3 + 9 = 13\n\nTastiness: 5 + 5 + 7 = 17\n\nPopularity: 9 + 8 + 9 = 26\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 13 + 17 + 26 = 56. This is the maximum value.\n\nSample Input 2\n\n5 3\n1 -2 3\n-4 5 -6\n7 -8 -9\n-10 11 -12\n13 -14 15\n\nSample Output 2\n\n54\n\nConsider having the 1-st, 3-rd and 5-th kinds of cakes. The total beauty, tastiness and popularity will be as follows:\n\nBeauty: 1 + 7 + 13 = 21\n\nTastiness: (-2) + (-8) + (-14) = -24\n\nPopularity: 3 + (-9) + 15 = 9\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 21 + 24 + 9 = 54. This is the maximum value.\n\nSample Input 3\n\n10 5\n10 -80 21\n23 8 38\n-94 28 11\n-26 -2 18\n-69 72 79\n-26 -86 -54\n-72 -50 59\n21 65 -32\n40 -94 87\n-62 18 82\n\nSample Output 3\n\n638\n\nIf we have the 3-rd, 4-th, 5-th, 7-th and 10-th kinds of cakes, the total beauty, tastiness and popularity will be -323, 66 and 249, respectively.\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 323 + 66 + 249 = 638. This is the maximum value.\n\nSample Input 4\n\n3 2\n2000000000 -9000000000 4000000000\n7000000000 -5000000000 3000000000\n6000000000 -1000000000 8000000000\n\nSample Output 4\n\n30000000000\n\nThe values of the beauty, tastiness and popularity of the cakes and the value to be printed may not fit into 32-bit integers.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 12, "memory_kb": 1008}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s135980829", "group_id": "codeNet:p03327", "input_text": "a=io.read()*1\nprint(a>999 and\"ABD\"or\"ABC\")", "language": "Lua", "metadata": {"date": 1551991793, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03327.html", "problem_id": "p03327", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03327/input.txt", "sample_output_relpath": "derived/input_output/data/p03327/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03327/Lua/s135980829.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s135980829", "user_id": "u837412668"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "a=io.read()*1\nprint(a>999 and\"ABD\"or\"ABC\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nDecades have passed since the beginning of AtCoder Beginner Contest.\n\nThe contests are labeled as ABC001, ABC002, ... from the first round, but after the 999-th round ABC999, a problem occurred: how the future rounds should be labeled?\n\nIn the end, the labels for the rounds from the 1000-th to the 1998-th are decided: ABD001, ABD002, ..., ABD999.\n\nYou are given an integer N between 1 and 1998 (inclusive). Print the first three characters of the label of the N-th round of AtCoder Beginner Contest.\n\nConstraints\n\n1 \\leq N \\leq 1998\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the first three characters of the label of the N-th round of AtCoder Beginner Contest.\n\nSample Input 1\n\n999\n\nSample Output 1\n\nABC\n\nThe 999-th round of AtCoder Beginner Contest is labeled as ABC999.\n\nSample Input 2\n\n1000\n\nSample Output 2\n\nABD\n\nThe 1000-th round of AtCoder Beginner Contest is labeled as ABD001.\n\nSample Input 3\n\n1481\n\nSample Output 3\n\nABD\n\nThe 1481-th round of AtCoder Beginner Contest is labeled as ABD482.", "sample_input": "999\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03327", "source_text": "Score : 100 points\n\nProblem Statement\n\nDecades have passed since the beginning of AtCoder Beginner Contest.\n\nThe contests are labeled as ABC001, ABC002, ... from the first round, but after the 999-th round ABC999, a problem occurred: how the future rounds should be labeled?\n\nIn the end, the labels for the rounds from the 1000-th to the 1998-th are decided: ABD001, ABD002, ..., ABD999.\n\nYou are given an integer N between 1 and 1998 (inclusive). Print the first three characters of the label of the N-th round of AtCoder Beginner Contest.\n\nConstraints\n\n1 \\leq N \\leq 1998\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the first three characters of the label of the N-th round of AtCoder Beginner Contest.\n\nSample Input 1\n\n999\n\nSample Output 1\n\nABC\n\nThe 999-th round of AtCoder Beginner Contest is labeled as ABC999.\n\nSample Input 2\n\n1000\n\nSample Output 2\n\nABD\n\nThe 1000-th round of AtCoder Beginner Contest is labeled as ABD001.\n\nSample Input 3\n\n1481\n\nSample Output 3\n\nABD\n\nThe 1481-th round of AtCoder Beginner Contest is labeled as ABD482.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 42, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s685610998", "group_id": "codeNet:p03327", "input_text": "N=io.read(\"n\")\nif N>999 then\n print(\"ABD\")\n else\n print(\"ABC\")\nend", "language": "Lua", "metadata": {"date": 1550687201, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03327.html", "problem_id": "p03327", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03327/input.txt", "sample_output_relpath": "derived/input_output/data/p03327/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03327/Lua/s685610998.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s685610998", "user_id": "u015229643"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "N=io.read(\"n\")\nif N>999 then\n print(\"ABD\")\n else\n print(\"ABC\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nDecades have passed since the beginning of AtCoder Beginner Contest.\n\nThe contests are labeled as ABC001, ABC002, ... from the first round, but after the 999-th round ABC999, a problem occurred: how the future rounds should be labeled?\n\nIn the end, the labels for the rounds from the 1000-th to the 1998-th are decided: ABD001, ABD002, ..., ABD999.\n\nYou are given an integer N between 1 and 1998 (inclusive). Print the first three characters of the label of the N-th round of AtCoder Beginner Contest.\n\nConstraints\n\n1 \\leq N \\leq 1998\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the first three characters of the label of the N-th round of AtCoder Beginner Contest.\n\nSample Input 1\n\n999\n\nSample Output 1\n\nABC\n\nThe 999-th round of AtCoder Beginner Contest is labeled as ABC999.\n\nSample Input 2\n\n1000\n\nSample Output 2\n\nABD\n\nThe 1000-th round of AtCoder Beginner Contest is labeled as ABD001.\n\nSample Input 3\n\n1481\n\nSample Output 3\n\nABD\n\nThe 1481-th round of AtCoder Beginner Contest is labeled as ABD482.", "sample_input": "999\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03327", "source_text": "Score : 100 points\n\nProblem Statement\n\nDecades have passed since the beginning of AtCoder Beginner Contest.\n\nThe contests are labeled as ABC001, ABC002, ... from the first round, but after the 999-th round ABC999, a problem occurred: how the future rounds should be labeled?\n\nIn the end, the labels for the rounds from the 1000-th to the 1998-th are decided: ABD001, ABD002, ..., ABD999.\n\nYou are given an integer N between 1 and 1998 (inclusive). Print the first three characters of the label of the N-th round of AtCoder Beginner Contest.\n\nConstraints\n\n1 \\leq N \\leq 1998\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the first three characters of the label of the N-th round of AtCoder Beginner Contest.\n\nSample Input 1\n\n999\n\nSample Output 1\n\nABC\n\nThe 999-th round of AtCoder Beginner Contest is labeled as ABC999.\n\nSample Input 2\n\n1000\n\nSample Output 2\n\nABD\n\nThe 1000-th round of AtCoder Beginner Contest is labeled as ABD001.\n\nSample Input 3\n\n1481\n\nSample Output 3\n\nABD\n\nThe 1481-th round of AtCoder Beginner Contest is labeled as ABD482.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 69, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s883228437", "group_id": "codeNet:p03327", "input_text": "n = tonumber(io.read())\nif n < 1000 then\n print(\"ABC\")\nelse\n print(\"ABD\")\nend\n", "language": "Lua", "metadata": {"date": 1529314248, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03327.html", "problem_id": "p03327", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03327/input.txt", "sample_output_relpath": "derived/input_output/data/p03327/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03327/Lua/s883228437.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s883228437", "user_id": "u714587753"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "n = tonumber(io.read())\nif n < 1000 then\n print(\"ABC\")\nelse\n print(\"ABD\")\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nDecades have passed since the beginning of AtCoder Beginner Contest.\n\nThe contests are labeled as ABC001, ABC002, ... from the first round, but after the 999-th round ABC999, a problem occurred: how the future rounds should be labeled?\n\nIn the end, the labels for the rounds from the 1000-th to the 1998-th are decided: ABD001, ABD002, ..., ABD999.\n\nYou are given an integer N between 1 and 1998 (inclusive). Print the first three characters of the label of the N-th round of AtCoder Beginner Contest.\n\nConstraints\n\n1 \\leq N \\leq 1998\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the first three characters of the label of the N-th round of AtCoder Beginner Contest.\n\nSample Input 1\n\n999\n\nSample Output 1\n\nABC\n\nThe 999-th round of AtCoder Beginner Contest is labeled as ABC999.\n\nSample Input 2\n\n1000\n\nSample Output 2\n\nABD\n\nThe 1000-th round of AtCoder Beginner Contest is labeled as ABD001.\n\nSample Input 3\n\n1481\n\nSample Output 3\n\nABD\n\nThe 1481-th round of AtCoder Beginner Contest is labeled as ABD482.", "sample_input": "999\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03327", "source_text": "Score : 100 points\n\nProblem Statement\n\nDecades have passed since the beginning of AtCoder Beginner Contest.\n\nThe contests are labeled as ABC001, ABC002, ... from the first round, but after the 999-th round ABC999, a problem occurred: how the future rounds should be labeled?\n\nIn the end, the labels for the rounds from the 1000-th to the 1998-th are decided: ABD001, ABD002, ..., ABD999.\n\nYou are given an integer N between 1 and 1998 (inclusive). Print the first three characters of the label of the N-th round of AtCoder Beginner Contest.\n\nConstraints\n\n1 \\leq N \\leq 1998\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the first three characters of the label of the N-th round of AtCoder Beginner Contest.\n\nSample Input 1\n\n999\n\nSample Output 1\n\nABC\n\nThe 999-th round of AtCoder Beginner Contest is labeled as ABC999.\n\nSample Input 2\n\n1000\n\nSample Output 2\n\nABD\n\nThe 1000-th round of AtCoder Beginner Contest is labeled as ABD001.\n\nSample Input 3\n\n1481\n\nSample Output 3\n\nABD\n\nThe 1481-th round of AtCoder Beginner Contest is labeled as ABD482.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 80, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s054494289", "group_id": "codeNet:p03329", "input_text": "N=io.read(\"n\")\nt={}\nfor i=0,N do\n count=0\n k=i\n j=N-i \n while (k>0) do\n count=count+k%6\n k=k//6\n end\n while (j>0) do\n count=count+j%9\n j=j//9\n end\n t[i+1]=count\nend\ntable.sort(t)\nprint(t[1])", "language": "Lua", "metadata": {"date": 1550703409, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s054494289.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s054494289", "user_id": "u015229643"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "N=io.read(\"n\")\nt={}\nfor i=0,N do\n count=0\n k=i\n j=N-i \n while (k>0) do\n count=count+k%6\n k=k//6\n end\n while (j>0) do\n count=count+j%9\n j=j//9\n end\n t[i+1]=count\nend\ntable.sort(t)\nprint(t[1])", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 271, "memory_kb": 2424}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s734800081", "group_id": "codeNet:p03329", "input_text": "N=io.read(\"n\")\nt={}\nfor i=0,N do\n count=0\n k=i\n j=N-i \n while (k>0) do\n count=count+k%6\n k=k//6\n end\n while (j>0) do\n count=count+j%9\n j=j//9\n end\n t[i]=count\nend\ntable.sort(t)\nprint(t[1])", "language": "Lua", "metadata": {"date": 1550703145, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s734800081.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s734800081", "user_id": "u015229643"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "N=io.read(\"n\")\nt={}\nfor i=0,N do\n count=0\n k=i\n j=N-i \n while (k>0) do\n count=count+k%6\n k=k//6\n end\n while (j>0) do\n count=count+j%9\n j=j//9\n end\n t[i]=count\nend\ntable.sort(t)\nprint(t[1])", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 279, "memory_kb": 2424}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s533554816", "group_id": "codeNet:p03329", "input_text": "N=io.read(\"n\")\nfor i=1,N do\n count=0\n j=N-i \n while i>0 do\n count=count+i%6\n i=i//6\n end\n while j>0 do\n count=count+j%9\n j=j//9\n end\n t[i]=count\nend\ntable.sort(t)\nprint(t[1])", "language": "Lua", "metadata": {"date": 1550701685, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s533554816.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s533554816", "user_id": "u015229643"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "N=io.read(\"n\")\nfor i=1,N do\n count=0\n j=N-i \n while i>0 do\n count=count+i%6\n i=i//6\n end\n while j>0 do\n count=count+j%9\n j=j//9\n end\n t[i]=count\nend\ntable.sort(t)\nprint(t[1])", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s572302776", "group_id": "codeNet:p03329", "input_text": "N=io.read(\"n\")\nfor i=1,N do\n local count=0\n local j=N-i \n while i>0 do\n count=count+i%6\n i=i//6\n end\n while j>0 do\n count=count+j%9\n j=j//9\n end\n t[i]=count\nend\ntable.sort(t)\nprint(t[1])", "language": "Lua", "metadata": {"date": 1550698204, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s572302776.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s572302776", "user_id": "u015229643"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "N=io.read(\"n\")\nfor i=1,N do\n local count=0\n local j=N-i \n while i>0 do\n count=count+i%6\n i=i//6\n end\n while j>0 do\n count=count+j%9\n j=j//9\n end\n t[i]=count\nend\ntable.sort(t)\nprint(t[1])", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s964815236", "group_id": "codeNet:p03331", "input_text": "local n = io.read(\"*n\")\nlocal hn = n // 2\n\nlocal function get(x)\n local r = 0\n while 0 < x do\n r = r + x % 10\n x = x // 10\n end\n return r\nend\nlocal mmi = math.min\nlocal ret = get(1) + get(n - 1)\nfor i = 2, hn do\n ret = mmi(ret, get(i) + get(n - i))\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1563307657, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s964815236.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s964815236", "user_id": "u120582723"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal hn = n // 2\n\nlocal function get(x)\n local r = 0\n while 0 < x do\n r = r + x % 10\n x = x // 10\n end\n return r\nend\nlocal mmi = math.min\nlocal ret = get(1) + get(n - 1)\nfor i = 2, hn do\n ret = mmi(ret, get(i) + get(n - i))\nend\nprint(ret)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has two positive integers A and B.\n\nIt is known that A plus B equals N.\nFind the minimum possible value of \"the sum of the digits of A\" plus \"the sum of the digits of B\" (in base 10).\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum possible value of \"the sum of the digits of A\" plus \"the sum of the digits of B\".\n\nSample Input 1\n\n15\n\nSample Output 1\n\n6\n\nWhen A=2 and B=13, the sums of their digits are 2 and 4, which minimizes the value in question.\n\nSample Input 2\n\n100000\n\nSample Output 2\n\n10", "sample_input": "15\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03331", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has two positive integers A and B.\n\nIt is known that A plus B equals N.\nFind the minimum possible value of \"the sum of the digits of A\" plus \"the sum of the digits of B\" (in base 10).\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum possible value of \"the sum of the digits of A\" plus \"the sum of the digits of B\".\n\nSample Input 1\n\n15\n\nSample Output 1\n\n6\n\nWhen A=2 and B=13, the sums of their digits are 2 and 4, which minimizes the value in question.\n\nSample Input 2\n\n100000\n\nSample Output 2\n\n10", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 37, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s401809446", "group_id": "codeNet:p03331", "input_text": "local someTable = {}\nfor i=1,10 do\n someTable[10^i] = true\nend\n\nfunction suibian(a)\n local total = 0\n if someTable[a] then\n print(10)\n return\n end\n a = tostring(a)\n for i=1,string.len(a) do\n total = tonumber(string.sub(a,i,i))+total\n end\n print(total)\nend\nlocal n = io.read(\"*n\")\nsuibian(n)", "language": "Lua", "metadata": {"date": 1541654389, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s401809446.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s401809446", "user_id": "u353919145"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "local someTable = {}\nfor i=1,10 do\n someTable[10^i] = true\nend\n\nfunction suibian(a)\n local total = 0\n if someTable[a] then\n print(10)\n return\n end\n a = tostring(a)\n for i=1,string.len(a) do\n total = tonumber(string.sub(a,i,i))+total\n end\n print(total)\nend\nlocal n = io.read(\"*n\")\nsuibian(n)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has two positive integers A and B.\n\nIt is known that A plus B equals N.\nFind the minimum possible value of \"the sum of the digits of A\" plus \"the sum of the digits of B\" (in base 10).\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum possible value of \"the sum of the digits of A\" plus \"the sum of the digits of B\".\n\nSample Input 1\n\n15\n\nSample Output 1\n\n6\n\nWhen A=2 and B=13, the sums of their digits are 2 and 4, which minimizes the value in question.\n\nSample Input 2\n\n100000\n\nSample Output 2\n\n10", "sample_input": "15\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03331", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has two positive integers A and B.\n\nIt is known that A plus B equals N.\nFind the minimum possible value of \"the sum of the digits of A\" plus \"the sum of the digits of B\" (in base 10).\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum possible value of \"the sum of the digits of A\" plus \"the sum of the digits of B\".\n\nSample Input 1\n\n15\n\nSample Output 1\n\n6\n\nWhen A=2 and B=13, the sums of their digits are 2 and 4, which minimizes the value in question.\n\nSample Input 2\n\n100000\n\nSample Output 2\n\n10", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 335, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s782764791", "group_id": "codeNet:p03331", "input_text": "n = io.read(\"*n\")\nif n % 10 == 0 then\n\tprint(10)\nelse\n\tsum = 0\n\twhile n > 0 do\n\t\tsum = sum + n % 10\n\t\tn = math.floor(n / 10)\n\tend\n\tprint(sum)\nend", "language": "Lua", "metadata": {"date": 1541635114, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s782764791.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s782764791", "user_id": "u018679195"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "n = io.read(\"*n\")\nif n % 10 == 0 then\n\tprint(10)\nelse\n\tsum = 0\n\twhile n > 0 do\n\t\tsum = sum + n % 10\n\t\tn = math.floor(n / 10)\n\tend\n\tprint(sum)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s555470086", "group_id": "codeNet:p03337", "input_text": "a, b = io.read(): match(\"(.+)%s(.+)\")\nprint(string.format(\"%d\", math.max(math.max(a + b, a - b), a * b)))", "language": "Lua", "metadata": {"date": 1552101369, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03337.html", "problem_id": "p03337", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03337/input.txt", "sample_output_relpath": "derived/input_output/data/p03337/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03337/Lua/s555470086.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s555470086", "user_id": "u810735437"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "a, b = io.read(): match(\"(.+)%s(.+)\")\nprint(string.format(\"%d\", math.max(math.max(a + b, a - b), a * b)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B.\nFind the largest value among A+B, A-B and A \\times B.\n\nConstraints\n\n-1000 \\leq A,B \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest value among A+B, A-B and A \\times B.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\n4\n\n3+1=4, 3-1=2 and 3 \\times 1=3. The largest among them is 4.\n\nSample Input 2\n\n4 -2\n\nSample Output 2\n\n6\n\nThe largest is 4 - (-2) = 6.\n\nSample Input 3\n\n0 0\n\nSample Output 3\n\n0", "sample_input": "3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03337", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B.\nFind the largest value among A+B, A-B and A \\times B.\n\nConstraints\n\n-1000 \\leq A,B \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest value among A+B, A-B and A \\times B.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\n4\n\n3+1=4, 3-1=2 and 3 \\times 1=3. The largest among them is 4.\n\nSample Input 2\n\n4 -2\n\nSample Output 2\n\n6\n\nThe largest is 4 - (-2) = 6.\n\nSample Input 3\n\n0 0\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 105, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s859780821", "group_id": "codeNet:p03337", "input_text": "a,b=io.read():match(\"(.+)%s(.+)\")\nprint(math.floor(math.max(a+b,a-b,a*b)))", "language": "Lua", "metadata": {"date": 1551841539, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03337.html", "problem_id": "p03337", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03337/input.txt", "sample_output_relpath": "derived/input_output/data/p03337/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03337/Lua/s859780821.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s859780821", "user_id": "u837412668"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "a,b=io.read():match(\"(.+)%s(.+)\")\nprint(math.floor(math.max(a+b,a-b,a*b)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B.\nFind the largest value among A+B, A-B and A \\times B.\n\nConstraints\n\n-1000 \\leq A,B \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest value among A+B, A-B and A \\times B.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\n4\n\n3+1=4, 3-1=2 and 3 \\times 1=3. The largest among them is 4.\n\nSample Input 2\n\n4 -2\n\nSample Output 2\n\n6\n\nThe largest is 4 - (-2) = 6.\n\nSample Input 3\n\n0 0\n\nSample Output 3\n\n0", "sample_input": "3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03337", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B.\nFind the largest value among A+B, A-B and A \\times B.\n\nConstraints\n\n-1000 \\leq A,B \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest value among A+B, A-B and A \\times B.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\n4\n\n3+1=4, 3-1=2 and 3 \\times 1=3. The largest among them is 4.\n\nSample Input 2\n\n4 -2\n\nSample Output 2\n\n6\n\nThe largest is 4 - (-2) = 6.\n\nSample Input 3\n\n0 0\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 74, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s313568461", "group_id": "codeNet:p03337", "input_text": "A,B=io.read(\"n\",\"n\")\na=A+B\nb=A-B\nc=A*B\nres=math.max(a,b)\nres=math.max(res,c)\nprint(res)", "language": "Lua", "metadata": {"date": 1550703595, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03337.html", "problem_id": "p03337", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03337/input.txt", "sample_output_relpath": "derived/input_output/data/p03337/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03337/Lua/s313568461.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s313568461", "user_id": "u015229643"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "A,B=io.read(\"n\",\"n\")\na=A+B\nb=A-B\nc=A*B\nres=math.max(a,b)\nres=math.max(res,c)\nprint(res)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B.\nFind the largest value among A+B, A-B and A \\times B.\n\nConstraints\n\n-1000 \\leq A,B \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest value among A+B, A-B and A \\times B.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\n4\n\n3+1=4, 3-1=2 and 3 \\times 1=3. The largest among them is 4.\n\nSample Input 2\n\n4 -2\n\nSample Output 2\n\n6\n\nThe largest is 4 - (-2) = 6.\n\nSample Input 3\n\n0 0\n\nSample Output 3\n\n0", "sample_input": "3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03337", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B.\nFind the largest value among A+B, A-B and A \\times B.\n\nConstraints\n\n-1000 \\leq A,B \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest value among A+B, A-B and A \\times B.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\n4\n\n3+1=4, 3-1=2 and 3 \\times 1=3. The largest among them is 4.\n\nSample Input 2\n\n4 -2\n\nSample Output 2\n\n6\n\nThe largest is 4 - (-2) = 6.\n\nSample Input 3\n\n0 0\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 87, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s304907900", "group_id": "codeNet:p03337", "input_text": "a,b=io.read(\"*n\",\"*n\")\nprint(math.max(a+b,a-b,a*b))", "language": "Lua", "metadata": {"date": 1527424412, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03337.html", "problem_id": "p03337", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03337/input.txt", "sample_output_relpath": "derived/input_output/data/p03337/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03337/Lua/s304907900.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s304907900", "user_id": "u781091740"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "a,b=io.read(\"*n\",\"*n\")\nprint(math.max(a+b,a-b,a*b))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B.\nFind the largest value among A+B, A-B and A \\times B.\n\nConstraints\n\n-1000 \\leq A,B \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest value among A+B, A-B and A \\times B.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\n4\n\n3+1=4, 3-1=2 and 3 \\times 1=3. The largest among them is 4.\n\nSample Input 2\n\n4 -2\n\nSample Output 2\n\n6\n\nThe largest is 4 - (-2) = 6.\n\nSample Input 3\n\n0 0\n\nSample Output 3\n\n0", "sample_input": "3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03337", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B.\nFind the largest value among A+B, A-B and A \\times B.\n\nConstraints\n\n-1000 \\leq A,B \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest value among A+B, A-B and A \\times B.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\n4\n\n3+1=4, 3-1=2 and 3 \\times 1=3. The largest among them is 4.\n\nSample Input 2\n\n4 -2\n\nSample Output 2\n\n6\n\nThe largest is 4 - (-2) = 6.\n\nSample Input 3\n\n0 0\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s784929396", "group_id": "codeNet:p03346", "input_text": "local n = io.read(\"*n\")\nlocal t = {}\nfor i = 1, n do t[i] = i end\nfor i = 1, n do\n local a = io.read(\"*n\")\n t[a] = i\nend\nlocal f = {}\nfor i = 1, n - 1 do\n f[i] = t[i] < t[i + 1]\nend\nf[n] = false\nlocal len = 0\nlocal mma = math.max\nlocal mlen = 0\nfor i = 1, n do\n if f[i] then\n len = len + 1\n else\n mlen = mma(mlen, len)\n len = 0\n end\nend\nprint(n - 1 - mlen)\n", "language": "Lua", "metadata": {"date": 1563369231, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03346.html", "problem_id": "p03346", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03346/input.txt", "sample_output_relpath": "derived/input_output/data/p03346/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03346/Lua/s784929396.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s784929396", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal t = {}\nfor i = 1, n do t[i] = i end\nfor i = 1, n do\n local a = io.read(\"*n\")\n t[a] = i\nend\nlocal f = {}\nfor i = 1, n - 1 do\n f[i] = t[i] < t[i + 1]\nend\nf[n] = false\nlocal len = 0\nlocal mma = math.max\nlocal mlen = 0\nfor i = 1, n do\n if f[i] then\n len = len + 1\n else\n mlen = mma(mlen, len)\n len = 0\n end\nend\nprint(n - 1 - mlen)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a sequence (P_1,P_2,...,P_N) which is a permutation of the integers from 1 through N.\nYou would like to sort this sequence in ascending order by repeating the following operation:\n\nChoose an element in the sequence and move it to the beginning or the end of the sequence.\n\nFind the minimum number of operations required.\nIt can be proved that it is actually possible to sort the sequence using this operation.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n(P_1,P_2,...,P_N) is a permutation of (1,2,...,N).\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nP_1\n:\nP_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4\n1\n3\n2\n4\n\nSample Output 1\n\n2\n\nFor example, the sequence can be sorted in ascending order as follows:\n\nMove 2 to the beginning. The sequence is now (2,1,3,4).\n\nMove 1 to the beginning. The sequence is now (1,2,3,4).\n\nSample Input 2\n\n6\n3\n2\n5\n1\n4\n6\n\nSample Output 2\n\n4\n\nSample Input 3\n\n8\n6\n3\n1\n2\n7\n4\n8\n5\n\nSample Output 3\n\n5", "sample_input": "4\n1\n3\n2\n4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03346", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a sequence (P_1,P_2,...,P_N) which is a permutation of the integers from 1 through N.\nYou would like to sort this sequence in ascending order by repeating the following operation:\n\nChoose an element in the sequence and move it to the beginning or the end of the sequence.\n\nFind the minimum number of operations required.\nIt can be proved that it is actually possible to sort the sequence using this operation.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n(P_1,P_2,...,P_N) is a permutation of (1,2,...,N).\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nP_1\n:\nP_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4\n1\n3\n2\n4\n\nSample Output 1\n\n2\n\nFor example, the sequence can be sorted in ascending order as follows:\n\nMove 2 to the beginning. The sequence is now (2,1,3,4).\n\nMove 1 to the beginning. The sequence is now (1,2,3,4).\n\nSample Input 2\n\n6\n3\n2\n5\n1\n4\n6\n\nSample Output 2\n\n4\n\nSample Input 3\n\n8\n6\n3\n1\n2\n7\n4\n8\n5\n\nSample Output 3\n\n5", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 372, "cpu_time_ms": 86, "memory_kb": 9072}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s156647268", "group_id": "codeNet:p03346", "input_text": "local N = io.read(\"n\")\nlocal P = {}\nlocal sort_count = {}\nsort_count[0] = 0\nfor i=1,N do\n P[i] = io.read(\"n\")\n sort_count[i] = 0\nend\n\nfor i=1,N do\n local n = P[i]\n sort_count[n] = sort_count[n-1] + 1\nend\n\nlocal max = 0\nfor i=1,N do\n if sort_count[i] > max then\n max = sort_count[i]\n end\nend\n\nprint(N-max)\n", "language": "Lua", "metadata": {"date": 1553378195, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03346.html", "problem_id": "p03346", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03346/input.txt", "sample_output_relpath": "derived/input_output/data/p03346/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03346/Lua/s156647268.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s156647268", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local N = io.read(\"n\")\nlocal P = {}\nlocal sort_count = {}\nsort_count[0] = 0\nfor i=1,N do\n P[i] = io.read(\"n\")\n sort_count[i] = 0\nend\n\nfor i=1,N do\n local n = P[i]\n sort_count[n] = sort_count[n-1] + 1\nend\n\nlocal max = 0\nfor i=1,N do\n if sort_count[i] > max then\n max = sort_count[i]\n end\nend\n\nprint(N-max)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a sequence (P_1,P_2,...,P_N) which is a permutation of the integers from 1 through N.\nYou would like to sort this sequence in ascending order by repeating the following operation:\n\nChoose an element in the sequence and move it to the beginning or the end of the sequence.\n\nFind the minimum number of operations required.\nIt can be proved that it is actually possible to sort the sequence using this operation.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n(P_1,P_2,...,P_N) is a permutation of (1,2,...,N).\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nP_1\n:\nP_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4\n1\n3\n2\n4\n\nSample Output 1\n\n2\n\nFor example, the sequence can be sorted in ascending order as follows:\n\nMove 2 to the beginning. The sequence is now (2,1,3,4).\n\nMove 1 to the beginning. The sequence is now (1,2,3,4).\n\nSample Input 2\n\n6\n3\n2\n5\n1\n4\n6\n\nSample Output 2\n\n4\n\nSample Input 3\n\n8\n6\n3\n1\n2\n7\n4\n8\n5\n\nSample Output 3\n\n5", "sample_input": "4\n1\n3\n2\n4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03346", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a sequence (P_1,P_2,...,P_N) which is a permutation of the integers from 1 through N.\nYou would like to sort this sequence in ascending order by repeating the following operation:\n\nChoose an element in the sequence and move it to the beginning or the end of the sequence.\n\nFind the minimum number of operations required.\nIt can be proved that it is actually possible to sort the sequence using this operation.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n(P_1,P_2,...,P_N) is a permutation of (1,2,...,N).\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nP_1\n:\nP_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4\n1\n3\n2\n4\n\nSample Output 1\n\n2\n\nFor example, the sequence can be sorted in ascending order as follows:\n\nMove 2 to the beginning. The sequence is now (2,1,3,4).\n\nMove 1 to the beginning. The sequence is now (1,2,3,4).\n\nSample Input 2\n\n6\n3\n2\n5\n1\n4\n6\n\nSample Output 2\n\n4\n\nSample Input 3\n\n8\n6\n3\n1\n2\n7\n4\n8\n5\n\nSample Output 3\n\n5", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 330, "cpu_time_ms": 94, "memory_kb": 9080}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s695526508", "group_id": "codeNet:p03351", "input_text": "a,b,c,d=io.read():match(\"(.+)%s(.+)%s(.+)%s(.+)\")\nprint(math.abs(a-c)>d*1 and (math.abs(a-b)>d*1 or math.abs(b-c)>d*1)and\"No\"or\"Yes\")", "language": "Lua", "metadata": {"date": 1551841434, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03351.html", "problem_id": "p03351", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03351/input.txt", "sample_output_relpath": "derived/input_output/data/p03351/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03351/Lua/s695526508.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s695526508", "user_id": "u837412668"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "a,b,c,d=io.read():match(\"(.+)%s(.+)%s(.+)%s(.+)\")\nprint(math.abs(a-c)>d*1 and (math.abs(a-b)>d*1 or math.abs(b-c)>d*1)and\"No\"or\"Yes\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThree people, A, B and C, are trying to communicate using transceivers.\nThey are standing along a number line, and the coordinates of A, B and C are a, b and c (in meters), respectively.\nTwo people can directly communicate when the distance between them is at most d meters.\nDetermine if A and C can communicate, either directly or indirectly.\nHere, A and C can indirectly communicate when A and B can directly communicate and also B and C can directly communicate.\n\nConstraints\n\n1 ≤ a,b,c ≤ 100\n\n1 ≤ d ≤ 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c d\n\nOutput\n\nIf A and C can communicate, print Yes; if they cannot, print No.\n\nSample Input 1\n\n4 7 9 3\n\nSample Output 1\n\nYes\n\nA and B can directly communicate, and also B and C can directly communicate, so we should print Yes.\n\nSample Input 2\n\n100 10 1 2\n\nSample Output 2\n\nNo\n\nThey cannot communicate in this case.\n\nSample Input 3\n\n10 10 10 1\n\nSample Output 3\n\nYes\n\nThere can be multiple people at the same position.\n\nSample Input 4\n\n1 100 2 10\n\nSample Output 4\n\nYes", "sample_input": "4 7 9 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03351", "source_text": "Score : 100 points\n\nProblem Statement\n\nThree people, A, B and C, are trying to communicate using transceivers.\nThey are standing along a number line, and the coordinates of A, B and C are a, b and c (in meters), respectively.\nTwo people can directly communicate when the distance between them is at most d meters.\nDetermine if A and C can communicate, either directly or indirectly.\nHere, A and C can indirectly communicate when A and B can directly communicate and also B and C can directly communicate.\n\nConstraints\n\n1 ≤ a,b,c ≤ 100\n\n1 ≤ d ≤ 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c d\n\nOutput\n\nIf A and C can communicate, print Yes; if they cannot, print No.\n\nSample Input 1\n\n4 7 9 3\n\nSample Output 1\n\nYes\n\nA and B can directly communicate, and also B and C can directly communicate, so we should print Yes.\n\nSample Input 2\n\n100 10 1 2\n\nSample Output 2\n\nNo\n\nThey cannot communicate in this case.\n\nSample Input 3\n\n10 10 10 1\n\nSample Output 3\n\nYes\n\nThere can be multiple people at the same position.\n\nSample Input 4\n\n1 100 2 10\n\nSample Output 4\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 133, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s140953737", "group_id": "codeNet:p03351", "input_text": "a,b,c,d=io.read(\"n\",\"n\",\"n\",\"n\")\nif math.abs(c-a)<=d or math.abs(b-a)<=d and math.abs(c-b)<=d then\n print(\"Yes\")\n else\n print(\"No\")\nend", "language": "Lua", "metadata": {"date": 1550716644, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03351.html", "problem_id": "p03351", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03351/input.txt", "sample_output_relpath": "derived/input_output/data/p03351/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03351/Lua/s140953737.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s140953737", "user_id": "u015229643"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "a,b,c,d=io.read(\"n\",\"n\",\"n\",\"n\")\nif math.abs(c-a)<=d or math.abs(b-a)<=d and math.abs(c-b)<=d then\n print(\"Yes\")\n else\n print(\"No\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThree people, A, B and C, are trying to communicate using transceivers.\nThey are standing along a number line, and the coordinates of A, B and C are a, b and c (in meters), respectively.\nTwo people can directly communicate when the distance between them is at most d meters.\nDetermine if A and C can communicate, either directly or indirectly.\nHere, A and C can indirectly communicate when A and B can directly communicate and also B and C can directly communicate.\n\nConstraints\n\n1 ≤ a,b,c ≤ 100\n\n1 ≤ d ≤ 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c d\n\nOutput\n\nIf A and C can communicate, print Yes; if they cannot, print No.\n\nSample Input 1\n\n4 7 9 3\n\nSample Output 1\n\nYes\n\nA and B can directly communicate, and also B and C can directly communicate, so we should print Yes.\n\nSample Input 2\n\n100 10 1 2\n\nSample Output 2\n\nNo\n\nThey cannot communicate in this case.\n\nSample Input 3\n\n10 10 10 1\n\nSample Output 3\n\nYes\n\nThere can be multiple people at the same position.\n\nSample Input 4\n\n1 100 2 10\n\nSample Output 4\n\nYes", "sample_input": "4 7 9 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03351", "source_text": "Score : 100 points\n\nProblem Statement\n\nThree people, A, B and C, are trying to communicate using transceivers.\nThey are standing along a number line, and the coordinates of A, B and C are a, b and c (in meters), respectively.\nTwo people can directly communicate when the distance between them is at most d meters.\nDetermine if A and C can communicate, either directly or indirectly.\nHere, A and C can indirectly communicate when A and B can directly communicate and also B and C can directly communicate.\n\nConstraints\n\n1 ≤ a,b,c ≤ 100\n\n1 ≤ d ≤ 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c d\n\nOutput\n\nIf A and C can communicate, print Yes; if they cannot, print No.\n\nSample Input 1\n\n4 7 9 3\n\nSample Output 1\n\nYes\n\nA and B can directly communicate, and also B and C can directly communicate, so we should print Yes.\n\nSample Input 2\n\n100 10 1 2\n\nSample Output 2\n\nNo\n\nThey cannot communicate in this case.\n\nSample Input 3\n\n10 10 10 1\n\nSample Output 3\n\nYes\n\nThere can be multiple people at the same position.\n\nSample Input 4\n\n1 100 2 10\n\nSample Output 4\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Lua:s491685978", "group_id": "codeNet:p03354", "input_text": "local par={}\nlocal size={}\n\nlocal function init(n)\n for i=1,n do\n par[i]=i\n size[i]=1\n end\nend\n\nlocal function root(x)\n return par[x]==x and x or root(par[x])\nend\n\nlocal function same(x,y)\n return root(x)==root(y)\nend\n\nlocal function unite(x,y)\n x=root(x)\n y=root(y)\n if x==y then\n return\n end\n if size[x]>size[y] then\n x,y=y,x\n end\n par[x]=y\n size[y]=size[y]+size[x]\nend\n\nlocal function getsize(x)\n return size[root(x)]\nend\n\n----------\n\nlocal n,m=io.read(\"n\",\"n\")\ninit(n)\n\nlocal p={}\nfor i=1,n do\n p[i]=io.read(\"n\")\nend\n\nfor i=1,m do\n local x,y=io.read(\"n\",\"n\")\n unite(x,y)\nend\n\nlocal counter=0\nfor i=1,n do\n if same(p[i],i) then\n counter=counter+1\n end\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1598176308, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p03354.html", "problem_id": "p03354", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03354/input.txt", "sample_output_relpath": "derived/input_output/data/p03354/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03354/Lua/s491685978.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s491685978", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local par={}\nlocal size={}\n\nlocal function init(n)\n for i=1,n do\n par[i]=i\n size[i]=1\n end\nend\n\nlocal function root(x)\n return par[x]==x and x or root(par[x])\nend\n\nlocal function same(x,y)\n return root(x)==root(y)\nend\n\nlocal function unite(x,y)\n x=root(x)\n y=root(y)\n if x==y then\n return\n end\n if size[x]>size[y] then\n x,y=y,x\n end\n par[x]=y\n size[y]=size[y]+size[x]\nend\n\nlocal function getsize(x)\n return size[root(x)]\nend\n\n----------\n\nlocal n,m=io.read(\"n\",\"n\")\ninit(n)\n\nlocal p={}\nfor i=1,n do\n p[i]=io.read(\"n\")\nend\n\nfor i=1,m do\n local x,y=io.read(\"n\",\"n\")\n unite(x,y)\nend\n\nlocal counter=0\nfor i=1,n do\n if same(p[i],i) then\n counter=counter+1\n end\nend\nprint(counter)", "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": "p03354", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 77, "memory_kb": 5884}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s451222511", "group_id": "codeNet:p03354", "input_text": "local par={}\nlocal rank={}\nlocal size={}\n\nlocal function init(n)\n for i=1,n do\n par[i]=i\n rank[i]=1\n size[i]=1\n end\nend\n\nlocal function root(x)\n return par[x]==x and x or root(par[x])\nend\n\nlocal function same(x,y)\n return root(x)==root(y)\nend\n\nlocal function unite(x,y)\n x=root(x)\n y=root(y)\n if x==y then\n return\n end\n if rank[x]>rank[y] then\n par[x]=y\n size[y]=size[y]+size[x]\n else\n par[x]=y\n size[y]=size[y]+size[x]\n if rank[x]==rank[y] then\n rank[y]=rank[y]+1\n end\n end\nend\n\nlocal function getsize(x)\n return size[root(x)]\nend\n\n----------\n\nlocal n,m=io.read(\"n\",\"n\")\ninit(n)\n\nlocal p={}\nfor i=1,n do\n p[i]=io.read(\"n\")\nend\n\nfor i=1,m do\n local x,y=io.read(\"n\",\"n\")\n unite(x,y)\nend\n\nlocal counter=0\nfor i=1,n do\n if same(p[i],i) then\n counter=counter+1\n end\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1598174182, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03354.html", "problem_id": "p03354", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03354/input.txt", "sample_output_relpath": "derived/input_output/data/p03354/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03354/Lua/s451222511.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s451222511", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local par={}\nlocal rank={}\nlocal size={}\n\nlocal function init(n)\n for i=1,n do\n par[i]=i\n rank[i]=1\n size[i]=1\n end\nend\n\nlocal function root(x)\n return par[x]==x and x or root(par[x])\nend\n\nlocal function same(x,y)\n return root(x)==root(y)\nend\n\nlocal function unite(x,y)\n x=root(x)\n y=root(y)\n if x==y then\n return\n end\n if rank[x]>rank[y] then\n par[x]=y\n size[y]=size[y]+size[x]\n else\n par[x]=y\n size[y]=size[y]+size[x]\n if rank[x]==rank[y] then\n rank[y]=rank[y]+1\n end\n end\nend\n\nlocal function getsize(x)\n return size[root(x)]\nend\n\n----------\n\nlocal n,m=io.read(\"n\",\"n\")\ninit(n)\n\nlocal p={}\nfor i=1,n do\n p[i]=io.read(\"n\")\nend\n\nfor i=1,m do\n local x,y=io.read(\"n\",\"n\")\n unite(x,y)\nend\n\nlocal counter=0\nfor i=1,n do\n if same(p[i],i) then\n counter=counter+1\n end\nend\nprint(counter)", "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": "p03354", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 919, "cpu_time_ms": 2206, "memory_kb": 11256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s443894858", "group_id": "codeNet:p03354", "input_text": "local par={}\nlocal rank={}\nlocal size={}\n\nlocal function init(n)\n for i=1,n do\n par[i]=i\n rank[i]=1\n size[i]=1\n end\nend\n\nlocal function root(x)\n return par[x]==x and x or root(par[x])\nend\n\nlocal function same(x,y)\n return root(x)==root(y)\nend\n\nlocal function unite(x,y)\n x=root(x)\n y=root(y)\n if x==y then\n return\n end\n if rank[x]>rank[y] then\n par[x]=y\n size[y]=size[y]+size[x]\n else\n par[x]=y\n size[y]=size[y]+size[x]\n if rank[x]==rank[y] then\n rank[y]=rank[y]+1\n end\n end\nend\n\nlocal function getsize(x)\n return size[root(x)]\nend\n\n----------\n\nlocal n,m=io.read(\"n\",\"n\")\ninit(n)\n\nlocal p={}\nfor i=1,n do\n p[i]=io.read(\"n\")\nend\n\nfor i=1,m do\n local x,y=io.read(\"n\",\"n\")\n unite(x,y)\nend\n\nlocal counter=0\nfor i=1,n do\n if same(p[i],i) then\n counter=counter+1\n end\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1598174036, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p03354.html", "problem_id": "p03354", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03354/input.txt", "sample_output_relpath": "derived/input_output/data/p03354/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03354/Lua/s443894858.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s443894858", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local par={}\nlocal rank={}\nlocal size={}\n\nlocal function init(n)\n for i=1,n do\n par[i]=i\n rank[i]=1\n size[i]=1\n end\nend\n\nlocal function root(x)\n return par[x]==x and x or root(par[x])\nend\n\nlocal function same(x,y)\n return root(x)==root(y)\nend\n\nlocal function unite(x,y)\n x=root(x)\n y=root(y)\n if x==y then\n return\n end\n if rank[x]>rank[y] then\n par[x]=y\n size[y]=size[y]+size[x]\n else\n par[x]=y\n size[y]=size[y]+size[x]\n if rank[x]==rank[y] then\n rank[y]=rank[y]+1\n end\n end\nend\n\nlocal function getsize(x)\n return size[root(x)]\nend\n\n----------\n\nlocal n,m=io.read(\"n\",\"n\")\ninit(n)\n\nlocal p={}\nfor i=1,n do\n p[i]=io.read(\"n\")\nend\n\nfor i=1,m do\n local x,y=io.read(\"n\",\"n\")\n unite(x,y)\nend\n\nlocal counter=0\nfor i=1,n do\n if same(p[i],i) then\n counter=counter+1\n end\nend\nprint(counter)", "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": "p03354", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 919, "cpu_time_ms": 2205, "memory_kb": 7156}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s435583129", "group_id": "codeNet:p03355", "input_text": "local s=io.read()\nlocal n=#s\nlocal k=io.read(\"n\")\nlocal t1={}\nfor i=1,k do\n for j=1,n-i+1 do\n local sub=s:sub(j,j+i-1)\n table.insert(t1,sub) \n end\nend\ntable.sort(t1)\n\nlocal t2={t1[1]}\nfor i=1,#t1-1 do\n if t1[i]~=t1[i+1] then\n table.insert(t2,t1[i+1])\n end\nend\nprint(t2[k])", "language": "Lua", "metadata": {"date": 1595039015, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s435583129.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s435583129", "user_id": "u045238009"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "local s=io.read()\nlocal n=#s\nlocal k=io.read(\"n\")\nlocal t1={}\nfor i=1,k do\n for j=1,n-i+1 do\n local sub=s:sub(j,j+i-1)\n table.insert(t1,sub) \n end\nend\ntable.sort(t1)\n\nlocal t2={t1[1]}\nfor i=1,#t1-1 do\n if t1[i]~=t1[i+1] then\n table.insert(t2,t1[i+1])\n end\nend\nprint(t2[k])", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 306, "cpu_time_ms": 27, "memory_kb": 3524}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s323871118", "group_id": "codeNet:p03356", "input_text": "local n, m = io.read(\"*n\", \"*n\",\"*l\")\nlocal str = io.read()\nlocal posval = {}\nfor strnum in string.gmatch(str, \"%d+\") do\n table.insert(posval, tonumber(strnum))\nend\n\nlocal parent = {}\nfor i = 1, n do parent[i] = 0 end\nfunction findroot(x)\n local cand = x\n while(parent[cand] ~= 0) do\n cand = parent[cand]\n end\n return cand\nend\n\nfor i = 1, m do\n local a, b = io.read(\"*n\", \"*n\")\n local aroot, broot = findroot(a), findroot(b)\n if(aroot ~= a) then parent[a] = aroot end\n if(broot ~= b) then parent[b] = broot end\n if(aroot ~= broot) then\n parent[broot] = aroot\n end\nend\nlocal ret = 0\nfor i = 1, n do\n local gsrc, gdst = findroot(i), findroot(posval[i])\n if(gsrc ~= 0 and gsrc == gdst) then ret = ret + 1 end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1555820730, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s323871118.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s323871118", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n, m = io.read(\"*n\", \"*n\",\"*l\")\nlocal str = io.read()\nlocal posval = {}\nfor strnum in string.gmatch(str, \"%d+\") do\n table.insert(posval, tonumber(strnum))\nend\n\nlocal parent = {}\nfor i = 1, n do parent[i] = 0 end\nfunction findroot(x)\n local cand = x\n while(parent[cand] ~= 0) do\n cand = parent[cand]\n end\n return cand\nend\n\nfor i = 1, m do\n local a, b = io.read(\"*n\", \"*n\")\n local aroot, broot = findroot(a), findroot(b)\n if(aroot ~= a) then parent[a] = aroot end\n if(broot ~= b) then parent[b] = broot end\n if(aroot ~= broot) then\n parent[broot] = aroot\n end\nend\nlocal ret = 0\nfor i = 1, n do\n local gsrc, gdst = findroot(i), findroot(posval[i])\n if(gsrc ~= 0 and gsrc == gdst) then ret = ret + 1 end\nend\nprint(ret)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 740, "cpu_time_ms": 260, "memory_kb": 5428}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s831551996", "group_id": "codeNet:p03357", "input_text": "local mma, mmi = math.max, math.min\nlocal n = io.read(\"*n\", \"*l\")\nlocal t = {}\nlocal tmap = {}\nfor i = 1, 2 * n do tmap[i] = 0 end\nfor i = 1, 2 * n do\n local str = io.read()\n local tp, num = str:match(\"(%w) (%d+)\")\n num = tonumber(num)\n if tp == \"B\" then num = num + n end\n t[i] = num\n tmap[num] = i\nend\n\nlocal wcnt, bcnt = {}, {}\nfor i = 1, n do\n wcnt[i] = {}\n bcnt[i] = {}\n local wc, bc = 0, 0\n for j = 1, 2 * n do\n if t[j] <= i then\n wc = wc + 1\n end\n if n < t[j] and t[j] - n <= i then\n bc = bc + 1\n end\n wcnt[i][j] = wc\n bcnt[i][j] = bc\n end\nend\n\nlocal d = {}\nfor i = 1, n + 1 do\n d[i] = {}\n for j = 1, n + 1 do\n d[i][j] = 1000000007\n end\nend\nd[1][1] = 0\nfor j = 1, n do\n d[1][j + 1] = d[1][j] + tmap[j] - wcnt[j][tmap[j]]\nend\nfor i = 1, n do\n d[i + 1][1] = d[i][1] + tmap[n + i] - bcnt[i][tmap[n + i]]\n for j = 1, n do\n local sub1 = wcnt[j][tmap[n + i]]\n local sub2 = bcnt[i][tmap[n + i]]\n\n local sub3 = wcnt[j][tmap[j]]\n local sub4 = bcnt[i][tmap[j]]\n d[i + 1][j + 1] = mmi(d[i][j + 1] + tmap[n + i] - sub1 - sub2, d[i + 1][j] + tmap[j] - sub3 - sub4)\n end\nend\nprint(d[n + 1][n + 1])\n", "language": "Lua", "metadata": {"date": 1569270985, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03357.html", "problem_id": "p03357", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03357/input.txt", "sample_output_relpath": "derived/input_output/data/p03357/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03357/Lua/s831551996.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s831551996", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local mma, mmi = math.max, math.min\nlocal n = io.read(\"*n\", \"*l\")\nlocal t = {}\nlocal tmap = {}\nfor i = 1, 2 * n do tmap[i] = 0 end\nfor i = 1, 2 * n do\n local str = io.read()\n local tp, num = str:match(\"(%w) (%d+)\")\n num = tonumber(num)\n if tp == \"B\" then num = num + n end\n t[i] = num\n tmap[num] = i\nend\n\nlocal wcnt, bcnt = {}, {}\nfor i = 1, n do\n wcnt[i] = {}\n bcnt[i] = {}\n local wc, bc = 0, 0\n for j = 1, 2 * n do\n if t[j] <= i then\n wc = wc + 1\n end\n if n < t[j] and t[j] - n <= i then\n bc = bc + 1\n end\n wcnt[i][j] = wc\n bcnt[i][j] = bc\n end\nend\n\nlocal d = {}\nfor i = 1, n + 1 do\n d[i] = {}\n for j = 1, n + 1 do\n d[i][j] = 1000000007\n end\nend\nd[1][1] = 0\nfor j = 1, n do\n d[1][j + 1] = d[1][j] + tmap[j] - wcnt[j][tmap[j]]\nend\nfor i = 1, n do\n d[i + 1][1] = d[i][1] + tmap[n + i] - bcnt[i][tmap[n + i]]\n for j = 1, n do\n local sub1 = wcnt[j][tmap[n + i]]\n local sub2 = bcnt[i][tmap[n + i]]\n\n local sub3 = wcnt[j][tmap[j]]\n local sub4 = bcnt[i][tmap[j]]\n d[i + 1][j + 1] = mmi(d[i][j + 1] + tmap[n + i] - sub1 - sub2, d[i + 1][j] + tmap[j] - sub3 - sub4)\n end\nend\nprint(d[n + 1][n + 1])\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere are 2N balls, N white and N black, arranged in a row. The integers from 1 through N are written on the white balls, one on each ball, and they are also written on the black balls, one on each ball.\nThe integer written on the i-th ball from the left (1 ≤ i ≤ 2N) is a_i, and the color of this ball is represented by a letter c_i.\nc_i = W represents the ball is white; c_i = B represents the ball is black.\n\nTakahashi the human wants to achieve the following objective:\n\nFor every pair of integers (i,j) such that 1 ≤ i < j ≤ N, the white ball with i written on it is to the left of the white ball with j written on it.\n\nFor every pair of integers (i,j) such that 1 ≤ i < j ≤ N, the black ball with i written on it is to the left of the black ball with j written on it.\n\nIn order to achieve this, he can perform the following operation:\n\nSwap two adjacent balls.\n\nFind the minimum number of operations required to achieve the objective.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1 ≤ a_i ≤ N\n\nc_i = W or c_i = B.\n\nIf i ≠ j, (a_i,c_i) ≠ (a_j,c_j).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nc_1 a_1\nc_2 a_2\n:\nc_{2N} a_{2N}\n\nOutput\n\nPrint the minimum number of operations required to achieve the objective.\n\nSample Input 1\n\n3\nB 1\nW 2\nB 3\nW 1\nW 3\nB 2\n\nSample Output 1\n\n4\n\nThe objective can be achieved in four operations, for example, as follows:\n\nSwap the black 3 and white 1.\n\nSwap the white 1 and white 2.\n\nSwap the black 3 and white 3.\n\nSwap the black 3 and black 2.\n\nSample Input 2\n\n4\nB 4\nW 4\nB 3\nW 3\nB 2\nW 2\nB 1\nW 1\n\nSample Output 2\n\n18\n\nSample Input 3\n\n9\nW 3\nB 1\nB 4\nW 1\nB 5\nW 9\nW 2\nB 6\nW 5\nB 3\nW 8\nB 9\nW 7\nB 2\nB 8\nW 4\nW 6\nB 7\n\nSample Output 3\n\n41", "sample_input": "3\nB 1\nW 2\nB 3\nW 1\nW 3\nB 2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03357", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere are 2N balls, N white and N black, arranged in a row. The integers from 1 through N are written on the white balls, one on each ball, and they are also written on the black balls, one on each ball.\nThe integer written on the i-th ball from the left (1 ≤ i ≤ 2N) is a_i, and the color of this ball is represented by a letter c_i.\nc_i = W represents the ball is white; c_i = B represents the ball is black.\n\nTakahashi the human wants to achieve the following objective:\n\nFor every pair of integers (i,j) such that 1 ≤ i < j ≤ N, the white ball with i written on it is to the left of the white ball with j written on it.\n\nFor every pair of integers (i,j) such that 1 ≤ i < j ≤ N, the black ball with i written on it is to the left of the black ball with j written on it.\n\nIn order to achieve this, he can perform the following operation:\n\nSwap two adjacent balls.\n\nFind the minimum number of operations required to achieve the objective.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1 ≤ a_i ≤ N\n\nc_i = W or c_i = B.\n\nIf i ≠ j, (a_i,c_i) ≠ (a_j,c_j).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nc_1 a_1\nc_2 a_2\n:\nc_{2N} a_{2N}\n\nOutput\n\nPrint the minimum number of operations required to achieve the objective.\n\nSample Input 1\n\n3\nB 1\nW 2\nB 3\nW 1\nW 3\nB 2\n\nSample Output 1\n\n4\n\nThe objective can be achieved in four operations, for example, as follows:\n\nSwap the black 3 and white 1.\n\nSwap the white 1 and white 2.\n\nSwap the black 3 and white 3.\n\nSwap the black 3 and black 2.\n\nSample Input 2\n\n4\nB 4\nW 4\nB 3\nW 3\nB 2\nW 2\nB 1\nW 1\n\nSample Output 2\n\n18\n\nSample Input 3\n\n9\nW 3\nB 1\nB 4\nW 1\nB 5\nW 9\nW 2\nB 6\nW 5\nB 3\nW 8\nB 9\nW 7\nB 2\nB 8\nW 4\nW 6\nB 7\n\nSample Output 3\n\n41", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1155, "cpu_time_ms": 486, "memory_kb": 166016}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s165507401", "group_id": "codeNet:p03357", "input_text": "local n = io.read(\"*n\", \"*l\")\nlocal t = {}\nfor i = 1, 2 * n do\n local str = io.read()\n local tp, num = str:match(\"(%w) (%d+)\")\n num = tonumber(num)\n if tp == \"B\" then num = num + n end\n t[i] = num\nend\nlocal curw, curb = 1, n + 1\nlocal len = 0\nfor i = 1, 2 * n do\n for j = 1, #t do\n if t[j] == curw or t[j] == curb then\n len = len + j - 1\n if t[j] == curw then curw = curw + 1 else curb = curb + 1 end\n table.remove(t, j)\n break\n end\n end\nend\nprint(len)\n", "language": "Lua", "metadata": {"date": 1569252519, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03357.html", "problem_id": "p03357", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03357/input.txt", "sample_output_relpath": "derived/input_output/data/p03357/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03357/Lua/s165507401.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s165507401", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local n = io.read(\"*n\", \"*l\")\nlocal t = {}\nfor i = 1, 2 * n do\n local str = io.read()\n local tp, num = str:match(\"(%w) (%d+)\")\n num = tonumber(num)\n if tp == \"B\" then num = num + n end\n t[i] = num\nend\nlocal curw, curb = 1, n + 1\nlocal len = 0\nfor i = 1, 2 * n do\n for j = 1, #t do\n if t[j] == curw or t[j] == curb then\n len = len + j - 1\n if t[j] == curw then curw = curw + 1 else curb = curb + 1 end\n table.remove(t, j)\n break\n end\n end\nend\nprint(len)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere are 2N balls, N white and N black, arranged in a row. The integers from 1 through N are written on the white balls, one on each ball, and they are also written on the black balls, one on each ball.\nThe integer written on the i-th ball from the left (1 ≤ i ≤ 2N) is a_i, and the color of this ball is represented by a letter c_i.\nc_i = W represents the ball is white; c_i = B represents the ball is black.\n\nTakahashi the human wants to achieve the following objective:\n\nFor every pair of integers (i,j) such that 1 ≤ i < j ≤ N, the white ball with i written on it is to the left of the white ball with j written on it.\n\nFor every pair of integers (i,j) such that 1 ≤ i < j ≤ N, the black ball with i written on it is to the left of the black ball with j written on it.\n\nIn order to achieve this, he can perform the following operation:\n\nSwap two adjacent balls.\n\nFind the minimum number of operations required to achieve the objective.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1 ≤ a_i ≤ N\n\nc_i = W or c_i = B.\n\nIf i ≠ j, (a_i,c_i) ≠ (a_j,c_j).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nc_1 a_1\nc_2 a_2\n:\nc_{2N} a_{2N}\n\nOutput\n\nPrint the minimum number of operations required to achieve the objective.\n\nSample Input 1\n\n3\nB 1\nW 2\nB 3\nW 1\nW 3\nB 2\n\nSample Output 1\n\n4\n\nThe objective can be achieved in four operations, for example, as follows:\n\nSwap the black 3 and white 1.\n\nSwap the white 1 and white 2.\n\nSwap the black 3 and white 3.\n\nSwap the black 3 and black 2.\n\nSample Input 2\n\n4\nB 4\nW 4\nB 3\nW 3\nB 2\nW 2\nB 1\nW 1\n\nSample Output 2\n\n18\n\nSample Input 3\n\n9\nW 3\nB 1\nB 4\nW 1\nB 5\nW 9\nW 2\nB 6\nW 5\nB 3\nW 8\nB 9\nW 7\nB 2\nB 8\nW 4\nW 6\nB 7\n\nSample Output 3\n\n41", "sample_input": "3\nB 1\nW 2\nB 3\nW 1\nW 3\nB 2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03357", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere are 2N balls, N white and N black, arranged in a row. The integers from 1 through N are written on the white balls, one on each ball, and they are also written on the black balls, one on each ball.\nThe integer written on the i-th ball from the left (1 ≤ i ≤ 2N) is a_i, and the color of this ball is represented by a letter c_i.\nc_i = W represents the ball is white; c_i = B represents the ball is black.\n\nTakahashi the human wants to achieve the following objective:\n\nFor every pair of integers (i,j) such that 1 ≤ i < j ≤ N, the white ball with i written on it is to the left of the white ball with j written on it.\n\nFor every pair of integers (i,j) such that 1 ≤ i < j ≤ N, the black ball with i written on it is to the left of the black ball with j written on it.\n\nIn order to achieve this, he can perform the following operation:\n\nSwap two adjacent balls.\n\nFind the minimum number of operations required to achieve the objective.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1 ≤ a_i ≤ N\n\nc_i = W or c_i = B.\n\nIf i ≠ j, (a_i,c_i) ≠ (a_j,c_j).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nc_1 a_1\nc_2 a_2\n:\nc_{2N} a_{2N}\n\nOutput\n\nPrint the minimum number of operations required to achieve the objective.\n\nSample Input 1\n\n3\nB 1\nW 2\nB 3\nW 1\nW 3\nB 2\n\nSample Output 1\n\n4\n\nThe objective can be achieved in four operations, for example, as follows:\n\nSwap the black 3 and white 1.\n\nSwap the white 1 and white 2.\n\nSwap the black 3 and white 3.\n\nSwap the black 3 and black 2.\n\nSample Input 2\n\n4\nB 4\nW 4\nB 3\nW 3\nB 2\nW 2\nB 1\nW 1\n\nSample Output 2\n\n18\n\nSample Input 3\n\n9\nW 3\nB 1\nB 4\nW 1\nB 5\nW 9\nW 2\nB 6\nW 5\nB 3\nW 8\nB 9\nW 7\nB 2\nB 8\nW 4\nW 6\nB 7\n\nSample Output 3\n\n41", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 486, "cpu_time_ms": 281, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s439276178", "group_id": "codeNet:p03359", "input_text": "a,b=io.read(\"n\",\"n\")\nprint(math.min(a,b))", "language": "Lua", "metadata": {"date": 1550779874, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s439276178.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s439276178", "user_id": "u015229643"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "a,b=io.read(\"n\",\"n\")\nprint(math.min(a,b))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 41, "cpu_time_ms": 9, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s881820452", "group_id": "codeNet:p03360", "input_text": "A=io.read(\"n\")\nB=io.read(\"n\")\nC=io.read(\"n\")\nK=io.read(\"n\")\nmax=math.max(A,B)\nmax=math.max(max,C)\nprint(A+B+C-max+math.floor(max*math.pow(2,K)))", "language": "Lua", "metadata": {"date": 1550781083, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03360.html", "problem_id": "p03360", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03360/input.txt", "sample_output_relpath": "derived/input_output/data/p03360/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03360/Lua/s881820452.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s881820452", "user_id": "u015229643"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "A=io.read(\"n\")\nB=io.read(\"n\")\nC=io.read(\"n\")\nK=io.read(\"n\")\nmax=math.max(A,B)\nmax=math.max(max,C)\nprint(A+B+C-max+math.floor(max*math.pow(2,K)))", "problem_context": "Score: 200 points\n\nProblem Statement\n\nThere are three positive integers A, B and C written on a blackboard. E869120 performs the following operation K times:\n\nChoose one integer written on the blackboard and let the chosen integer be n. Replace the chosen integer with 2n.\n\nWhat is the largest possible sum of the integers written on the blackboard after K operations?\n\nConstraints\n\nA, B and C are integers between 1 and 50 (inclusive).\n\nK is an integer between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\nK\n\nOutput\n\nPrint the largest possible sum of the integers written on the blackboard after K operations by E869220.\n\nSample Input 1\n\n5 3 11\n1\n\nSample Output 1\n\n30\n\nIn this sample, 5, 3, 11 are initially written on the blackboard, and E869120 can perform the operation once.\n\nThere are three choices:\n\nDouble 5: The integers written on the board after the operation are 10, 3, 11.\n\nDouble 3: The integers written on the board after the operation are 5, 6, 11.\n\nDouble 11: The integers written on the board after the operation are 5, 3, 22.\n\nIf he chooses 3., the sum of the integers written on the board afterwards is 5 + 3 + 22 = 30, which is the largest among 1. through 3.\n\nSample Input 2\n\n3 3 4\n2\n\nSample Output 2\n\n22\n\nE869120 can perform the operation twice. The sum of the integers eventually written on the blackboard is maximized as follows:\n\nFirst, double 4. The integers written on the board are now 3, 3, 8.\n\nNext, double 8. The integers written on the board are now 3, 3, 16.\n\nThen, the sum of the integers eventually written on the blackboard is 3 + 3 + 16 = 22.", "sample_input": "5 3 11\n1\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03360", "source_text": "Score: 200 points\n\nProblem Statement\n\nThere are three positive integers A, B and C written on a blackboard. E869120 performs the following operation K times:\n\nChoose one integer written on the blackboard and let the chosen integer be n. Replace the chosen integer with 2n.\n\nWhat is the largest possible sum of the integers written on the blackboard after K operations?\n\nConstraints\n\nA, B and C are integers between 1 and 50 (inclusive).\n\nK is an integer between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\nK\n\nOutput\n\nPrint the largest possible sum of the integers written on the blackboard after K operations by E869220.\n\nSample Input 1\n\n5 3 11\n1\n\nSample Output 1\n\n30\n\nIn this sample, 5, 3, 11 are initially written on the blackboard, and E869120 can perform the operation once.\n\nThere are three choices:\n\nDouble 5: The integers written on the board after the operation are 10, 3, 11.\n\nDouble 3: The integers written on the board after the operation are 5, 6, 11.\n\nDouble 11: The integers written on the board after the operation are 5, 3, 22.\n\nIf he chooses 3., the sum of the integers written on the board afterwards is 5 + 3 + 22 = 30, which is the largest among 1. through 3.\n\nSample Input 2\n\n3 3 4\n2\n\nSample Output 2\n\n22\n\nE869120 can perform the operation twice. The sum of the integers eventually written on the blackboard is maximized as follows:\n\nFirst, double 4. The integers written on the board are now 3, 3, 8.\n\nNext, double 8. The integers written on the board are now 3, 3, 16.\n\nThen, the sum of the integers eventually written on the blackboard is 3 + 3 + 16 = 22.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 144, "cpu_time_ms": 10, "memory_kb": 884}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s497475158", "group_id": "codeNet:p03360", "input_text": "a, b, c = io.read('n'), io.read('n'), io.read('n')\nprint(a + b + c + math.max(a, b, c) * ((1 << io.read('n')) - 1))", "language": "Lua", "metadata": {"date": 1525572448, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03360.html", "problem_id": "p03360", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03360/input.txt", "sample_output_relpath": "derived/input_output/data/p03360/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03360/Lua/s497475158.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s497475158", "user_id": "u785421275"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "a, b, c = io.read('n'), io.read('n'), io.read('n')\nprint(a + b + c + math.max(a, b, c) * ((1 << io.read('n')) - 1))", "problem_context": "Score: 200 points\n\nProblem Statement\n\nThere are three positive integers A, B and C written on a blackboard. E869120 performs the following operation K times:\n\nChoose one integer written on the blackboard and let the chosen integer be n. Replace the chosen integer with 2n.\n\nWhat is the largest possible sum of the integers written on the blackboard after K operations?\n\nConstraints\n\nA, B and C are integers between 1 and 50 (inclusive).\n\nK is an integer between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\nK\n\nOutput\n\nPrint the largest possible sum of the integers written on the blackboard after K operations by E869220.\n\nSample Input 1\n\n5 3 11\n1\n\nSample Output 1\n\n30\n\nIn this sample, 5, 3, 11 are initially written on the blackboard, and E869120 can perform the operation once.\n\nThere are three choices:\n\nDouble 5: The integers written on the board after the operation are 10, 3, 11.\n\nDouble 3: The integers written on the board after the operation are 5, 6, 11.\n\nDouble 11: The integers written on the board after the operation are 5, 3, 22.\n\nIf he chooses 3., the sum of the integers written on the board afterwards is 5 + 3 + 22 = 30, which is the largest among 1. through 3.\n\nSample Input 2\n\n3 3 4\n2\n\nSample Output 2\n\n22\n\nE869120 can perform the operation twice. The sum of the integers eventually written on the blackboard is maximized as follows:\n\nFirst, double 4. The integers written on the board are now 3, 3, 8.\n\nNext, double 8. The integers written on the board are now 3, 3, 16.\n\nThen, the sum of the integers eventually written on the blackboard is 3 + 3 + 16 = 22.", "sample_input": "5 3 11\n1\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03360", "source_text": "Score: 200 points\n\nProblem Statement\n\nThere are three positive integers A, B and C written on a blackboard. E869120 performs the following operation K times:\n\nChoose one integer written on the blackboard and let the chosen integer be n. Replace the chosen integer with 2n.\n\nWhat is the largest possible sum of the integers written on the blackboard after K operations?\n\nConstraints\n\nA, B and C are integers between 1 and 50 (inclusive).\n\nK is an integer between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\nK\n\nOutput\n\nPrint the largest possible sum of the integers written on the blackboard after K operations by E869220.\n\nSample Input 1\n\n5 3 11\n1\n\nSample Output 1\n\n30\n\nIn this sample, 5, 3, 11 are initially written on the blackboard, and E869120 can perform the operation once.\n\nThere are three choices:\n\nDouble 5: The integers written on the board after the operation are 10, 3, 11.\n\nDouble 3: The integers written on the board after the operation are 5, 6, 11.\n\nDouble 11: The integers written on the board after the operation are 5, 3, 22.\n\nIf he chooses 3., the sum of the integers written on the board afterwards is 5 + 3 + 22 = 30, which is the largest among 1. through 3.\n\nSample Input 2\n\n3 3 4\n2\n\nSample Output 2\n\n22\n\nE869120 can perform the operation twice. The sum of the integers eventually written on the blackboard is maximized as follows:\n\nFirst, double 4. The integers written on the board are now 3, 3, 8.\n\nNext, double 8. The integers written on the board are now 3, 3, 16.\n\nThen, the sum of the integers eventually written on the blackboard is 3 + 3 + 16 = 22.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 115, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s477909584", "group_id": "codeNet:p03361", "input_text": "h,w=io.read(\"*n\",\"*n\")\ngrid={}\nfor i=1,h+2 do\n grid[i]={}\n if i~=1 and i~=h+2 then\n s=io.read()\n end\n for j=1,w+2 do\n if i==1 or i==h+2 then\n grid[i][j]=\".\"\n else\n if j==1 or j==w+2 then\n grid[i][j]=\".\"\n else\n grid[i][j]=s:sub(j-1,j-1)\n end\n end\n end\nend\n\nfeasible=true\nfor i=2,h+1 do\n for j=2,w+1 do\n if grid[i][j-1]..grid[i][j]..grid[i][j+1]==\".#.\" and grid[i-1][j]..grid[i][j]..grid[i+1][j]==\".#.\" then\n feasible=false\n end\n end\nend\nif feasible then\n print(\"Yes\")\nelse\n print(\"No\")\nend", "language": "Lua", "metadata": {"date": 1589119148, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s477909584.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s477909584", "user_id": "u045238009"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "h,w=io.read(\"*n\",\"*n\")\ngrid={}\nfor i=1,h+2 do\n grid[i]={}\n if i~=1 and i~=h+2 then\n s=io.read()\n end\n for j=1,w+2 do\n if i==1 or i==h+2 then\n grid[i][j]=\".\"\n else\n if j==1 or j==w+2 then\n grid[i][j]=\".\"\n else\n grid[i][j]=s:sub(j-1,j-1)\n end\n end\n end\nend\n\nfeasible=true\nfor i=2,h+1 do\n for j=2,w+1 do\n if grid[i][j-1]..grid[i][j]..grid[i][j+1]==\".#.\" and grid[i-1][j]..grid[i][j]..grid[i+1][j]==\".#.\" then\n feasible=false\n end\n end\nend\nif feasible then\n print(\"Yes\")\nelse\n print(\"No\")\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s086882409", "group_id": "codeNet:p03363", "input_text": "local n=io.read(\"n\")\nlocal counter=0\nlocal sum=0\nlocal map={[0]=1}\nfor i=1,n do\n sum=sum+io.read(\"n\")\n local check=(map[sum] or 0)\n counter=counter+check\n map[sum]=check+1\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1593434332, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p03363.html", "problem_id": "p03363", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03363/input.txt", "sample_output_relpath": "derived/input_output/data/p03363/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03363/Lua/s086882409.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s086882409", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal counter=0\nlocal sum=0\nlocal map={[0]=1}\nfor i=1,n do\n sum=sum+io.read(\"n\")\n local check=(map[sum] or 0)\n counter=counter+check\n map[sum]=check+1\nend\nprint(counter)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have an integer sequence A, whose length is N.\n\nFind the number of the non-empty contiguous subsequences of A whose sums are 0.\nNote that we are counting the ways to take out subsequences.\nThat is, even if the contents of some two subsequences are the same, they are counted individually if they are taken from different positions.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFind the number of the non-empty contiguous subsequences of A whose sum is 0.\n\nSample Input 1\n\n6\n1 3 -4 2 2 -2\n\nSample Output 1\n\n3\n\nThere are three contiguous subsequences whose sums are 0: (1,3,-4), (-4,2,2) and (2,-2).\n\nSample Input 2\n\n7\n1 -1 1 -1 1 -1 1\n\nSample Output 2\n\n12\n\nIn this case, some subsequences that have the same contents but are taken from different positions are counted individually.\nFor example, three occurrences of (1, -1) are counted.\n\nSample Input 3\n\n5\n1 -2 3 -4 5\n\nSample Output 3\n\n0\n\nThere are no contiguous subsequences whose sums are 0.", "sample_input": "6\n1 3 -4 2 2 -2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03363", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have an integer sequence A, whose length is N.\n\nFind the number of the non-empty contiguous subsequences of A whose sums are 0.\nNote that we are counting the ways to take out subsequences.\nThat is, even if the contents of some two subsequences are the same, they are counted individually if they are taken from different positions.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFind the number of the non-empty contiguous subsequences of A whose sum is 0.\n\nSample Input 1\n\n6\n1 3 -4 2 2 -2\n\nSample Output 1\n\n3\n\nThere are three contiguous subsequences whose sums are 0: (1,3,-4), (-4,2,2) and (2,-2).\n\nSample Input 2\n\n7\n1 -1 1 -1 1 -1 1\n\nSample Output 2\n\n12\n\nIn this case, some subsequences that have the same contents but are taken from different positions are counted individually.\nFor example, three occurrences of (1, -1) are counted.\n\nSample Input 3\n\n5\n1 -2 3 -4 5\n\nSample Output 3\n\n0\n\nThere are no contiguous subsequences whose sums are 0.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 83, "memory_kb": 11936}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s704337385", "group_id": "codeNet:p03364", "input_text": "local n = io.read(\"*n\", \"*l\")\nlocal row = {}\nfor i = 1, n do\n row[i] = io.read()\nend\nlocal col = {}\nfor i = 1, n do col[i] = \"\" end\nfor i = 1, n do\n for j = 1, n do\n col[i] = col[i] .. row[j]:sub(i, i)\n end\nend\n\nlocal colmap = {}\nfor i = 1, n do\n local tmps = col[i]\n colmap[i] = {tmps}\n for j = 2, n do\n tmps = tmps:sub(2, n) .. tmps:sub(1, 1)\n colmap[i][j] = tmps\n end\nend\n\nlocal function check(i, j)\n for k = 1, n do\n local kcol = k + i - 1\n if n < kcol then kcol = kcol - n end\n if row[k] ~= colmap[kcol][j] then return 0 end\n end\n return 1\nend\n\nlocal ret = 0\nfor i = 1, n do\n for j = 1, n do\n ret = ret + check(i, j)\n local tmp = row[1]\n for k = 2, n do\n row[k - 1] = row[k]\n end\n row[n] = tmp\n end\n if 1 < n then\n for k = 1, n do\n row[k] = row[k]:sub(n, n) .. row[k]:sub(1, n - 1)\n end\n end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1565664014, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03364.html", "problem_id": "p03364", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03364/input.txt", "sample_output_relpath": "derived/input_output/data/p03364/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03364/Lua/s704337385.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s704337385", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n = io.read(\"*n\", \"*l\")\nlocal row = {}\nfor i = 1, n do\n row[i] = io.read()\nend\nlocal col = {}\nfor i = 1, n do col[i] = \"\" end\nfor i = 1, n do\n for j = 1, n do\n col[i] = col[i] .. row[j]:sub(i, i)\n end\nend\n\nlocal colmap = {}\nfor i = 1, n do\n local tmps = col[i]\n colmap[i] = {tmps}\n for j = 2, n do\n tmps = tmps:sub(2, n) .. tmps:sub(1, 1)\n colmap[i][j] = tmps\n end\nend\n\nlocal function check(i, j)\n for k = 1, n do\n local kcol = k + i - 1\n if n < kcol then kcol = kcol - n end\n if row[k] ~= colmap[kcol][j] then return 0 end\n end\n return 1\nend\n\nlocal ret = 0\nfor i = 1, n do\n for j = 1, n do\n ret = ret + check(i, j)\n local tmp = row[1]\n for k = 2, n do\n row[k - 1] = row[k]\n end\n row[n] = tmp\n end\n if 1 < n then\n for k = 1, n do\n row[k] = row[k]:sub(n, n) .. row[k]:sub(1, n - 1)\n end\n end\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nSnuke has two boards, each divided into a grid with N rows and N columns.\nFor both of these boards, the square at the i-th row from the top and the j-th column from the left is called Square (i,j).\n\nThere is a lowercase English letter written in each square on the first board. The letter written in Square (i,j) is S_{i,j}. On the second board, nothing is written yet.\n\nSnuke will write letters on the second board, as follows:\n\nFirst, choose two integers A and B ( 0 \\leq A, B < N ).\n\nWrite one letter in each square on the second board.\nSpecifically, write the letter written in Square ( i+A, j+B ) on the first board into Square (i,j) on the second board.\nHere, the k-th row is also represented as the (N+k)-th row, and the k-th column is also represented as the (N+k)-th column.\n\nAfter this operation, the second board is called a good board when, for every i and j ( 1 \\leq i, j \\leq N ), the letter in Square (i,j) and the letter in Square (j,i) are equal.\n\nFind the number of the ways to choose integers A and B ( 0 \\leq A, B < N ) such that the second board is a good board.\n\nConstraints\n\n1 \\leq N \\leq 300\n\nS_{i,j} ( 1 \\leq i, j \\leq N ) is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_{1,1}S_{1,2}..S_{1,N}\nS_{2,1}S_{2,2}..S_{2,N}\n:\nS_{N,1}S_{N,2}..S_{N,N}\n\nOutput\n\nPrint the number of the ways to choose integers A and B ( 0 \\leq A, B < N ) such that the second board is a good board.\n\nSample Input 1\n\n2\nab\nca\n\nSample Output 1\n\n2\n\nFor each pair of A and B, the second board will look as shown below:\n\nThe second board is a good board when (A,B) = (0,1) or (A,B) = (1,0), thus the answer is 2.\n\nSample Input 2\n\n4\naaaa\naaaa\naaaa\naaaa\n\nSample Output 2\n\n16\n\nEvery possible choice of A and B makes the second board good.\n\nSample Input 3\n\n5\nabcde\nfghij\nklmno\npqrst\nuvwxy\n\nSample Output 3\n\n0\n\nNo possible choice of A and B makes the second board good.", "sample_input": "2\nab\nca\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03364", "source_text": "Score : 500 points\n\nProblem Statement\n\nSnuke has two boards, each divided into a grid with N rows and N columns.\nFor both of these boards, the square at the i-th row from the top and the j-th column from the left is called Square (i,j).\n\nThere is a lowercase English letter written in each square on the first board. The letter written in Square (i,j) is S_{i,j}. On the second board, nothing is written yet.\n\nSnuke will write letters on the second board, as follows:\n\nFirst, choose two integers A and B ( 0 \\leq A, B < N ).\n\nWrite one letter in each square on the second board.\nSpecifically, write the letter written in Square ( i+A, j+B ) on the first board into Square (i,j) on the second board.\nHere, the k-th row is also represented as the (N+k)-th row, and the k-th column is also represented as the (N+k)-th column.\n\nAfter this operation, the second board is called a good board when, for every i and j ( 1 \\leq i, j \\leq N ), the letter in Square (i,j) and the letter in Square (j,i) are equal.\n\nFind the number of the ways to choose integers A and B ( 0 \\leq A, B < N ) such that the second board is a good board.\n\nConstraints\n\n1 \\leq N \\leq 300\n\nS_{i,j} ( 1 \\leq i, j \\leq N ) is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_{1,1}S_{1,2}..S_{1,N}\nS_{2,1}S_{2,2}..S_{2,N}\n:\nS_{N,1}S_{N,2}..S_{N,N}\n\nOutput\n\nPrint the number of the ways to choose integers A and B ( 0 \\leq A, B < N ) such that the second board is a good board.\n\nSample Input 1\n\n2\nab\nca\n\nSample Output 1\n\n2\n\nFor each pair of A and B, the second board will look as shown below:\n\nThe second board is a good board when (A,B) = (0,1) or (A,B) = (1,0), thus the answer is 2.\n\nSample Input 2\n\n4\naaaa\naaaa\naaaa\naaaa\n\nSample Output 2\n\n16\n\nEvery possible choice of A and B makes the second board good.\n\nSample Input 3\n\n5\nabcde\nfghij\nklmno\npqrst\nuvwxy\n\nSample Output 3\n\n0\n\nNo possible choice of A and B makes the second board good.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 875, "cpu_time_ms": 2103, "memory_kb": 53876}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s713602886", "group_id": "codeNet:p03364", "input_text": "local n = io.read(\"*n\", \"*l\")\nlocal row = {}\nfor i = 1, n do\n row[i] = io.read()\nend\nlocal col = {}\nfor i = 1, n do col[i] = \"\" end\nfor i = 1, n do\n for j = 1, n do\n col[i] = col[i] .. row[j]:sub(i, i)\n end\nend\n\nlocal colmap = {}\nfor i = 1, n do\n local tmps = col[i]\n colmap[i] = {}\n for j = 1, n do\n colmap[i][j] = tmps\n tmps = tmps:sub(n, n) .. tmps:sub(1, n - 1)\n end\nend\n\nlocal function check(j)\n for i = 1, n do\n if row[i] ~= colmap[i][j] then return 0 end\n end\n return 1\nend\n\nlocal ret = 0\nfor i = 1, n do\n for j = 1, n do\n ret = ret + check(j)\n local tmp = row[1]\n for k = 2, n do\n row[k - 1] = row[k]\n end\n row[n] = tmp\n end\n local tmp2 = colmap[1]\n for k = 2, n do\n colmap[k - 1] = colmap[k]\n end\n colmap[n] = tmp2\n for k = 1, n do\n row[k] = row[k]:sub(n, n) .. row[k]:sub(1, n - 1)\n end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1565663077, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03364.html", "problem_id": "p03364", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03364/input.txt", "sample_output_relpath": "derived/input_output/data/p03364/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03364/Lua/s713602886.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s713602886", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n = io.read(\"*n\", \"*l\")\nlocal row = {}\nfor i = 1, n do\n row[i] = io.read()\nend\nlocal col = {}\nfor i = 1, n do col[i] = \"\" end\nfor i = 1, n do\n for j = 1, n do\n col[i] = col[i] .. row[j]:sub(i, i)\n end\nend\n\nlocal colmap = {}\nfor i = 1, n do\n local tmps = col[i]\n colmap[i] = {}\n for j = 1, n do\n colmap[i][j] = tmps\n tmps = tmps:sub(n, n) .. tmps:sub(1, n - 1)\n end\nend\n\nlocal function check(j)\n for i = 1, n do\n if row[i] ~= colmap[i][j] then return 0 end\n end\n return 1\nend\n\nlocal ret = 0\nfor i = 1, n do\n for j = 1, n do\n ret = ret + check(j)\n local tmp = row[1]\n for k = 2, n do\n row[k - 1] = row[k]\n end\n row[n] = tmp\n end\n local tmp2 = colmap[1]\n for k = 2, n do\n colmap[k - 1] = colmap[k]\n end\n colmap[n] = tmp2\n for k = 1, n do\n row[k] = row[k]:sub(n, n) .. row[k]:sub(1, n - 1)\n end\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nSnuke has two boards, each divided into a grid with N rows and N columns.\nFor both of these boards, the square at the i-th row from the top and the j-th column from the left is called Square (i,j).\n\nThere is a lowercase English letter written in each square on the first board. The letter written in Square (i,j) is S_{i,j}. On the second board, nothing is written yet.\n\nSnuke will write letters on the second board, as follows:\n\nFirst, choose two integers A and B ( 0 \\leq A, B < N ).\n\nWrite one letter in each square on the second board.\nSpecifically, write the letter written in Square ( i+A, j+B ) on the first board into Square (i,j) on the second board.\nHere, the k-th row is also represented as the (N+k)-th row, and the k-th column is also represented as the (N+k)-th column.\n\nAfter this operation, the second board is called a good board when, for every i and j ( 1 \\leq i, j \\leq N ), the letter in Square (i,j) and the letter in Square (j,i) are equal.\n\nFind the number of the ways to choose integers A and B ( 0 \\leq A, B < N ) such that the second board is a good board.\n\nConstraints\n\n1 \\leq N \\leq 300\n\nS_{i,j} ( 1 \\leq i, j \\leq N ) is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_{1,1}S_{1,2}..S_{1,N}\nS_{2,1}S_{2,2}..S_{2,N}\n:\nS_{N,1}S_{N,2}..S_{N,N}\n\nOutput\n\nPrint the number of the ways to choose integers A and B ( 0 \\leq A, B < N ) such that the second board is a good board.\n\nSample Input 1\n\n2\nab\nca\n\nSample Output 1\n\n2\n\nFor each pair of A and B, the second board will look as shown below:\n\nThe second board is a good board when (A,B) = (0,1) or (A,B) = (1,0), thus the answer is 2.\n\nSample Input 2\n\n4\naaaa\naaaa\naaaa\naaaa\n\nSample Output 2\n\n16\n\nEvery possible choice of A and B makes the second board good.\n\nSample Input 3\n\n5\nabcde\nfghij\nklmno\npqrst\nuvwxy\n\nSample Output 3\n\n0\n\nNo possible choice of A and B makes the second board good.", "sample_input": "2\nab\nca\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03364", "source_text": "Score : 500 points\n\nProblem Statement\n\nSnuke has two boards, each divided into a grid with N rows and N columns.\nFor both of these boards, the square at the i-th row from the top and the j-th column from the left is called Square (i,j).\n\nThere is a lowercase English letter written in each square on the first board. The letter written in Square (i,j) is S_{i,j}. On the second board, nothing is written yet.\n\nSnuke will write letters on the second board, as follows:\n\nFirst, choose two integers A and B ( 0 \\leq A, B < N ).\n\nWrite one letter in each square on the second board.\nSpecifically, write the letter written in Square ( i+A, j+B ) on the first board into Square (i,j) on the second board.\nHere, the k-th row is also represented as the (N+k)-th row, and the k-th column is also represented as the (N+k)-th column.\n\nAfter this operation, the second board is called a good board when, for every i and j ( 1 \\leq i, j \\leq N ), the letter in Square (i,j) and the letter in Square (j,i) are equal.\n\nFind the number of the ways to choose integers A and B ( 0 \\leq A, B < N ) such that the second board is a good board.\n\nConstraints\n\n1 \\leq N \\leq 300\n\nS_{i,j} ( 1 \\leq i, j \\leq N ) is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_{1,1}S_{1,2}..S_{1,N}\nS_{2,1}S_{2,2}..S_{2,N}\n:\nS_{N,1}S_{N,2}..S_{N,N}\n\nOutput\n\nPrint the number of the ways to choose integers A and B ( 0 \\leq A, B < N ) such that the second board is a good board.\n\nSample Input 1\n\n2\nab\nca\n\nSample Output 1\n\n2\n\nFor each pair of A and B, the second board will look as shown below:\n\nThe second board is a good board when (A,B) = (0,1) or (A,B) = (1,0), thus the answer is 2.\n\nSample Input 2\n\n4\naaaa\naaaa\naaaa\naaaa\n\nSample Output 2\n\n16\n\nEvery possible choice of A and B makes the second board good.\n\nSample Input 3\n\n5\nabcde\nfghij\nklmno\npqrst\nuvwxy\n\nSample Output 3\n\n0\n\nNo possible choice of A and B makes the second board good.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 868, "cpu_time_ms": 2103, "memory_kb": 53876}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s237764206", "group_id": "codeNet:p03369", "input_text": "a,b,c=io.read(1,1,1)\nfunction t(x) return x=='o' and 100 or 0 end\nprint(700+t(a)+t(b)+t(c))", "language": "Lua", "metadata": {"date": 1569211694, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s237764206.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s237764206", "user_id": "u162773977"}, "prompt_components": {"gold_output": "900\n", "input_to_evaluate": "a,b,c=io.read(1,1,1)\nfunction t(x) return x=='o' and 100 or 0 end\nprint(700+t(a)+t(b)+t(c))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 91, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s974992210", "group_id": "codeNet:p03371", "input_text": "a,b,c,x,y=io.read(\"*n\",\"*n\",\"*n\",\"*n\",\"*n\")\nif a+b<=c*2 then\n print(a*x+b*y)\nelse\n if x>=y then\n print(math.min(c*y*2+a*(x-y), c*x*2))\n else\n print(math.min(c*x*2+b*(y-x), c*y*2))\n end\nend", "language": "Lua", "metadata": {"date": 1587612970, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03371.html", "problem_id": "p03371", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03371/input.txt", "sample_output_relpath": "derived/input_output/data/p03371/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03371/Lua/s974992210.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s974992210", "user_id": "u045238009"}, "prompt_components": {"gold_output": "7900\n", "input_to_evaluate": "a,b,c,x,y=io.read(\"*n\",\"*n\",\"*n\",\"*n\",\"*n\")\nif a+b<=c*2 then\n print(a*x+b*y)\nelse\n if x>=y then\n print(math.min(c*y*2+a*(x-y), c*x*2))\n else\n print(math.min(c*x*2+b*(y-x), c*y*2))\n end\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": "p03371", "source_text": "Score : 300 points\n\nProblem Statement\n\n\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-pizza\". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen (yen is the currency of Japan), respectively.\n\nNakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza. At least how much money does he need for this? It is fine to have more pizzas than necessary by rearranging pizzas.\n\nConstraints\n\n1 ≤ A, B, C ≤ 5000\n\n1 ≤ X, Y ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C X Y\n\nOutput\n\nPrint the minimum amount of money required to prepare X A-pizzas and Y B-pizzas.\n\nSample Input 1\n\n1500 2000 1600 3 2\n\nSample Output 1\n\n7900\n\nIt is optimal to buy four AB-pizzas and rearrange them into two A-pizzas and two B-pizzas, then buy additional one A-pizza.\n\nSample Input 2\n\n1500 2000 1900 3 2\n\nSample Output 2\n\n8500\n\nIt is optimal to directly buy three A-pizzas and two B-pizzas.\n\nSample Input 3\n\n1500 2000 500 90000 100000\n\nSample Output 3\n\n100000000\n\nIt is optimal to buy 200000 AB-pizzas and rearrange them into 100000 A-pizzas and 100000 B-pizzas. We will have 10000 more A-pizzas than necessary, but that is fine.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 214, "cpu_time_ms": 9, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s307936970", "group_id": "codeNet:p03371", "input_text": "local a, b, c, x, y = io.read(\"*n\", \"*n\", \"*n\", \"*n\", \"*n\")\nif(a + b <= c * 2) then\n print(a * x + b * y)\nelse\n local both = math.min(x, y)\n local price = both * c * 2\n x, y = x - both, y - both\n price = price + x * math.min(c * 2, a)\n price = price + y * math.min(c * 2, b)\n print(price)\nend\n", "language": "Lua", "metadata": {"date": 1556078107, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03371.html", "problem_id": "p03371", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03371/input.txt", "sample_output_relpath": "derived/input_output/data/p03371/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03371/Lua/s307936970.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s307936970", "user_id": "u120582723"}, "prompt_components": {"gold_output": "7900\n", "input_to_evaluate": "local a, b, c, x, y = io.read(\"*n\", \"*n\", \"*n\", \"*n\", \"*n\")\nif(a + b <= c * 2) then\n print(a * x + b * y)\nelse\n local both = math.min(x, y)\n local price = both * c * 2\n x, y = x - both, y - both\n price = price + x * math.min(c * 2, a)\n price = price + y * math.min(c * 2, b)\n print(price)\nend\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\n\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-pizza\". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen (yen is the currency of Japan), respectively.\n\nNakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza. At least how much money does he need for this? It is fine to have more pizzas than necessary by rearranging pizzas.\n\nConstraints\n\n1 ≤ A, B, C ≤ 5000\n\n1 ≤ X, Y ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C X Y\n\nOutput\n\nPrint the minimum amount of money required to prepare X A-pizzas and Y B-pizzas.\n\nSample Input 1\n\n1500 2000 1600 3 2\n\nSample Output 1\n\n7900\n\nIt is optimal to buy four AB-pizzas and rearrange them into two A-pizzas and two B-pizzas, then buy additional one A-pizza.\n\nSample Input 2\n\n1500 2000 1900 3 2\n\nSample Output 2\n\n8500\n\nIt is optimal to directly buy three A-pizzas and two B-pizzas.\n\nSample Input 3\n\n1500 2000 500 90000 100000\n\nSample Output 3\n\n100000000\n\nIt is optimal to buy 200000 AB-pizzas and rearrange them into 100000 A-pizzas and 100000 B-pizzas. We will have 10000 more A-pizzas than necessary, but that is fine.", "sample_input": "1500 2000 1600 3 2\n"}, "reference_outputs": ["7900\n"], "source_document_id": "p03371", "source_text": "Score : 300 points\n\nProblem Statement\n\n\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-pizza\". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen (yen is the currency of Japan), respectively.\n\nNakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza. At least how much money does he need for this? It is fine to have more pizzas than necessary by rearranging pizzas.\n\nConstraints\n\n1 ≤ A, B, C ≤ 5000\n\n1 ≤ X, Y ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C X Y\n\nOutput\n\nPrint the minimum amount of money required to prepare X A-pizzas and Y B-pizzas.\n\nSample Input 1\n\n1500 2000 1600 3 2\n\nSample Output 1\n\n7900\n\nIt is optimal to buy four AB-pizzas and rearrange them into two A-pizzas and two B-pizzas, then buy additional one A-pizza.\n\nSample Input 2\n\n1500 2000 1900 3 2\n\nSample Output 2\n\n8500\n\nIt is optimal to directly buy three A-pizzas and two B-pizzas.\n\nSample Input 3\n\n1500 2000 500 90000 100000\n\nSample Output 3\n\n100000000\n\nIt is optimal to buy 200000 AB-pizzas and rearrange them into 100000 A-pizzas and 100000 B-pizzas. We will have 10000 more A-pizzas than necessary, but that is fine.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 301, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s625060668", "group_id": "codeNet:p03371", "input_text": "A=io.read(\"n\")\nB=io.read(\"n\")\nC=io.read(\"n\")\nX=io.read(\"n\")\nY=io.read(\"n\")\nlocal cost=0\nif C*2<=math.min(A,B) then\n cost=C*2*math.max(X,Y)\n elseif C*2>=A+B then\n cost=A*X+B*Y\n elseif C*2=math.max(A,B) then\n if X>Y then\n cost=C*2*math.min(X,Y)+math.abs(X-Y)*A\n else \n cost=C*2*math.min(X,Y)+math.abs(X-Y)*B\n end\n elseif C*2>math.min(A,B) and C*2B and X>Y then\n cost=C*2*math.max(X,Y)\n elseif AY then\n cost=C*2*Y+A*(X-Y)\n elseif A>B and X=A+B then\n cost=A*X+B*Y\n elseif C*2=math.max(A,B) then\n if X>Y then\n cost=C*2*math.min(X,Y)+math.abs(X-Y)*A\n else \n cost=C*2*math.min(X,Y)+math.abs(X-Y)*B\n end\n elseif C*2>math.min(A,B) and C*2B and X>Y then\n cost=C*2*math.max(X,Y)\n elseif AY then\n cost=C*2*Y+A*(X-Y)\n elseif A>B and X=right then\n print(left)\n end\nend\n", "language": "Lua", "metadata": {"date": 1550801433, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s277154575.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s277154575", "user_id": "u015229643"}, "prompt_components": {"gold_output": "4\n3\n3\n4\n", "input_to_evaluate": "N=io.read(\"n\")\nX={}\nB={}\nfor i=1,N do\n X[i]=io.read(\"n\")\n B[i]=X[i]\nend\ntable.sort(B)\nleft=B[N//2]\nright=B[N//2+1]\nfor i=1,N do\n if X[i]<=left then\n print(right)\n \telseif X[i]>=right then\n print(left)\n end\nend\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 688, "memory_kb": 10588}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s828556664", "group_id": "codeNet:p03380", "input_text": "local N=io.read(\"n\")\nlocal a={}\nfor i=1,N do\n a[i]=io.read(\"n\")\nend\nfunction c(n,m)\n local res=0\n local s=1\n local k=1\n for i=n,n-m+1,-1 do\n s=s*i\n end\n for i=1,m do\n k=k*i\n end\n return s//k\nend\ntable.sort(a,function (a,b) return a>b end)\nlocal first=a[1]\nlocal second=a[2]\nlocal total=c(a[1],a[2])\nfor i=1,N-1 do\n for j=i+1,N do\n if c(a[i],a[j])>total then\n total=c(a[i],a[j])\n first=a[i]\n second=a[j]\n end\n end\nend\nprint(first,second)", "language": "Lua", "metadata": {"date": 1550803589, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03380.html", "problem_id": "p03380", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03380/input.txt", "sample_output_relpath": "derived/input_output/data/p03380/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03380/Lua/s828556664.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s828556664", "user_id": "u015229643"}, "prompt_components": {"gold_output": "11 6\n", "input_to_evaluate": "local N=io.read(\"n\")\nlocal a={}\nfor i=1,N do\n a[i]=io.read(\"n\")\nend\nfunction c(n,m)\n local res=0\n local s=1\n local k=1\n for i=n,n-m+1,-1 do\n s=s*i\n end\n for i=1,m do\n k=k*i\n end\n return s//k\nend\ntable.sort(a,function (a,b) return a>b end)\nlocal first=a[1]\nlocal second=a[2]\nlocal total=c(a[1],a[2])\nfor i=1,N-1 do\n for j=i+1,N do\n if c(a[i],a[j])>total then\n total=c(a[i],a[j])\n first=a[i]\n second=a[j]\n end\n end\nend\nprint(first,second)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nLet {\\rm comb}(n,r) be the number of ways to choose r objects from among n objects, disregarding order.\nFrom n non-negative integers a_1, a_2, ..., a_n, select two numbers a_i > a_j so that {\\rm comb}(a_i,a_j) is maximized.\nIf there are multiple pairs that maximize the value, any of them is accepted.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\n0 \\leq a_i \\leq 10^9\n\na_1,a_2,...,a_n are pairwise distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\na_1 a_2 ... a_n\n\nOutput\n\nPrint a_i and a_j that you selected, with a space in between.\n\nSample Input 1\n\n5\n6 9 4 2 11\n\nSample Output 1\n\n11 6\n\n\\rm{comb}(a_i,a_j) for each possible selection is as follows:\n\n\\rm{comb}(4,2)=6\n\n\\rm{comb}(6,2)=15\n\n\\rm{comb}(6,4)=15\n\n\\rm{comb}(9,2)=36\n\n\\rm{comb}(9,4)=126\n\n\\rm{comb}(9,6)=84\n\n\\rm{comb}(11,2)=55\n\n\\rm{comb}(11,4)=330\n\n\\rm{comb}(11,6)=462\n\n\\rm{comb}(11,9)=55\n\nThus, we should print 11 and 6.\n\nSample Input 2\n\n2\n100 0\n\nSample Output 2\n\n100 0", "sample_input": "5\n6 9 4 2 11\n"}, "reference_outputs": ["11 6\n"], "source_document_id": "p03380", "source_text": "Score : 400 points\n\nProblem Statement\n\nLet {\\rm comb}(n,r) be the number of ways to choose r objects from among n objects, disregarding order.\nFrom n non-negative integers a_1, a_2, ..., a_n, select two numbers a_i > a_j so that {\\rm comb}(a_i,a_j) is maximized.\nIf there are multiple pairs that maximize the value, any of them is accepted.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\n0 \\leq a_i \\leq 10^9\n\na_1,a_2,...,a_n are pairwise distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\na_1 a_2 ... a_n\n\nOutput\n\nPrint a_i and a_j that you selected, with a space in between.\n\nSample Input 1\n\n5\n6 9 4 2 11\n\nSample Output 1\n\n11 6\n\n\\rm{comb}(a_i,a_j) for each possible selection is as follows:\n\n\\rm{comb}(4,2)=6\n\n\\rm{comb}(6,2)=15\n\n\\rm{comb}(6,4)=15\n\n\\rm{comb}(9,2)=36\n\n\\rm{comb}(9,4)=126\n\n\\rm{comb}(9,6)=84\n\n\\rm{comb}(11,2)=55\n\n\\rm{comb}(11,4)=330\n\n\\rm{comb}(11,6)=462\n\n\\rm{comb}(11,9)=55\n\nThus, we should print 11 and 6.\n\nSample Input 2\n\n2\n100 0\n\nSample Output 2\n\n100 0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 2424}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s731490475", "group_id": "codeNet:p03386", "input_text": "a,b,k=io.read(\"*n\",\"*n\",\"*n\")\n\nfor i=1, k do\n if a+i-1<=b then\n print(a+i-1)\n end\nend\n\nfor i=k, 1, -1 do\n if b-i>=a+k-1 then\n print(b-i+1)\n end\nend", "language": "Lua", "metadata": {"date": 1587251978, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03386.html", "problem_id": "p03386", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03386/input.txt", "sample_output_relpath": "derived/input_output/data/p03386/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03386/Lua/s731490475.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s731490475", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n4\n7\n8\n", "input_to_evaluate": "a,b,k=io.read(\"*n\",\"*n\",\"*n\")\n\nfor i=1, k do\n if a+i-1<=b then\n print(a+i-1)\n end\nend\n\nfor i=k, 1, -1 do\n if b-i>=a+k-1 then\n print(b-i+1)\n end\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nPrint all the integers that satisfies the following in ascending order:\n\nAmong the integers between A and B (inclusive), it is either within the K smallest integers or within the K largest integers.\n\nConstraints\n\n1 \\leq A \\leq B \\leq 10^9\n\n1 \\leq K \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint all the integers that satisfies the condition above in ascending order.\n\nSample Input 1\n\n3 8 2\n\nSample Output 1\n\n3\n4\n7\n8\n\n3 is the first smallest integer among the integers between 3 and 8.\n\n4 is the second smallest integer among the integers between 3 and 8.\n\n7 is the second largest integer among the integers between 3 and 8.\n\n8 is the first largest integer among the integers between 3 and 8.\n\nSample Input 2\n\n4 8 3\n\nSample Output 2\n\n4\n5\n6\n7\n8\n\nSample Input 3\n\n2 9 100\n\nSample Output 3\n\n2\n3\n4\n5\n6\n7\n8\n9", "sample_input": "3 8 2\n"}, "reference_outputs": ["3\n4\n7\n8\n"], "source_document_id": "p03386", "source_text": "Score : 200 points\n\nProblem Statement\n\nPrint all the integers that satisfies the following in ascending order:\n\nAmong the integers between A and B (inclusive), it is either within the K smallest integers or within the K largest integers.\n\nConstraints\n\n1 \\leq A \\leq B \\leq 10^9\n\n1 \\leq K \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint all the integers that satisfies the condition above in ascending order.\n\nSample Input 1\n\n3 8 2\n\nSample Output 1\n\n3\n4\n7\n8\n\n3 is the first smallest integer among the integers between 3 and 8.\n\n4 is the second smallest integer among the integers between 3 and 8.\n\n7 is the second largest integer among the integers between 3 and 8.\n\n8 is the first largest integer among the integers between 3 and 8.\n\nSample Input 2\n\n4 8 3\n\nSample Output 2\n\n4\n5\n6\n7\n8\n\nSample Input 3\n\n2 9 100\n\nSample Output 3\n\n2\n3\n4\n5\n6\n7\n8\n9", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 173, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s678458720", "group_id": "codeNet:p03387", "input_text": "a={}\nfor i=1,3 do\n table.insert(a,io.read(\"*n\"))\nend\ntable.sort(a)\nif (a[2]-a[1])%2==0 then\n print((a[2]-a[1])//2+a[3]-a[2])\nelse\n print((a[2]-a[1]+1)//2+a[3]-a[2]+1)\nend", "language": "Lua", "metadata": {"date": 1588474001, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03387.html", "problem_id": "p03387", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03387/input.txt", "sample_output_relpath": "derived/input_output/data/p03387/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03387/Lua/s678458720.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s678458720", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "a={}\nfor i=1,3 do\n table.insert(a,io.read(\"*n\"))\nend\ntable.sort(a)\nif (a[2]-a[1])%2==0 then\n print((a[2]-a[1])//2+a[3]-a[2])\nelse\n print((a[2]-a[1]+1)//2+a[3]-a[2]+1)\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given three integers A, B and C. Find the minimum number of operations required to make A, B and C all equal by repeatedly performing the following two kinds of operations in any order:\n\nChoose two among A, B and C, then increase both by 1.\n\nChoose one among A, B and C, then increase it by 2.\n\nIt can be proved that we can always make A, B and C all equal by repeatedly performing these operations.\n\nConstraints\n\n0 \\leq A,B,C \\leq 50\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the minimum number of operations required to make A, B and C all equal.\n\nSample Input 1\n\n2 5 4\n\nSample Output 1\n\n2\n\nWe can make A, B and C all equal by the following operations:\n\nIncrease A and C by 1. Now, A, B, C are 3, 5, 5, respectively.\n\nIncrease A by 2. Now, A, B, C are 5, 5, 5, respectively.\n\nSample Input 2\n\n2 6 3\n\nSample Output 2\n\n5\n\nSample Input 3\n\n31 41 5\n\nSample Output 3\n\n23", "sample_input": "2 5 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03387", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given three integers A, B and C. Find the minimum number of operations required to make A, B and C all equal by repeatedly performing the following two kinds of operations in any order:\n\nChoose two among A, B and C, then increase both by 1.\n\nChoose one among A, B and C, then increase it by 2.\n\nIt can be proved that we can always make A, B and C all equal by repeatedly performing these operations.\n\nConstraints\n\n0 \\leq A,B,C \\leq 50\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the minimum number of operations required to make A, B and C all equal.\n\nSample Input 1\n\n2 5 4\n\nSample Output 1\n\n2\n\nWe can make A, B and C all equal by the following operations:\n\nIncrease A and C by 1. Now, A, B, C are 3, 5, 5, respectively.\n\nIncrease A by 2. Now, A, B, C are 5, 5, 5, respectively.\n\nSample Input 2\n\n2 6 3\n\nSample Output 2\n\n5\n\nSample Input 3\n\n31 41 5\n\nSample Output 3\n\n23", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s320850933", "group_id": "codeNet:p03387", "input_text": "A=io.read(\"n\")\nB=io.read(\"n\")\nC=io.read(\"n\")\nif A>B then\n A,B=B,A\nend\nif B>C then\n B,C=C,B\n if A>B then\n A,B=B,A\n end\nend\nlocal count=0\nif (B-A)%2==0 then\n count=(B-A)//2+C-B\n else count=(B+1-A)//2+C-B+1\nend\nprint(count)", "language": "Lua", "metadata": {"date": 1550862410, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03387.html", "problem_id": "p03387", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03387/input.txt", "sample_output_relpath": "derived/input_output/data/p03387/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03387/Lua/s320850933.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s320850933", "user_id": "u015229643"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "A=io.read(\"n\")\nB=io.read(\"n\")\nC=io.read(\"n\")\nif A>B then\n A,B=B,A\nend\nif B>C then\n B,C=C,B\n if A>B then\n A,B=B,A\n end\nend\nlocal count=0\nif (B-A)%2==0 then\n count=(B-A)//2+C-B\n else count=(B+1-A)//2+C-B+1\nend\nprint(count)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given three integers A, B and C. Find the minimum number of operations required to make A, B and C all equal by repeatedly performing the following two kinds of operations in any order:\n\nChoose two among A, B and C, then increase both by 1.\n\nChoose one among A, B and C, then increase it by 2.\n\nIt can be proved that we can always make A, B and C all equal by repeatedly performing these operations.\n\nConstraints\n\n0 \\leq A,B,C \\leq 50\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the minimum number of operations required to make A, B and C all equal.\n\nSample Input 1\n\n2 5 4\n\nSample Output 1\n\n2\n\nWe can make A, B and C all equal by the following operations:\n\nIncrease A and C by 1. Now, A, B, C are 3, 5, 5, respectively.\n\nIncrease A by 2. Now, A, B, C are 5, 5, 5, respectively.\n\nSample Input 2\n\n2 6 3\n\nSample Output 2\n\n5\n\nSample Input 3\n\n31 41 5\n\nSample Output 3\n\n23", "sample_input": "2 5 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03387", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given three integers A, B and C. Find the minimum number of operations required to make A, B and C all equal by repeatedly performing the following two kinds of operations in any order:\n\nChoose two among A, B and C, then increase both by 1.\n\nChoose one among A, B and C, then increase it by 2.\n\nIt can be proved that we can always make A, B and C all equal by repeatedly performing these operations.\n\nConstraints\n\n0 \\leq A,B,C \\leq 50\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the minimum number of operations required to make A, B and C all equal.\n\nSample Input 1\n\n2 5 4\n\nSample Output 1\n\n2\n\nWe can make A, B and C all equal by the following operations:\n\nIncrease A and C by 1. Now, A, B, C are 3, 5, 5, respectively.\n\nIncrease A by 2. Now, A, B, C are 5, 5, 5, respectively.\n\nSample Input 2\n\n2 6 3\n\nSample Output 2\n\n5\n\nSample Input 3\n\n31 41 5\n\nSample Output 3\n\n23", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 229, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s632785845", "group_id": "codeNet:p03393", "input_text": "local s=io.read()\n\nif #s==26 then\n for i=#s,2,-1 do\n if s:sub(i,i)>s:sub(i-1,i-1) then\n s=s:sub(1,i-1)\n break\n end\n end\n if #s==26 then\n print(-1)\n return\n else\n for i=97,122 do\n local c=string.char(i)\n if not s:find(c) then\n print(s:sub(1,#s-1)..c)\n break\n end\n end\n end\nelse\n for i=97,122 do\n local c=string.char(i)\n if not s:find(c) then\n print(s..c)\n break\n end\n end\nend", "language": "Lua", "metadata": {"date": 1590627468, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03393.html", "problem_id": "p03393", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03393/input.txt", "sample_output_relpath": "derived/input_output/data/p03393/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03393/Lua/s632785845.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s632785845", "user_id": "u045238009"}, "prompt_components": {"gold_output": "atcoderb\n", "input_to_evaluate": "local s=io.read()\n\nif #s==26 then\n for i=#s,2,-1 do\n if s:sub(i,i)>s:sub(i-1,i-1) then\n s=s:sub(1,i-1)\n break\n end\n end\n if #s==26 then\n print(-1)\n return\n else\n for i=97,122 do\n local c=string.char(i)\n if not s:find(c) then\n print(s:sub(1,#s-1)..c)\n break\n end\n end\n end\nelse\n for i=97,122 do\n local c=string.char(i)\n if not s:find(c) then\n print(s..c)\n break\n end\n end\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGotou just received a dictionary. However, he doesn't recognize the language used in the dictionary. He did some analysis on the dictionary and realizes that the dictionary contains all possible diverse words in lexicographical order.\n\nA word is called diverse if and only if it is a nonempty string of English lowercase letters and all letters in the word are distinct. For example, atcoder, zscoder and agc are diverse words while gotou and connect aren't diverse words.\n\nGiven a diverse word S, determine the next word that appears after S in the dictionary, i.e. the lexicographically smallest diverse word that is lexicographically larger than S, or determine that it doesn't exist.\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 \\leq |S| \\leq 26\n\nS is a diverse word.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the next word that appears after S in the dictionary, or -1 if it doesn't exist.\n\nSample Input 1\n\natcoder\n\nSample Output 1\n\natcoderb\n\natcoderb is the lexicographically smallest diverse word that is lexicographically larger than atcoder. Note that atcoderb is lexicographically smaller than b.\n\nSample Input 2\n\nabc\n\nSample Output 2\n\nabcd\n\nSample Input 3\n\nzyxwvutsrqponmlkjihgfedcba\n\nSample Output 3\n\n-1\n\nThis is the lexicographically largest diverse word, so the answer is -1.\n\nSample Input 4\n\nabcdefghijklmnopqrstuvwzyx\n\nSample Output 4\n\nabcdefghijklmnopqrstuvx", "sample_input": "atcoder\n"}, "reference_outputs": ["atcoderb\n"], "source_document_id": "p03393", "source_text": "Score : 300 points\n\nProblem Statement\n\nGotou just received a dictionary. However, he doesn't recognize the language used in the dictionary. He did some analysis on the dictionary and realizes that the dictionary contains all possible diverse words in lexicographical order.\n\nA word is called diverse if and only if it is a nonempty string of English lowercase letters and all letters in the word are distinct. For example, atcoder, zscoder and agc are diverse words while gotou and connect aren't diverse words.\n\nGiven a diverse word S, determine the next word that appears after S in the dictionary, i.e. the lexicographically smallest diverse word that is lexicographically larger than S, or determine that it doesn't exist.\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 \\leq |S| \\leq 26\n\nS is a diverse word.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the next word that appears after S in the dictionary, or -1 if it doesn't exist.\n\nSample Input 1\n\natcoder\n\nSample Output 1\n\natcoderb\n\natcoderb is the lexicographically smallest diverse word that is lexicographically larger than atcoder. Note that atcoderb is lexicographically smaller than b.\n\nSample Input 2\n\nabc\n\nSample Output 2\n\nabcd\n\nSample Input 3\n\nzyxwvutsrqponmlkjihgfedcba\n\nSample Output 3\n\n-1\n\nThis is the lexicographically largest diverse word, so the answer is -1.\n\nSample Input 4\n\nabcdefghijklmnopqrstuvwzyx\n\nSample Output 4\n\nabcdefghijklmnopqrstuvx", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 508}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s344579051", "group_id": "codeNet:p03395", "input_text": "local mmi, mma = math.min, math.max\nlocal mfl, mce = math.floor, math.ceil\nlocal n = io.read(\"*n\")\nlocal a = {}\nlocal b = {}\nlocal kval = {}\nfor i = 1, n do\n a[i] = {}\n local z = io.read(\"*n\")\n a[i][z] = true\n kval[i] = 100\nend\nfor i = 1, n do\n b[i] = io.read(\"*n\")\nend\nlocal valid = true\nfor i = 1, n do\n local at = next(a[i])\n local z = at - b[i]\n local min = b[i] + 1\n if 0 < z and z < min then\n valid = false\n end\n for j = min, z do\n if z % j == 0 then\n kval[i] = j\n break\n end\n end\nend\nif not valid then\n print(-1)\n os.exit()\nend\nlocal function flush()\n for i = n, 1, -1 do\n local found = false\n for av, _u in pairs(a[i]) do\n if b[i] == av then\n found = true\n break\n end\n end\n if found then\n table.remove(a, i)\n table.remove(b, i)\n table.remove(kval, i)\n end\n end\n n = #a\nend\nlocal ret = {}\nwhile true do\n flush()\n if n == 0 then\n break\n end\n local maxval = kval[1]\n for i = 2, n do\n maxval = mma(maxval, kval[i])\n end\n assert(maxval < 100)\n table.insert(ret, maxval)\n for i = 1, n do\n local add = {}\n for av, _u in pairs(a[i]) do\n local z = av % maxval\n if b[i] <= z then\n table.insert(add, z)\n end\n end\n for j = 1, #add do\n local v = add[j]\n a[i][v] = true\n local z = v - b[i]\n local min = b[i] + 1\n for s = min, z do\n if z % s == 0 then\n kval[i] = mmi(kval[i], s)\n break\n end\n end\n end\n end\nend\nlocal ans = 0LL\nfor i = 1, #ret do\n local v = ret[i]\n local z = 1LL\n for j = 1, v do\n z = z * 2LL\n end\n ans = ans + z\nend\nlocal str = tostring(ans):gsub(\"LL\", \"\")\nprint(str)\n", "language": "Lua", "metadata": {"date": 1587610650, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03395.html", "problem_id": "p03395", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03395/input.txt", "sample_output_relpath": "derived/input_output/data/p03395/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03395/Lua/s344579051.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s344579051", "user_id": "u120582723"}, "prompt_components": {"gold_output": "160\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal mfl, mce = math.floor, math.ceil\nlocal n = io.read(\"*n\")\nlocal a = {}\nlocal b = {}\nlocal kval = {}\nfor i = 1, n do\n a[i] = {}\n local z = io.read(\"*n\")\n a[i][z] = true\n kval[i] = 100\nend\nfor i = 1, n do\n b[i] = io.read(\"*n\")\nend\nlocal valid = true\nfor i = 1, n do\n local at = next(a[i])\n local z = at - b[i]\n local min = b[i] + 1\n if 0 < z and z < min then\n valid = false\n end\n for j = min, z do\n if z % j == 0 then\n kval[i] = j\n break\n end\n end\nend\nif not valid then\n print(-1)\n os.exit()\nend\nlocal function flush()\n for i = n, 1, -1 do\n local found = false\n for av, _u in pairs(a[i]) do\n if b[i] == av then\n found = true\n break\n end\n end\n if found then\n table.remove(a, i)\n table.remove(b, i)\n table.remove(kval, i)\n end\n end\n n = #a\nend\nlocal ret = {}\nwhile true do\n flush()\n if n == 0 then\n break\n end\n local maxval = kval[1]\n for i = 2, n do\n maxval = mma(maxval, kval[i])\n end\n assert(maxval < 100)\n table.insert(ret, maxval)\n for i = 1, n do\n local add = {}\n for av, _u in pairs(a[i]) do\n local z = av % maxval\n if b[i] <= z then\n table.insert(add, z)\n end\n end\n for j = 1, #add do\n local v = add[j]\n a[i][v] = true\n local z = v - b[i]\n local min = b[i] + 1\n for s = min, z do\n if z % s == 0 then\n kval[i] = mmi(kval[i], s)\n break\n end\n end\n end\n end\nend\nlocal ans = 0LL\nfor i = 1, #ret do\n local v = ret[i]\n local z = 1LL\n for j = 1, v do\n z = z * 2LL\n end\n ans = ans + z\nend\nlocal str = tostring(ans):gsub(\"LL\", \"\")\nprint(str)\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nAoki is playing with a sequence of numbers a_{1}, a_{2}, ..., a_{N}. Every second, he performs the following operation :\n\nChoose a positive integer k. For each element of the sequence v, Aoki may choose to replace v with its remainder when divided by k, or do nothing with v. The cost of this operation is 2^{k} (regardless of how many elements he changes).\n\nAoki wants to turn the sequence into b_{1}, b_{2}, ..., b_{N} (the order of the elements is important). Determine if it is possible for Aoki to perform this task and if yes, find the minimum cost required.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n0 \\leq a_{i}, b_{i} \\leq 50\n\nAll values in the input 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\nPrint the minimum cost required to turn the original sequence into b_{1}, b_{2}, ..., b_{N}. If the task is impossible, output -1 instead.\n\nSample Input 1\n\n3\n19 10 14\n0 3 4\n\nSample Output 1\n\n160\n\nHere's a possible sequence of operations :\n\nChoose k = 7. Replace 19 with 5, 10 with 3 and do nothing to 14. The sequence is now 5, 3, 14.\n\nChoose k = 5. Replace 5 with 0, do nothing to 3 and replace 14 with 4. The sequence is now 0, 3, 4.\n\nThe total cost is 2^{7} + 2^{5} = 160.\n\nSample Input 2\n\n3\n19 15 14\n0 0 0\n\nSample Output 2\n\n2\n\nAoki can just choose k = 1 and turn everything into 0. The cost is 2^{1} = 2.\n\nSample Input 3\n\n2\n8 13\n5 13\n\nSample Output 3\n\n-1\n\nThe task is impossible because we can never turn 8 into 5 using the given operation.\n\nSample Input 4\n\n4\n2 0 1 8\n2 0 1 8\n\nSample Output 4\n\n0\n\nAoki doesn't need to do anything here. The cost is 0.\n\nSample Input 5\n\n1\n50\n13\n\nSample Output 5\n\n137438953472\n\nBeware of overflow issues.", "sample_input": "3\n19 10 14\n0 3 4\n"}, "reference_outputs": ["160\n"], "source_document_id": "p03395", "source_text": "Score : 700 points\n\nProblem Statement\n\nAoki is playing with a sequence of numbers a_{1}, a_{2}, ..., a_{N}. Every second, he performs the following operation :\n\nChoose a positive integer k. For each element of the sequence v, Aoki may choose to replace v with its remainder when divided by k, or do nothing with v. The cost of this operation is 2^{k} (regardless of how many elements he changes).\n\nAoki wants to turn the sequence into b_{1}, b_{2}, ..., b_{N} (the order of the elements is important). Determine if it is possible for Aoki to perform this task and if yes, find the minimum cost required.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n0 \\leq a_{i}, b_{i} \\leq 50\n\nAll values in the input 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\nPrint the minimum cost required to turn the original sequence into b_{1}, b_{2}, ..., b_{N}. If the task is impossible, output -1 instead.\n\nSample Input 1\n\n3\n19 10 14\n0 3 4\n\nSample Output 1\n\n160\n\nHere's a possible sequence of operations :\n\nChoose k = 7. Replace 19 with 5, 10 with 3 and do nothing to 14. The sequence is now 5, 3, 14.\n\nChoose k = 5. Replace 5 with 0, do nothing to 3 and replace 14 with 4. The sequence is now 0, 3, 4.\n\nThe total cost is 2^{7} + 2^{5} = 160.\n\nSample Input 2\n\n3\n19 15 14\n0 0 0\n\nSample Output 2\n\n2\n\nAoki can just choose k = 1 and turn everything into 0. The cost is 2^{1} = 2.\n\nSample Input 3\n\n2\n8 13\n5 13\n\nSample Output 3\n\n-1\n\nThe task is impossible because we can never turn 8 into 5 using the given operation.\n\nSample Input 4\n\n4\n2 0 1 8\n2 0 1 8\n\nSample Output 4\n\n0\n\nAoki doesn't need to do anything here. The cost is 0.\n\nSample Input 5\n\n1\n50\n13\n\nSample Output 5\n\n137438953472\n\nBeware of overflow issues.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1690, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s578722208", "group_id": "codeNet:p03395", "input_text": "local mmi, mma = math.min, math.max\nlocal mfl, mce = math.floor, math.ceil\nlocal n = io.read(\"*n\")\nlocal a = {}\nlocal kval = {}\nfor i = 1, n do\n a[i] = {}\n local z = io.read(\"*n\")\n a[i][z] = true\n kval[i] = 100\nend\nlocal b = {}\nfor i = 1, n do\n b[i] = io.read(\"*n\")\nend\nlocal valid = true\nfor i = 1, n do\n local at = next(a[i])\n local z = at - b[i]\n local min = mce((b[i] + 1) / 2)\n if 0 < z and z < min then\n valid = false\n end\n for j = min, z do\n if z % j == 0 then\n kval[i] = j\n break\n end\n end\nend\nif not valid then\n print(-1)\n os.exit()\nend\nlocal function flush()\n for i = n, 1, -1 do\n local found = false\n for av, _u in pairs(a[i]) do\n if b[i] == av then\n found = true\n break\n end\n end\n if found then\n table.remove(a, i)\n table.remove(b, i)\n table.remove(kval, i)\n end\n end\n n = #a\nend\nlocal ret = {}\nwhile true do\n flush()\n if n == 0 then\n break\n end\n local maxval = kval[1]\n for i = 2, n do\n maxval = mma(maxval, kval[i])\n end\n table.insert(ret, maxval)\n for i = 1, n do\n local add = {}\n for av, _u in pairs(a[i]) do\n local z = av % maxval\n if b[i] <= z then\n table.insert(add, z)\n end\n end\n for j = 1, #add do\n local v = add[j]\n a[i][v] = true\n local z = v - b[i]\n local min = mce((b[i] + 1) / 2)\n for j = min, z do\n if z % j == 0 then\n kval[i] = mmi(kval[i], j)\n break\n end\n end\n end\n end\nend\nlocal ans = 0LL\nfor i = 1, #ret do\n local v = ret[i]\n local z = 1LL\n for j = 1, v do\n z = z * 2LL\n end\n ans = ans + z\nend\nlocal str = tostring(ans):gsub(\"LL\", \"\")\nprint(str)\n", "language": "Lua", "metadata": {"date": 1587609661, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03395.html", "problem_id": "p03395", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03395/input.txt", "sample_output_relpath": "derived/input_output/data/p03395/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03395/Lua/s578722208.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s578722208", "user_id": "u120582723"}, "prompt_components": {"gold_output": "160\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal mfl, mce = math.floor, math.ceil\nlocal n = io.read(\"*n\")\nlocal a = {}\nlocal kval = {}\nfor i = 1, n do\n a[i] = {}\n local z = io.read(\"*n\")\n a[i][z] = true\n kval[i] = 100\nend\nlocal b = {}\nfor i = 1, n do\n b[i] = io.read(\"*n\")\nend\nlocal valid = true\nfor i = 1, n do\n local at = next(a[i])\n local z = at - b[i]\n local min = mce((b[i] + 1) / 2)\n if 0 < z and z < min then\n valid = false\n end\n for j = min, z do\n if z % j == 0 then\n kval[i] = j\n break\n end\n end\nend\nif not valid then\n print(-1)\n os.exit()\nend\nlocal function flush()\n for i = n, 1, -1 do\n local found = false\n for av, _u in pairs(a[i]) do\n if b[i] == av then\n found = true\n break\n end\n end\n if found then\n table.remove(a, i)\n table.remove(b, i)\n table.remove(kval, i)\n end\n end\n n = #a\nend\nlocal ret = {}\nwhile true do\n flush()\n if n == 0 then\n break\n end\n local maxval = kval[1]\n for i = 2, n do\n maxval = mma(maxval, kval[i])\n end\n table.insert(ret, maxval)\n for i = 1, n do\n local add = {}\n for av, _u in pairs(a[i]) do\n local z = av % maxval\n if b[i] <= z then\n table.insert(add, z)\n end\n end\n for j = 1, #add do\n local v = add[j]\n a[i][v] = true\n local z = v - b[i]\n local min = mce((b[i] + 1) / 2)\n for j = min, z do\n if z % j == 0 then\n kval[i] = mmi(kval[i], j)\n break\n end\n end\n end\n end\nend\nlocal ans = 0LL\nfor i = 1, #ret do\n local v = ret[i]\n local z = 1LL\n for j = 1, v do\n z = z * 2LL\n end\n ans = ans + z\nend\nlocal str = tostring(ans):gsub(\"LL\", \"\")\nprint(str)\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nAoki is playing with a sequence of numbers a_{1}, a_{2}, ..., a_{N}. Every second, he performs the following operation :\n\nChoose a positive integer k. For each element of the sequence v, Aoki may choose to replace v with its remainder when divided by k, or do nothing with v. The cost of this operation is 2^{k} (regardless of how many elements he changes).\n\nAoki wants to turn the sequence into b_{1}, b_{2}, ..., b_{N} (the order of the elements is important). Determine if it is possible for Aoki to perform this task and if yes, find the minimum cost required.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n0 \\leq a_{i}, b_{i} \\leq 50\n\nAll values in the input 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\nPrint the minimum cost required to turn the original sequence into b_{1}, b_{2}, ..., b_{N}. If the task is impossible, output -1 instead.\n\nSample Input 1\n\n3\n19 10 14\n0 3 4\n\nSample Output 1\n\n160\n\nHere's a possible sequence of operations :\n\nChoose k = 7. Replace 19 with 5, 10 with 3 and do nothing to 14. The sequence is now 5, 3, 14.\n\nChoose k = 5. Replace 5 with 0, do nothing to 3 and replace 14 with 4. The sequence is now 0, 3, 4.\n\nThe total cost is 2^{7} + 2^{5} = 160.\n\nSample Input 2\n\n3\n19 15 14\n0 0 0\n\nSample Output 2\n\n2\n\nAoki can just choose k = 1 and turn everything into 0. The cost is 2^{1} = 2.\n\nSample Input 3\n\n2\n8 13\n5 13\n\nSample Output 3\n\n-1\n\nThe task is impossible because we can never turn 8 into 5 using the given operation.\n\nSample Input 4\n\n4\n2 0 1 8\n2 0 1 8\n\nSample Output 4\n\n0\n\nAoki doesn't need to do anything here. The cost is 0.\n\nSample Input 5\n\n1\n50\n13\n\nSample Output 5\n\n137438953472\n\nBeware of overflow issues.", "sample_input": "3\n19 10 14\n0 3 4\n"}, "reference_outputs": ["160\n"], "source_document_id": "p03395", "source_text": "Score : 700 points\n\nProblem Statement\n\nAoki is playing with a sequence of numbers a_{1}, a_{2}, ..., a_{N}. Every second, he performs the following operation :\n\nChoose a positive integer k. For each element of the sequence v, Aoki may choose to replace v with its remainder when divided by k, or do nothing with v. The cost of this operation is 2^{k} (regardless of how many elements he changes).\n\nAoki wants to turn the sequence into b_{1}, b_{2}, ..., b_{N} (the order of the elements is important). Determine if it is possible for Aoki to perform this task and if yes, find the minimum cost required.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n0 \\leq a_{i}, b_{i} \\leq 50\n\nAll values in the input 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\nPrint the minimum cost required to turn the original sequence into b_{1}, b_{2}, ..., b_{N}. If the task is impossible, output -1 instead.\n\nSample Input 1\n\n3\n19 10 14\n0 3 4\n\nSample Output 1\n\n160\n\nHere's a possible sequence of operations :\n\nChoose k = 7. Replace 19 with 5, 10 with 3 and do nothing to 14. The sequence is now 5, 3, 14.\n\nChoose k = 5. Replace 5 with 0, do nothing to 3 and replace 14 with 4. The sequence is now 0, 3, 4.\n\nThe total cost is 2^{7} + 2^{5} = 160.\n\nSample Input 2\n\n3\n19 15 14\n0 0 0\n\nSample Output 2\n\n2\n\nAoki can just choose k = 1 and turn everything into 0. The cost is 2^{1} = 2.\n\nSample Input 3\n\n2\n8 13\n5 13\n\nSample Output 3\n\n-1\n\nThe task is impossible because we can never turn 8 into 5 using the given operation.\n\nSample Input 4\n\n4\n2 0 1 8\n2 0 1 8\n\nSample Output 4\n\n0\n\nAoki doesn't need to do anything here. The cost is 0.\n\nSample Input 5\n\n1\n50\n13\n\nSample Output 5\n\n137438953472\n\nBeware of overflow issues.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1689, "cpu_time_ms": 2109, "memory_kb": 107504}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s398616693", "group_id": "codeNet:p03399", "input_text": "a, b = io.read(\"*n\", \"*n\")\nc, d = io.read(\"*n\", \"*n\")\nprint(math.min(a, b) + math.min(c, d))", "language": "Lua", "metadata": {"date": 1566824949, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03399.html", "problem_id": "p03399", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03399/input.txt", "sample_output_relpath": "derived/input_output/data/p03399/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03399/Lua/s398616693.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s398616693", "user_id": "u120582723"}, "prompt_components": {"gold_output": "520\n", "input_to_evaluate": "a, b = io.read(\"*n\", \"*n\")\nc, d = io.read(\"*n\", \"*n\")\nprint(math.min(a, b) + math.min(c, d))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou planned a trip using trains and buses.\nThe train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket.\nSimilarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket.\n\nFind the minimum total fare when the optimal choices are made for trains and buses.\n\nConstraints\n\n1 \\leq A \\leq 1 000\n\n1 \\leq B \\leq 1 000\n\n1 \\leq C \\leq 1 000\n\n1 \\leq D \\leq 1 000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\n\nOutput\n\nPrint the minimum total fare.\n\nSample Input 1\n\n600\n300\n220\n420\n\nSample Output 1\n\n520\n\nThe train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket.\nThus, the optimal choice for trains is to buy an unlimited ticket for 300 yen.\nOn the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.\n\nTherefore, the minimum total fare is 300 + 220 = 520 yen.\n\nSample Input 2\n\n555\n555\n400\n200\n\nSample Output 2\n\n755\n\nSample Input 3\n\n549\n817\n715\n603\n\nSample Output 3\n\n1152", "sample_input": "600\n300\n220\n420\n"}, "reference_outputs": ["520\n"], "source_document_id": "p03399", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou planned a trip using trains and buses.\nThe train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket.\nSimilarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket.\n\nFind the minimum total fare when the optimal choices are made for trains and buses.\n\nConstraints\n\n1 \\leq A \\leq 1 000\n\n1 \\leq B \\leq 1 000\n\n1 \\leq C \\leq 1 000\n\n1 \\leq D \\leq 1 000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\n\nOutput\n\nPrint the minimum total fare.\n\nSample Input 1\n\n600\n300\n220\n420\n\nSample Output 1\n\n520\n\nThe train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket.\nThus, the optimal choice for trains is to buy an unlimited ticket for 300 yen.\nOn the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.\n\nTherefore, the minimum total fare is 300 + 220 = 520 yen.\n\nSample Input 2\n\n555\n555\n400\n200\n\nSample Output 2\n\n755\n\nSample Input 3\n\n549\n817\n715\n603\n\nSample Output 3\n\n1152", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 92, "cpu_time_ms": 6, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s270025427", "group_id": "codeNet:p03399", "input_text": "a = io.read(\"*n\")\nb = io.read(\"*n\")\nc = io.read(\"*n\")\nd = io.read(\"*n\")\n\nprint(math.min(a, b) + math.min(c,d))\n", "language": "Lua", "metadata": {"date": 1565474553, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03399.html", "problem_id": "p03399", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03399/input.txt", "sample_output_relpath": "derived/input_output/data/p03399/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03399/Lua/s270025427.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s270025427", "user_id": "u318027064"}, "prompt_components": {"gold_output": "520\n", "input_to_evaluate": "a = io.read(\"*n\")\nb = io.read(\"*n\")\nc = io.read(\"*n\")\nd = io.read(\"*n\")\n\nprint(math.min(a, b) + math.min(c,d))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou planned a trip using trains and buses.\nThe train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket.\nSimilarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket.\n\nFind the minimum total fare when the optimal choices are made for trains and buses.\n\nConstraints\n\n1 \\leq A \\leq 1 000\n\n1 \\leq B \\leq 1 000\n\n1 \\leq C \\leq 1 000\n\n1 \\leq D \\leq 1 000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\n\nOutput\n\nPrint the minimum total fare.\n\nSample Input 1\n\n600\n300\n220\n420\n\nSample Output 1\n\n520\n\nThe train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket.\nThus, the optimal choice for trains is to buy an unlimited ticket for 300 yen.\nOn the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.\n\nTherefore, the minimum total fare is 300 + 220 = 520 yen.\n\nSample Input 2\n\n555\n555\n400\n200\n\nSample Output 2\n\n755\n\nSample Input 3\n\n549\n817\n715\n603\n\nSample Output 3\n\n1152", "sample_input": "600\n300\n220\n420\n"}, "reference_outputs": ["520\n"], "source_document_id": "p03399", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou planned a trip using trains and buses.\nThe train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket.\nSimilarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket.\n\nFind the minimum total fare when the optimal choices are made for trains and buses.\n\nConstraints\n\n1 \\leq A \\leq 1 000\n\n1 \\leq B \\leq 1 000\n\n1 \\leq C \\leq 1 000\n\n1 \\leq D \\leq 1 000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\n\nOutput\n\nPrint the minimum total fare.\n\nSample Input 1\n\n600\n300\n220\n420\n\nSample Output 1\n\n520\n\nThe train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket.\nThus, the optimal choice for trains is to buy an unlimited ticket for 300 yen.\nOn the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.\n\nTherefore, the minimum total fare is 300 + 220 = 520 yen.\n\nSample Input 2\n\n555\n555\n400\n200\n\nSample Output 2\n\n755\n\nSample Input 3\n\n549\n817\n715\n603\n\nSample Output 3\n\n1152", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 111, "cpu_time_ms": 5, "memory_kb": 508}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s535448900", "group_id": "codeNet:p03399", "input_text": "print(math.floor(math.min(io.read(),io.read())+math.min(io.read(),io.read())))", "language": "Lua", "metadata": {"date": 1551839883, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03399.html", "problem_id": "p03399", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03399/input.txt", "sample_output_relpath": "derived/input_output/data/p03399/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03399/Lua/s535448900.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s535448900", "user_id": "u837412668"}, "prompt_components": {"gold_output": "520\n", "input_to_evaluate": "print(math.floor(math.min(io.read(),io.read())+math.min(io.read(),io.read())))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou planned a trip using trains and buses.\nThe train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket.\nSimilarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket.\n\nFind the minimum total fare when the optimal choices are made for trains and buses.\n\nConstraints\n\n1 \\leq A \\leq 1 000\n\n1 \\leq B \\leq 1 000\n\n1 \\leq C \\leq 1 000\n\n1 \\leq D \\leq 1 000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\n\nOutput\n\nPrint the minimum total fare.\n\nSample Input 1\n\n600\n300\n220\n420\n\nSample Output 1\n\n520\n\nThe train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket.\nThus, the optimal choice for trains is to buy an unlimited ticket for 300 yen.\nOn the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.\n\nTherefore, the minimum total fare is 300 + 220 = 520 yen.\n\nSample Input 2\n\n555\n555\n400\n200\n\nSample Output 2\n\n755\n\nSample Input 3\n\n549\n817\n715\n603\n\nSample Output 3\n\n1152", "sample_input": "600\n300\n220\n420\n"}, "reference_outputs": ["520\n"], "source_document_id": "p03399", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou planned a trip using trains and buses.\nThe train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket.\nSimilarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket.\n\nFind the minimum total fare when the optimal choices are made for trains and buses.\n\nConstraints\n\n1 \\leq A \\leq 1 000\n\n1 \\leq B \\leq 1 000\n\n1 \\leq C \\leq 1 000\n\n1 \\leq D \\leq 1 000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\n\nOutput\n\nPrint the minimum total fare.\n\nSample Input 1\n\n600\n300\n220\n420\n\nSample Output 1\n\n520\n\nThe train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket.\nThus, the optimal choice for trains is to buy an unlimited ticket for 300 yen.\nOn the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.\n\nTherefore, the minimum total fare is 300 + 220 = 520 yen.\n\nSample Input 2\n\n555\n555\n400\n200\n\nSample Output 2\n\n755\n\nSample Input 3\n\n549\n817\n715\n603\n\nSample Output 3\n\n1152", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s002583831", "group_id": "codeNet:p03399", "input_text": "A=io.read(\"n\")\nB=io.read(\"n\")\nC=io.read(\"n\")\nD=io.read(\"n\")\nprint(math.min(A,B)+math.min(C,D))", "language": "Lua", "metadata": {"date": 1550871070, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03399.html", "problem_id": "p03399", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03399/input.txt", "sample_output_relpath": "derived/input_output/data/p03399/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03399/Lua/s002583831.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s002583831", "user_id": "u015229643"}, "prompt_components": {"gold_output": "520\n", "input_to_evaluate": "A=io.read(\"n\")\nB=io.read(\"n\")\nC=io.read(\"n\")\nD=io.read(\"n\")\nprint(math.min(A,B)+math.min(C,D))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou planned a trip using trains and buses.\nThe train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket.\nSimilarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket.\n\nFind the minimum total fare when the optimal choices are made for trains and buses.\n\nConstraints\n\n1 \\leq A \\leq 1 000\n\n1 \\leq B \\leq 1 000\n\n1 \\leq C \\leq 1 000\n\n1 \\leq D \\leq 1 000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\n\nOutput\n\nPrint the minimum total fare.\n\nSample Input 1\n\n600\n300\n220\n420\n\nSample Output 1\n\n520\n\nThe train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket.\nThus, the optimal choice for trains is to buy an unlimited ticket for 300 yen.\nOn the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.\n\nTherefore, the minimum total fare is 300 + 220 = 520 yen.\n\nSample Input 2\n\n555\n555\n400\n200\n\nSample Output 2\n\n755\n\nSample Input 3\n\n549\n817\n715\n603\n\nSample Output 3\n\n1152", "sample_input": "600\n300\n220\n420\n"}, "reference_outputs": ["520\n"], "source_document_id": "p03399", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou planned a trip using trains and buses.\nThe train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket.\nSimilarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket.\n\nFind the minimum total fare when the optimal choices are made for trains and buses.\n\nConstraints\n\n1 \\leq A \\leq 1 000\n\n1 \\leq B \\leq 1 000\n\n1 \\leq C \\leq 1 000\n\n1 \\leq D \\leq 1 000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\n\nOutput\n\nPrint the minimum total fare.\n\nSample Input 1\n\n600\n300\n220\n420\n\nSample Output 1\n\n520\n\nThe train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket.\nThus, the optimal choice for trains is to buy an unlimited ticket for 300 yen.\nOn the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.\n\nTherefore, the minimum total fare is 300 + 220 = 520 yen.\n\nSample Input 2\n\n555\n555\n400\n200\n\nSample Output 2\n\n755\n\nSample Input 3\n\n549\n817\n715\n603\n\nSample Output 3\n\n1152", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 1008}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s642118538", "group_id": "codeNet:p03399", "input_text": "local a = io.read()\nlocal b = io.read()\nlocal c = io.read()\nlocal d = io.read()\n\nlocal aa = 0 \nlocal bb = 0 \n\nif a < b then\n aa = tonumber(a)\nelseif a == b then\n aa = tonumber(a)\nelse\n aa = tonumber(b)\nend\n\nif c < d then\n bb = tonumber(c)\nelseif c == d then\n bb = tonumber(c)\nelse\n bb = tonumber(d)\nend\n\nprint(aa+bb)", "language": "Lua", "metadata": {"date": 1522027367, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03399.html", "problem_id": "p03399", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03399/input.txt", "sample_output_relpath": "derived/input_output/data/p03399/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03399/Lua/s642118538.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s642118538", "user_id": "u751668935"}, "prompt_components": {"gold_output": "520\n", "input_to_evaluate": "local a = io.read()\nlocal b = io.read()\nlocal c = io.read()\nlocal d = io.read()\n\nlocal aa = 0 \nlocal bb = 0 \n\nif a < b then\n aa = tonumber(a)\nelseif a == b then\n aa = tonumber(a)\nelse\n aa = tonumber(b)\nend\n\nif c < d then\n bb = tonumber(c)\nelseif c == d then\n bb = tonumber(c)\nelse\n bb = tonumber(d)\nend\n\nprint(aa+bb)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou planned a trip using trains and buses.\nThe train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket.\nSimilarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket.\n\nFind the minimum total fare when the optimal choices are made for trains and buses.\n\nConstraints\n\n1 \\leq A \\leq 1 000\n\n1 \\leq B \\leq 1 000\n\n1 \\leq C \\leq 1 000\n\n1 \\leq D \\leq 1 000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\n\nOutput\n\nPrint the minimum total fare.\n\nSample Input 1\n\n600\n300\n220\n420\n\nSample Output 1\n\n520\n\nThe train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket.\nThus, the optimal choice for trains is to buy an unlimited ticket for 300 yen.\nOn the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.\n\nTherefore, the minimum total fare is 300 + 220 = 520 yen.\n\nSample Input 2\n\n555\n555\n400\n200\n\nSample Output 2\n\n755\n\nSample Input 3\n\n549\n817\n715\n603\n\nSample Output 3\n\n1152", "sample_input": "600\n300\n220\n420\n"}, "reference_outputs": ["520\n"], "source_document_id": "p03399", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou planned a trip using trains and buses.\nThe train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket.\nSimilarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket.\n\nFind the minimum total fare when the optimal choices are made for trains and buses.\n\nConstraints\n\n1 \\leq A \\leq 1 000\n\n1 \\leq B \\leq 1 000\n\n1 \\leq C \\leq 1 000\n\n1 \\leq D \\leq 1 000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\n\nOutput\n\nPrint the minimum total fare.\n\nSample Input 1\n\n600\n300\n220\n420\n\nSample Output 1\n\n520\n\nThe train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket.\nThus, the optimal choice for trains is to buy an unlimited ticket for 300 yen.\nOn the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.\n\nTherefore, the minimum total fare is 300 + 220 = 520 yen.\n\nSample Input 2\n\n555\n555\n400\n200\n\nSample Output 2\n\n755\n\nSample Input 3\n\n549\n817\n715\n603\n\nSample Output 3\n\n1152", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 334, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s427554970", "group_id": "codeNet:p03401", "input_text": "local mab = math.abs\nlocal n = io.read(\"*n\", \"*l\")\nlocal str = io.read()\nlocal a = {}\nfor v in str:gmatch(\"%-?%d+\") do\n table.insert(a, tonumber(v))\nend\nlocal sum = mab(a[1]) + mab(a[n])\nfor i = 1, n - 1 do\n sum = sum + mab(a[i] - a[i + 1])\nend\nprint(sum - mab(a[1]) - mab(a[1] - a[2]) + mab(a[2]))\nfor i = 2, n - 1 do\n print(sum - mab(a[i] - a[i - 1]) - mab(a[i] - a[i + 1]) + mab(a[i - 1] - a[i + 1]))\nend\nprint(sum - mab(a[n]) - mab(a[n] - a[n - 1]) + mab(a[n - 1]))\n", "language": "Lua", "metadata": {"date": 1559520059, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s427554970.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s427554970", "user_id": "u120582723"}, "prompt_components": {"gold_output": "12\n8\n10\n", "input_to_evaluate": "local mab = math.abs\nlocal n = io.read(\"*n\", \"*l\")\nlocal str = io.read()\nlocal a = {}\nfor v in str:gmatch(\"%-?%d+\") do\n table.insert(a, tonumber(v))\nend\nlocal sum = mab(a[1]) + mab(a[n])\nfor i = 1, n - 1 do\n sum = sum + mab(a[i] - a[i + 1])\nend\nprint(sum - mab(a[1]) - mab(a[1] - a[2]) + mab(a[2]))\nfor i = 2, n - 1 do\n print(sum - mab(a[i] - a[i - 1]) - mab(a[i] - a[i + 1]) + mab(a[i - 1] - a[i + 1]))\nend\nprint(sum - mab(a[n]) - mab(a[n] - a[n - 1]) + mab(a[n - 1]))\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": "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 108, "memory_kb": 3708}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s260712005", "group_id": "codeNet:p03401", "input_text": "N=io.read(\"n\")\nA={}\nA[1]=0\nfor i=2,N+1 do\n A[i]=io.read(\"n\")\nend\ntable.insert(A,0)\nlocal total=0\nfor i=2,N+2 do\n total=total+math.abs(A[i]-A[i-1])\nend\nfor i=2,N+1 do\n if A[i]>math.min(A[i-1],A[i+1]) and A[i]math.max(A[i-1],A[i+1]) then\n print(total-2*(A[i]-math.max(A[i-1],A[i+1])))\n end\nend", "language": "Lua", "metadata": {"date": 1550876844, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s260712005.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s260712005", "user_id": "u015229643"}, "prompt_components": {"gold_output": "12\n8\n10\n", "input_to_evaluate": "N=io.read(\"n\")\nA={}\nA[1]=0\nfor i=2,N+1 do\n A[i]=io.read(\"n\")\nend\ntable.insert(A,0)\nlocal total=0\nfor i=2,N+2 do\n total=total+math.abs(A[i]-A[i-1])\nend\nfor i=2,N+1 do\n if A[i]>math.min(A[i-1],A[i+1]) and A[i]math.max(A[i-1],A[i+1]) then\n print(total-2*(A[i]-math.max(A[i-1],A[i+1])))\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 465, "cpu_time_ms": 362, "memory_kb": 4460}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s176525725", "group_id": "codeNet:p03401", "input_text": "N=io.read(\"n\")\nA={}\nfor i=2,N+1 do\n A[i]=io.read(\"n\")\nend\nA[1]=0\ntable.insert(A,0)\nlocal total=0\nfor i=2,N do\n for j=2,N+1 do\n local g=0\n local k=math.abs(A[j+g]-A[j-1+g])\n if j==i then\n k=math.abs(A[j+1]-A[j-1])\n g=1\n end\n total=total+k\n end\n print(total)\nend", "language": "Lua", "metadata": {"date": 1550874880, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s176525725.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s176525725", "user_id": "u015229643"}, "prompt_components": {"gold_output": "12\n8\n10\n", "input_to_evaluate": "N=io.read(\"n\")\nA={}\nfor i=2,N+1 do\n A[i]=io.read(\"n\")\nend\nA[1]=0\ntable.insert(A,0)\nlocal total=0\nfor i=2,N do\n for j=2,N+1 do\n local g=0\n local k=math.abs(A[j+g]-A[j-1+g])\n if j==i then\n k=math.abs(A[j+1]-A[j-1])\n g=1\n end\n total=total+k\n end\n print(total)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 2424}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s949691147", "group_id": "codeNet:p03407", "input_text": "a,b,c=io.read():match(\"(.+)%s(.+)%s(.+)\")\nprint(a+b 0 then\n print(\"Yes\")\nelse\n print(\"No\")\nend", "language": "Lua", "metadata": {"date": 1521336275, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03407.html", "problem_id": "p03407", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03407/input.txt", "sample_output_relpath": "derived/input_output/data/p03407/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03407/Lua/s070351428.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s070351428", "user_id": "u751668935"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "function split(text, delimiter)\n if text.find(text, delimiter) == nil then\n return { text }\n end \n\n local splited_texts = {}\n local last_position\n\n for splited_text, position in text:gmatch(\"(.-)\"..delimiter..\"()\") do\n table.insert(splited_texts, splited_text)\n last_position = position\n end \n table.insert(splited_texts, string.sub(text, last_position))\n return splited_texts\nend\n\nlocal a = io.read()\nlocal list = split(a, \" \")\nlocal have_money = tonumber(list[1]) + tonumber(list[2])\nlocal price = tonumber(list[3])\n\nif (have_money-price) > 0 then\n print(\"Yes\")\nelse\n print(\"No\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAn elementary school student Takahashi has come to a variety store.\n\nHe has two coins, A-yen and B-yen coins (yen is the currency of Japan), and wants to buy a toy that costs C yen. Can he buy it?\n\nNote that he lives in Takahashi Kingdom, and may have coins that do not exist in Japan.\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq A, B \\leq 500\n\n1 \\leq C \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf Takahashi can buy the toy, print Yes; if he cannot, print No.\n\nSample Input 1\n\n50 100 120\n\nSample Output 1\n\nYes\n\nHe has 50 + 100 = 150 yen, so he can buy the 120-yen toy.\n\nSample Input 2\n\n500 100 1000\n\nSample Output 2\n\nNo\n\nHe has 500 + 100 = 600 yen, but he cannot buy the 1000-yen toy.\n\nSample Input 3\n\n19 123 143\n\nSample Output 3\n\nNo\n\nThere are 19-yen and 123-yen coins in Takahashi Kingdom, which are rather hard to use.\n\nSample Input 4\n\n19 123 142\n\nSample Output 4\n\nYes", "sample_input": "50 100 120\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03407", "source_text": "Score : 100 points\n\nProblem Statement\n\nAn elementary school student Takahashi has come to a variety store.\n\nHe has two coins, A-yen and B-yen coins (yen is the currency of Japan), and wants to buy a toy that costs C yen. Can he buy it?\n\nNote that he lives in Takahashi Kingdom, and may have coins that do not exist in Japan.\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq A, B \\leq 500\n\n1 \\leq C \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf Takahashi can buy the toy, print Yes; if he cannot, print No.\n\nSample Input 1\n\n50 100 120\n\nSample Output 1\n\nYes\n\nHe has 50 + 100 = 150 yen, so he can buy the 120-yen toy.\n\nSample Input 2\n\n500 100 1000\n\nSample Output 2\n\nNo\n\nHe has 500 + 100 = 600 yen, but he cannot buy the 1000-yen toy.\n\nSample Input 3\n\n19 123 143\n\nSample Output 3\n\nNo\n\nThere are 19-yen and 123-yen coins in Takahashi Kingdom, which are rather hard to use.\n\nSample Input 4\n\n19 123 142\n\nSample Output 4\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 608, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s982395787", "group_id": "codeNet:p03407", "input_text": "function split(text, delimiter)\n if text.find(text, delimiter) == nil then\n return { text }\n end \n\n local splited_texts = {}\n local last_position\n\n for splited_text, position in text:gmatch(\"(.-)\"..delimiter..\"()\") do\n table.insert(splited_texts, splited_text)\n last_position = position\n end \n table.insert(splited_texts, string.sub(text, last_position))\n return splited_texts\nend\n\nlocal a = io.read()\nlocal list = split(a, \" \")\nlocal have_money = tonumber(list[1]) + tonumber(list[2])\nlocal price = tonumber(list[3])\n\nif (have_money-price) > 0 then\n print(\"yes\")\nelse\n print(\"no\")\nend", "language": "Lua", "metadata": {"date": 1521336189, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03407.html", "problem_id": "p03407", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03407/input.txt", "sample_output_relpath": "derived/input_output/data/p03407/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03407/Lua/s982395787.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s982395787", "user_id": "u751668935"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "function split(text, delimiter)\n if text.find(text, delimiter) == nil then\n return { text }\n end \n\n local splited_texts = {}\n local last_position\n\n for splited_text, position in text:gmatch(\"(.-)\"..delimiter..\"()\") do\n table.insert(splited_texts, splited_text)\n last_position = position\n end \n table.insert(splited_texts, string.sub(text, last_position))\n return splited_texts\nend\n\nlocal a = io.read()\nlocal list = split(a, \" \")\nlocal have_money = tonumber(list[1]) + tonumber(list[2])\nlocal price = tonumber(list[3])\n\nif (have_money-price) > 0 then\n print(\"yes\")\nelse\n print(\"no\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAn elementary school student Takahashi has come to a variety store.\n\nHe has two coins, A-yen and B-yen coins (yen is the currency of Japan), and wants to buy a toy that costs C yen. Can he buy it?\n\nNote that he lives in Takahashi Kingdom, and may have coins that do not exist in Japan.\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq A, B \\leq 500\n\n1 \\leq C \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf Takahashi can buy the toy, print Yes; if he cannot, print No.\n\nSample Input 1\n\n50 100 120\n\nSample Output 1\n\nYes\n\nHe has 50 + 100 = 150 yen, so he can buy the 120-yen toy.\n\nSample Input 2\n\n500 100 1000\n\nSample Output 2\n\nNo\n\nHe has 500 + 100 = 600 yen, but he cannot buy the 1000-yen toy.\n\nSample Input 3\n\n19 123 143\n\nSample Output 3\n\nNo\n\nThere are 19-yen and 123-yen coins in Takahashi Kingdom, which are rather hard to use.\n\nSample Input 4\n\n19 123 142\n\nSample Output 4\n\nYes", "sample_input": "50 100 120\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03407", "source_text": "Score : 100 points\n\nProblem Statement\n\nAn elementary school student Takahashi has come to a variety store.\n\nHe has two coins, A-yen and B-yen coins (yen is the currency of Japan), and wants to buy a toy that costs C yen. Can he buy it?\n\nNote that he lives in Takahashi Kingdom, and may have coins that do not exist in Japan.\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq A, B \\leq 500\n\n1 \\leq C \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf Takahashi can buy the toy, print Yes; if he cannot, print No.\n\nSample Input 1\n\n50 100 120\n\nSample Output 1\n\nYes\n\nHe has 50 + 100 = 150 yen, so he can buy the 120-yen toy.\n\nSample Input 2\n\n500 100 1000\n\nSample Output 2\n\nNo\n\nHe has 500 + 100 = 600 yen, but he cannot buy the 1000-yen toy.\n\nSample Input 3\n\n19 123 143\n\nSample Output 3\n\nNo\n\nThere are 19-yen and 123-yen coins in Takahashi Kingdom, which are rather hard to use.\n\nSample Input 4\n\n19 123 142\n\nSample Output 4\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 608, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s563846221", "group_id": "codeNet:p03415", "input_text": "a = io.read()\nb = io.read()\nc = io.read()\nio.write(a:sub(1, 1))\nio.write(b:sub(2, 2))\nio.write(c:sub(3, 3))\nio.write(\"\\n\")", "language": "Lua", "metadata": {"date": 1576421065, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03415.html", "problem_id": "p03415", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03415/input.txt", "sample_output_relpath": "derived/input_output/data/p03415/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03415/Lua/s563846221.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s563846221", "user_id": "u120582723"}, "prompt_components": {"gold_output": "abc\n", "input_to_evaluate": "a = io.read()\nb = io.read()\nc = io.read()\nio.write(a:sub(1, 1))\nio.write(b:sub(2, 2))\nio.write(c:sub(3, 3))\nio.write(\"\\n\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have a 3×3 square grid, where each square contains a lowercase English letters.\nThe letter in the square at the i-th row from the top and j-th column from the left is c_{ij}.\n\nPrint the string of length 3 that can be obtained by concatenating the letters in the squares on the diagonal connecting the top-left and bottom-right corner of the grid, from the top-left to bottom-right.\n\nConstraints\n\nInput consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nc_{11}c_{12}c_{13}\nc_{21}c_{22}c_{23}\nc_{31}c_{32}c_{33}\n\nOutput\n\nPrint the string of length 3 that can be obtained by concatenating the letters on the diagonal connecting the top-left and bottom-right corner of the grid, from the top-left to bottom-right.\n\nSample Input 1\n\nant\nobe\nrec\n\nSample Output 1\n\nabc\n\nThe letters in the squares on the diagonal connecting the top-left and bottom-right corner of the grid are a, b and c from top-right to bottom-left. Concatenate these letters and print abc.\n\nSample Input 2\n\nedu\ncat\nion\n\nSample Output 2\n\nean", "sample_input": "ant\nobe\nrec\n"}, "reference_outputs": ["abc\n"], "source_document_id": "p03415", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have a 3×3 square grid, where each square contains a lowercase English letters.\nThe letter in the square at the i-th row from the top and j-th column from the left is c_{ij}.\n\nPrint the string of length 3 that can be obtained by concatenating the letters in the squares on the diagonal connecting the top-left and bottom-right corner of the grid, from the top-left to bottom-right.\n\nConstraints\n\nInput consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nc_{11}c_{12}c_{13}\nc_{21}c_{22}c_{23}\nc_{31}c_{32}c_{33}\n\nOutput\n\nPrint the string of length 3 that can be obtained by concatenating the letters on the diagonal connecting the top-left and bottom-right corner of the grid, from the top-left to bottom-right.\n\nSample Input 1\n\nant\nobe\nrec\n\nSample Output 1\n\nabc\n\nThe letters in the squares on the diagonal connecting the top-left and bottom-right corner of the grid are a, b and c from top-right to bottom-left. Concatenate these letters and print abc.\n\nSample Input 2\n\nedu\ncat\nion\n\nSample Output 2\n\nean", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s966772616", "group_id": "codeNet:p03415", "input_text": "a={}\nfor i=1,9 do\n a[i]=io.read()\nend\nprint(a[2]..a[5]..a[8])\n ", "language": "Lua", "metadata": {"date": 1550946682, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03415.html", "problem_id": "p03415", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03415/input.txt", "sample_output_relpath": "derived/input_output/data/p03415/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03415/Lua/s966772616.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s966772616", "user_id": "u015229643"}, "prompt_components": {"gold_output": "abc\n", "input_to_evaluate": "a={}\nfor i=1,9 do\n a[i]=io.read()\nend\nprint(a[2]..a[5]..a[8])\n ", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have a 3×3 square grid, where each square contains a lowercase English letters.\nThe letter in the square at the i-th row from the top and j-th column from the left is c_{ij}.\n\nPrint the string of length 3 that can be obtained by concatenating the letters in the squares on the diagonal connecting the top-left and bottom-right corner of the grid, from the top-left to bottom-right.\n\nConstraints\n\nInput consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nc_{11}c_{12}c_{13}\nc_{21}c_{22}c_{23}\nc_{31}c_{32}c_{33}\n\nOutput\n\nPrint the string of length 3 that can be obtained by concatenating the letters on the diagonal connecting the top-left and bottom-right corner of the grid, from the top-left to bottom-right.\n\nSample Input 1\n\nant\nobe\nrec\n\nSample Output 1\n\nabc\n\nThe letters in the squares on the diagonal connecting the top-left and bottom-right corner of the grid are a, b and c from top-right to bottom-left. Concatenate these letters and print abc.\n\nSample Input 2\n\nedu\ncat\nion\n\nSample Output 2\n\nean", "sample_input": "ant\nobe\nrec\n"}, "reference_outputs": ["abc\n"], "source_document_id": "p03415", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have a 3×3 square grid, where each square contains a lowercase English letters.\nThe letter in the square at the i-th row from the top and j-th column from the left is c_{ij}.\n\nPrint the string of length 3 that can be obtained by concatenating the letters in the squares on the diagonal connecting the top-left and bottom-right corner of the grid, from the top-left to bottom-right.\n\nConstraints\n\nInput consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nc_{11}c_{12}c_{13}\nc_{21}c_{22}c_{23}\nc_{31}c_{32}c_{33}\n\nOutput\n\nPrint the string of length 3 that can be obtained by concatenating the letters on the diagonal connecting the top-left and bottom-right corner of the grid, from the top-left to bottom-right.\n\nSample Input 1\n\nant\nobe\nrec\n\nSample Output 1\n\nabc\n\nThe letters in the squares on the diagonal connecting the top-left and bottom-right corner of the grid are a, b and c from top-right to bottom-left. Concatenate these letters and print abc.\n\nSample Input 2\n\nedu\ncat\nion\n\nSample Output 2\n\nean", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 65, "cpu_time_ms": 10, "memory_kb": 1132}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s020017137", "group_id": "codeNet:p03416", "input_text": "local str1 = io.read()\nlocal str2 = io.read()\n\nlocal count = 0\nfor i = tonumber(str1), tonumber(str2) do\n if(tonumber(i) == tonumber(string.reverse(i))) then\n count = count + 1\n end\nend\nprint(count)", "language": "Lua", "metadata": {"date": 1520818014, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03416.html", "problem_id": "p03416", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03416/input.txt", "sample_output_relpath": "derived/input_output/data/p03416/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03416/Lua/s020017137.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s020017137", "user_id": "u751668935"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local str1 = io.read()\nlocal str2 = io.read()\n\nlocal count = 0\nfor i = tonumber(str1), tonumber(str2) do\n if(tonumber(i) == tonumber(string.reverse(i))) then\n count = count + 1\n end\nend\nprint(count)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the number of palindromic numbers among the integers between A and B (inclusive).\nHere, a palindromic number is a positive integer whose string representation in base 10 (without leading zeros) reads the same forward and backward.\n\nConstraints\n\n10000 \\leq A \\leq B \\leq 99999\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the number of palindromic numbers among the integers between A and B (inclusive).\n\nSample Input 1\n\n11009 11332\n\nSample Output 1\n\n4\n\nThere are four integers that satisfy the conditions: 11011, 11111, 11211 and 11311.\n\nSample Input 2\n\n31415 92653\n\nSample Output 2\n\n612", "sample_input": "11009 11332\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03416", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the number of palindromic numbers among the integers between A and B (inclusive).\nHere, a palindromic number is a positive integer whose string representation in base 10 (without leading zeros) reads the same forward and backward.\n\nConstraints\n\n10000 \\leq A \\leq B \\leq 99999\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the number of palindromic numbers among the integers between A and B (inclusive).\n\nSample Input 1\n\n11009 11332\n\nSample Output 1\n\n4\n\nThere are four integers that satisfy the conditions: 11011, 11111, 11211 and 11311.\n\nSample Input 2\n\n31415 92653\n\nSample Output 2\n\n612", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 211, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s904240210", "group_id": "codeNet:p03416", "input_text": "local str1 = io.read()\nlocal str2 = io.read()\n\nlocal len = (str2) - tonumber(str1)\nlocal count = 0\nfor i = tonumber(str1), tonumber(str2) do\n if(tonumber(i) == tonumber(string.reverse(i))) then\n count = count + 1\n end\nend\nprint(count)", "language": "Lua", "metadata": {"date": 1520817894, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03416.html", "problem_id": "p03416", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03416/input.txt", "sample_output_relpath": "derived/input_output/data/p03416/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03416/Lua/s904240210.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s904240210", "user_id": "u751668935"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local str1 = io.read()\nlocal str2 = io.read()\n\nlocal len = (str2) - tonumber(str1)\nlocal count = 0\nfor i = tonumber(str1), tonumber(str2) do\n if(tonumber(i) == tonumber(string.reverse(i))) then\n count = count + 1\n end\nend\nprint(count)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the number of palindromic numbers among the integers between A and B (inclusive).\nHere, a palindromic number is a positive integer whose string representation in base 10 (without leading zeros) reads the same forward and backward.\n\nConstraints\n\n10000 \\leq A \\leq B \\leq 99999\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the number of palindromic numbers among the integers between A and B (inclusive).\n\nSample Input 1\n\n11009 11332\n\nSample Output 1\n\n4\n\nThere are four integers that satisfy the conditions: 11011, 11111, 11211 and 11311.\n\nSample Input 2\n\n31415 92653\n\nSample Output 2\n\n612", "sample_input": "11009 11332\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03416", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the number of palindromic numbers among the integers between A and B (inclusive).\nHere, a palindromic number is a positive integer whose string representation in base 10 (without leading zeros) reads the same forward and backward.\n\nConstraints\n\n10000 \\leq A \\leq B \\leq 99999\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the number of palindromic numbers among the integers between A and B (inclusive).\n\nSample Input 1\n\n11009 11332\n\nSample Output 1\n\n4\n\nThere are four integers that satisfy the conditions: 11011, 11111, 11211 and 11311.\n\nSample Input 2\n\n31415 92653\n\nSample Output 2\n\n612", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 247, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s584985867", "group_id": "codeNet:p03417", "input_text": "local n, m = io.read(\"*n\", \"*n\")\nif n == 1 then\n if m == 1 then\n print(1)\n else\n print(m - 2)\n end\nelseif n == 2 then\n print(0)\nelse\n if m == 1 then\n print(n - 2)\n elseif m == 2 then\n print(0)\n else\n print((n - 2) * (m - 2))\n end\nend\n", "language": "Lua", "metadata": {"date": 1559521074, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03417.html", "problem_id": "p03417", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03417/input.txt", "sample_output_relpath": "derived/input_output/data/p03417/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03417/Lua/s584985867.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s584985867", "user_id": "u120582723"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "local n, m = io.read(\"*n\", \"*n\")\nif n == 1 then\n if m == 1 then\n print(1)\n else\n print(m - 2)\n end\nelseif n == 2 then\n print(0)\nelse\n if m == 1 then\n print(n - 2)\n elseif m == 2 then\n print(0)\n else\n print((n - 2) * (m - 2))\n end\nend\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with infinitely many rows and columns. In this grid, there is a rectangular region with consecutive N rows and M columns, and a card is placed in each square in this region.\nThe front and back sides of these cards can be distinguished, and initially every card faces up.\n\nWe will perform the following operation once for each square contains a card:\n\nFor each of the following nine squares, flip the card in it if it exists: the target square itself and the eight squares that shares a corner or a side with the target square.\n\nIt can be proved that, whether each card faces up or down after all the operations does not depend on the order the operations are performed.\nFind the number of cards that face down after all the operations.\n\nConstraints\n\n1 \\leq N,M \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of cards that face down after all the operations.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n0\n\nWe will flip every card in any of the four operations. Thus, after all the operations, all cards face up.\n\nSample Input 2\n\n1 7\n\nSample Output 2\n\n5\n\nAfter all the operations, all cards except at both ends face down.\n\nSample Input 3\n\n314 1592\n\nSample Output 3\n\n496080", "sample_input": "2 2\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03417", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with infinitely many rows and columns. In this grid, there is a rectangular region with consecutive N rows and M columns, and a card is placed in each square in this region.\nThe front and back sides of these cards can be distinguished, and initially every card faces up.\n\nWe will perform the following operation once for each square contains a card:\n\nFor each of the following nine squares, flip the card in it if it exists: the target square itself and the eight squares that shares a corner or a side with the target square.\n\nIt can be proved that, whether each card faces up or down after all the operations does not depend on the order the operations are performed.\nFind the number of cards that face down after all the operations.\n\nConstraints\n\n1 \\leq N,M \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of cards that face down after all the operations.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n0\n\nWe will flip every card in any of the four operations. Thus, after all the operations, all cards face up.\n\nSample Input 2\n\n1 7\n\nSample Output 2\n\n5\n\nAfter all the operations, all cards except at both ends face down.\n\nSample Input 3\n\n314 1592\n\nSample Output 3\n\n496080", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 257, "cpu_time_ms": 6, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s044164828", "group_id": "codeNet:p03417", "input_text": "N=io.read(\"n\")\nM=io.read(\"n\")\nlocal count=0\nif N==1 and M==1 then\n count=1\n elseif N==2 or M==2 then\n count=0\n elseif N>=3 and M>=3 then\n count=(N-2)*(M-2)\nend\nprint(count)\n\n", "language": "Lua", "metadata": {"date": 1550952598, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03417.html", "problem_id": "p03417", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03417/input.txt", "sample_output_relpath": "derived/input_output/data/p03417/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03417/Lua/s044164828.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s044164828", "user_id": "u015229643"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "N=io.read(\"n\")\nM=io.read(\"n\")\nlocal count=0\nif N==1 and M==1 then\n count=1\n elseif N==2 or M==2 then\n count=0\n elseif N>=3 and M>=3 then\n count=(N-2)*(M-2)\nend\nprint(count)\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with infinitely many rows and columns. In this grid, there is a rectangular region with consecutive N rows and M columns, and a card is placed in each square in this region.\nThe front and back sides of these cards can be distinguished, and initially every card faces up.\n\nWe will perform the following operation once for each square contains a card:\n\nFor each of the following nine squares, flip the card in it if it exists: the target square itself and the eight squares that shares a corner or a side with the target square.\n\nIt can be proved that, whether each card faces up or down after all the operations does not depend on the order the operations are performed.\nFind the number of cards that face down after all the operations.\n\nConstraints\n\n1 \\leq N,M \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of cards that face down after all the operations.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n0\n\nWe will flip every card in any of the four operations. Thus, after all the operations, all cards face up.\n\nSample Input 2\n\n1 7\n\nSample Output 2\n\n5\n\nAfter all the operations, all cards except at both ends face down.\n\nSample Input 3\n\n314 1592\n\nSample Output 3\n\n496080", "sample_input": "2 2\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03417", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with infinitely many rows and columns. In this grid, there is a rectangular region with consecutive N rows and M columns, and a card is placed in each square in this region.\nThe front and back sides of these cards can be distinguished, and initially every card faces up.\n\nWe will perform the following operation once for each square contains a card:\n\nFor each of the following nine squares, flip the card in it if it exists: the target square itself and the eight squares that shares a corner or a side with the target square.\n\nIt can be proved that, whether each card faces up or down after all the operations does not depend on the order the operations are performed.\nFind the number of cards that face down after all the operations.\n\nConstraints\n\n1 \\leq N,M \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of cards that face down after all the operations.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n0\n\nWe will flip every card in any of the four operations. Thus, after all the operations, all cards face up.\n\nSample Input 2\n\n1 7\n\nSample Output 2\n\n5\n\nAfter all the operations, all cards except at both ends face down.\n\nSample Input 3\n\n314 1592\n\nSample Output 3\n\n496080", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 10, "memory_kb": 1008}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s339003959", "group_id": "codeNet:p03418", "input_text": "N=io.read(\"n\")\nK=io.read(\"n\")\nlocal count=0\nfor i=K+1,N do\n for j=1,N do\n while(j%i<=K) do\n count=count+1\n end\n end\nend\nprint(count)", "language": "Lua", "metadata": {"date": 1550953574, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03418.html", "problem_id": "p03418", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03418/input.txt", "sample_output_relpath": "derived/input_output/data/p03418/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03418/Lua/s339003959.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s339003959", "user_id": "u015229643"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "N=io.read(\"n\")\nK=io.read(\"n\")\nlocal count=0\nfor i=K+1,N do\n for j=1,N do\n while(j%i<=K) do\n count=count+1\n end\n end\nend\nprint(count)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten.\nHe remembers that the remainder of a divided by b was greater than or equal to K.\nFind the number of possible pairs that he may have had.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq K \\leq N-1\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of possible pairs that he may have had.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n7\n\nThere are seven possible pairs: (2,3),(5,3),(2,4),(3,4),(2,5),(3,5) and (4,5).\n\nSample Input 2\n\n10 0\n\nSample Output 2\n\n100\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n287927211", "sample_input": "5 2\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03418", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten.\nHe remembers that the remainder of a divided by b was greater than or equal to K.\nFind the number of possible pairs that he may have had.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq K \\leq N-1\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of possible pairs that he may have had.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n7\n\nThere are seven possible pairs: (2,3),(5,3),(2,4),(3,4),(2,5),(3,5) and (4,5).\n\nSample Input 2\n\n10 0\n\nSample Output 2\n\n100\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n287927211", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s871201374", "group_id": "codeNet:p03420", "input_text": "local n, k = io.read(\"*n\", \"*n\")\nlocal cnt = 0\nlocal mm = math.max\nfor b = k + 1, n do\n cnt = cnt + (n // b) * (b - k)\n local rem = n % b\n if(0 < rem) then\n if(k == 0) then cnt = cnt + rem\n else cnt = cnt + mm(0, rem - k + 1)\n end\n end\nend\nprint(cnt)\n", "language": "Lua", "metadata": {"date": 1555990534, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03420.html", "problem_id": "p03420", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03420/input.txt", "sample_output_relpath": "derived/input_output/data/p03420/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03420/Lua/s871201374.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s871201374", "user_id": "u120582723"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "local n, k = io.read(\"*n\", \"*n\")\nlocal cnt = 0\nlocal mm = math.max\nfor b = k + 1, n do\n cnt = cnt + (n // b) * (b - k)\n local rem = n % b\n if(0 < rem) then\n if(k == 0) then cnt = cnt + rem\n else cnt = cnt + mm(0, rem - k + 1)\n end\n end\nend\nprint(cnt)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten.\nHe remembers that the remainder of a divided by b was greater than or equal to K.\nFind the number of possible pairs that he may have had.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq K \\leq N-1\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of possible pairs that he may have had.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n7\n\nThere are seven possible pairs: (2,3),(5,3),(2,4),(3,4),(2,5),(3,5) and (4,5).\n\nSample Input 2\n\n10 0\n\nSample Output 2\n\n100\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n287927211", "sample_input": "5 2\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03420", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten.\nHe remembers that the remainder of a divided by b was greater than or equal to K.\nFind the number of possible pairs that he may have had.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq K \\leq N-1\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of possible pairs that he may have had.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n7\n\nThere are seven possible pairs: (2,3),(5,3),(2,4),(3,4),(2,5),(3,5) and (4,5).\n\nSample Input 2\n\n10 0\n\nSample Output 2\n\n100\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n287927211", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 18, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s422496624", "group_id": "codeNet:p03423", "input_text": "print(math.floor(io.read()//3))", "language": "Lua", "metadata": {"date": 1551839304, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03423.html", "problem_id": "p03423", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03423/input.txt", "sample_output_relpath": "derived/input_output/data/p03423/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03423/Lua/s422496624.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s422496624", "user_id": "u837412668"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "print(math.floor(io.read()//3))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N students in a school.\n\nWe will divide these students into some groups, and in each group they will discuss some themes.\n\nYou think that groups consisting of two or less students cannot have an effective discussion, so you want to have as many groups consisting of three or more students as possible.\n\nDivide the students so that the number of groups consisting of three or more students is maximized.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf you can form at most x groups consisting of three or more students, print x.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n2\n\nFor example, you can form a group of three students and another of five students.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n0\n\nSometimes you cannot form any group consisting of three or more students, regardless of how you divide the students.\n\nSample Input 3\n\n9\n\nSample Output 3\n\n3", "sample_input": "8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03423", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N students in a school.\n\nWe will divide these students into some groups, and in each group they will discuss some themes.\n\nYou think that groups consisting of two or less students cannot have an effective discussion, so you want to have as many groups consisting of three or more students as possible.\n\nDivide the students so that the number of groups consisting of three or more students is maximized.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf you can form at most x groups consisting of three or more students, print x.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n2\n\nFor example, you can form a group of three students and another of five students.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n0\n\nSometimes you cannot form any group consisting of three or more students, regardless of how you divide the students.\n\nSample Input 3\n\n9\n\nSample Output 3\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 31, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s195131395", "group_id": "codeNet:p03424", "input_text": "local N=io.read(\"n\")\nlocal t={}\nfor i=1,N do\n local s=io.read()\n t[s]=t[s] or true\nend\nlocal count=0\nfor i in pairs(t) do\n count=count+1\nend\nif count==3 then\n print(\"Three\")\n elseif count==4 then\n print(\"Four\")\nend", "language": "Lua", "metadata": {"date": 1550961907, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03424.html", "problem_id": "p03424", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03424/input.txt", "sample_output_relpath": "derived/input_output/data/p03424/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03424/Lua/s195131395.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s195131395", "user_id": "u015229643"}, "prompt_components": {"gold_output": "Four\n", "input_to_evaluate": "local N=io.read(\"n\")\nlocal t={}\nfor i=1,N do\n local s=io.read()\n t[s]=t[s] or true\nend\nlocal count=0\nfor i in pairs(t) do\n count=count+1\nend\nif count==3 then\n print(\"Three\")\n elseif count==4 then\n print(\"Four\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn Japan, people make offerings called hina arare, colorful crackers, on March 3.\n\nWe have a bag that contains N hina arare. (From here, we call them arare.)\n\nIt is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.\n\nWe have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS_i is P, W, G or Y.\n\nThere always exist i, j and k such that S_i=P, S_j=W and S_k=G.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_N\n\nOutput\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nSample Input 1\n\n6\nG W Y P Y W\n\nSample Output 1\n\nFour\n\nThe bag contained arare in four colors, so you should print Four.\n\nSample Input 2\n\n9\nG W W G P W P G G\n\nSample Output 2\n\nThree\n\nThe bag contained arare in three colors, so you should print Three.\n\nSample Input 3\n\n8\nP Y W G Y W Y Y\n\nSample Output 3\n\nFour", "sample_input": "6\nG W Y P Y W\n"}, "reference_outputs": ["Four\n"], "source_document_id": "p03424", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn Japan, people make offerings called hina arare, colorful crackers, on March 3.\n\nWe have a bag that contains N hina arare. (From here, we call them arare.)\n\nIt is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.\n\nWe have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS_i is P, W, G or Y.\n\nThere always exist i, j and k such that S_i=P, S_j=W and S_k=G.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_N\n\nOutput\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nSample Input 1\n\n6\nG W Y P Y W\n\nSample Output 1\n\nFour\n\nThe bag contained arare in four colors, so you should print Four.\n\nSample Input 2\n\n9\nG W W G P W P G G\n\nSample Output 2\n\nThree\n\nThe bag contained arare in three colors, so you should print Three.\n\nSample Input 3\n\n8\nP Y W G Y W Y Y\n\nSample Output 3\n\nFour", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s583312913", "group_id": "codeNet:p03424", "input_text": "local N=io.read()\nlocal t={}\nfor i=1,N do\n local s=io.read()\n t[s]=t[s] or true\nend\nlocal count=0\nfor i in pairs(t) do\n count=count+1\nend\nif count==3 then\n print(\"Three\")\n elseif count==4 then\n print(\"Four\")\nend", "language": "Lua", "metadata": {"date": 1550961639, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03424.html", "problem_id": "p03424", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03424/input.txt", "sample_output_relpath": "derived/input_output/data/p03424/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03424/Lua/s583312913.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s583312913", "user_id": "u015229643"}, "prompt_components": {"gold_output": "Four\n", "input_to_evaluate": "local N=io.read()\nlocal t={}\nfor i=1,N do\n local s=io.read()\n t[s]=t[s] or true\nend\nlocal count=0\nfor i in pairs(t) do\n count=count+1\nend\nif count==3 then\n print(\"Three\")\n elseif count==4 then\n print(\"Four\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn Japan, people make offerings called hina arare, colorful crackers, on March 3.\n\nWe have a bag that contains N hina arare. (From here, we call them arare.)\n\nIt is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.\n\nWe have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS_i is P, W, G or Y.\n\nThere always exist i, j and k such that S_i=P, S_j=W and S_k=G.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_N\n\nOutput\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nSample Input 1\n\n6\nG W Y P Y W\n\nSample Output 1\n\nFour\n\nThe bag contained arare in four colors, so you should print Four.\n\nSample Input 2\n\n9\nG W W G P W P G G\n\nSample Output 2\n\nThree\n\nThe bag contained arare in three colors, so you should print Three.\n\nSample Input 3\n\n8\nP Y W G Y W Y Y\n\nSample Output 3\n\nFour", "sample_input": "6\nG W Y P Y W\n"}, "reference_outputs": ["Four\n"], "source_document_id": "p03424", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn Japan, people make offerings called hina arare, colorful crackers, on March 3.\n\nWe have a bag that contains N hina arare. (From here, we call them arare.)\n\nIt is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.\n\nWe have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS_i is P, W, G or Y.\n\nThere always exist i, j and k such that S_i=P, S_j=W and S_k=G.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_N\n\nOutput\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nSample Input 1\n\n6\nG W Y P Y W\n\nSample Output 1\n\nFour\n\nThe bag contained arare in four colors, so you should print Four.\n\nSample Input 2\n\n9\nG W W G P W P G G\n\nSample Output 2\n\nThree\n\nThe bag contained arare in three colors, so you should print Three.\n\nSample Input 3\n\n8\nP Y W G Y W Y Y\n\nSample Output 3\n\nFour", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 217, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s740697639", "group_id": "codeNet:p03424", "input_text": "local function split(text, delimiter)\n if text.find(text, delimiter) == nil then\n return { text }\n end\n\n local splited_texts = {}\n local last_position\n\n for splited_text, position in text:gmatch(\"(.-)\"..delimiter..\"()\") do\n table.insert(splited_texts, splited_text)\n last_position = position\n end\n table.insert(splited_texts, string.sub(text, last_position))\n return splited_texts\nend\n\nlocal total = io.read()\nlocal arares = io.read()\n\nlocal color = {}\ncolor[\"p\"] = 0\ncolor[\"w\"] = 0\ncolor[\"g\"] = 0\ncolor[\"y\"] = 0\n\nlocal arare_list = split(arares, \" \")\nfor k,v in pairs(arare_list) do\n if v == \"P\" then\n color[\"p\"] = color[\"p\"] + 1\n elseif v == \"W\" then\n color[\"w\"] = color[\"w\"] + 1\n elseif v == \"G\" then\n color[\"g\"] = color[\"g\"] + 1\n elseif v == \"Y\" then\n color[\"y\"] = color[\"y\"] + 1\n end\nend\n\nlocal number = 0\nif color[\"p\"] > 0 then\n number = number + 1\nend\nif color[\"w\"] > 0 then\n number = number + 1\nend\nif color[\"g\"] > 0 then\n number = number + 1\nend\nif color[\"y\"] > 0 then\n number = number + 1\nend\n\nif number == 3 then\n print(\"Three\")\nelseif number == 4 then\n print(\"Four\")\nend", "language": "Lua", "metadata": {"date": 1520217131, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03424.html", "problem_id": "p03424", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03424/input.txt", "sample_output_relpath": "derived/input_output/data/p03424/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03424/Lua/s740697639.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s740697639", "user_id": "u751668935"}, "prompt_components": {"gold_output": "Four\n", "input_to_evaluate": "local function split(text, delimiter)\n if text.find(text, delimiter) == nil then\n return { text }\n end\n\n local splited_texts = {}\n local last_position\n\n for splited_text, position in text:gmatch(\"(.-)\"..delimiter..\"()\") do\n table.insert(splited_texts, splited_text)\n last_position = position\n end\n table.insert(splited_texts, string.sub(text, last_position))\n return splited_texts\nend\n\nlocal total = io.read()\nlocal arares = io.read()\n\nlocal color = {}\ncolor[\"p\"] = 0\ncolor[\"w\"] = 0\ncolor[\"g\"] = 0\ncolor[\"y\"] = 0\n\nlocal arare_list = split(arares, \" \")\nfor k,v in pairs(arare_list) do\n if v == \"P\" then\n color[\"p\"] = color[\"p\"] + 1\n elseif v == \"W\" then\n color[\"w\"] = color[\"w\"] + 1\n elseif v == \"G\" then\n color[\"g\"] = color[\"g\"] + 1\n elseif v == \"Y\" then\n color[\"y\"] = color[\"y\"] + 1\n end\nend\n\nlocal number = 0\nif color[\"p\"] > 0 then\n number = number + 1\nend\nif color[\"w\"] > 0 then\n number = number + 1\nend\nif color[\"g\"] > 0 then\n number = number + 1\nend\nif color[\"y\"] > 0 then\n number = number + 1\nend\n\nif number == 3 then\n print(\"Three\")\nelseif number == 4 then\n print(\"Four\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn Japan, people make offerings called hina arare, colorful crackers, on March 3.\n\nWe have a bag that contains N hina arare. (From here, we call them arare.)\n\nIt is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.\n\nWe have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS_i is P, W, G or Y.\n\nThere always exist i, j and k such that S_i=P, S_j=W and S_k=G.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_N\n\nOutput\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nSample Input 1\n\n6\nG W Y P Y W\n\nSample Output 1\n\nFour\n\nThe bag contained arare in four colors, so you should print Four.\n\nSample Input 2\n\n9\nG W W G P W P G G\n\nSample Output 2\n\nThree\n\nThe bag contained arare in three colors, so you should print Three.\n\nSample Input 3\n\n8\nP Y W G Y W Y Y\n\nSample Output 3\n\nFour", "sample_input": "6\nG W Y P Y W\n"}, "reference_outputs": ["Four\n"], "source_document_id": "p03424", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn Japan, people make offerings called hina arare, colorful crackers, on March 3.\n\nWe have a bag that contains N hina arare. (From here, we call them arare.)\n\nIt is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.\n\nWe have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS_i is P, W, G or Y.\n\nThere always exist i, j and k such that S_i=P, S_j=W and S_k=G.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_N\n\nOutput\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nSample Input 1\n\n6\nG W Y P Y W\n\nSample Output 1\n\nFour\n\nThe bag contained arare in four colors, so you should print Four.\n\nSample Input 2\n\n9\nG W W G P W P G G\n\nSample Output 2\n\nThree\n\nThe bag contained arare in three colors, so you should print Three.\n\nSample Input 3\n\n8\nP Y W G Y W Y Y\n\nSample Output 3\n\nFour", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1129, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s252683265", "group_id": "codeNet:p03425", "input_text": "n=io.read(\"*n\",\"*l\")\ns={}\nfor i=1,n do\n initial=io.read():sub(1,1)\n if initial==\"M\" or initial==\"A\" or initial==\"R\" or initial==\"C\" or initial==\"H\" then\n if not s[initial] then\n s[initial]=1\n else\n s[initial]=s[initial]+1\n end\n end\nend\n\ncombination=0\nfor i,_ in pairs(s) do\n for j,_ in pairs(s) do\n for k,_ in pairs(s) do\n if i y end)\nfor i = 1, n do\n if i % 2 == 1 then\n alice_sum = alice_sum + a[i]\n else\n bob_sum = bob_sum + a[i]\n end\nend\n\nprint(alice_sum - bob_sum)", "language": "Lua", "metadata": {"date": 1586525120, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s151202014.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s151202014", "user_id": "u793881115"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\nend\n\nlocal alice_sum, bob_sum = 0, 0\ntable.sort(a, function(x, y) return x > y end)\nfor i = 1, n do\n if i % 2 == 1 then\n alice_sum = alice_sum + a[i]\n else\n bob_sum = bob_sum + a[i]\n end\nend\n\nprint(alice_sum - bob_sum)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 323, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s349254079", "group_id": "codeNet:p03434", "input_text": "local n = io.read(\"*n\")\na = {}\nlocal sum = 0\nfor i = 1, n do\n local k = io.read(\"*n\")\n a[i] = k\n sum = sum + k\nend\ntable.sort(a, function(x, y) return x > y end)\nlocal alice = 0\nfor i = 1, n, 2 do\n alice = alice + a[i]\nend\nprint(alice * 2 - sum)", "language": "Lua", "metadata": {"date": 1555383342, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s349254079.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s349254079", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n = io.read(\"*n\")\na = {}\nlocal sum = 0\nfor i = 1, n do\n local k = io.read(\"*n\")\n a[i] = k\n sum = sum + k\nend\ntable.sort(a, function(x, y) return x > y end)\nlocal alice = 0\nfor i = 1, n, 2 do\n alice = alice + a[i]\nend\nprint(alice * 2 - sum)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 257, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s688478117", "group_id": "codeNet:p03434", "input_text": "local n = io.read(\"*n\")\nio.read(\"*l\")\nlocal arr\ndo\n local _accum_0 = { }\n local _len_0 = 1\n for e in io.read(\"*l\"):gmatch(\"%d+\") do\n _accum_0[_len_0] = tonumber(e)\n _len_0 = _len_0 + 1\n end\n arr = _accum_0\nend\ntable.sort(arr, function(a, b)\n return a > b\nend)\nlocal r = 0\nlocal t = 1\nfor _index_0 = 1, #arr do\n local e = arr[_index_0]\n r = r + (t * e)\n t = -t\nend\nreturn print(r)", "language": "Lua", "metadata": {"date": 1529109465, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s688478117.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s688478117", "user_id": "u280667879"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n = io.read(\"*n\")\nio.read(\"*l\")\nlocal arr\ndo\n local _accum_0 = { }\n local _len_0 = 1\n for e in io.read(\"*l\"):gmatch(\"%d+\") do\n _accum_0[_len_0] = tonumber(e)\n _len_0 = _len_0 + 1\n end\n arr = _accum_0\nend\ntable.sort(arr, function(a, b)\n return a > b\nend)\nlocal r = 0\nlocal t = 1\nfor _index_0 = 1, #arr do\n local e = arr[_index_0]\n r = r + (t * e)\n t = -t\nend\nreturn print(r)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 394, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s858235675", "group_id": "codeNet:p03436", "input_text": "--https://www.lua.org/pil/11.4.html\nlocal List = {}\nfunction List.new ()\n return {first = 0, last = -1}\nend\n\nfunction List.pushleft (list, value)\n local first = list.first - 1\n list.first = first\n list[first] = value\nend\n\nfunction List.pushright (list, value)\n local last = list.last + 1\n list.last = last\n list[last] = value\nend\n\nfunction List.popleft (list)\n local first = list.first\n if first > list.last then return false end\n local value = list[first]\n list[first] = nil\n list.first = first + 1\n return value\nend\n\nfunction List.popright (list)\n local last = list.last\n if list.first > last then return false end\n local value = list[last]\n list[last] = nil\n list.last = last - 1\n return value\nend\n\n----------\n\nlocal h,w=io.read(\"n\",\"n\",\"l\")\nlocal maze={}\nlocal shounter=0\nfor i=1,h do\n local s=io.read()\n maze[i]={}\n for j=1,w do\n local sub=s:sub(j,j)\n if sub==\"#\" then\n shounter=shounter+1\n end\n maze[i][j]=sub\n end\nend\n\nlocal dx={1,0,-1,0}\nlocal dy={0,1,0,-1}\n\nlocal function bfs(x,y)\n local dist={}\n for i=1,h do\n dist[i]={}\n for j=1,w do\n dist[i][j]=-1\n end\n end\n local que=List.new()\n \n List.pushright(que,{x,y})\n dist[x][y]=1\n\n while x~=h and y~=w do\n local q=List.popleft(que)\n if not q then break end\n local x,y=q[1],q[2]\n for i=1,4 do\n local nx,ny=x+dx[i],y+dy[i]\n local checker=(nx<1 or nx>h or ny<1 or ny>w)\n if not checker and maze[nx][ny]~=\"#\" and dist[nx][ny]==-1 then\n dist[nx][ny]=dist[x][y]+1\n List.pushright(que,{nx,ny})\n end\n end\n end\n \n return dist[h][w]\nend\n\nlocal mindist=bfs(1,1)\nif mindist>-1 then\n print(h*w-(mindist+shounter))\nelse\n print(mindist)\nend", "language": "Lua", "metadata": {"date": 1593371757, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03436.html", "problem_id": "p03436", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03436/input.txt", "sample_output_relpath": "derived/input_output/data/p03436/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03436/Lua/s858235675.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s858235675", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "--https://www.lua.org/pil/11.4.html\nlocal List = {}\nfunction List.new ()\n return {first = 0, last = -1}\nend\n\nfunction List.pushleft (list, value)\n local first = list.first - 1\n list.first = first\n list[first] = value\nend\n\nfunction List.pushright (list, value)\n local last = list.last + 1\n list.last = last\n list[last] = value\nend\n\nfunction List.popleft (list)\n local first = list.first\n if first > list.last then return false end\n local value = list[first]\n list[first] = nil\n list.first = first + 1\n return value\nend\n\nfunction List.popright (list)\n local last = list.last\n if list.first > last then return false end\n local value = list[last]\n list[last] = nil\n list.last = last - 1\n return value\nend\n\n----------\n\nlocal h,w=io.read(\"n\",\"n\",\"l\")\nlocal maze={}\nlocal shounter=0\nfor i=1,h do\n local s=io.read()\n maze[i]={}\n for j=1,w do\n local sub=s:sub(j,j)\n if sub==\"#\" then\n shounter=shounter+1\n end\n maze[i][j]=sub\n end\nend\n\nlocal dx={1,0,-1,0}\nlocal dy={0,1,0,-1}\n\nlocal function bfs(x,y)\n local dist={}\n for i=1,h do\n dist[i]={}\n for j=1,w do\n dist[i][j]=-1\n end\n end\n local que=List.new()\n \n List.pushright(que,{x,y})\n dist[x][y]=1\n\n while x~=h and y~=w do\n local q=List.popleft(que)\n if not q then break end\n local x,y=q[1],q[2]\n for i=1,4 do\n local nx,ny=x+dx[i],y+dy[i]\n local checker=(nx<1 or nx>h or ny<1 or ny>w)\n if not checker and maze[nx][ny]~=\"#\" and dist[nx][ny]==-1 then\n dist[nx][ny]=dist[x][y]+1\n List.pushright(que,{nx,ny})\n end\n end\n end\n \n return dist[h][w]\nend\n\nlocal mindist=bfs(1,1)\nif mindist>-1 then\n print(h*w-(mindist+shounter))\nelse\n print(mindist)\nend", "problem_context": "Score: 400 points\n\nProblem statement\n\nWe have an H \\times W grid whose squares are painted black or white. The square at the i-th row from the top and the j-th column from the left is denoted as (i, j).\n\nSnuke would like to play the following game on this grid. At the beginning of the game, there is a character called Kenus at square (1, 1). The player repeatedly moves Kenus up, down, left or right by one square. The game is completed when Kenus reaches square (H, W) passing only white squares.\n\nBefore Snuke starts the game, he can change the color of some of the white squares to black. However, he cannot change the color of square (1, 1) and (H, W). Also, changes of color must all be carried out before the beginning of the game.\n\nWhen the game is completed, Snuke's score will be the number of times he changed the color of a square before the beginning of the game. Find the maximum possible score that Snuke can achieve, or print -1 if the game cannot be completed, that is, Kenus can never reach square (H, W) regardless of how Snuke changes the color of the squares.\n\nThe color of the squares are given to you as characters s_{i, j}. If square (i, j) is initially painted by white, s_{i, j} is .; if square (i, j) is initially painted by black, s_{i, j} is #.\n\nConstraints\n\nH is an integer between 2 and 50 (inclusive).\n\nW is an integer between 2 and 50 (inclusive).\n\ns_{i, j} is . or # (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\ns_{1, 1} and s_{H, W} are ..\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\nPrint the maximum possible score that Snuke can achieve, or print -1 if the game cannot be completed.\n\nSample Input 1\n\n3 3\n..#\n#..\n...\n\nSample Output 1\n\n2\n\nThe score 2 can be achieved by changing the color of squares as follows:\n\nSample Input 2\n\n10 37\n.....................................\n...#...####...####..###...###...###..\n..#.#..#...#.##....#...#.#...#.#...#.\n..#.#..#...#.#.....#...#.#...#.#...#.\n.#...#.#..##.#.....#...#.#.###.#.###.\n.#####.####..#.....#...#..##....##...\n.#...#.#...#.#.....#...#.#...#.#...#.\n.#...#.#...#.##....#...#.#...#.#...#.\n.#...#.####...####..###...###...###..\n.....................................\n\nSample Output 2\n\n209", "sample_input": "3 3\n..#\n#..\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03436", "source_text": "Score: 400 points\n\nProblem statement\n\nWe have an H \\times W grid whose squares are painted black or white. The square at the i-th row from the top and the j-th column from the left is denoted as (i, j).\n\nSnuke would like to play the following game on this grid. At the beginning of the game, there is a character called Kenus at square (1, 1). The player repeatedly moves Kenus up, down, left or right by one square. The game is completed when Kenus reaches square (H, W) passing only white squares.\n\nBefore Snuke starts the game, he can change the color of some of the white squares to black. However, he cannot change the color of square (1, 1) and (H, W). Also, changes of color must all be carried out before the beginning of the game.\n\nWhen the game is completed, Snuke's score will be the number of times he changed the color of a square before the beginning of the game. Find the maximum possible score that Snuke can achieve, or print -1 if the game cannot be completed, that is, Kenus can never reach square (H, W) regardless of how Snuke changes the color of the squares.\n\nThe color of the squares are given to you as characters s_{i, j}. If square (i, j) is initially painted by white, s_{i, j} is .; if square (i, j) is initially painted by black, s_{i, j} is #.\n\nConstraints\n\nH is an integer between 2 and 50 (inclusive).\n\nW is an integer between 2 and 50 (inclusive).\n\ns_{i, j} is . or # (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\ns_{1, 1} and s_{H, W} are ..\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\nPrint the maximum possible score that Snuke can achieve, or print -1 if the game cannot be completed.\n\nSample Input 1\n\n3 3\n..#\n#..\n...\n\nSample Output 1\n\n2\n\nThe score 2 can be achieved by changing the color of squares as follows:\n\nSample Input 2\n\n10 37\n.....................................\n...#...####...####..###...###...###..\n..#.#..#...#.##....#...#.#...#.#...#.\n..#.#..#...#.#.....#...#.#...#.#...#.\n.#...#.#..##.#.....#...#.#.###.#.###.\n.#####.####..#.....#...#..##....##...\n.#...#.#...#.#.....#...#.#...#.#...#.\n.#...#.#...#.##....#...#.#...#.#...#.\n.#...#.####...####..###...###...###..\n.....................................\n\nSample Output 2\n\n209", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1831, "cpu_time_ms": 12, "memory_kb": 2884}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s064626267", "group_id": "codeNet:p03436", "input_text": "local H = io.read(\"*n\")\nlocal W = io.read(\"*n\")\nio.read(\"*l\")\n\nlocal map = {}\nlocal whiteCount = 0\nfor h = 1, H do\n\tlocal str = io.read('*l')\n\tprint(str)\n\tmap[h] = {}\n\tfor w = 1, W do\n\t\tif string.sub(str, w, w) == '.' then\n\t\t\twhiteCount = whiteCount + 1\n\t\t\tmap[h][w] = 0\n\t\telse\n\t\t\tmap[h][w] = -1\n\t\tend\n\tend\nend\n\nmap[1][1] = 1\nlocal stack = {}\ntable.insert(stack, {1, 1})\nlocal function unvisit(h, w)\n\tif not map[h] then\n\t\treturn false\n\tend\n\treturn map[h][w] == 0\nend\nwhile(true) do\n\tif not stack[1] then\n\t\tprint(-1)\n\t\tbreak\n\tend\n\tlocal t = stack[1]\n\tlocal h, w, steps = t[1], t[2], map[t[1]][t[2]]\n\tlocal neightbors = {\n\t\t{h - 1, w},\n\t\t{h, w - 1},\n\t\t{h + 1, w},\n\t\t{h, w + 1}\n\t}\n\tfor k, v in ipairs(neightbors) do\n\t\tif v[1] == H and v[2] == W then\n\t\t\tprint(whiteCount - (steps + 1))\n\t\t\tfinded = true\n\t\t\tbreak\n\t\tend\n\t\tif unvisit(v[1], v[2]) then\n\t\t\tmap[v[1]][v[2]] = steps + 1\n\t\t\ttable.insert(stack, {v[1], v[2]})\n\t\tend\n\tend\n\tif finded then\n\t\tbreak\n\tend\n\ttable.remove(stack, 1)\nend", "language": "Lua", "metadata": {"date": 1553902157, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03436.html", "problem_id": "p03436", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03436/input.txt", "sample_output_relpath": "derived/input_output/data/p03436/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03436/Lua/s064626267.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s064626267", "user_id": "u863370423"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local H = io.read(\"*n\")\nlocal W = io.read(\"*n\")\nio.read(\"*l\")\n\nlocal map = {}\nlocal whiteCount = 0\nfor h = 1, H do\n\tlocal str = io.read('*l')\n\tprint(str)\n\tmap[h] = {}\n\tfor w = 1, W do\n\t\tif string.sub(str, w, w) == '.' then\n\t\t\twhiteCount = whiteCount + 1\n\t\t\tmap[h][w] = 0\n\t\telse\n\t\t\tmap[h][w] = -1\n\t\tend\n\tend\nend\n\nmap[1][1] = 1\nlocal stack = {}\ntable.insert(stack, {1, 1})\nlocal function unvisit(h, w)\n\tif not map[h] then\n\t\treturn false\n\tend\n\treturn map[h][w] == 0\nend\nwhile(true) do\n\tif not stack[1] then\n\t\tprint(-1)\n\t\tbreak\n\tend\n\tlocal t = stack[1]\n\tlocal h, w, steps = t[1], t[2], map[t[1]][t[2]]\n\tlocal neightbors = {\n\t\t{h - 1, w},\n\t\t{h, w - 1},\n\t\t{h + 1, w},\n\t\t{h, w + 1}\n\t}\n\tfor k, v in ipairs(neightbors) do\n\t\tif v[1] == H and v[2] == W then\n\t\t\tprint(whiteCount - (steps + 1))\n\t\t\tfinded = true\n\t\t\tbreak\n\t\tend\n\t\tif unvisit(v[1], v[2]) then\n\t\t\tmap[v[1]][v[2]] = steps + 1\n\t\t\ttable.insert(stack, {v[1], v[2]})\n\t\tend\n\tend\n\tif finded then\n\t\tbreak\n\tend\n\ttable.remove(stack, 1)\nend", "problem_context": "Score: 400 points\n\nProblem statement\n\nWe have an H \\times W grid whose squares are painted black or white. The square at the i-th row from the top and the j-th column from the left is denoted as (i, j).\n\nSnuke would like to play the following game on this grid. At the beginning of the game, there is a character called Kenus at square (1, 1). The player repeatedly moves Kenus up, down, left or right by one square. The game is completed when Kenus reaches square (H, W) passing only white squares.\n\nBefore Snuke starts the game, he can change the color of some of the white squares to black. However, he cannot change the color of square (1, 1) and (H, W). Also, changes of color must all be carried out before the beginning of the game.\n\nWhen the game is completed, Snuke's score will be the number of times he changed the color of a square before the beginning of the game. Find the maximum possible score that Snuke can achieve, or print -1 if the game cannot be completed, that is, Kenus can never reach square (H, W) regardless of how Snuke changes the color of the squares.\n\nThe color of the squares are given to you as characters s_{i, j}. If square (i, j) is initially painted by white, s_{i, j} is .; if square (i, j) is initially painted by black, s_{i, j} is #.\n\nConstraints\n\nH is an integer between 2 and 50 (inclusive).\n\nW is an integer between 2 and 50 (inclusive).\n\ns_{i, j} is . or # (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\ns_{1, 1} and s_{H, W} are ..\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\nPrint the maximum possible score that Snuke can achieve, or print -1 if the game cannot be completed.\n\nSample Input 1\n\n3 3\n..#\n#..\n...\n\nSample Output 1\n\n2\n\nThe score 2 can be achieved by changing the color of squares as follows:\n\nSample Input 2\n\n10 37\n.....................................\n...#...####...####..###...###...###..\n..#.#..#...#.##....#...#.#...#.#...#.\n..#.#..#...#.#.....#...#.#...#.#...#.\n.#...#.#..##.#.....#...#.#.###.#.###.\n.#####.####..#.....#...#..##....##...\n.#...#.#...#.#.....#...#.#...#.#...#.\n.#...#.#...#.##....#...#.#...#.#...#.\n.#...#.####...####..###...###...###..\n.....................................\n\nSample Output 2\n\n209", "sample_input": "3 3\n..#\n#..\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03436", "source_text": "Score: 400 points\n\nProblem statement\n\nWe have an H \\times W grid whose squares are painted black or white. The square at the i-th row from the top and the j-th column from the left is denoted as (i, j).\n\nSnuke would like to play the following game on this grid. At the beginning of the game, there is a character called Kenus at square (1, 1). The player repeatedly moves Kenus up, down, left or right by one square. The game is completed when Kenus reaches square (H, W) passing only white squares.\n\nBefore Snuke starts the game, he can change the color of some of the white squares to black. However, he cannot change the color of square (1, 1) and (H, W). Also, changes of color must all be carried out before the beginning of the game.\n\nWhen the game is completed, Snuke's score will be the number of times he changed the color of a square before the beginning of the game. Find the maximum possible score that Snuke can achieve, or print -1 if the game cannot be completed, that is, Kenus can never reach square (H, W) regardless of how Snuke changes the color of the squares.\n\nThe color of the squares are given to you as characters s_{i, j}. If square (i, j) is initially painted by white, s_{i, j} is .; if square (i, j) is initially painted by black, s_{i, j} is #.\n\nConstraints\n\nH is an integer between 2 and 50 (inclusive).\n\nW is an integer between 2 and 50 (inclusive).\n\ns_{i, j} is . or # (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\ns_{1, 1} and s_{H, W} are ..\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\nPrint the maximum possible score that Snuke can achieve, or print -1 if the game cannot be completed.\n\nSample Input 1\n\n3 3\n..#\n#..\n...\n\nSample Output 1\n\n2\n\nThe score 2 can be achieved by changing the color of squares as follows:\n\nSample Input 2\n\n10 37\n.....................................\n...#...####...####..###...###...###..\n..#.#..#...#.##....#...#.#...#.#...#.\n..#.#..#...#.#.....#...#.#...#.#...#.\n.#...#.#..##.#.....#...#.#.###.#.###.\n.#####.####..#.....#...#..##....##...\n.#...#.#...#.#.....#...#.#...#.#...#.\n.#...#.#...#.##....#...#.#...#.#...#.\n.#...#.####...####..###...###...###..\n.....................................\n\nSample Output 2\n\n209", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 979, "cpu_time_ms": 10, "memory_kb": 504}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s465476307", "group_id": "codeNet:p03437", "input_text": "a, b = io.read(\"*n\", \"*n\")\nprint(a % b == 0 and -1 or a)", "language": "Lua", "metadata": {"date": 1572608023, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s465476307.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s465476307", "user_id": "u120582723"}, "prompt_components": {"gold_output": "16\n", "input_to_evaluate": "a, b = io.read(\"*n\", \"*n\")\nprint(a % b == 0 and -1 or a)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 56, "cpu_time_ms": 10, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s364391327", "group_id": "codeNet:p03438", "input_text": "n=io.read(\"*n\",\"*l\")\na={}\nb={}\nfor i=1,n do\n a[i]=io.read(\"*n\")\nend\nfor i=1,n do\n b[i]=io.read(\"*n\")\nend\n\ncounter=0\nfor i=1,n do\n if a[i] cur[1] - per[1] then\n\t\tstata = \"No\"\n\t\tbreak\n\telseif math.abs((v - (cur[1] - per[1]))) % 2 == 1 then\n\t\tstata = \"No\"\n\t\tbreak\n\tend\nend\n\nprint(stata)", "language": "Lua", "metadata": {"date": 1553567391, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s816467553.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s816467553", "user_id": "u089230684"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local line = io.read(\"*n\")\n\nlocal tab = {{0, 0, 0}}\nlocal len = 1\n\nfor i=1,line do\n\tlocal a = io.read(\"*n\")\n\tlocal b = io.read(\"*n\")\n\tlocal c = io.read(\"*n\")\n\ttable.insert(tab, {a, b, c})\n\tlen = len + 1\nend\n\nlocal stata = \"Yes\"\nfor i=2,len do\n\tlocal cur = tab[i]\n\tlocal per = tab[i - 1]\n\n\tlocal v = math.abs(cur[2] - per[2]) + math.abs(cur[3] - per[3])\n\n\tif v > cur[1] - per[1] then\n\t\tstata = \"No\"\n\t\tbreak\n\telseif math.abs((v - (cur[1] - per[1]))) % 2 == 1 then\n\t\tstata = \"No\"\n\t\tbreak\n\tend\nend\n\nprint(stata)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 507, "cpu_time_ms": 162, "memory_kb": 14840}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s972833805", "group_id": "codeNet:p03459", "input_text": "local times = io.read(\"*l\")\nlocal paths = {}\nfor i = 1,times do\n\tlocal tmp = {}\n\tfor j = 1,3 do\n\t\ttmp[j] = io.read(\"*n\")\n\tend\n\tpaths[i] = tmp\nend\nlocal pos = {0,0,0}\nfor k,v in ipairs(paths) do\n\tlocal step = v[1] - pos[1]\n\tlocal x = v[2]\n\tlocal y = v[3]\n\tlocal dis = math.abs(x - pos[1]) + math.abs(y - pos[2])\n\tif dis < step or (dis-step)%2 == 1 then\n\t\tprint(\"No\")\n\t\treturn\n\tend\n\tpos = v\nend\nprint(\"Yes\")", "language": "Lua", "metadata": {"date": 1553562842, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s972833805.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s972833805", "user_id": "u018679195"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local times = io.read(\"*l\")\nlocal paths = {}\nfor i = 1,times do\n\tlocal tmp = {}\n\tfor j = 1,3 do\n\t\ttmp[j] = io.read(\"*n\")\n\tend\n\tpaths[i] = tmp\nend\nlocal pos = {0,0,0}\nfor k,v in ipairs(paths) do\n\tlocal step = v[1] - pos[1]\n\tlocal x = v[2]\n\tlocal y = v[3]\n\tlocal dis = math.abs(x - pos[1]) + math.abs(y - pos[2])\n\tif dis < step or (dis-step)%2 == 1 then\n\t\tprint(\"No\")\n\t\treturn\n\tend\n\tpos = v\nend\nprint(\"Yes\")", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 125, "memory_kb": 16376}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s096075091", "group_id": "codeNet:p03459", "input_text": "\nlocal a = io.read(\"*number\")\n\nlocal function getABC()\n\tlocal tb = {false, false}\n\tfor i=1, a do\n\t\tlocal s = io.read(\"*number\")\n\t\tlocal x = io.read(\"*number\")\n\t\tlocal y = io.read(\"*number\")\n\t\tfor j=1, s do\n\t\t\tr = x + y + 2*j\n\t\t\tif s == r then\n\t\t\t\ttb[i] = true\n\t\t\t\tbreak\n\t\t\tend\n\t\tend\n\tend\n\treturn tb\nend\n\nlocal r = getABC()\nif r[1] and r[2] then\n\tprint(\"YES\")\nelse\n\tprint(\"NO\")\nend\n", "language": "Lua", "metadata": {"date": 1553560951, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s096075091.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s096075091", "user_id": "u353919145"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "\nlocal a = io.read(\"*number\")\n\nlocal function getABC()\n\tlocal tb = {false, false}\n\tfor i=1, a do\n\t\tlocal s = io.read(\"*number\")\n\t\tlocal x = io.read(\"*number\")\n\t\tlocal y = io.read(\"*number\")\n\t\tfor j=1, s do\n\t\t\tr = x + y + 2*j\n\t\t\tif s == r then\n\t\t\t\ttb[i] = true\n\t\t\t\tbreak\n\t\t\tend\n\t\tend\n\tend\n\treturn tb\nend\n\nlocal r = getABC()\nif r[1] and r[2] then\n\tprint(\"YES\")\nelse\n\tprint(\"NO\")\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 381, "cpu_time_ms": 2103, "memory_kb": 632}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s352400171", "group_id": "codeNet:p03459", "input_text": "local a = io.read(\"*number\")\n\nlocal function getABC()\n\tlocal result\n\tfor i=1, a do\n\t\tlocal s = io.read(\"*number\")\n\t\tlocal x = io.read(\"*number\")\n\t\tlocal y = io.read(\"*number\")\n\t\tfor j=1, s do\n\t\t\tr = x + y + 2*j\n\t\t\tif s == r then\n\t\t\t\tresult = \"YES\"\n\t\t\t\treturn result\n\t\t\tend\n\t\tend\n\tend\n\n\treturn \"NO\"\nend\n\nlocal r = getABC()\nprint(r)\n", "language": "Lua", "metadata": {"date": 1553560615, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s352400171.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s352400171", "user_id": "u863370423"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local a = io.read(\"*number\")\n\nlocal function getABC()\n\tlocal result\n\tfor i=1, a do\n\t\tlocal s = io.read(\"*number\")\n\t\tlocal x = io.read(\"*number\")\n\t\tlocal y = io.read(\"*number\")\n\t\tfor j=1, s do\n\t\t\tr = x + y + 2*j\n\t\t\tif s == r then\n\t\t\t\tresult = \"YES\"\n\t\t\t\treturn result\n\t\t\tend\n\t\tend\n\tend\n\n\treturn \"NO\"\nend\n\nlocal r = getABC()\nprint(r)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s391976915", "group_id": "codeNet:p03469", "input_text": "s = io.read()\ns = string.gsub(s, \"2017\", \"2018\")\nprint(s)", "language": "Lua", "metadata": {"date": 1555248531, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s391976915.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s391976915", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2018/01/07\n", "input_to_evaluate": "s = io.read()\ns = string.gsub(s, \"2017\", \"2018\")\nprint(s)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s293599811", "group_id": "codeNet:p03470", "input_text": "N=io.read(\"n\")\na={}\nfor i=1,N do\n a[i]=io.read(\"n\")\nend\ntable.sort(a,function (a,b) return a>b end)\nlocal count=1\nfor i=2,N do\n if a[i]b end)\nlocal count=1\nfor i=2,N do\n if a[i]b end)\na=table.concat(S)\nb=table.concat(T)\nif ab end)\na=table.concat(S)\nb=table.concat(T)\nif a #tb then\n return false\n end\n\n if math.abs(a) > #tb or math.abs(b) > #tb then\n return false\n end\n\n if tb[idx] == 'F' then\n return digui(a+dirTb[curDir][1],b+dirTb[curDir][2],idx+1,curDir)\n else\n return digui(a,b,idx+1,turnTb[curDir][1]) or digui(a,b,idx+1,turnTb[curDir][2]) \n end\n\nend\n\nlocal f = digui(0,0,1,1) or digui(0,0,1,2) or digui(0,0,1,3) or digui(0,0,1,4)\nprint(f and \"yes\" or \"no\")", "language": "Lua", "metadata": {"date": 1594165503, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s395677891.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s395677891", "user_id": "u018679195"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local str = io.read(\"*l\")\nlocal finalA,finalB = io.read(\"*n\",\"*n\")\nio.read()\n\n\nlocal tb = {}\nfor i = 1, string.len(str) do\n table.insert(tb,string.sub(str,i,i))\nend\n\nlocal dirTb = {\n {0,1},\n {0,-1},\n {-1,0},\n {1,0}\n}\n\nlocal turnTb = {\n {3,4},\n {3,4},\n {1,2},\n {1,2}\n}\nlocal function digui( a,b,idx,curDir )\n if a == finalA and b == finalB and idx == #tb + 1 then\n return true\n end\n\n if idx > #tb then\n return false\n end\n\n if math.abs(a) > #tb or math.abs(b) > #tb then\n return false\n end\n\n if tb[idx] == 'F' then\n return digui(a+dirTb[curDir][1],b+dirTb[curDir][2],idx+1,curDir)\n else\n return digui(a,b,idx+1,turnTb[curDir][1]) or digui(a,b,idx+1,turnTb[curDir][2]) \n end\n\nend\n\nlocal f = digui(0,0,1,1) or digui(0,0,1,2) or digui(0,0,1,3) or digui(0,0,1,4)\nprint(f and \"yes\" or \"no\")", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 872, "cpu_time_ms": 2205, "memory_kb": 3908}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s905971056", "group_id": "codeNet:p03490", "input_text": "local str = io.read(\"*l\")\nlocal finalA = io.read(\"*n\")\nlocal finalB = io.read(\"*n\")\n\n\nlocal tb = {}\nfor i = 1, string.len(str) do\n table.insert(tb,string.sub(str,i,i))\nend\n\nlocal dirTb = {\n {0,1},\n {0,-1},\n {-1,0},\n {1,0}\n}\n\nlocal turnTb = {\n {3,4},\n {3,4},\n {1,2},\n {1,2}\n}\nlocal function digui( a,b,idx,curDir )\n print(a..\" \"..b)\n if a == finalA and b == finalB and idx == #tb + 1 then\n return true\n end\n\n if idx > #tb then\n return false\n end\n\n if math.abs(a) > #tb or math.abs(b) > #tb then\n return false\n end\n\n if tb[idx] == 'F' then\n return digui(a+dirTb[curDir][1],b+dirTb[curDir][2],idx+1,curDir)\n else\n return digui(a,b,idx+1,turnTb[curDir][1]) or digui(a,b,idx+1,turnTb[curDir][2]) \n end\n\nend\n\nlocal f = digui(0,0,1,1) or digui(0,0,1,2) or digui(0,0,1,3) or digui(0,0,1,4)\nprint(f and \"yes\" or \"no\")", "language": "Lua", "metadata": {"date": 1594165318, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s905971056.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s905971056", "user_id": "u018679195"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local str = io.read(\"*l\")\nlocal finalA = io.read(\"*n\")\nlocal finalB = io.read(\"*n\")\n\n\nlocal tb = {}\nfor i = 1, string.len(str) do\n table.insert(tb,string.sub(str,i,i))\nend\n\nlocal dirTb = {\n {0,1},\n {0,-1},\n {-1,0},\n {1,0}\n}\n\nlocal turnTb = {\n {3,4},\n {3,4},\n {1,2},\n {1,2}\n}\nlocal function digui( a,b,idx,curDir )\n print(a..\" \"..b)\n if a == finalA and b == finalB and idx == #tb + 1 then\n return true\n end\n\n if idx > #tb then\n return false\n end\n\n if math.abs(a) > #tb or math.abs(b) > #tb then\n return false\n end\n\n if tb[idx] == 'F' then\n return digui(a+dirTb[curDir][1],b+dirTb[curDir][2],idx+1,curDir)\n else\n return digui(a,b,idx+1,turnTb[curDir][1]) or digui(a,b,idx+1,turnTb[curDir][2]) \n end\n\nend\n\nlocal f = digui(0,0,1,1) or digui(0,0,1,2) or digui(0,0,1,3) or digui(0,0,1,4)\nprint(f and \"yes\" or \"no\")", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2233, "memory_kb": 13304}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s564723513", "group_id": "codeNet:p03495", "input_text": "local read = io.read\nlocal N, K = read(\"n\", \"n\")\n\nlocal number_of_types = {}\nlocal have_types_s = {}\nfor i = 1, N do\n\tlocal readed = read(\"n\")\n\tif have_types_s[readed] then\n\t\tlocal index = have_types_s[readed]\n\t\tnumber_of_types[index] = number_of_types[index] + 1\n\telse\n\t\tlocal new_index = #number_of_types + 1\n\t\thave_types_s[readed] = new_index\n\t\tnumber_of_types[new_index] = 1\n\tend\nend\n\ntable.sort(number_of_types)\n\nlocal out = 0\nfor i = 1, #number_of_types - K do\n\tout = out + number_of_types[i]\nend\n\nprint(out)\n", "language": "Lua", "metadata": {"date": 1596335073, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s564723513.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s564723513", "user_id": "u793881115"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local read = io.read\nlocal N, K = read(\"n\", \"n\")\n\nlocal number_of_types = {}\nlocal have_types_s = {}\nfor i = 1, N do\n\tlocal readed = read(\"n\")\n\tif have_types_s[readed] then\n\t\tlocal index = have_types_s[readed]\n\t\tnumber_of_types[index] = number_of_types[index] + 1\n\telse\n\t\tlocal new_index = #number_of_types + 1\n\t\thave_types_s[readed] = new_index\n\t\tnumber_of_types[new_index] = 1\n\tend\nend\n\ntable.sort(number_of_types)\n\nlocal out = 0\nfor i = 1, #number_of_types - K do\n\tout = out + number_of_types[i]\nend\n\nprint(out)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi has N balls. Initially, an integer A_i is written on the i-th ball.\n\nHe would like to rewrite the integer on some balls so that there are at most K different integers written on the N balls.\n\nFind the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 200000\n\n1 \\leq A_i \\leq N\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nSample Input 1\n\n5 2\n1 1 2 2 5\n\nSample Output 1\n\n1\n\nFor example, if we rewrite the integer on the fifth ball to 2, there are two different integers written on the balls: 1 and 2.\nOn the other hand, it is not possible to rewrite the integers on zero balls so that there are at most two different integers written on the balls, so we should print 1.\n\nSample Input 2\n\n4 4\n1 1 2 2\n\nSample Output 2\n\n0\n\nAlready in the beginning, there are two different integers written on the balls, so we do not need to rewrite anything.\n\nSample Input 3\n\n10 3\n5 1 3 2 4 1 1 2 3 4\n\nSample Output 3\n\n3", "sample_input": "5 2\n1 1 2 2 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03495", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi has N balls. Initially, an integer A_i is written on the i-th ball.\n\nHe would like to rewrite the integer on some balls so that there are at most K different integers written on the N balls.\n\nFind the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 200000\n\n1 \\leq A_i \\leq N\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nSample Input 1\n\n5 2\n1 1 2 2 5\n\nSample Output 1\n\n1\n\nFor example, if we rewrite the integer on the fifth ball to 2, there are two different integers written on the balls: 1 and 2.\nOn the other hand, it is not possible to rewrite the integers on zero balls so that there are at most two different integers written on the balls, so we should print 1.\n\nSample Input 2\n\n4 4\n1 1 2 2\n\nSample Output 2\n\n0\n\nAlready in the beginning, there are two different integers written on the balls, so we do not need to rewrite anything.\n\nSample Input 3\n\n10 3\n5 1 3 2 4 1 1 2 3 4\n\nSample Output 3\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 515, "cpu_time_ms": 169, "memory_kb": 15556}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s753535220", "group_id": "codeNet:p03495", "input_text": "local n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n local a = io.read(\"*n\")\n if t[a] then t[a] = t[a] + 1 else t[a] = 1 end\nend\nlocal tm = {}\nfor k, v in pairs(t) do\n table.insert(tm, v)\nend\ntable.sort(tm, function(x, y) return x > y end)\nif #tm <= k then print(0)\nelse\n local c = 0\n for i = k + 1, #tm do\n c = c + tm[i]\n end\n print(c)\nend\n", "language": "Lua", "metadata": {"date": 1581891166, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s753535220.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s753535220", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n local a = io.read(\"*n\")\n if t[a] then t[a] = t[a] + 1 else t[a] = 1 end\nend\nlocal tm = {}\nfor k, v in pairs(t) do\n table.insert(tm, v)\nend\ntable.sort(tm, function(x, y) return x > y end)\nif #tm <= k then print(0)\nelse\n local c = 0\n for i = k + 1, #tm do\n c = c + tm[i]\n end\n print(c)\nend\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi has N balls. Initially, an integer A_i is written on the i-th ball.\n\nHe would like to rewrite the integer on some balls so that there are at most K different integers written on the N balls.\n\nFind the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 200000\n\n1 \\leq A_i \\leq N\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nSample Input 1\n\n5 2\n1 1 2 2 5\n\nSample Output 1\n\n1\n\nFor example, if we rewrite the integer on the fifth ball to 2, there are two different integers written on the balls: 1 and 2.\nOn the other hand, it is not possible to rewrite the integers on zero balls so that there are at most two different integers written on the balls, so we should print 1.\n\nSample Input 2\n\n4 4\n1 1 2 2\n\nSample Output 2\n\n0\n\nAlready in the beginning, there are two different integers written on the balls, so we do not need to rewrite anything.\n\nSample Input 3\n\n10 3\n5 1 3 2 4 1 1 2 3 4\n\nSample Output 3\n\n3", "sample_input": "5 2\n1 1 2 2 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03495", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi has N balls. Initially, an integer A_i is written on the i-th ball.\n\nHe would like to rewrite the integer on some balls so that there are at most K different integers written on the N balls.\n\nFind the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 200000\n\n1 \\leq A_i \\leq N\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nSample Input 1\n\n5 2\n1 1 2 2 5\n\nSample Output 1\n\n1\n\nFor example, if we rewrite the integer on the fifth ball to 2, there are two different integers written on the balls: 1 and 2.\nOn the other hand, it is not possible to rewrite the integers on zero balls so that there are at most two different integers written on the balls, so we should print 1.\n\nSample Input 2\n\n4 4\n1 1 2 2\n\nSample Output 2\n\n0\n\nAlready in the beginning, there are two different integers written on the balls, so we do not need to rewrite anything.\n\nSample Input 3\n\n10 3\n5 1 3 2 4 1 1 2 3 4\n\nSample Output 3\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 361, "cpu_time_ms": 370, "memory_kb": 10080}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s308031082", "group_id": "codeNet:p03495", "input_text": "n, k = io.read(\"*n\", \"*n\")\nt = {}\nfor i = 1, n do\n a = io.read(\"*n\")\n if(t[a] == nil) then t[a] = 1 else t[a] = t[a] + 1 end\nend\ntall = {}\nfor k, v in pairs(t) do\n table.insert(tall, v)\nend\ntable.sort(tall)\ntot = 0\nremcount = #tall - k\nfor i = 1, remcount do\n tot = tot + tall[i]\nend\nprint(tot)", "language": "Lua", "metadata": {"date": 1554696181, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s308031082.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s308031082", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "n, k = io.read(\"*n\", \"*n\")\nt = {}\nfor i = 1, n do\n a = io.read(\"*n\")\n if(t[a] == nil) then t[a] = 1 else t[a] = t[a] + 1 end\nend\ntall = {}\nfor k, v in pairs(t) do\n table.insert(tall, v)\nend\ntable.sort(tall)\ntot = 0\nremcount = #tall - k\nfor i = 1, remcount do\n tot = tot + tall[i]\nend\nprint(tot)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 306, "cpu_time_ms": 174, "memory_kb": 4524}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s830739588", "group_id": "codeNet:p03495", "input_text": "N=io.read(\"n\")\nK=io.read(\"n\")\nA={}\nt={}\nfor i=1,N do \n A[i]=io.read(\"n\")\n t[A[i]]=(t[A[i]] or 0)+1\nend\nlocal count=0\nnumber={}\nfor i,v in pairs(t) do\n count=count+1\n number[count]=v\nend\ntable.sort(number)\nlocal res=0\nfor i=1,number-K do\n res=res+number[i]\nend\nprint(res)\n", "language": "Lua", "metadata": {"date": 1551236388, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s830739588.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s830739588", "user_id": "u015229643"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "N=io.read(\"n\")\nK=io.read(\"n\")\nA={}\nt={}\nfor i=1,N do \n A[i]=io.read(\"n\")\n t[A[i]]=(t[A[i]] or 0)+1\nend\nlocal count=0\nnumber={}\nfor i,v in pairs(t) do\n count=count+1\n number[count]=v\nend\ntable.sort(number)\nlocal res=0\nfor i=1,number-K do\n res=res+number[i]\nend\nprint(res)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi has N balls. Initially, an integer A_i is written on the i-th ball.\n\nHe would like to rewrite the integer on some balls so that there are at most K different integers written on the N balls.\n\nFind the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 200000\n\n1 \\leq A_i \\leq N\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nSample Input 1\n\n5 2\n1 1 2 2 5\n\nSample Output 1\n\n1\n\nFor example, if we rewrite the integer on the fifth ball to 2, there are two different integers written on the balls: 1 and 2.\nOn the other hand, it is not possible to rewrite the integers on zero balls so that there are at most two different integers written on the balls, so we should print 1.\n\nSample Input 2\n\n4 4\n1 1 2 2\n\nSample Output 2\n\n0\n\nAlready in the beginning, there are two different integers written on the balls, so we do not need to rewrite anything.\n\nSample Input 3\n\n10 3\n5 1 3 2 4 1 1 2 3 4\n\nSample Output 3\n\n3", "sample_input": "5 2\n1 1 2 2 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03495", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi has N balls. Initially, an integer A_i is written on the i-th ball.\n\nHe would like to rewrite the integer on some balls so that there are at most K different integers written on the N balls.\n\nFind the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 200000\n\n1 \\leq A_i \\leq N\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nSample Input 1\n\n5 2\n1 1 2 2 5\n\nSample Output 1\n\n1\n\nFor example, if we rewrite the integer on the fifth ball to 2, there are two different integers written on the balls: 1 and 2.\nOn the other hand, it is not possible to rewrite the integers on zero balls so that there are at most two different integers written on the balls, so we should print 1.\n\nSample Input 2\n\n4 4\n1 1 2 2\n\nSample Output 2\n\n0\n\nAlready in the beginning, there are two different integers written on the balls, so we do not need to rewrite anything.\n\nSample Input 3\n\n10 3\n5 1 3 2 4 1 1 2 3 4\n\nSample Output 3\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 240, "memory_kb": 12768}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s092256197", "group_id": "codeNet:p03501", "input_text": "a, b = io.read(\"*n\", \"*n\")\nc = io.read(\"*n\")\nprint(math.min(a * b, c))", "language": "Lua", "metadata": {"date": 1567078552, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s092256197.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s092256197", "user_id": "u120582723"}, "prompt_components": {"gold_output": "119\n", "input_to_evaluate": "a, b = io.read(\"*n\", \"*n\")\nc = io.read(\"*n\")\nprint(math.min(a * b, c))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 70, "cpu_time_ms": 14, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s676730402", "group_id": "codeNet:p03501", "input_text": "T=io.read(\"n\")\nA=io.read(\"n\")\nB=io.read(\"n\")\nif T*A<=B then\n print(T*A)\n else\n print(B)\nend", "language": "Lua", "metadata": {"date": 1551289211, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s676730402.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s676730402", "user_id": "u015229643"}, "prompt_components": {"gold_output": "119\n", "input_to_evaluate": "T=io.read(\"n\")\nA=io.read(\"n\")\nB=io.read(\"n\")\nif T*A<=B then\n print(T*A)\n else\n print(B)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s691718960", "group_id": "codeNet:p03502", "input_text": "local flo = math.floor\n\nlocal function div_flo(divided, dividing)\n\treturn flo(divided / dividing)\nend\n\nlocal N = io.read(\"*n\")\n\nlocal sum = 0\nlocal num = N\nwhile true do\n\tif num <= 0 then\n\t\tbreak\n\tend\n\tlocal drow = div_flo(num, 10) * 10\n\tsum = sum + num - drow\n\n\tnum = div_flo(num, 10)\nend\n\nprint((N % sum == 0) and \"Yes\" or \"No\")", "language": "Lua", "metadata": {"date": 1589342416, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s691718960.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s691718960", "user_id": "u793881115"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local flo = math.floor\n\nlocal function div_flo(divided, dividing)\n\treturn flo(divided / dividing)\nend\n\nlocal N = io.read(\"*n\")\n\nlocal sum = 0\nlocal num = N\nwhile true do\n\tif num <= 0 then\n\t\tbreak\n\tend\n\tlocal drow = div_flo(num, 10) * 10\n\tsum = sum + num - drow\n\n\tnum = div_flo(num, 10)\nend\n\nprint((N % sum == 0) and \"Yes\" or \"No\")", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 330, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s295546032", "group_id": "codeNet:p03502", "input_text": "local n = io.read(\"*n\")\nlocal s = 0\nlocal t = n\nwhile 0 < t do\n s = s + t % 10\n t = math.floor(t / 10)\nend\nprint(n % s == 0 and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1567047570, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s295546032.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s295546032", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal s = 0\nlocal t = n\nwhile 0 < t do\n s = s + t % 10\n t = math.floor(t / 10)\nend\nprint(n % s == 0 and \"Yes\" or \"No\")\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAn integer X is called a Harshad number if X is divisible by f(X), where f(X) is the sum of the digits in X when written in base 10.\n\nGiven an integer N, determine whether it is a Harshad number.\n\nConstraints\n\n1?N?10^8\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint Yes if N is a Harshad number; print No otherwise.\n\nSample Input 1\n\n12\n\nSample Output 1\n\nYes\n\nf(12)=1+2=3. Since 12 is divisible by 3, 12 is a Harshad number.\n\nSample Input 2\n\n57\n\nSample Output 2\n\nNo\n\nf(57)=5+7=12. Since 57 is not divisible by 12, 12 is not a Harshad number.\n\nSample Input 3\n\n148\n\nSample Output 3\n\nNo", "sample_input": "12\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03502", "source_text": "Score : 200 points\n\nProblem Statement\n\nAn integer X is called a Harshad number if X is divisible by f(X), where f(X) is the sum of the digits in X when written in base 10.\n\nGiven an integer N, determine whether it is a Harshad number.\n\nConstraints\n\n1?N?10^8\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint Yes if N is a Harshad number; print No otherwise.\n\nSample Input 1\n\n12\n\nSample Output 1\n\nYes\n\nf(12)=1+2=3. Since 12 is divisible by 3, 12 is a Harshad number.\n\nSample Input 2\n\n57\n\nSample Output 2\n\nNo\n\nf(57)=5+7=12. Since 57 is not divisible by 12, 12 is not a Harshad number.\n\nSample Input 3\n\n148\n\nSample Output 3\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s594430987", "group_id": "codeNet:p03508", "input_text": "local n, m = io.read(\"*n\", \"*n\")\nlocal parent = {}\nfor i = 1, n do\n parent[i] = i\nend\n\nlocal function uf_findroot(idx)\n local idx_update = idx\n while parent[idx] ~= idx do\n idx = parent[idx]\n end\n while parent[idx_update] ~= idx do\n parent[idx_update], idx_update = idx, parent[idx_update]\n end\n return idx\nend\n\nfor i = 1, m do\n local a, b = io.read(\"*n\", \"*n\")\n local ra, rb = uf_findroot(a), uf_findroot(b)\n parent[rb], parent[b] = ra, ra\nend\nlocal groups = {}\nlocal g1 = uf_findroot(1)\nlocal g2 = uf_findroot(2)\ngroups[g1] = 1\ngroups[g2] = 1\nfor i = 3, n do\n local g = uf_findroot(i)\n if not groups[g] then groups[g] = 1\n else groups[g] = groups[g] + 1\n end\nend\nlocal c1, c2 = groups[g1], groups[g2]\nlocal rem = 0\nfor k, v in pairs(groups) do\n if k ~= g1 and k ~= g2 then\n rem = rem + v\n end\nend\nif c1 < c2 then\n c2 = c2 + rem\nelse\n c1 = c1 + rem\nend\nprint(math.floor(c1 * (c1 - 1) / 2) + math.floor(c2 * (c2 - 1) / 2) - m)\n", "language": "Lua", "metadata": {"date": 1575750618, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03508.html", "problem_id": "p03508", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03508/input.txt", "sample_output_relpath": "derived/input_output/data/p03508/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03508/Lua/s594430987.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s594430987", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n, m = io.read(\"*n\", \"*n\")\nlocal parent = {}\nfor i = 1, n do\n parent[i] = i\nend\n\nlocal function uf_findroot(idx)\n local idx_update = idx\n while parent[idx] ~= idx do\n idx = parent[idx]\n end\n while parent[idx_update] ~= idx do\n parent[idx_update], idx_update = idx, parent[idx_update]\n end\n return idx\nend\n\nfor i = 1, m do\n local a, b = io.read(\"*n\", \"*n\")\n local ra, rb = uf_findroot(a), uf_findroot(b)\n parent[rb], parent[b] = ra, ra\nend\nlocal groups = {}\nlocal g1 = uf_findroot(1)\nlocal g2 = uf_findroot(2)\ngroups[g1] = 1\ngroups[g2] = 1\nfor i = 3, n do\n local g = uf_findroot(i)\n if not groups[g] then groups[g] = 1\n else groups[g] = groups[g] + 1\n end\nend\nlocal c1, c2 = groups[g1], groups[g2]\nlocal rem = 0\nfor k, v in pairs(groups) do\n if k ~= g1 and k ~= g2 then\n rem = rem + v\n end\nend\nif c1 < c2 then\n c2 = c2 + rem\nelse\n c1 = c1 + rem\nend\nprint(math.floor(c1 * (c1 - 1) / 2) + math.floor(c2 * (c2 - 1) / 2) - m)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given an undirected graph G. G has N vertices and M edges. The vertices are numbered from 1 through N, and the i-th edge (1 ≤ i ≤ M) connects Vertex a_i and b_i. G does not have self-loops and multiple edges.\n\nYou can repeatedly perform the operation of adding an edge between two vertices. However, G must not have self-loops or multiple edges as the result. Also, if Vertex 1 and 2 are connected directly or indirectly by edges, your body will be exposed to a voltage of 1000000007 volts. This must also be avoided.\n\nUnder these conditions, at most how many edges can you add? Note that Vertex 1 and 2 are never connected directly or indirectly in the beginning.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n0 ≤ M ≤ 10^5\n\n1 ≤ a_i < b_i ≤ N\n\nAll pairs (a_i, b_i) are distinct.\n\nVertex 1 and 2 in G are not connected directly or indirectly by edges.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_M b_M\n\nOutput\n\nPrint the maximum number of edges that can be added.\n\nSample Input 1\n\n4 1\n1 3\n\nSample Output 1\n\n2\n\nAs shown above, two edges can be added. It is not possible to add three or more edges.\n\nSample Input 2\n\n2 0\n\nSample Output 2\n\n0\n\nNo edge can be added.\n\nSample Input 3\n\n9 6\n1 4\n1 8\n2 5\n3 6\n4 8\n5 7\n\nSample Output 3\n\n12", "sample_input": "4 1\n1 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03508", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given an undirected graph G. G has N vertices and M edges. The vertices are numbered from 1 through N, and the i-th edge (1 ≤ i ≤ M) connects Vertex a_i and b_i. G does not have self-loops and multiple edges.\n\nYou can repeatedly perform the operation of adding an edge between two vertices. However, G must not have self-loops or multiple edges as the result. Also, if Vertex 1 and 2 are connected directly or indirectly by edges, your body will be exposed to a voltage of 1000000007 volts. This must also be avoided.\n\nUnder these conditions, at most how many edges can you add? Note that Vertex 1 and 2 are never connected directly or indirectly in the beginning.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n0 ≤ M ≤ 10^5\n\n1 ≤ a_i < b_i ≤ N\n\nAll pairs (a_i, b_i) are distinct.\n\nVertex 1 and 2 in G are not connected directly or indirectly by edges.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_M b_M\n\nOutput\n\nPrint the maximum number of edges that can be added.\n\nSample Input 1\n\n4 1\n1 3\n\nSample Output 1\n\n2\n\nAs shown above, two edges can be added. It is not possible to add three or more edges.\n\nSample Input 2\n\n2 0\n\nSample Output 2\n\n0\n\nNo edge can be added.\n\nSample Input 3\n\n9 6\n1 4\n1 8\n2 5\n3 6\n4 8\n5 7\n\nSample Output 3\n\n12", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 954, "cpu_time_ms": 71, "memory_kb": 2748}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s665228207", "group_id": "codeNet:p03523", "input_text": "function s1(c)\n if c == \"A\" then\n return s2\n elseif c == \"K\" then\n return s3\n else\n return nil\n end\nend\nfunction s2(c)\n if c == \"K\" then\n return s3\n else\n return nil\n end\nend\nfunction s3(c)\n if c == \"I\" then\n return s4\n else\n return nil\n end\nend\nfunction s4(c)\n if c == \"H\" then\n return s5\n else\n return nil\n end\nend\nfunction s5(c)\n if c == \"A\" then\n return s6\n elseif c == \"B\" then\n return s7\n else\n return nil\n end\nend\nfunction s6(c)\n if c == \"B\" then\n return s7\n else\n return nil\n end\nend\nfunction s7(c)\n if c == \"A\" then\n return s8\n elseif c == \"R\" then\n return s9\n else\n return nil\n end\nend\nfunction s8(c)\n if c == \"R\" then\n return s9\n else\n return nil\n end\nend\nfunction s9(c)\n if c == \"A\" then\n return s10\n elseif c == \"\\n\" then\n print(\"YES\")\n os.exit(0)\n else\n return nil\n end\nend\nfunction s10(c)\n if c == \"\\n\" then\n print(\"YES\")\n os.exit(0)\n else\n return nil\n end\nend\n\nlocal s = s1\nwhile true do\n local c = io.read(1)\n s = s(c)\n if not s then\n print(\"NO\")\n break\n end\nend", "language": "Lua", "metadata": {"date": 1572149995, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03523.html", "problem_id": "p03523", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03523/input.txt", "sample_output_relpath": "derived/input_output/data/p03523/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03523/Lua/s665228207.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s665228207", "user_id": "u162773977"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "function s1(c)\n if c == \"A\" then\n return s2\n elseif c == \"K\" then\n return s3\n else\n return nil\n end\nend\nfunction s2(c)\n if c == \"K\" then\n return s3\n else\n return nil\n end\nend\nfunction s3(c)\n if c == \"I\" then\n return s4\n else\n return nil\n end\nend\nfunction s4(c)\n if c == \"H\" then\n return s5\n else\n return nil\n end\nend\nfunction s5(c)\n if c == \"A\" then\n return s6\n elseif c == \"B\" then\n return s7\n else\n return nil\n end\nend\nfunction s6(c)\n if c == \"B\" then\n return s7\n else\n return nil\n end\nend\nfunction s7(c)\n if c == \"A\" then\n return s8\n elseif c == \"R\" then\n return s9\n else\n return nil\n end\nend\nfunction s8(c)\n if c == \"R\" then\n return s9\n else\n return nil\n end\nend\nfunction s9(c)\n if c == \"A\" then\n return s10\n elseif c == \"\\n\" then\n print(\"YES\")\n os.exit(0)\n else\n return nil\n end\nend\nfunction s10(c)\n if c == \"\\n\" then\n print(\"YES\")\n os.exit(0)\n else\n return nil\n end\nend\n\nlocal s = s1\nwhile true do\n local c = io.read(1)\n s = s(c)\n if not s then\n print(\"NO\")\n break\n end\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S.\n\nTakahashi can insert the character A at any position in this string any number of times.\n\nCan he change S into AKIHABARA?\n\nConstraints\n\n1 \\leq |S| \\leq 50\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to change S into AKIHABARA, print YES; otherwise, print NO.\n\nSample Input 1\n\nKIHBR\n\nSample Output 1\n\nYES\n\nInsert one A at each of the four positions: the beginning, immediately after H, immediately after B and the end.\n\nSample Input 2\n\nAKIBAHARA\n\nSample Output 2\n\nNO\n\nThe correct spell is AKIHABARA.\n\nSample Input 3\n\nAAKIAHBAARA\n\nSample Output 3\n\nNO", "sample_input": "KIHBR\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03523", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S.\n\nTakahashi can insert the character A at any position in this string any number of times.\n\nCan he change S into AKIHABARA?\n\nConstraints\n\n1 \\leq |S| \\leq 50\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to change S into AKIHABARA, print YES; otherwise, print NO.\n\nSample Input 1\n\nKIHBR\n\nSample Output 1\n\nYES\n\nInsert one A at each of the four positions: the beginning, immediately after H, immediately after B and the end.\n\nSample Input 2\n\nAKIBAHARA\n\nSample Output 2\n\nNO\n\nThe correct spell is AKIHABARA.\n\nSample Input 3\n\nAAKIAHBAARA\n\nSample Output 3\n\nNO", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1101, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s367945430", "group_id": "codeNet:p03523", "input_text": "local s = io.read()\nlocal n = #s\nlocal pos = 1\nlocal f = false\n\npos = s:find(\"KIH\", pos)\nif pos == 1 or (pos == 2 and s:sub(1, 1) == \"A\") then\n pos = pos + 3\n local bpos = s:find(\"B\", pos)\n if bpos and bpos < n then\n if bpos == pos or (bpos == pos + 1 and s:sub(pos, pos) == \"A\") then\n local rpos = s:find(\"R\", bpos)\n if rpos then\n if rpos == bpos + 1 or (rpos == bpos + 2 and s:sub(bpos + 1, bpos + 1) == \"A\") then\n if rpos == n or (rpos == n - 1 and s:sub(n, n) == \"A\") then\n f = true\n end\n end\n end\n end\n end\nend\n\nprint(f and \"YES\" or \"NO\")\n", "language": "Lua", "metadata": {"date": 1563729385, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03523.html", "problem_id": "p03523", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03523/input.txt", "sample_output_relpath": "derived/input_output/data/p03523/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03523/Lua/s367945430.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s367945430", "user_id": "u120582723"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "local s = io.read()\nlocal n = #s\nlocal pos = 1\nlocal f = false\n\npos = s:find(\"KIH\", pos)\nif pos == 1 or (pos == 2 and s:sub(1, 1) == \"A\") then\n pos = pos + 3\n local bpos = s:find(\"B\", pos)\n if bpos and bpos < n then\n if bpos == pos or (bpos == pos + 1 and s:sub(pos, pos) == \"A\") then\n local rpos = s:find(\"R\", bpos)\n if rpos then\n if rpos == bpos + 1 or (rpos == bpos + 2 and s:sub(bpos + 1, bpos + 1) == \"A\") then\n if rpos == n or (rpos == n - 1 and s:sub(n, n) == \"A\") then\n f = true\n end\n end\n end\n end\n end\nend\n\nprint(f and \"YES\" or \"NO\")\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S.\n\nTakahashi can insert the character A at any position in this string any number of times.\n\nCan he change S into AKIHABARA?\n\nConstraints\n\n1 \\leq |S| \\leq 50\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to change S into AKIHABARA, print YES; otherwise, print NO.\n\nSample Input 1\n\nKIHBR\n\nSample Output 1\n\nYES\n\nInsert one A at each of the four positions: the beginning, immediately after H, immediately after B and the end.\n\nSample Input 2\n\nAKIBAHARA\n\nSample Output 2\n\nNO\n\nThe correct spell is AKIHABARA.\n\nSample Input 3\n\nAAKIAHBAARA\n\nSample Output 3\n\nNO", "sample_input": "KIHBR\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03523", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S.\n\nTakahashi can insert the character A at any position in this string any number of times.\n\nCan he change S into AKIHABARA?\n\nConstraints\n\n1 \\leq |S| \\leq 50\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to change S into AKIHABARA, print YES; otherwise, print NO.\n\nSample Input 1\n\nKIHBR\n\nSample Output 1\n\nYES\n\nInsert one A at each of the four positions: the beginning, immediately after H, immediately after B and the end.\n\nSample Input 2\n\nAKIBAHARA\n\nSample Output 2\n\nNO\n\nThe correct spell is AKIHABARA.\n\nSample Input 3\n\nAAKIAHBAARA\n\nSample Output 3\n\nNO", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 612, "cpu_time_ms": 13, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s352119201", "group_id": "codeNet:p03523", "input_text": "local s = io.read()\nlocal pos = 1\nlocal f = false\nwhile pos do\n pos = s:find(\"KIH\", pos)\n if not pos then break end\n local bpos = s:find(\"B\", pos)\n if bpos then\n if bpos == pos + 3 or (bpos == pos + 4 and s:sub(pos + 3) == \"A\") then\n local rpos = s:find(\"R\", bpos)\n if rpos then\n if rpos == bpos + 1 or (rpos == bpos + 2 and s:sub(bpos + 1) == \"A\") then\n f = true\n break\n end\n end\n end\n end\n pos = pos + 1\nend\nprint(f and \"YES\" or \"NO\")\n", "language": "Lua", "metadata": {"date": 1563728658, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03523.html", "problem_id": "p03523", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03523/input.txt", "sample_output_relpath": "derived/input_output/data/p03523/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03523/Lua/s352119201.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s352119201", "user_id": "u120582723"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "local s = io.read()\nlocal pos = 1\nlocal f = false\nwhile pos do\n pos = s:find(\"KIH\", pos)\n if not pos then break end\n local bpos = s:find(\"B\", pos)\n if bpos then\n if bpos == pos + 3 or (bpos == pos + 4 and s:sub(pos + 3) == \"A\") then\n local rpos = s:find(\"R\", bpos)\n if rpos then\n if rpos == bpos + 1 or (rpos == bpos + 2 and s:sub(bpos + 1) == \"A\") then\n f = true\n break\n end\n end\n end\n end\n pos = pos + 1\nend\nprint(f and \"YES\" or \"NO\")\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S.\n\nTakahashi can insert the character A at any position in this string any number of times.\n\nCan he change S into AKIHABARA?\n\nConstraints\n\n1 \\leq |S| \\leq 50\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to change S into AKIHABARA, print YES; otherwise, print NO.\n\nSample Input 1\n\nKIHBR\n\nSample Output 1\n\nYES\n\nInsert one A at each of the four positions: the beginning, immediately after H, immediately after B and the end.\n\nSample Input 2\n\nAKIBAHARA\n\nSample Output 2\n\nNO\n\nThe correct spell is AKIHABARA.\n\nSample Input 3\n\nAAKIAHBAARA\n\nSample Output 3\n\nNO", "sample_input": "KIHBR\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03523", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S.\n\nTakahashi can insert the character A at any position in this string any number of times.\n\nCan he change S into AKIHABARA?\n\nConstraints\n\n1 \\leq |S| \\leq 50\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to change S into AKIHABARA, print YES; otherwise, print NO.\n\nSample Input 1\n\nKIHBR\n\nSample Output 1\n\nYES\n\nInsert one A at each of the four positions: the beginning, immediately after H, immediately after B and the end.\n\nSample Input 2\n\nAKIBAHARA\n\nSample Output 2\n\nNO\n\nThe correct spell is AKIHABARA.\n\nSample Input 3\n\nAAKIAHBAARA\n\nSample Output 3\n\nNO", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s482817949", "group_id": "codeNet:p03525", "input_text": "local mmi, mma, mab, mfl = math.min, math.max, math.abs, math.floor\nlocal function solve()\n local n = io.read(\"*n\")\n local iszero = false\n local cnt = {}\n for i = 1, 12 do cnt[i] = 0 end\n for i = 1, n do\n local d = io.read(\"*n\")\n if d == 0 then iszero = true\n else\n cnt[d] = cnt[d] + 1\n if 3 <= cnt[d] then iszero = true end\n end\n end\n if iszero then return 0 end\n local fix, float = {}, {}\n local minval = 12\n for i = 12, 1, -1 do\n if 0 < cnt[i] then\n minval = i\n end\n if cnt[i] == 1 then\n table.insert(float, i)\n elseif cnt[i] == 2 then\n table.insert(fix, i)\n end\n end\n --fix_fix\n for i = 1, #fix - 1 do\n for j = i + 1, #fix do\n minval = mmi(minval, fix[i] - fix[j])\n end\n end\n for i = 1, #fix do\n minval = mmi(minval, fix[i] * 2)\n minval = mmi(minval, (12 - fix[i]) * 2)\n end\n --fix_float\n for i = 1, #fix do\n for j = 1, #float do\n minval = mmi(minval, mab(fix[i] - float[j]))\n end\n end\n --float_float\n if 0 < #float then\n local mul = 1\n local z = {}\n for i = 1, #float do mul = mul * 2 end\n local partmax = 0\n for i = 0, mul - 1 do\n local partmin = 12\n for j = 1, #float do\n if i % 2 == 0 then\n z[j] = float[j]\n else\n z[j] = -float[j]\n end\n i = mfl(i / 2)\n end\n for j = 1, #float - 1 do\n for k = j + 1, #float do\n local v = mab(z[j] - z[k])\n v = mmi(v, 24 - v)\n partmin = mmi(partmin, v)\n end\n end\n partmax = mma(partmax, partmin)\n end\n minval = mmi(minval, partmax)\n end\n return minval\nend\nprint(solve())\n", "language": "Lua", "metadata": {"date": 1568771432, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03525.html", "problem_id": "p03525", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03525/input.txt", "sample_output_relpath": "derived/input_output/data/p03525/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03525/Lua/s482817949.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s482817949", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local mmi, mma, mab, mfl = math.min, math.max, math.abs, math.floor\nlocal function solve()\n local n = io.read(\"*n\")\n local iszero = false\n local cnt = {}\n for i = 1, 12 do cnt[i] = 0 end\n for i = 1, n do\n local d = io.read(\"*n\")\n if d == 0 then iszero = true\n else\n cnt[d] = cnt[d] + 1\n if 3 <= cnt[d] then iszero = true end\n end\n end\n if iszero then return 0 end\n local fix, float = {}, {}\n local minval = 12\n for i = 12, 1, -1 do\n if 0 < cnt[i] then\n minval = i\n end\n if cnt[i] == 1 then\n table.insert(float, i)\n elseif cnt[i] == 2 then\n table.insert(fix, i)\n end\n end\n --fix_fix\n for i = 1, #fix - 1 do\n for j = i + 1, #fix do\n minval = mmi(minval, fix[i] - fix[j])\n end\n end\n for i = 1, #fix do\n minval = mmi(minval, fix[i] * 2)\n minval = mmi(minval, (12 - fix[i]) * 2)\n end\n --fix_float\n for i = 1, #fix do\n for j = 1, #float do\n minval = mmi(minval, mab(fix[i] - float[j]))\n end\n end\n --float_float\n if 0 < #float then\n local mul = 1\n local z = {}\n for i = 1, #float do mul = mul * 2 end\n local partmax = 0\n for i = 0, mul - 1 do\n local partmin = 12\n for j = 1, #float do\n if i % 2 == 0 then\n z[j] = float[j]\n else\n z[j] = -float[j]\n end\n i = mfl(i / 2)\n end\n for j = 1, #float - 1 do\n for k = j + 1, #float do\n local v = mab(z[j] - z[k])\n v = mmi(v, 24 - v)\n partmin = mmi(partmin, v)\n end\n end\n partmax = mma(partmax, partmin)\n end\n minval = mmi(minval, partmax)\n end\n return minval\nend\nprint(solve())\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nIn CODE FESTIVAL XXXX, there are N+1 participants from all over the world, including Takahashi.\n\nTakahashi checked and found that the time gap (defined below) between the local times in his city and the i-th person's city was D_i hours.\nThe time gap between two cities is defined as follows. For two cities A and B, if the local time in city B is d o'clock at the moment when the local time in city A is 0 o'clock, then the time gap between these two cities is defined to be min(d,24-d) hours.\nHere, we are using 24-hour notation.\nThat is, the local time in the i-th person's city is either d o'clock or 24-d o'clock at the moment when the local time in Takahashi's city is 0 o'clock, for example.\n\nThen, for each pair of two people chosen from the N+1 people, he wrote out the time gap between their cities. Let the smallest time gap among them be s hours.\n\nFind the maximum possible value of s.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n0 \\leq D_i \\leq 12\n\nAll input values 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 maximum possible value of s.\n\nSample Input 1\n\n3\n7 12 8\n\nSample Output 1\n\n4\n\nFor example, consider the situation where it is 7, 12 and 16 o'clock in each person's city at the moment when it is 0 o'clock in Takahashi's city. In this case, the time gap between the second and third persons' cities is 4 hours.\n\nSample Input 2\n\n2\n11 11\n\nSample Output 2\n\n2\n\nSample Input 3\n\n1\n0\n\nSample Output 3\n\n0\n\nNote that Takahashi himself is also a participant.", "sample_input": "3\n7 12 8\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03525", "source_text": "Score : 500 points\n\nProblem Statement\n\nIn CODE FESTIVAL XXXX, there are N+1 participants from all over the world, including Takahashi.\n\nTakahashi checked and found that the time gap (defined below) between the local times in his city and the i-th person's city was D_i hours.\nThe time gap between two cities is defined as follows. For two cities A and B, if the local time in city B is d o'clock at the moment when the local time in city A is 0 o'clock, then the time gap between these two cities is defined to be min(d,24-d) hours.\nHere, we are using 24-hour notation.\nThat is, the local time in the i-th person's city is either d o'clock or 24-d o'clock at the moment when the local time in Takahashi's city is 0 o'clock, for example.\n\nThen, for each pair of two people chosen from the N+1 people, he wrote out the time gap between their cities. Let the smallest time gap among them be s hours.\n\nFind the maximum possible value of s.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n0 \\leq D_i \\leq 12\n\nAll input values 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 maximum possible value of s.\n\nSample Input 1\n\n3\n7 12 8\n\nSample Output 1\n\n4\n\nFor example, consider the situation where it is 7, 12 and 16 o'clock in each person's city at the moment when it is 0 o'clock in Takahashi's city. In this case, the time gap between the second and third persons' cities is 4 hours.\n\nSample Input 2\n\n2\n11 11\n\nSample Output 2\n\n2\n\nSample Input 3\n\n1\n0\n\nSample Output 3\n\n0\n\nNote that Takahashi himself is also a participant.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s664547117", "group_id": "codeNet:p03533", "input_text": "print(io.read():match(\"A?KIHA?BA?RA?\")and\"YES\"or\"NO\")", "language": "Lua", "metadata": {"date": 1525540558, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03533.html", "problem_id": "p03533", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03533/input.txt", "sample_output_relpath": "derived/input_output/data/p03533/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03533/Lua/s664547117.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s664547117", "user_id": "u781091740"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "print(io.read():match(\"A?KIHA?BA?RA?\")and\"YES\"or\"NO\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S.\n\nTakahashi can insert the character A at any position in this string any number of times.\n\nCan he change S into AKIHABARA?\n\nConstraints\n\n1 \\leq |S| \\leq 50\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to change S into AKIHABARA, print YES; otherwise, print NO.\n\nSample Input 1\n\nKIHBR\n\nSample Output 1\n\nYES\n\nInsert one A at each of the four positions: the beginning, immediately after H, immediately after B and the end.\n\nSample Input 2\n\nAKIBAHARA\n\nSample Output 2\n\nNO\n\nThe correct spell is AKIHABARA.\n\nSample Input 3\n\nAAKIAHBAARA\n\nSample Output 3\n\nNO", "sample_input": "KIHBR\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03533", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S.\n\nTakahashi can insert the character A at any position in this string any number of times.\n\nCan he change S into AKIHABARA?\n\nConstraints\n\n1 \\leq |S| \\leq 50\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to change S into AKIHABARA, print YES; otherwise, print NO.\n\nSample Input 1\n\nKIHBR\n\nSample Output 1\n\nYES\n\nInsert one A at each of the four positions: the beginning, immediately after H, immediately after B and the end.\n\nSample Input 2\n\nAKIBAHARA\n\nSample Output 2\n\nNO\n\nThe correct spell is AKIHABARA.\n\nSample Input 3\n\nAAKIAHBAARA\n\nSample Output 3\n\nNO", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 53, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s972220773", "group_id": "codeNet:p03543", "input_text": "local s = io.read()\nif s:sub(1,1)==s:sub(2,2) and s:sub(1,1)==s:sub(3,3) then\n print(\"Yes\")\nelseif s:sub(4,4)==s:sub(2,2) and s:sub(4,4)==s:sub(3,3) then\n print(\"Yes\")\nelse\n print(\"No\")\nend\n", "language": "Lua", "metadata": {"date": 1561521643, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s972220773.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s972220773", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local s = io.read()\nif s:sub(1,1)==s:sub(2,2) and s:sub(1,1)==s:sub(3,3) then\n print(\"Yes\")\nelseif s:sub(4,4)==s:sub(2,2) and s:sub(4,4)==s:sub(3,3) then\n print(\"Yes\")\nelse\n print(\"No\")\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s052479822", "group_id": "codeNet:p03544", "input_text": "N=io.read(\"n\")\nfunction lucas(n)\n local L={}\n L[0]=2\n L[1]=1\n if n>=2 then\n return lucas(n-1)+lucas(n-2)\n else \n return L[n]\n end\nend\nprint(lucas(N))", "language": "Lua", "metadata": {"date": 1551305874, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s052479822.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s052479822", "user_id": "u015229643"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "N=io.read(\"n\")\nfunction lucas(n)\n local L={}\n L[0]=2\n L[1]=1\n if n>=2 then\n return lucas(n-1)+lucas(n-2)\n else \n return L[n]\n end\nend\nprint(lucas(N))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIt is November 18 now in Japan. By the way, 11 and 18 are adjacent Lucas numbers.\n\nYou are given an integer N. Find the N-th Lucas number.\n\nHere, the i-th Lucas number L_i is defined as follows:\n\nL_0=2\n\nL_1=1\n\nL_i=L_{i-1}+L_{i-2} (i≥2)\n\nConstraints\n\n1≤N≤86\n\nIt is guaranteed that the answer is less than 10^{18}.\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the N-th Lucas number.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n11\n\nL_0=2\n\nL_1=1\n\nL_2=L_0+L_1=3\n\nL_3=L_1+L_2=4\n\nL_4=L_2+L_3=7\n\nL_5=L_3+L_4=11\n\nThus, the 5-th Lucas number is 11.\n\nSample Input 2\n\n86\n\nSample Output 2\n\n939587134549734843", "sample_input": "5\n"}, "reference_outputs": ["11\n"], "source_document_id": "p03544", "source_text": "Score : 200 points\n\nProblem Statement\n\nIt is November 18 now in Japan. By the way, 11 and 18 are adjacent Lucas numbers.\n\nYou are given an integer N. Find the N-th Lucas number.\n\nHere, the i-th Lucas number L_i is defined as follows:\n\nL_0=2\n\nL_1=1\n\nL_i=L_{i-1}+L_{i-2} (i≥2)\n\nConstraints\n\n1≤N≤86\n\nIt is guaranteed that the answer is less than 10^{18}.\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the N-th Lucas number.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n11\n\nL_0=2\n\nL_1=1\n\nL_2=L_0+L_1=3\n\nL_3=L_1+L_2=4\n\nL_4=L_2+L_3=7\n\nL_5=L_3+L_4=11\n\nThus, the 5-th Lucas number is 11.\n\nSample Input 2\n\n86\n\nSample Output 2\n\n939587134549734843", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 161, "cpu_time_ms": 2103, "memory_kb": 504}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s836068097", "group_id": "codeNet:p03547", "input_text": "x,_,y=io.read(1,1,1)\nprint(x>y and'>'or x'or x max_abs then\n max_abs = diff\n end\n end\n memo[left_i][w] = max_abs\n return max_abs\n end\nend\n\naction_y = nil\ndo\n local memo = {}\n action_y = function(tbl, left_i, z)\n if not memo[left_i] then\n memo[left_i] = {}\n elseif memo[left_i][w] then\n return memo[left_i][z]\n end\n \n local min_abs = math.abs(tbl[#tbl] - z)\n \n for i = left_i, #tbl - 1 do\n local diff = action_x(tbl, i + 1, tbl[i])\n if diff < min_abs then\n min_abs = diff\n end\n end\n memo[left_i][z] = min_abs\n return min_abs\n end\nend\n\nfunction main()\n local nzw_input = string.gmatch(io.read(), \"%d+\")\n local n = tonumber(nzw_input())\n local z = tonumber(nzw_input())\n local w = tonumber(nzw_input())\n local a = {}\n for i in string.gmatch(io.read(), \"%d+\") do\n table.insert(a, tonumber(i))\n end\n \n if #a == 1 then\n return math.abs(a[1] - w)\n end\n \n return action_x(a, 1, w)\nend\n\nprint(main())", "language": "Lua", "metadata": {"date": 1510555510, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s245203347.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s245203347", "user_id": "u940915899"}, "prompt_components": {"gold_output": "900\n", "input_to_evaluate": "action_x = nil\ndo\n local memo = {}\n action_x = function(tbl, left_i, w)\n if not memo[left_i] then\n memo[left_i] = {}\n elseif memo[left_i][w] then\n return memo[left_i][w]\n end\n \n local max_abs = math.abs(tbl[#tbl] - w)\n \n for i = left_i, #tbl - 1 do\n local diff = action_y(tbl, i + 1, tbl[i])\n if diff > max_abs then\n max_abs = diff\n end\n end\n memo[left_i][w] = max_abs\n return max_abs\n end\nend\n\naction_y = nil\ndo\n local memo = {}\n action_y = function(tbl, left_i, z)\n if not memo[left_i] then\n memo[left_i] = {}\n elseif memo[left_i][w] then\n return memo[left_i][z]\n end\n \n local min_abs = math.abs(tbl[#tbl] - z)\n \n for i = left_i, #tbl - 1 do\n local diff = action_x(tbl, i + 1, tbl[i])\n if diff < min_abs then\n min_abs = diff\n end\n end\n memo[left_i][z] = min_abs\n return min_abs\n end\nend\n\nfunction main()\n local nzw_input = string.gmatch(io.read(), \"%d+\")\n local n = tonumber(nzw_input())\n local z = tonumber(nzw_input())\n local w = tonumber(nzw_input())\n local a = {}\n for i in string.gmatch(io.read(), \"%d+\") do\n table.insert(a, tonumber(i))\n end\n \n if #a == 1 then\n return math.abs(a[1] - w)\n end\n \n return action_x(a, 1, w)\nend\n\nprint(main())", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1495, "cpu_time_ms": 2103, "memory_kb": 768}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s665103171", "group_id": "codeNet:p03553", "input_text": "local mfl = math.floor\nlocal mmi, mma = math.min, math.max\nlocal MPM = {}\n\nMPM.initialize = function(self, n, spos, tpos)\n self.n = n\n self.spos, self.tpos = spos, tpos\n -- edge_dst[src][i] := dst\n self.edge_dst = {}\n -- edge_cap[src][i] := capacity from src to edge_dst[src][i]\n self.edge_cap = {}\n -- edge_dst_invedge_idx[src][i] := \"j\" where edge_dst[dst][j] == src\n -- in this case, edge_dst_invedge_idx[dst][j] should be \"i\".\n self.edge_dst_invedge_idx = {}\n -- level[v] := length from spos. level[spos] := 1\n self.level = {}\n -- level_vertex_count[i] := count of vertexes that levels are i\n self.level_vertex_count = {}\n -- sub_graph_v[i] := list of vertexes that are contained in the sub-graph.\n self.sub_graph_v = {}\n -- sub_graph_size := the size of sub_graph_v.\n -- may not equal to #sub_graph_v (because not cleared).\n self.sub_graph_size = 0\n -- sub_graph_flag[v] := whether to contains the vertex v in the sub-graph or not\n self.sub_graph_flag = {}\n -- send[v] := sum of sendable amount from v to other vertexes in the sub-graph\n self.send = {}\n -- receive[v] := sum of receivable amount toward v from other vertexes in the sub-graph\n self.receive = {}\n -- sub_edge_idxes[src][i] := edge (from v) using in the sub-graph.\n -- for example, if sub_edge_idxes[src][i] is j,\n -- the edge from src to dst (= edge_dst[src][j]) contains in the sub-graph.\n self.sub_edge_idxes = {}\n -- sub_edge_cnt[src] := the size of sub_edge_idxes[src].\n -- may not equal to #sub_edge_idxes[src] (because not cleared).\n self.sub_edge_cnt = {}\n -- sub_invedge_idxes[dst] := edge (to dst) using in the sub-graph.\n -- for example, if sub_invedge_idxes[dst][i] is j,\n -- the src is edge_dst[dst][j], and the edge index (from src to dst) is k := edge_dst_invedge_idx[dst][j].\n -- so edge_dst[src][k] is the edge from src to dst using in the sub-graph.\n self.sub_invedge_idxes = {}\n -- sub_invedge_cnt[dst] := the size of sub_invedge_idxes[dst].\n -- may not equal to #sub_invedge_idxes[dst] (because not cleared).\n self.sub_invedge_cnt = {}\n -- flow_route[v] := [for \"flowToT\"] whether to contain in the route from weak_vertex to tpos.\n self.flow_route = {}\n -- actual_flow_amount[v] := [for \"flowToT\"] send amount from v\n self.actual_flow_amount = {}\n for i = 1, n do\n self.edge_dst[i] = {}\n self.edge_cap[i] = {}\n self.edge_dst_invedge_idx[i] = {}\n self.level[i] = 0\n self.level_vertex_count[i] = 0\n self.sub_graph_flag[i] = false\n self.send[i] = 0\n self.receive[i] = 0\n self.sub_edge_idxes[i] = {}\n self.sub_edge_cnt[i] = 0\n self.sub_invedge_idxes[i] = {}\n self.sub_invedge_cnt[i] = 0\n self.flow_route[i] = false\n self.actual_flow_amount[i] = 0\n end\nend\n\nMPM.addEdge = function(self, src, dst, cap, invcap)\n if not invcap then invcap = 0 end\n table.insert(self.edge_dst[src], dst)\n table.insert(self.edge_cap[src], cap)\n table.insert(self.edge_dst_invedge_idx[src], 1 + #self.edge_dst[dst])\n table.insert(self.edge_dst[dst], src)\n table.insert(self.edge_cap[dst], invcap)\n table.insert(self.edge_dst_invedge_idx[dst], #self.edge_dst[src])\nend\nMPM.makeSubGraph = function(self)\n local inf = self.n + 2\n local level, sub_graph_flag = self.level, self.sub_graph_flag\n local edge_dst, edge_cap = self.edge_dst, self.edge_cap\n local edge_dst_invedge_idx = self.edge_dst_invedge_idx\n local send, receive = self.send, self.receive\n local sub_graph_v = self.sub_graph_v\n local sub_edge_idxes, sub_edge_cnt = self.sub_edge_idxes, self.sub_edge_cnt\n local sub_invedge_idxes, sub_invedge_cnt = self.sub_invedge_idxes, self.sub_invedge_cnt\n local level_vertex_count = self.level_vertex_count\n for i = 1, self.n do\n level[i] = inf\n sub_graph_flag[i] = false\n send[i], receive[i] = 0, 0\n sub_edge_cnt[i] = 0\n sub_invedge_cnt[i] = 0\n level_vertex_count[i] = 0\n end\n -- BFS\n level[self.spos] = 1\n local taskcnt, done = 1, 0\n sub_graph_v[1] = self.spos\n local reached = false\n while done < taskcnt do\n done = done + 1\n local src = sub_graph_v[done]\n if src == self.tpos then reached = true break end\n for i = 1, #edge_dst[src] do\n local cap = edge_cap[src][i]\n if 0 < cap then\n local dst = edge_dst[src][i]\n if level[dst] == inf then\n level[dst] = level[src] + 1\n taskcnt = taskcnt + 1\n sub_graph_v[taskcnt] = dst\n elseif level[dst] == level[src] + 1 then\n end\n end\n end\n end\n if not reached then\n self.sub_graph_size = 0\n return false\n end\n -- restore route\n sub_graph_flag[self.tpos] = true\n local curlevel = level[self.tpos]\n while curlevel == level[sub_graph_v[taskcnt]] do\n taskcnt = taskcnt - 1\n end\n for isrc = taskcnt, 1, -1 do\n local src = sub_graph_v[isrc]\n for i = 1, #edge_dst[src] do\n local dst, cap = edge_dst[src][i], edge_cap[src][i]\n if 0 < cap and sub_graph_flag[dst]\n and level[dst] == level[src] + 1 then\n sub_graph_flag[src] = true\n local edgecnt = sub_edge_cnt[src] + 1\n sub_edge_cnt[src] = edgecnt\n sub_edge_idxes[src][edgecnt] = i\n sub_invedge_cnt[dst] = sub_invedge_cnt[dst] + 1\n sub_invedge_idxes[dst][sub_invedge_cnt[dst]] = edge_dst_invedge_idx[src][i]\n send[src] = send[src] + cap\n receive[dst] = receive[dst] + cap\n end\n end\n if not sub_graph_flag[src] then\n for i = 1, #edge_dst[src] do\n local dst = edge_dst[src][i]\n local cap = edge_cap[src][i]\n if 0 < cap and level[dst] == level[src] + 1 then\n send[src] = send[src] - cap\n receive[dst] = receive[dst] - cap\n end\n end\n end\n end\n -- remove unused vertex from \"taskcnt\" and set as sub_graph_size\n local nodecnt = 1\n for i = 1, taskcnt do\n local v = sub_graph_v[i]\n if sub_graph_flag[v] then\n sub_graph_v[nodecnt] = v\n local lv = level[v]\n level_vertex_count[lv] = level_vertex_count[lv] + 1\n nodecnt = nodecnt + 1\n end\n end\n if sub_graph_v[nodecnt - 1] == self.tpos then\n nodecnt = nodecnt - 1\n else\n sub_graph_v[nodecnt] = self.tpos\n local lv = level[self.tpos]\n level_vertex_count[lv] = level_vertex_count[lv] + 1\n end\n self.sub_graph_size = nodecnt\n return true\nend\n\nMPM.subGraphConnected = function(self)\n local max_level = self.level[self.tpos]\n local level_vertex_count = self.level_vertex_count\n for i = 1, max_level do\n if level_vertex_count[i] <= 0 then return false end\n end\n return true\nend\n\nMPM.findWeakVertex = function(self)\n local sub_graph_v = self.sub_graph_v\n local sub_graph_size = self.sub_graph_size\n local send, receive = self.send, self.receive\n local min_vertex = self.spos\n local min_potential = send[min_vertex]\n if receive[self.tpos] < min_potential then\n min_vertex = self.tpos\n min_potential = receive[min_vertex]\n end\n for i = 2, sub_graph_size - 1 do\n local v = sub_graph_v[i]\n local min_v = mmi(send[v], receive[v])\n if min_v < min_potential then\n min_potential, min_vertex = min_v, v\n end\n end\n return min_vertex, min_potential\nend\n\nMPM.flowToT = function(self, weak_vertex, potential)\n if weak_vertex == self.tpos then return end\n local sub_graph_flag = self.sub_graph_flag\n local edge_dst, edge_cap = self.edge_dst, self.edge_cap\n local edge_dst_invedge_idx = self.edge_dst_invedge_idx\n local sub_graph_v = self.sub_graph_v\n local sub_graph_size = self.sub_graph_size\n local sub_edge_cnt = self.sub_edge_cnt\n local sub_edge_idxes = self.sub_edge_idxes\n local send, receive = self.send, self.receive\n local level = self.level\n local flow_route = self.flow_route\n local actual_flow_amount = self.actual_flow_amount\n local tpos = self.tpos\n for i = 1, sub_graph_size do\n local v = sub_graph_v[i]\n flow_route[v] = false\n actual_flow_amount[v] = 0\n end\n flow_route[weak_vertex] = true\n actual_flow_amount[weak_vertex] = potential\n local weak_vertex_level = level[weak_vertex]\n local max_level = level[tpos]\n for iv = 1, sub_graph_size do\n local src = sub_graph_v[iv]\n local lv = level[src]\n if lv == max_level then break end\n local need_to_send = actual_flow_amount[src]\n if flow_route[src] and 0 < need_to_send then\n send[src] = send[src] - need_to_send\n local sub_edge_idxes_src = sub_edge_idxes[src]\n local dsts, caps, invidxes = edge_dst[src], edge_cap[src], edge_dst_invedge_idx[src]\n local used = 0\n -- use edge in descending order, to remove used edges quickly\n for j = sub_edge_cnt[src], 1, -1 do\n local edgeidx = sub_edge_idxes_src[j]\n local dst, cap = dsts[edgeidx], caps[edgeidx]\n local actual_flow = mmi(cap, need_to_send)\n receive[dst] = receive[dst] - actual_flow\n caps[edgeidx] = caps[edgeidx] - actual_flow\n need_to_send = need_to_send - actual_flow\n flow_route[dst] = true\n actual_flow_amount[dst] = actual_flow_amount[dst] + actual_flow\n local inv_edge_idx = invidxes[edgeidx]\n edge_cap[dst][inv_edge_idx] = edge_cap[dst][inv_edge_idx] + actual_flow\n if caps[edgeidx] == 0 then\n used = used + 1\n end\n if need_to_send == 0 then\n break\n end\n end\n sub_edge_cnt[src] = sub_edge_cnt[src] - used\n end\n end\nend\n\nMPM.flowFromS = function(self, weak_vertex, potential)\n if weak_vertex == self.spos then return end\n local sub_graph_flag = self.sub_graph_flag\n local edge_dst, edge_cap = self.edge_dst, self.edge_cap\n local edge_dst_invedge_idx = self.edge_dst_invedge_idx\n local sub_graph_v = self.sub_graph_v\n local sub_graph_size = self.sub_graph_size\n local sub_edge_cnt = self.sub_edge_cnt\n local sub_edge_idxes = self.sub_edge_idxes\n local sub_invedge_idxes = self.sub_invedge_idxes\n local sub_invedge_cnt = self.sub_invedge_cnt\n local send, receive = self.send, self.receive\n local level = self.level\n local flow_route = self.flow_route\n local actual_flow_amount = self.actual_flow_amount\n local spos = self.spos\n for i = 1, sub_graph_size do\n local v = sub_graph_v[i]\n flow_route[v] = false\n actual_flow_amount[v] = 0\n end\n flow_route[weak_vertex] = true\n actual_flow_amount[weak_vertex] = potential\n local weak_vertex_level = level[weak_vertex]\n local max_level = level[tpos]\n for iv = sub_graph_size, 1, -1 do\n local dst = sub_graph_v[iv]\n local lv = level[dst]\n if lv == 1 then break end\n local need_to_receive = actual_flow_amount[dst]\n if flow_route[dst] and 0 < need_to_receive then\n receive[dst] = receive[dst] - need_to_receive\n local sub_invedge_idxes_dst = sub_invedge_idxes[dst]\n local srcs = edge_dst[dst]\n local inv_invidxes = edge_dst_invedge_idx[dst]\n -- local dsts, caps, invidxes = edge_dst[src], edge_cap[src], edge_dst_invedge_idx[src]\n local used = 0\n -- use edge in descending order, to remove used edges quickly\n for j = sub_invedge_cnt[dst], 1, -1 do\n local invedgeidx = sub_invedge_idxes_dst[j]\n local src = srcs[invedgeidx]\n local edgeidx = inv_invidxes[invedgeidx]\n assert(edge_dst[src][edgeidx] == dst)\n local cap = edge_cap[src][edgeidx]\n local actual_flow = mmi(cap, need_to_receive)\n\n send[src] = send[src] - actual_flow\n edge_cap[src][edgeidx] = edge_cap[src][edgeidx] - actual_flow\n need_to_receive = need_to_receive - actual_flow\n flow_route[src] = true\n actual_flow_amount[src] = actual_flow_amount[src] + actual_flow\n edge_cap[dst][invedgeidx] = edge_cap[dst][invedgeidx] + actual_flow\n if edge_cap[src][edgeidx] == 0 then\n used = used + 1\n end\n if need_to_receive == 0 then\n break\n end\n end\n sub_invedge_cnt[dst] = sub_invedge_cnt[dst] - used\n end\n end\nend\n\nMPM.updateSubGraph = function(self)\n local sub_graph_v = self.sub_graph_v\n local sub_graph_size = self.sub_graph_size\n local sub_graph_flag = self.sub_graph_flag\n local send, receive = self.send, self.receive\n local spos, tpos = self.spos, self.tpos\n local level = self.level\n local level_vertex_count = self.level_vertex_count\n local sub_edge_idxes = self.sub_edge_idxes\n local sub_edge_cnt = self.sub_edge_cnt\n local edge_dst = self.edge_dst\n local sub_invedge_idxes = self.sub_invedge_idxes\n local sub_invedge_cnt = self.sub_invedge_cnt\n local nodecnt = 0\n for i = 1, sub_graph_size do\n local v = sub_graph_v[i]\n local valid = true\n if v ~= spos and receive[v] <= 0 then valid = false end\n if v ~= tpos and send[v] <= 0 then valid = false end\n if valid then\n local sub_invedge_idxes_v = sub_invedge_idxes[v]\n valid = false\n for j = 1, sub_invedge_cnt[v] do\n local ei = sub_invedge_idxes_v[j]\n local src = edge_dst[v][ei]\n if sub_graph_flag[src] then valid = true break end\n end\n end\n if valid then\n nodecnt = nodecnt + 1\n sub_graph_v[nodecnt] = v\n else\n sub_graph_flag[v] = false\n local lv = level[v]\n level_vertex_count[lv] = level_vertex_count[lv] - 1\n end\n end\n sub_graph_size = nodecnt\n for i = sub_graph_size, 1, -1 do\n local v = sub_graph_v[i]\n local valid = false\n local sub_edge_idxes_v = sub_edge_idxes[v]\n for j = 1, sub_edge_cnt[v] do\n local ei = sub_edge_idxes_v[j]\n local dst = edge_dst[v][ei]\n if sub_graph_flag[dst] then valid = true break end\n end\n if not valid then\n sub_graph_flag[v] = false\n local lv = level[v]\n level_vertex_count[lv] = level_vertex_count[lv] - 1\n end\n end\n nodecnt = 0\n for i = 1, sub_graph_size do\n local v = sub_graph_v[i]\n if sub_graph_v[v] then\n nodecnt = nodecnt + 1\n sub_graph_v[nodecnt] = v\n end\n end\n self.sub_graph_size = nodecnt\nend\n\nMPM.partialwork = function(self)\n local sum = 0\n while(self:subGraphConnected()) do\n local weak_vertex, potential = self:findWeakVertex()\n self:flowToT(weak_vertex, potential)\n self:flowFromS(weak_vertex, potential)\n self:updateSubGraph()\n sum = sum + potential\n end\n return sum\nend\n\nMPM.getMaxFlow = function(self)\n local ret = 0\n while(self:makeSubGraph()) do\n ret = ret + self:partialwork()\n end\n return ret\nend\n\nlocal inf = 1000000007 * 1000\nlocal n = io.read(\"*n\")\nMPM:initialize(n + 2, n + 1, n + 2)\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\nend\nlocal score = 0\nfor i = 1, n do\n if 0 < a[i] then\n score = score + a[i]\n MPM:addEdge(i, n + 2, a[i])\n elseif a[i] < 0 then\n MPM:addEdge(n + 1, i, -a[i])\n end\nend\nfor src = 1, n do\n local lim = mfl(n / src)\n for j = 2, lim do\n local dst = j * src\n MPM:addEdge(src, dst, inf)\n end\nend\nlocal flow = MPM:getMaxFlow()\nprint(score - flow)\n", "language": "Lua", "metadata": {"date": 1592275936, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s665103171.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s665103171", "user_id": "u120582723"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "local mfl = math.floor\nlocal mmi, mma = math.min, math.max\nlocal MPM = {}\n\nMPM.initialize = function(self, n, spos, tpos)\n self.n = n\n self.spos, self.tpos = spos, tpos\n -- edge_dst[src][i] := dst\n self.edge_dst = {}\n -- edge_cap[src][i] := capacity from src to edge_dst[src][i]\n self.edge_cap = {}\n -- edge_dst_invedge_idx[src][i] := \"j\" where edge_dst[dst][j] == src\n -- in this case, edge_dst_invedge_idx[dst][j] should be \"i\".\n self.edge_dst_invedge_idx = {}\n -- level[v] := length from spos. level[spos] := 1\n self.level = {}\n -- level_vertex_count[i] := count of vertexes that levels are i\n self.level_vertex_count = {}\n -- sub_graph_v[i] := list of vertexes that are contained in the sub-graph.\n self.sub_graph_v = {}\n -- sub_graph_size := the size of sub_graph_v.\n -- may not equal to #sub_graph_v (because not cleared).\n self.sub_graph_size = 0\n -- sub_graph_flag[v] := whether to contains the vertex v in the sub-graph or not\n self.sub_graph_flag = {}\n -- send[v] := sum of sendable amount from v to other vertexes in the sub-graph\n self.send = {}\n -- receive[v] := sum of receivable amount toward v from other vertexes in the sub-graph\n self.receive = {}\n -- sub_edge_idxes[src][i] := edge (from v) using in the sub-graph.\n -- for example, if sub_edge_idxes[src][i] is j,\n -- the edge from src to dst (= edge_dst[src][j]) contains in the sub-graph.\n self.sub_edge_idxes = {}\n -- sub_edge_cnt[src] := the size of sub_edge_idxes[src].\n -- may not equal to #sub_edge_idxes[src] (because not cleared).\n self.sub_edge_cnt = {}\n -- sub_invedge_idxes[dst] := edge (to dst) using in the sub-graph.\n -- for example, if sub_invedge_idxes[dst][i] is j,\n -- the src is edge_dst[dst][j], and the edge index (from src to dst) is k := edge_dst_invedge_idx[dst][j].\n -- so edge_dst[src][k] is the edge from src to dst using in the sub-graph.\n self.sub_invedge_idxes = {}\n -- sub_invedge_cnt[dst] := the size of sub_invedge_idxes[dst].\n -- may not equal to #sub_invedge_idxes[dst] (because not cleared).\n self.sub_invedge_cnt = {}\n -- flow_route[v] := [for \"flowToT\"] whether to contain in the route from weak_vertex to tpos.\n self.flow_route = {}\n -- actual_flow_amount[v] := [for \"flowToT\"] send amount from v\n self.actual_flow_amount = {}\n for i = 1, n do\n self.edge_dst[i] = {}\n self.edge_cap[i] = {}\n self.edge_dst_invedge_idx[i] = {}\n self.level[i] = 0\n self.level_vertex_count[i] = 0\n self.sub_graph_flag[i] = false\n self.send[i] = 0\n self.receive[i] = 0\n self.sub_edge_idxes[i] = {}\n self.sub_edge_cnt[i] = 0\n self.sub_invedge_idxes[i] = {}\n self.sub_invedge_cnt[i] = 0\n self.flow_route[i] = false\n self.actual_flow_amount[i] = 0\n end\nend\n\nMPM.addEdge = function(self, src, dst, cap, invcap)\n if not invcap then invcap = 0 end\n table.insert(self.edge_dst[src], dst)\n table.insert(self.edge_cap[src], cap)\n table.insert(self.edge_dst_invedge_idx[src], 1 + #self.edge_dst[dst])\n table.insert(self.edge_dst[dst], src)\n table.insert(self.edge_cap[dst], invcap)\n table.insert(self.edge_dst_invedge_idx[dst], #self.edge_dst[src])\nend\nMPM.makeSubGraph = function(self)\n local inf = self.n + 2\n local level, sub_graph_flag = self.level, self.sub_graph_flag\n local edge_dst, edge_cap = self.edge_dst, self.edge_cap\n local edge_dst_invedge_idx = self.edge_dst_invedge_idx\n local send, receive = self.send, self.receive\n local sub_graph_v = self.sub_graph_v\n local sub_edge_idxes, sub_edge_cnt = self.sub_edge_idxes, self.sub_edge_cnt\n local sub_invedge_idxes, sub_invedge_cnt = self.sub_invedge_idxes, self.sub_invedge_cnt\n local level_vertex_count = self.level_vertex_count\n for i = 1, self.n do\n level[i] = inf\n sub_graph_flag[i] = false\n send[i], receive[i] = 0, 0\n sub_edge_cnt[i] = 0\n sub_invedge_cnt[i] = 0\n level_vertex_count[i] = 0\n end\n -- BFS\n level[self.spos] = 1\n local taskcnt, done = 1, 0\n sub_graph_v[1] = self.spos\n local reached = false\n while done < taskcnt do\n done = done + 1\n local src = sub_graph_v[done]\n if src == self.tpos then reached = true break end\n for i = 1, #edge_dst[src] do\n local cap = edge_cap[src][i]\n if 0 < cap then\n local dst = edge_dst[src][i]\n if level[dst] == inf then\n level[dst] = level[src] + 1\n taskcnt = taskcnt + 1\n sub_graph_v[taskcnt] = dst\n elseif level[dst] == level[src] + 1 then\n end\n end\n end\n end\n if not reached then\n self.sub_graph_size = 0\n return false\n end\n -- restore route\n sub_graph_flag[self.tpos] = true\n local curlevel = level[self.tpos]\n while curlevel == level[sub_graph_v[taskcnt]] do\n taskcnt = taskcnt - 1\n end\n for isrc = taskcnt, 1, -1 do\n local src = sub_graph_v[isrc]\n for i = 1, #edge_dst[src] do\n local dst, cap = edge_dst[src][i], edge_cap[src][i]\n if 0 < cap and sub_graph_flag[dst]\n and level[dst] == level[src] + 1 then\n sub_graph_flag[src] = true\n local edgecnt = sub_edge_cnt[src] + 1\n sub_edge_cnt[src] = edgecnt\n sub_edge_idxes[src][edgecnt] = i\n sub_invedge_cnt[dst] = sub_invedge_cnt[dst] + 1\n sub_invedge_idxes[dst][sub_invedge_cnt[dst]] = edge_dst_invedge_idx[src][i]\n send[src] = send[src] + cap\n receive[dst] = receive[dst] + cap\n end\n end\n if not sub_graph_flag[src] then\n for i = 1, #edge_dst[src] do\n local dst = edge_dst[src][i]\n local cap = edge_cap[src][i]\n if 0 < cap and level[dst] == level[src] + 1 then\n send[src] = send[src] - cap\n receive[dst] = receive[dst] - cap\n end\n end\n end\n end\n -- remove unused vertex from \"taskcnt\" and set as sub_graph_size\n local nodecnt = 1\n for i = 1, taskcnt do\n local v = sub_graph_v[i]\n if sub_graph_flag[v] then\n sub_graph_v[nodecnt] = v\n local lv = level[v]\n level_vertex_count[lv] = level_vertex_count[lv] + 1\n nodecnt = nodecnt + 1\n end\n end\n if sub_graph_v[nodecnt - 1] == self.tpos then\n nodecnt = nodecnt - 1\n else\n sub_graph_v[nodecnt] = self.tpos\n local lv = level[self.tpos]\n level_vertex_count[lv] = level_vertex_count[lv] + 1\n end\n self.sub_graph_size = nodecnt\n return true\nend\n\nMPM.subGraphConnected = function(self)\n local max_level = self.level[self.tpos]\n local level_vertex_count = self.level_vertex_count\n for i = 1, max_level do\n if level_vertex_count[i] <= 0 then return false end\n end\n return true\nend\n\nMPM.findWeakVertex = function(self)\n local sub_graph_v = self.sub_graph_v\n local sub_graph_size = self.sub_graph_size\n local send, receive = self.send, self.receive\n local min_vertex = self.spos\n local min_potential = send[min_vertex]\n if receive[self.tpos] < min_potential then\n min_vertex = self.tpos\n min_potential = receive[min_vertex]\n end\n for i = 2, sub_graph_size - 1 do\n local v = sub_graph_v[i]\n local min_v = mmi(send[v], receive[v])\n if min_v < min_potential then\n min_potential, min_vertex = min_v, v\n end\n end\n return min_vertex, min_potential\nend\n\nMPM.flowToT = function(self, weak_vertex, potential)\n if weak_vertex == self.tpos then return end\n local sub_graph_flag = self.sub_graph_flag\n local edge_dst, edge_cap = self.edge_dst, self.edge_cap\n local edge_dst_invedge_idx = self.edge_dst_invedge_idx\n local sub_graph_v = self.sub_graph_v\n local sub_graph_size = self.sub_graph_size\n local sub_edge_cnt = self.sub_edge_cnt\n local sub_edge_idxes = self.sub_edge_idxes\n local send, receive = self.send, self.receive\n local level = self.level\n local flow_route = self.flow_route\n local actual_flow_amount = self.actual_flow_amount\n local tpos = self.tpos\n for i = 1, sub_graph_size do\n local v = sub_graph_v[i]\n flow_route[v] = false\n actual_flow_amount[v] = 0\n end\n flow_route[weak_vertex] = true\n actual_flow_amount[weak_vertex] = potential\n local weak_vertex_level = level[weak_vertex]\n local max_level = level[tpos]\n for iv = 1, sub_graph_size do\n local src = sub_graph_v[iv]\n local lv = level[src]\n if lv == max_level then break end\n local need_to_send = actual_flow_amount[src]\n if flow_route[src] and 0 < need_to_send then\n send[src] = send[src] - need_to_send\n local sub_edge_idxes_src = sub_edge_idxes[src]\n local dsts, caps, invidxes = edge_dst[src], edge_cap[src], edge_dst_invedge_idx[src]\n local used = 0\n -- use edge in descending order, to remove used edges quickly\n for j = sub_edge_cnt[src], 1, -1 do\n local edgeidx = sub_edge_idxes_src[j]\n local dst, cap = dsts[edgeidx], caps[edgeidx]\n local actual_flow = mmi(cap, need_to_send)\n receive[dst] = receive[dst] - actual_flow\n caps[edgeidx] = caps[edgeidx] - actual_flow\n need_to_send = need_to_send - actual_flow\n flow_route[dst] = true\n actual_flow_amount[dst] = actual_flow_amount[dst] + actual_flow\n local inv_edge_idx = invidxes[edgeidx]\n edge_cap[dst][inv_edge_idx] = edge_cap[dst][inv_edge_idx] + actual_flow\n if caps[edgeidx] == 0 then\n used = used + 1\n end\n if need_to_send == 0 then\n break\n end\n end\n sub_edge_cnt[src] = sub_edge_cnt[src] - used\n end\n end\nend\n\nMPM.flowFromS = function(self, weak_vertex, potential)\n if weak_vertex == self.spos then return end\n local sub_graph_flag = self.sub_graph_flag\n local edge_dst, edge_cap = self.edge_dst, self.edge_cap\n local edge_dst_invedge_idx = self.edge_dst_invedge_idx\n local sub_graph_v = self.sub_graph_v\n local sub_graph_size = self.sub_graph_size\n local sub_edge_cnt = self.sub_edge_cnt\n local sub_edge_idxes = self.sub_edge_idxes\n local sub_invedge_idxes = self.sub_invedge_idxes\n local sub_invedge_cnt = self.sub_invedge_cnt\n local send, receive = self.send, self.receive\n local level = self.level\n local flow_route = self.flow_route\n local actual_flow_amount = self.actual_flow_amount\n local spos = self.spos\n for i = 1, sub_graph_size do\n local v = sub_graph_v[i]\n flow_route[v] = false\n actual_flow_amount[v] = 0\n end\n flow_route[weak_vertex] = true\n actual_flow_amount[weak_vertex] = potential\n local weak_vertex_level = level[weak_vertex]\n local max_level = level[tpos]\n for iv = sub_graph_size, 1, -1 do\n local dst = sub_graph_v[iv]\n local lv = level[dst]\n if lv == 1 then break end\n local need_to_receive = actual_flow_amount[dst]\n if flow_route[dst] and 0 < need_to_receive then\n receive[dst] = receive[dst] - need_to_receive\n local sub_invedge_idxes_dst = sub_invedge_idxes[dst]\n local srcs = edge_dst[dst]\n local inv_invidxes = edge_dst_invedge_idx[dst]\n -- local dsts, caps, invidxes = edge_dst[src], edge_cap[src], edge_dst_invedge_idx[src]\n local used = 0\n -- use edge in descending order, to remove used edges quickly\n for j = sub_invedge_cnt[dst], 1, -1 do\n local invedgeidx = sub_invedge_idxes_dst[j]\n local src = srcs[invedgeidx]\n local edgeidx = inv_invidxes[invedgeidx]\n assert(edge_dst[src][edgeidx] == dst)\n local cap = edge_cap[src][edgeidx]\n local actual_flow = mmi(cap, need_to_receive)\n\n send[src] = send[src] - actual_flow\n edge_cap[src][edgeidx] = edge_cap[src][edgeidx] - actual_flow\n need_to_receive = need_to_receive - actual_flow\n flow_route[src] = true\n actual_flow_amount[src] = actual_flow_amount[src] + actual_flow\n edge_cap[dst][invedgeidx] = edge_cap[dst][invedgeidx] + actual_flow\n if edge_cap[src][edgeidx] == 0 then\n used = used + 1\n end\n if need_to_receive == 0 then\n break\n end\n end\n sub_invedge_cnt[dst] = sub_invedge_cnt[dst] - used\n end\n end\nend\n\nMPM.updateSubGraph = function(self)\n local sub_graph_v = self.sub_graph_v\n local sub_graph_size = self.sub_graph_size\n local sub_graph_flag = self.sub_graph_flag\n local send, receive = self.send, self.receive\n local spos, tpos = self.spos, self.tpos\n local level = self.level\n local level_vertex_count = self.level_vertex_count\n local sub_edge_idxes = self.sub_edge_idxes\n local sub_edge_cnt = self.sub_edge_cnt\n local edge_dst = self.edge_dst\n local sub_invedge_idxes = self.sub_invedge_idxes\n local sub_invedge_cnt = self.sub_invedge_cnt\n local nodecnt = 0\n for i = 1, sub_graph_size do\n local v = sub_graph_v[i]\n local valid = true\n if v ~= spos and receive[v] <= 0 then valid = false end\n if v ~= tpos and send[v] <= 0 then valid = false end\n if valid then\n local sub_invedge_idxes_v = sub_invedge_idxes[v]\n valid = false\n for j = 1, sub_invedge_cnt[v] do\n local ei = sub_invedge_idxes_v[j]\n local src = edge_dst[v][ei]\n if sub_graph_flag[src] then valid = true break end\n end\n end\n if valid then\n nodecnt = nodecnt + 1\n sub_graph_v[nodecnt] = v\n else\n sub_graph_flag[v] = false\n local lv = level[v]\n level_vertex_count[lv] = level_vertex_count[lv] - 1\n end\n end\n sub_graph_size = nodecnt\n for i = sub_graph_size, 1, -1 do\n local v = sub_graph_v[i]\n local valid = false\n local sub_edge_idxes_v = sub_edge_idxes[v]\n for j = 1, sub_edge_cnt[v] do\n local ei = sub_edge_idxes_v[j]\n local dst = edge_dst[v][ei]\n if sub_graph_flag[dst] then valid = true break end\n end\n if not valid then\n sub_graph_flag[v] = false\n local lv = level[v]\n level_vertex_count[lv] = level_vertex_count[lv] - 1\n end\n end\n nodecnt = 0\n for i = 1, sub_graph_size do\n local v = sub_graph_v[i]\n if sub_graph_v[v] then\n nodecnt = nodecnt + 1\n sub_graph_v[nodecnt] = v\n end\n end\n self.sub_graph_size = nodecnt\nend\n\nMPM.partialwork = function(self)\n local sum = 0\n while(self:subGraphConnected()) do\n local weak_vertex, potential = self:findWeakVertex()\n self:flowToT(weak_vertex, potential)\n self:flowFromS(weak_vertex, potential)\n self:updateSubGraph()\n sum = sum + potential\n end\n return sum\nend\n\nMPM.getMaxFlow = function(self)\n local ret = 0\n while(self:makeSubGraph()) do\n ret = ret + self:partialwork()\n end\n return ret\nend\n\nlocal inf = 1000000007 * 1000\nlocal n = io.read(\"*n\")\nMPM:initialize(n + 2, n + 1, n + 2)\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\nend\nlocal score = 0\nfor i = 1, n do\n if 0 < a[i] then\n score = score + a[i]\n MPM:addEdge(i, n + 2, a[i])\n elseif a[i] < 0 then\n MPM:addEdge(n + 1, i, -a[i])\n end\nend\nfor src = 1, n do\n local lim = mfl(n / src)\n for j = 2, lim do\n local dst = j * src\n MPM:addEdge(src, dst, inf)\n end\nend\nlocal flow = MPM:getMaxFlow()\nprint(score - flow)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 14708, "cpu_time_ms": 16, "memory_kb": 880}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s135336957", "group_id": "codeNet:p03553", "input_text": "local mfl = math.floor\nlocal mmi, mma = math.min, math.max\nlocal MPM = {}\n\nMPM.initialize = function(self, n, spos, tpos)\n self.n = n\n self.spos, self.tpos = spos, tpos\n -- edge_dst[src][i] := dst\n self.edge_dst = {}\n -- edge_cap[src][i] := capacity from src to edge_dst[src][i]\n self.edge_cap = {}\n -- edge_dst_invedge_idx[src][i] := \"j\" where edge_dst[dst][j] == src\n -- in this case, edge_dst_invedge_idx[dst][j] should be \"i\".\n self.edge_dst_invedge_idx = {}\n -- level[v] := length from spos. level[spos] := 1\n self.level = {}\n -- level_vertex_count[i] := count of vertexes that levels are i\n self.level_vertex_count = {}\n -- sub_graph_v[i] := list of vertexes that are contained in the sub-graph.\n self.sub_graph_v = {}\n -- sub_graph_size := the size of sub_graph_v.\n -- may not equal to #sub_graph_v (because not cleared).\n self.sub_graph_size = 0\n -- sub_graph_flag[v] := whether to contains the vertex v in the sub-graph or not\n self.sub_graph_flag = {}\n -- send[v] := sum of sendable amount from v to other vertexes in the sub-graph\n self.send = {}\n -- receive[v] := sum of receivable amount toward v from other vertexes in the sub-graph\n self.receive = {}\n -- sub_edge_idxes[src][i] := edge (from v) using in the sub-graph.\n -- for example, if sub_edge_idxes[src][i] is j,\n -- the edge from src to dst (= edge_dst[src][j]) contains in the sub-graph.\n self.sub_edge_idxes = {}\n -- sub_edge_cnt[src] := the size of sub_edge_idxes[src].\n -- may not equal to #sub_edge_idxes[src] (because not cleared).\n self.sub_edge_cnt = {}\n -- sub_invedge_idxes[dst] := edge (to dst) using in the sub-graph.\n -- for example, if sub_invedge_idxes[dst][i] is j,\n -- the src is edge_dst[dst][j], and the edge index (from src to dst) is k := edge_dst_invedge_idx[dst][j].\n -- so edge_dst[src][k] is the edge from src to dst using in the sub-graph.\n self.sub_invedge_idxes = {}\n -- sub_invedge_cnt[dst] := the size of sub_invedge_idxes[dst].\n -- may not equal to #sub_invedge_idxes[dst] (because not cleared).\n self.sub_invedge_cnt = {}\n -- flow_route[v] := [for \"flowToT\"] whether to contain in the route from weak_vertex to tpos.\n self.flow_route = {}\n -- actual_flow_amount[v] := [for \"flowToT\"] send amount from v\n self.actual_flow_amount = {}\n for i = 1, n do\n self.edge_dst[i] = {}\n self.edge_cap[i] = {}\n self.edge_dst_invedge_idx[i] = {}\n self.level[i] = 0\n self.level_vertex_count[i] = 0\n self.sub_graph_flag[i] = false\n self.send[i] = 0\n self.receive[i] = 0\n self.sub_edge_idxes[i] = {}\n self.sub_edge_cnt[i] = 0\n self.sub_invedge_idxes[i] = {}\n self.sub_invedge_cnt[i] = 0\n self.flow_route[i] = false\n self.actual_flow_amount[i] = 0\n end\nend\n\nMPM.addEdge = function(self, src, dst, cap, invcap)\n if not invcap then invcap = 0 end\n table.insert(self.edge_dst[src], dst)\n table.insert(self.edge_cap[src], cap)\n table.insert(self.edge_dst_invedge_idx[src], 1 + #self.edge_dst[dst])\n table.insert(self.edge_dst[dst], src)\n table.insert(self.edge_cap[dst], invcap)\n table.insert(self.edge_dst_invedge_idx[dst], #self.edge_dst[src])\nend\nMPM.makeSubGraph = function(self)\n local inf = self.n + 2\n local level, sub_graph_flag = self.level, self.sub_graph_flag\n local edge_dst, edge_cap = self.edge_dst, self.edge_cap\n local edge_dst_invedge_idx = self.edge_dst_invedge_idx\n local send, receive = self.send, self.receive\n local sub_graph_v = self.sub_graph_v\n local sub_edge_idxes, sub_edge_cnt = self.sub_edge_idxes, self.sub_edge_cnt\n local sub_invedge_idxes, sub_invedge_cnt = self.sub_invedge_idxes, self.sub_invedge_cnt\n local level_vertex_count = self.level_vertex_count\n for i = 1, self.n do\n level[i] = inf\n sub_graph_flag[i] = false\n send[i], receive[i] = 0, 0\n sub_edge_cnt[i] = 0\n sub_invedge_cnt[i] = 0\n level_vertex_count[i] = 0\n end\n -- BFS\n level[self.spos] = 1\n local taskcnt, done = 1, 0\n sub_graph_v[1] = self.spos\n local reached = false\n while done < taskcnt do\n done = done + 1\n local src = sub_graph_v[done]\n if src == self.tpos then reached = true break end\n for i = 1, #edge_dst[src] do\n local cap = edge_cap[src][i]\n if 0 < cap then\n local dst = edge_dst[src][i]\n if level[dst] == inf then\n level[dst] = level[src] + 1\n taskcnt = taskcnt + 1\n sub_graph_v[taskcnt] = dst\n elseif level[dst] == level[src] + 1 then\n end\n end\n end\n end\n if not reached then\n self.sub_graph_size = 0\n return false\n end\n -- restore route\n sub_graph_flag[self.tpos] = true\n local curlevel = level[self.tpos]\n while curlevel == level[sub_graph_v[taskcnt]] do\n taskcnt = taskcnt - 1\n end\n for isrc = taskcnt, 1, -1 do\n local src = sub_graph_v[isrc]\n for i = 1, #edge_dst[src] do\n local dst, cap = edge_dst[src][i], edge_cap[src][i]\n if 0 < cap and sub_graph_flag[dst]\n and level[dst] == level[src] + 1 then\n sub_graph_flag[src] = true\n local edgecnt = sub_edge_cnt[src] + 1\n sub_edge_cnt[src] = edgecnt\n sub_edge_idxes[src][edgecnt] = i\n sub_invedge_cnt[dst] = sub_invedge_cnt[dst] + 1\n sub_invedge_idxes[dst][sub_invedge_cnt[dst]] = edge_dst_invedge_idx[src][i]\n send[src] = send[src] + cap\n receive[dst] = receive[dst] + cap\n end\n end\n if not sub_graph_flag[src] then\n for i = 1, #edge_dst[src] do\n local dst = edge_dst[src][i]\n local cap = edge_cap[src][i]\n if 0 < cap and level[dst] == level[src] + 1 then\n send[src] = send[src] - cap\n receive[dst] = receive[dst] - cap\n end\n end\n end\n end\n -- remove unused vertex from \"taskcnt\" and set as sub_graph_size\n local nodecnt = 1\n for i = 1, taskcnt do\n local v = sub_graph_v[i]\n if sub_graph_flag[v] then\n sub_graph_v[nodecnt] = v\n local lv = level[v]\n level_vertex_count[lv] = level_vertex_count[lv] + 1\n nodecnt = nodecnt + 1\n end\n end\n if sub_graph_v[nodecnt - 1] == self.tpos then\n nodecnt = nodecnt - 1\n else\n sub_graph_v[nodecnt] = self.tpos\n local lv = level[self.tpos]\n level_vertex_count[lv] = level_vertex_count[lv] + 1\n end\n self.sub_graph_size = nodecnt\n return true\nend\n\nMPM.subGraphConnected = function(self)\n local max_level = self.level[self.tpos]\n local level_vertex_count = self.level_vertex_count\n for i = 1, max_level do\n if level_vertex_count[i] <= 0 then return false end\n end\n return true\nend\n\nMPM.findWeakVertex = function(self)\n local sub_graph_v = self.sub_graph_v\n local sub_graph_size = self.sub_graph_size\n local send, receive = self.send, self.receive\n local min_vertex = self.spos\n local min_potential = send[min_vertex]\n if receive[self.tpos] < min_potential then\n min_vertex = self.tpos\n min_potential = receive[min_vertex]\n end\n for i = 2, sub_graph_size - 1 do\n local v = sub_graph_v[i]\n local min_v = mmi(send[v], receive[v])\n if min_v < min_potential then\n min_potential, min_vertex = min_v, v\n end\n end\n return min_vertex, min_potential\nend\n\nMPM.flowToT = function(self, weak_vertex, potential)\n if weak_vertex == self.tpos then return end\n local sub_graph_flag = self.sub_graph_flag\n local edge_dst, edge_cap = self.edge_dst, self.edge_cap\n local edge_dst_invedge_idx = self.edge_dst_invedge_idx\n local sub_graph_v = self.sub_graph_v\n local sub_graph_size = self.sub_graph_size\n local sub_edge_cnt = self.sub_edge_cnt\n local sub_edge_idxes = self.sub_edge_idxes\n local send, receive = self.send, self.receive\n local level = self.level\n local flow_route = self.flow_route\n local actual_flow_amount = self.actual_flow_amount\n local tpos = self.tpos\n for i = 1, sub_graph_size do\n local v = sub_graph_v[i]\n flow_route[v] = false\n actual_flow_amount[v] = 0\n end\n flow_route[weak_vertex] = true\n actual_flow_amount[weak_vertex] = potential\n local weak_vertex_level = level[weak_vertex]\n local max_level = level[tpos]\n for iv = 1, sub_graph_size do\n local src = sub_graph_v[iv]\n local lv = level[src]\n if lv == max_level then break end\n local need_to_send = actual_flow_amount[src]\n if flow_route[src] and 0 < need_to_send then\n send[src] = send[src] - need_to_send\n local sub_edge_idxes_src = sub_edge_idxes[src]\n local dsts, caps, invidxes = edge_dst[src], edge_cap[src], edge_dst_invedge_idx[src]\n local used = 0\n -- use edge in descending order, to remove used edges quickly\n for j = sub_edge_cnt[src], 1, -1 do\n local edgeidx = sub_edge_idxes_src[j]\n local dst, cap = dsts[edgeidx], caps[edgeidx]\n local actual_flow = mmi(cap, need_to_send)\n receive[dst] = receive[dst] - actual_flow\n caps[edgeidx] = caps[edgeidx] - actual_flow\n need_to_send = need_to_send - actual_flow\n flow_route[dst] = true\n actual_flow_amount[dst] = actual_flow_amount[dst] + actual_flow\n local inv_edge_idx = invidxes[edgeidx]\n edge_cap[dst][inv_edge_idx] = edge_cap[dst][inv_edge_idx] + actual_flow\n if caps[edgeidx] == 0 then\n used = used + 1\n end\n if need_to_send == 0 then\n break\n end\n end\n sub_edge_cnt[src] = sub_edge_cnt[src] - used\n end\n end\nend\n\nMPM.flowFromS = function(self, weak_vertex, potential)\n if weak_vertex == self.spos then return end\n local sub_graph_flag = self.sub_graph_flag\n local edge_dst, edge_cap = self.edge_dst, self.edge_cap\n local edge_dst_invedge_idx = self.edge_dst_invedge_idx\n local sub_graph_v = self.sub_graph_v\n local sub_graph_size = self.sub_graph_size\n local sub_edge_cnt = self.sub_edge_cnt\n local sub_edge_idxes = self.sub_edge_idxes\n local sub_invedge_idxes = self.sub_invedge_idxes\n local sub_invedge_cnt = self.sub_invedge_cnt\n local send, receive = self.send, self.receive\n local level = self.level\n local flow_route = self.flow_route\n local actual_flow_amount = self.actual_flow_amount\n local spos = self.spos\n for i = 1, sub_graph_size do\n local v = sub_graph_v[i]\n flow_route[v] = false\n actual_flow_amount[v] = 0\n end\n flow_route[weak_vertex] = true\n actual_flow_amount[weak_vertex] = potential\n local weak_vertex_level = level[weak_vertex]\n local max_level = level[tpos]\n for iv = sub_graph_size, 1, -1 do\n local dst = sub_graph_v[iv]\n local lv = level[dst]\n if lv == 1 then break end\n local need_to_receive = actual_flow_amount[dst]\n if flow_route[dst] and 0 < need_to_receive then\n receive[dst] = receive[dst] - need_to_receive\n local sub_invedge_idxes_dst = sub_invedge_idxes[dst]\n local srcs = edge_dst[dst]\n local inv_invidxes = edge_dst_invedge_idx[dst]\n -- local dsts, caps, invidxes = edge_dst[src], edge_cap[src], edge_dst_invedge_idx[src]\n local used = 0\n -- use edge in descending order, to remove used edges quickly\n for j = sub_invedge_cnt[dst], 1, -1 do\n local invedgeidx = sub_invedge_idxes_dst[j]\n local src = srcs[invedgeidx]\n local edgeidx = inv_invidxes[invedgeidx]\n assert(edge_dst[src][edgeidx] == dst)\n local cap = edge_cap[src][edgeidx]\n local actual_flow = mmi(cap, need_to_receive)\n\n send[src] = send[src] - actual_flow\n edge_cap[src][edgeidx] = edge_cap[src][edgeidx] - actual_flow\n need_to_receive = need_to_receive - actual_flow\n flow_route[src] = true\n actual_flow_amount[src] = actual_flow_amount[src] + actual_flow\n edge_cap[dst][invedgeidx] = edge_cap[dst][invedgeidx] + actual_flow\n if edge_cap[src][edgeidx] == 0 then\n used = used + 1\n end\n if need_to_receive == 0 then\n break\n end\n end\n sub_invedge_cnt[dst] = sub_invedge_cnt[dst] - used\n end\n end\nend\n\nMPM.updateSubGraph = function(self)\n local sub_graph_v = self.sub_graph_v\n local sub_graph_size = self.sub_graph_size\n local sub_graph_flag = self.sub_graph_flag\n local send, receive = self.send, self.receive\n local spos, tpos = self.spos, self.tpos\n local level = self.level\n local level_vertex_count = self.level_vertex_count\n local sub_edge_idxes = self.sub_edge_idxes\n local sub_edge_cnt = self.sub_edge_cnt\n local edge_dst = self.edge_dst\n local sub_invedge_idxes = self.sub_invedge_idxes\n local sub_invedge_cnt = self.sub_invedge_cnt\n local nodecnt = 0\n for i = 1, sub_graph_size do\n local v = sub_graph_v[i]\n local valid = true\n if v ~= spos and receive[v] <= 0 then valid = false end\n if v ~= tpos and send[v] <= 0 then valid = false end\n if valid then\n local sub_invedge_idxes_v = sub_invedge_idxes[v]\n valid = false\n for j = 1, sub_invedge_cnt[v] do\n local ei = sub_invedge_idxes_v[j]\n local src = edge_dst[v][ei]\n if sub_graph_flag[src] then valid = true break end\n end\n end\n if valid then\n nodecnt = nodecnt + 1\n sub_graph_v[nodecnt] = v\n else\n sub_graph_flag[v] = false\n local lv = level[v]\n level_vertex_count[lv] = level_vertex_count[lv] - 1\n end\n end\n sub_graph_size = nodecnt\n for i = sub_graph_size, 1, -1 do\n local v = sub_graph_v[i]\n local valid = false\n local sub_edge_idxes_v = sub_edge_idxes[v]\n for j = 1, sub_edge_cnt[v] do\n local ei = sub_edge_idxes_v[j]\n local dst = edge_dst[v][ei]\n if sub_graph_flag[dst] then valid = true break end\n end\n if not valid then\n sub_graph_flag[v] = false\n local lv = level[v]\n level_vertex_count[lv] = level_vertex_count[lv] - 1\n end\n end\n nodecnt = 0\n for i = 1, sub_graph_size do\n local v = sub_graph_v[i]\n if sub_graph_v[v] then\n nodecnt = nodecnt + 1\n sub_graph_v[nodecnt] = v\n end\n end\n self.sub_graph_size = nodecnt\nend\n\nMPM.partialwork = function(self)\n local sum = 0\n while(self:subGraphConnected()) do\n local weak_vertex, potential = self:findWeakVertex()\n self:flowToT(weak_vertex, potential)\n self:flowFromS(weak_vertex, potential)\n self:updateSubGraph()\n sum = sum + potential\n end\n return sum\nend\n\nMPM.getMaxFlow = function(self)\n local ret = 0\n while(self:makeSubGraph()) do\n ret = ret + self:partialwork()\n end\n return ret\nend\n\nlocal inf = 1000000007 * 1000\nlocal n = io.read(\"*n\")\nMPM:initialize(n + 2, n + 1, n + 2)\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\nend\nlocal score = 0\nfor i = 1, n do\n if 0 < a[i] then\n score = score + a[i]\n MPM:addEdge(i, n + 2, a[i])\n elseif a[i] < 0 then\n MPM:addEdge(n + 1, i, -a[i])\n end\nend\nfor src = 1, n do\n local lim = mfl(n / src)\n for j = 2, lim do\n local dst = j * src\n MPM:addEdge(src, dst, inf)\n end\nend\nlocal flow = MPM:getMaxFlow()\nprint(score - flow)\n", "language": "Lua", "metadata": {"date": 1592226656, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s135336957.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s135336957", "user_id": "u120582723"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "local mfl = math.floor\nlocal mmi, mma = math.min, math.max\nlocal MPM = {}\n\nMPM.initialize = function(self, n, spos, tpos)\n self.n = n\n self.spos, self.tpos = spos, tpos\n -- edge_dst[src][i] := dst\n self.edge_dst = {}\n -- edge_cap[src][i] := capacity from src to edge_dst[src][i]\n self.edge_cap = {}\n -- edge_dst_invedge_idx[src][i] := \"j\" where edge_dst[dst][j] == src\n -- in this case, edge_dst_invedge_idx[dst][j] should be \"i\".\n self.edge_dst_invedge_idx = {}\n -- level[v] := length from spos. level[spos] := 1\n self.level = {}\n -- level_vertex_count[i] := count of vertexes that levels are i\n self.level_vertex_count = {}\n -- sub_graph_v[i] := list of vertexes that are contained in the sub-graph.\n self.sub_graph_v = {}\n -- sub_graph_size := the size of sub_graph_v.\n -- may not equal to #sub_graph_v (because not cleared).\n self.sub_graph_size = 0\n -- sub_graph_flag[v] := whether to contains the vertex v in the sub-graph or not\n self.sub_graph_flag = {}\n -- send[v] := sum of sendable amount from v to other vertexes in the sub-graph\n self.send = {}\n -- receive[v] := sum of receivable amount toward v from other vertexes in the sub-graph\n self.receive = {}\n -- sub_edge_idxes[src][i] := edge (from v) using in the sub-graph.\n -- for example, if sub_edge_idxes[src][i] is j,\n -- the edge from src to dst (= edge_dst[src][j]) contains in the sub-graph.\n self.sub_edge_idxes = {}\n -- sub_edge_cnt[src] := the size of sub_edge_idxes[src].\n -- may not equal to #sub_edge_idxes[src] (because not cleared).\n self.sub_edge_cnt = {}\n -- sub_invedge_idxes[dst] := edge (to dst) using in the sub-graph.\n -- for example, if sub_invedge_idxes[dst][i] is j,\n -- the src is edge_dst[dst][j], and the edge index (from src to dst) is k := edge_dst_invedge_idx[dst][j].\n -- so edge_dst[src][k] is the edge from src to dst using in the sub-graph.\n self.sub_invedge_idxes = {}\n -- sub_invedge_cnt[dst] := the size of sub_invedge_idxes[dst].\n -- may not equal to #sub_invedge_idxes[dst] (because not cleared).\n self.sub_invedge_cnt = {}\n -- flow_route[v] := [for \"flowToT\"] whether to contain in the route from weak_vertex to tpos.\n self.flow_route = {}\n -- actual_flow_amount[v] := [for \"flowToT\"] send amount from v\n self.actual_flow_amount = {}\n for i = 1, n do\n self.edge_dst[i] = {}\n self.edge_cap[i] = {}\n self.edge_dst_invedge_idx[i] = {}\n self.level[i] = 0\n self.level_vertex_count[i] = 0\n self.sub_graph_flag[i] = false\n self.send[i] = 0\n self.receive[i] = 0\n self.sub_edge_idxes[i] = {}\n self.sub_edge_cnt[i] = 0\n self.sub_invedge_idxes[i] = {}\n self.sub_invedge_cnt[i] = 0\n self.flow_route[i] = false\n self.actual_flow_amount[i] = 0\n end\nend\n\nMPM.addEdge = function(self, src, dst, cap, invcap)\n if not invcap then invcap = 0 end\n table.insert(self.edge_dst[src], dst)\n table.insert(self.edge_cap[src], cap)\n table.insert(self.edge_dst_invedge_idx[src], 1 + #self.edge_dst[dst])\n table.insert(self.edge_dst[dst], src)\n table.insert(self.edge_cap[dst], invcap)\n table.insert(self.edge_dst_invedge_idx[dst], #self.edge_dst[src])\nend\nMPM.makeSubGraph = function(self)\n local inf = self.n + 2\n local level, sub_graph_flag = self.level, self.sub_graph_flag\n local edge_dst, edge_cap = self.edge_dst, self.edge_cap\n local edge_dst_invedge_idx = self.edge_dst_invedge_idx\n local send, receive = self.send, self.receive\n local sub_graph_v = self.sub_graph_v\n local sub_edge_idxes, sub_edge_cnt = self.sub_edge_idxes, self.sub_edge_cnt\n local sub_invedge_idxes, sub_invedge_cnt = self.sub_invedge_idxes, self.sub_invedge_cnt\n local level_vertex_count = self.level_vertex_count\n for i = 1, self.n do\n level[i] = inf\n sub_graph_flag[i] = false\n send[i], receive[i] = 0, 0\n sub_edge_cnt[i] = 0\n sub_invedge_cnt[i] = 0\n level_vertex_count[i] = 0\n end\n -- BFS\n level[self.spos] = 1\n local taskcnt, done = 1, 0\n sub_graph_v[1] = self.spos\n local reached = false\n while done < taskcnt do\n done = done + 1\n local src = sub_graph_v[done]\n if src == self.tpos then reached = true break end\n for i = 1, #edge_dst[src] do\n local cap = edge_cap[src][i]\n if 0 < cap then\n local dst = edge_dst[src][i]\n if level[dst] == inf then\n level[dst] = level[src] + 1\n taskcnt = taskcnt + 1\n sub_graph_v[taskcnt] = dst\n elseif level[dst] == level[src] + 1 then\n end\n end\n end\n end\n if not reached then\n self.sub_graph_size = 0\n return false\n end\n -- restore route\n sub_graph_flag[self.tpos] = true\n local curlevel = level[self.tpos]\n while curlevel == level[sub_graph_v[taskcnt]] do\n taskcnt = taskcnt - 1\n end\n for isrc = taskcnt, 1, -1 do\n local src = sub_graph_v[isrc]\n for i = 1, #edge_dst[src] do\n local dst, cap = edge_dst[src][i], edge_cap[src][i]\n if 0 < cap and sub_graph_flag[dst]\n and level[dst] == level[src] + 1 then\n sub_graph_flag[src] = true\n local edgecnt = sub_edge_cnt[src] + 1\n sub_edge_cnt[src] = edgecnt\n sub_edge_idxes[src][edgecnt] = i\n sub_invedge_cnt[dst] = sub_invedge_cnt[dst] + 1\n sub_invedge_idxes[dst][sub_invedge_cnt[dst]] = edge_dst_invedge_idx[src][i]\n send[src] = send[src] + cap\n receive[dst] = receive[dst] + cap\n end\n end\n if not sub_graph_flag[src] then\n for i = 1, #edge_dst[src] do\n local dst = edge_dst[src][i]\n local cap = edge_cap[src][i]\n if 0 < cap and level[dst] == level[src] + 1 then\n send[src] = send[src] - cap\n receive[dst] = receive[dst] - cap\n end\n end\n end\n end\n -- remove unused vertex from \"taskcnt\" and set as sub_graph_size\n local nodecnt = 1\n for i = 1, taskcnt do\n local v = sub_graph_v[i]\n if sub_graph_flag[v] then\n sub_graph_v[nodecnt] = v\n local lv = level[v]\n level_vertex_count[lv] = level_vertex_count[lv] + 1\n nodecnt = nodecnt + 1\n end\n end\n if sub_graph_v[nodecnt - 1] == self.tpos then\n nodecnt = nodecnt - 1\n else\n sub_graph_v[nodecnt] = self.tpos\n local lv = level[self.tpos]\n level_vertex_count[lv] = level_vertex_count[lv] + 1\n end\n self.sub_graph_size = nodecnt\n return true\nend\n\nMPM.subGraphConnected = function(self)\n local max_level = self.level[self.tpos]\n local level_vertex_count = self.level_vertex_count\n for i = 1, max_level do\n if level_vertex_count[i] <= 0 then return false end\n end\n return true\nend\n\nMPM.findWeakVertex = function(self)\n local sub_graph_v = self.sub_graph_v\n local sub_graph_size = self.sub_graph_size\n local send, receive = self.send, self.receive\n local min_vertex = self.spos\n local min_potential = send[min_vertex]\n if receive[self.tpos] < min_potential then\n min_vertex = self.tpos\n min_potential = receive[min_vertex]\n end\n for i = 2, sub_graph_size - 1 do\n local v = sub_graph_v[i]\n local min_v = mmi(send[v], receive[v])\n if min_v < min_potential then\n min_potential, min_vertex = min_v, v\n end\n end\n return min_vertex, min_potential\nend\n\nMPM.flowToT = function(self, weak_vertex, potential)\n if weak_vertex == self.tpos then return end\n local sub_graph_flag = self.sub_graph_flag\n local edge_dst, edge_cap = self.edge_dst, self.edge_cap\n local edge_dst_invedge_idx = self.edge_dst_invedge_idx\n local sub_graph_v = self.sub_graph_v\n local sub_graph_size = self.sub_graph_size\n local sub_edge_cnt = self.sub_edge_cnt\n local sub_edge_idxes = self.sub_edge_idxes\n local send, receive = self.send, self.receive\n local level = self.level\n local flow_route = self.flow_route\n local actual_flow_amount = self.actual_flow_amount\n local tpos = self.tpos\n for i = 1, sub_graph_size do\n local v = sub_graph_v[i]\n flow_route[v] = false\n actual_flow_amount[v] = 0\n end\n flow_route[weak_vertex] = true\n actual_flow_amount[weak_vertex] = potential\n local weak_vertex_level = level[weak_vertex]\n local max_level = level[tpos]\n for iv = 1, sub_graph_size do\n local src = sub_graph_v[iv]\n local lv = level[src]\n if lv == max_level then break end\n local need_to_send = actual_flow_amount[src]\n if flow_route[src] and 0 < need_to_send then\n send[src] = send[src] - need_to_send\n local sub_edge_idxes_src = sub_edge_idxes[src]\n local dsts, caps, invidxes = edge_dst[src], edge_cap[src], edge_dst_invedge_idx[src]\n local used = 0\n -- use edge in descending order, to remove used edges quickly\n for j = sub_edge_cnt[src], 1, -1 do\n local edgeidx = sub_edge_idxes_src[j]\n local dst, cap = dsts[edgeidx], caps[edgeidx]\n local actual_flow = mmi(cap, need_to_send)\n receive[dst] = receive[dst] - actual_flow\n caps[edgeidx] = caps[edgeidx] - actual_flow\n need_to_send = need_to_send - actual_flow\n flow_route[dst] = true\n actual_flow_amount[dst] = actual_flow_amount[dst] + actual_flow\n local inv_edge_idx = invidxes[edgeidx]\n edge_cap[dst][inv_edge_idx] = edge_cap[dst][inv_edge_idx] + actual_flow\n if caps[edgeidx] == 0 then\n used = used + 1\n end\n if need_to_send == 0 then\n break\n end\n end\n sub_edge_cnt[src] = sub_edge_cnt[src] - used\n end\n end\nend\n\nMPM.flowFromS = function(self, weak_vertex, potential)\n if weak_vertex == self.spos then return end\n local sub_graph_flag = self.sub_graph_flag\n local edge_dst, edge_cap = self.edge_dst, self.edge_cap\n local edge_dst_invedge_idx = self.edge_dst_invedge_idx\n local sub_graph_v = self.sub_graph_v\n local sub_graph_size = self.sub_graph_size\n local sub_edge_cnt = self.sub_edge_cnt\n local sub_edge_idxes = self.sub_edge_idxes\n local sub_invedge_idxes = self.sub_invedge_idxes\n local sub_invedge_cnt = self.sub_invedge_cnt\n local send, receive = self.send, self.receive\n local level = self.level\n local flow_route = self.flow_route\n local actual_flow_amount = self.actual_flow_amount\n local spos = self.spos\n for i = 1, sub_graph_size do\n local v = sub_graph_v[i]\n flow_route[v] = false\n actual_flow_amount[v] = 0\n end\n flow_route[weak_vertex] = true\n actual_flow_amount[weak_vertex] = potential\n local weak_vertex_level = level[weak_vertex]\n local max_level = level[tpos]\n for iv = sub_graph_size, 1, -1 do\n local dst = sub_graph_v[iv]\n local lv = level[dst]\n if lv == 1 then break end\n local need_to_receive = actual_flow_amount[dst]\n if flow_route[dst] and 0 < need_to_receive then\n receive[dst] = receive[dst] - need_to_receive\n local sub_invedge_idxes_dst = sub_invedge_idxes[dst]\n local srcs = edge_dst[dst]\n local inv_invidxes = edge_dst_invedge_idx[dst]\n -- local dsts, caps, invidxes = edge_dst[src], edge_cap[src], edge_dst_invedge_idx[src]\n local used = 0\n -- use edge in descending order, to remove used edges quickly\n for j = sub_invedge_cnt[dst], 1, -1 do\n local invedgeidx = sub_invedge_idxes_dst[j]\n local src = srcs[invedgeidx]\n local edgeidx = inv_invidxes[invedgeidx]\n assert(edge_dst[src][edgeidx] == dst)\n local cap = edge_cap[src][edgeidx]\n local actual_flow = mmi(cap, need_to_receive)\n\n send[src] = send[src] - actual_flow\n edge_cap[src][edgeidx] = edge_cap[src][edgeidx] - actual_flow\n need_to_receive = need_to_receive - actual_flow\n flow_route[src] = true\n actual_flow_amount[src] = actual_flow_amount[src] + actual_flow\n edge_cap[dst][invedgeidx] = edge_cap[dst][invedgeidx] + actual_flow\n if edge_cap[src][edgeidx] == 0 then\n used = used + 1\n end\n if need_to_receive == 0 then\n break\n end\n end\n sub_invedge_cnt[dst] = sub_invedge_cnt[dst] - used\n end\n end\nend\n\nMPM.updateSubGraph = function(self)\n local sub_graph_v = self.sub_graph_v\n local sub_graph_size = self.sub_graph_size\n local sub_graph_flag = self.sub_graph_flag\n local send, receive = self.send, self.receive\n local spos, tpos = self.spos, self.tpos\n local level = self.level\n local level_vertex_count = self.level_vertex_count\n local sub_edge_idxes = self.sub_edge_idxes\n local sub_edge_cnt = self.sub_edge_cnt\n local edge_dst = self.edge_dst\n local sub_invedge_idxes = self.sub_invedge_idxes\n local sub_invedge_cnt = self.sub_invedge_cnt\n local nodecnt = 0\n for i = 1, sub_graph_size do\n local v = sub_graph_v[i]\n local valid = true\n if v ~= spos and receive[v] <= 0 then valid = false end\n if v ~= tpos and send[v] <= 0 then valid = false end\n if valid then\n local sub_invedge_idxes_v = sub_invedge_idxes[v]\n valid = false\n for j = 1, sub_invedge_cnt[v] do\n local ei = sub_invedge_idxes_v[j]\n local src = edge_dst[v][ei]\n if sub_graph_flag[src] then valid = true break end\n end\n end\n if valid then\n nodecnt = nodecnt + 1\n sub_graph_v[nodecnt] = v\n else\n sub_graph_flag[v] = false\n local lv = level[v]\n level_vertex_count[lv] = level_vertex_count[lv] - 1\n end\n end\n sub_graph_size = nodecnt\n for i = sub_graph_size, 1, -1 do\n local v = sub_graph_v[i]\n local valid = false\n local sub_edge_idxes_v = sub_edge_idxes[v]\n for j = 1, sub_edge_cnt[v] do\n local ei = sub_edge_idxes_v[j]\n local dst = edge_dst[v][ei]\n if sub_graph_flag[dst] then valid = true break end\n end\n if not valid then\n sub_graph_flag[v] = false\n local lv = level[v]\n level_vertex_count[lv] = level_vertex_count[lv] - 1\n end\n end\n nodecnt = 0\n for i = 1, sub_graph_size do\n local v = sub_graph_v[i]\n if sub_graph_v[v] then\n nodecnt = nodecnt + 1\n sub_graph_v[nodecnt] = v\n end\n end\n self.sub_graph_size = nodecnt\nend\n\nMPM.partialwork = function(self)\n local sum = 0\n while(self:subGraphConnected()) do\n local weak_vertex, potential = self:findWeakVertex()\n self:flowToT(weak_vertex, potential)\n self:flowFromS(weak_vertex, potential)\n self:updateSubGraph()\n sum = sum + potential\n end\n return sum\nend\n\nMPM.getMaxFlow = function(self)\n local ret = 0\n while(self:makeSubGraph()) do\n ret = ret + self:partialwork()\n end\n return ret\nend\n\nlocal inf = 1000000007 * 1000\nlocal n = io.read(\"*n\")\nMPM:initialize(n + 2, n + 1, n + 2)\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\nend\nlocal score = 0\nfor i = 1, n do\n if 0 < a[i] then\n score = score + a[i]\n MPM:addEdge(i, n + 2, a[i])\n elseif a[i] < 0 then\n MPM:addEdge(n + 1, i, -a[i])\n end\nend\nfor src = 1, n do\n local lim = mfl(n / src)\n for j = 2, lim do\n local dst = j * src\n MPM:addEdge(src, dst, inf)\n end\nend\nlocal flow = MPM:getMaxFlow()\nprint(score - flow)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 14708, "cpu_time_ms": 6, "memory_kb": 512}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s700583269", "group_id": "codeNet:p03553", "input_text": "local mfl = math.floor\nlocal n = io.read(\"*n\")\nlocal a = {}\nlocal edge_to_child = {}\nlocal edge_to_parent = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\n edge_to_child[i] = {}\n edge_to_parent[i] = {}\nend\nfor i = 1, n - 1 do\n local lim = mfl(n / i)\n for j = 2, lim do\n edge_to_child[i][i * j] = true\n edge_to_parent[i * j][i] = true\n end\nend\n\nlocal cost = {}\nfor i = 1, n do cost[i] = a[i] end\n\nlocal function recalcCost()\n for i = 1, n do cost[i] = a[i] end\n for child = n, 2, -1 do\n for parent, _u in pairs(edge_to_parent[child]) do\n cost[parent] = cost[parent] + a[child]\n end\n end\nend\n\nwhile true do\n recalcCost()\n local mincost, minpos = 0, 0\n for i = n, 1, -1 do\n if cost[i] < 0 then\n mincost = cost[i]\n minpos = i\n break\n end\n end\n if 0 <= mincost then\n break\n else\n local lim = mfl(n / minpos)\n for j = 1, lim do\n a[minpos * j] = 0\n end\n end\nend\nlocal ret = 0\nfor i = 1, n do\n ret = ret + a[i]\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1579576354, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s700583269.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s700583269", "user_id": "u120582723"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "local mfl = math.floor\nlocal n = io.read(\"*n\")\nlocal a = {}\nlocal edge_to_child = {}\nlocal edge_to_parent = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\n edge_to_child[i] = {}\n edge_to_parent[i] = {}\nend\nfor i = 1, n - 1 do\n local lim = mfl(n / i)\n for j = 2, lim do\n edge_to_child[i][i * j] = true\n edge_to_parent[i * j][i] = true\n end\nend\n\nlocal cost = {}\nfor i = 1, n do cost[i] = a[i] end\n\nlocal function recalcCost()\n for i = 1, n do cost[i] = a[i] end\n for child = n, 2, -1 do\n for parent, _u in pairs(edge_to_parent[child]) do\n cost[parent] = cost[parent] + a[child]\n end\n end\nend\n\nwhile true do\n recalcCost()\n local mincost, minpos = 0, 0\n for i = n, 1, -1 do\n if cost[i] < 0 then\n mincost = cost[i]\n minpos = i\n break\n end\n end\n if 0 <= mincost then\n break\n else\n local lim = mfl(n / minpos)\n for j = 1, lim do\n a[minpos * j] = 0\n end\n end\nend\nlocal ret = 0\nfor i = 1, n do\n ret = ret + a[i]\nend\nprint(ret)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 984, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s511933015", "group_id": "codeNet:p03553", "input_text": "local mfl = math.floor\nlocal n = io.read(\"*n\")\nlocal a = {}\nlocal edge_to_child = {}\nlocal edge_to_parent = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\n edge_to_child[i] = {}\n edge_to_parent[i] = {}\nend\nfor i = 1, n - 1 do\n local lim = mfl(n / i)\n for j = 2, lim do\n edge_to_child[i][i * j] = true\n edge_to_parent[i * j][i] = true\n end\nend\n\nlocal cost = {}\nfor i = 1, n do cost[i] = a[i] end\n\nlocal function recalcCost()\n for i = 1, n do cost[i] = a[i] end\n for child = n, 2, -1 do\n for parent, _u in pairs(edge_to_parent[child]) do\n cost[parent] = cost[parent] + a[child]\n end\n end\nend\n\nwhile true do\n recalcCost()\n local mincost, minpos = cost[1], 1\n for i = 2, n do\n if cost[i] < mincost then\n mincost = cost[i]\n minpos = i\n end\n end\n if 0 <= mincost then\n break\n else\n local lim = mfl(n / minpos)\n for j = 1, lim do\n a[minpos * j] = 0\n end\n end\nend\nlocal ret = 0\nfor i = 1, n do\n ret = ret + a[i]\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1579549868, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s511933015.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s511933015", "user_id": "u120582723"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "local mfl = math.floor\nlocal n = io.read(\"*n\")\nlocal a = {}\nlocal edge_to_child = {}\nlocal edge_to_parent = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\n edge_to_child[i] = {}\n edge_to_parent[i] = {}\nend\nfor i = 1, n - 1 do\n local lim = mfl(n / i)\n for j = 2, lim do\n edge_to_child[i][i * j] = true\n edge_to_parent[i * j][i] = true\n end\nend\n\nlocal cost = {}\nfor i = 1, n do cost[i] = a[i] end\n\nlocal function recalcCost()\n for i = 1, n do cost[i] = a[i] end\n for child = n, 2, -1 do\n for parent, _u in pairs(edge_to_parent[child]) do\n cost[parent] = cost[parent] + a[child]\n end\n end\nend\n\nwhile true do\n recalcCost()\n local mincost, minpos = cost[1], 1\n for i = 2, n do\n if cost[i] < mincost then\n mincost = cost[i]\n minpos = i\n end\n end\n if 0 <= mincost then\n break\n else\n local lim = mfl(n / minpos)\n for j = 1, lim do\n a[minpos * j] = 0\n end\n end\nend\nlocal ret = 0\nfor i = 1, n do\n ret = ret + a[i]\nend\nprint(ret)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 980, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s061943616", "group_id": "codeNet:p03555", "input_text": "print(io.read()==io.read():reverse()and\"YES\"or\"NO\")", "language": "Lua", "metadata": {"date": 1551836988, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03555.html", "problem_id": "p03555", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03555/input.txt", "sample_output_relpath": "derived/input_output/data/p03555/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03555/Lua/s061943616.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s061943616", "user_id": "u837412668"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "print(io.read()==io.read():reverse()and\"YES\"or\"NO\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a grid with 2 rows and 3 columns of squares.\nThe color of the square at the i-th row and j-th column is represented by the character C_{ij}.\n\nWrite a program that prints YES if this grid remains the same when rotated 180 degrees, and prints NO otherwise.\n\nConstraints\n\nC_{i,j}(1 \\leq i \\leq 2, 1 \\leq j \\leq 3) is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nC_{11}C_{12}C_{13}\nC_{21}C_{22}C_{23}\n\nOutput\n\nPrint YES if this grid remains the same when rotated 180 degrees; print NO otherwise.\n\nSample Input 1\n\npot\ntop\n\nSample Output 1\n\nYES\n\nThis grid remains the same when rotated 180 degrees.\n\nSample Input 2\n\ntab\nbet\n\nSample Output 2\n\nNO\n\nThis grid does not remain the same when rotated 180 degrees.\n\nSample Input 3\n\neye\neel\n\nSample Output 3\n\nNO", "sample_input": "pot\ntop\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03555", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a grid with 2 rows and 3 columns of squares.\nThe color of the square at the i-th row and j-th column is represented by the character C_{ij}.\n\nWrite a program that prints YES if this grid remains the same when rotated 180 degrees, and prints NO otherwise.\n\nConstraints\n\nC_{i,j}(1 \\leq i \\leq 2, 1 \\leq j \\leq 3) is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nC_{11}C_{12}C_{13}\nC_{21}C_{22}C_{23}\n\nOutput\n\nPrint YES if this grid remains the same when rotated 180 degrees; print NO otherwise.\n\nSample Input 1\n\npot\ntop\n\nSample Output 1\n\nYES\n\nThis grid remains the same when rotated 180 degrees.\n\nSample Input 2\n\ntab\nbet\n\nSample Output 2\n\nNO\n\nThis grid does not remain the same when rotated 180 degrees.\n\nSample Input 3\n\neye\neel\n\nSample Output 3\n\nNO", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s109725889", "group_id": "codeNet:p03555", "input_text": "n=io.read()\nm=io.read()\nif string.reverse(m)==n then\n print(\"Yes\")\n else\n print(\"No\")\nend", "language": "Lua", "metadata": {"date": 1551483561, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03555.html", "problem_id": "p03555", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03555/input.txt", "sample_output_relpath": "derived/input_output/data/p03555/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03555/Lua/s109725889.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s109725889", "user_id": "u015229643"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "n=io.read()\nm=io.read()\nif string.reverse(m)==n then\n print(\"Yes\")\n else\n print(\"No\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a grid with 2 rows and 3 columns of squares.\nThe color of the square at the i-th row and j-th column is represented by the character C_{ij}.\n\nWrite a program that prints YES if this grid remains the same when rotated 180 degrees, and prints NO otherwise.\n\nConstraints\n\nC_{i,j}(1 \\leq i \\leq 2, 1 \\leq j \\leq 3) is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nC_{11}C_{12}C_{13}\nC_{21}C_{22}C_{23}\n\nOutput\n\nPrint YES if this grid remains the same when rotated 180 degrees; print NO otherwise.\n\nSample Input 1\n\npot\ntop\n\nSample Output 1\n\nYES\n\nThis grid remains the same when rotated 180 degrees.\n\nSample Input 2\n\ntab\nbet\n\nSample Output 2\n\nNO\n\nThis grid does not remain the same when rotated 180 degrees.\n\nSample Input 3\n\neye\neel\n\nSample Output 3\n\nNO", "sample_input": "pot\ntop\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03555", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a grid with 2 rows and 3 columns of squares.\nThe color of the square at the i-th row and j-th column is represented by the character C_{ij}.\n\nWrite a program that prints YES if this grid remains the same when rotated 180 degrees, and prints NO otherwise.\n\nConstraints\n\nC_{i,j}(1 \\leq i \\leq 2, 1 \\leq j \\leq 3) is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nC_{11}C_{12}C_{13}\nC_{21}C_{22}C_{23}\n\nOutput\n\nPrint YES if this grid remains the same when rotated 180 degrees; print NO otherwise.\n\nSample Input 1\n\npot\ntop\n\nSample Output 1\n\nYES\n\nThis grid remains the same when rotated 180 degrees.\n\nSample Input 2\n\ntab\nbet\n\nSample Output 2\n\nNO\n\nThis grid does not remain the same when rotated 180 degrees.\n\nSample Input 3\n\neye\neel\n\nSample Output 3\n\nNO", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 92, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s051873050", "group_id": "codeNet:p03556", "input_text": "N=io.read(\"n\")\nprint(math.floor(math.pow(math.floor(math.sqrt(n)),2)))", "language": "Lua", "metadata": {"date": 1551483974, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s051873050.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s051873050", "user_id": "u015229643"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "N=io.read(\"n\")\nprint(math.floor(math.pow(math.floor(math.sqrt(n)),2)))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 70, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s291009818", "group_id": "codeNet:p03561", "input_text": "local k, n = io.read(\"*n\", \"*n\")\nlocal t = {}\n\nif k % 2 == 0 then\n table.insert(t, k / 2)\n for i = 1, n - 1 do table.insert(t, k) end\nelse\n local hk = (k + 1) / 2\n for i = 1, n do t[i] = hk end\n local decnum = math.ceil((n - 1) / 2)\n local curpos = n\n for i = 1, decnum do\n for j = curpos, 1, -1 do\n if 0 < t[j] then\n t[j] = t[j] - 1\n if t[j] ~= 0 then\n for s = j + 1, n do\n t[s] = k\n end\n curpos = n\n else\n curpos = curpos - 1\n end\n break\n end\n end\n end\n for i = 1, n do\n if t[i] == 0 then\n for j = i, n do\n table.remove(t)\n end\n break\n end\n end\nend\n\nprint(table.concat(t, \" \"))\n", "language": "Lua", "metadata": {"date": 1565977431, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03561.html", "problem_id": "p03561", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03561/input.txt", "sample_output_relpath": "derived/input_output/data/p03561/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03561/Lua/s291009818.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s291009818", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2 1\n", "input_to_evaluate": "local k, n = io.read(\"*n\", \"*n\")\nlocal t = {}\n\nif k % 2 == 0 then\n table.insert(t, k / 2)\n for i = 1, n - 1 do table.insert(t, k) end\nelse\n local hk = (k + 1) / 2\n for i = 1, n do t[i] = hk end\n local decnum = math.ceil((n - 1) / 2)\n local curpos = n\n for i = 1, decnum do\n for j = curpos, 1, -1 do\n if 0 < t[j] then\n t[j] = t[j] - 1\n if t[j] ~= 0 then\n for s = j + 1, n do\n t[s] = k\n end\n curpos = n\n else\n curpos = curpos - 1\n end\n break\n end\n end\n end\n for i = 1, n do\n if t[i] == 0 then\n for j = i, n do\n table.remove(t)\n end\n break\n end\n end\nend\n\nprint(table.concat(t, \" \"))\n", "problem_context": "Score : 800 points\n\nProblem Statement\n\nIn Finite Encyclopedia of Integer Sequences (FEIS), all integer sequences of lengths between 1 and N (inclusive) consisting of integers between 1 and K (inclusive) are listed.\n\nLet the total number of sequences listed in FEIS be X. Among those sequences, find the (X/2)-th (rounded up to the nearest integer) lexicographically smallest one.\n\nConstraints\n\n1 \\leq N,K \\leq 3 × 10^5\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK N\n\nOutput\n\nPrint the (X/2)-th (rounded up to the nearest integer) lexicographically smallest sequence listed in FEIS, with spaces in between, where X is the total number of sequences listed in FEIS.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n2 1\n\nThere are 12 sequences listed in FEIS: (1),(1,1),(1,2),(1,3),(2),(2,1),(2,2),(2,3),(3),(3,1),(3,2),(3,3).\nThe (12/2 = 6)-th lexicographically smallest one among them is (2,1).\n\nSample Input 2\n\n2 4\n\nSample Output 2\n\n1 2 2 2\n\nSample Input 3\n\n5 14\n\nSample Output 3\n\n3 3 3 3 3 3 3 3 3 3 3 3 2 2", "sample_input": "3 2\n"}, "reference_outputs": ["2 1\n"], "source_document_id": "p03561", "source_text": "Score : 800 points\n\nProblem Statement\n\nIn Finite Encyclopedia of Integer Sequences (FEIS), all integer sequences of lengths between 1 and N (inclusive) consisting of integers between 1 and K (inclusive) are listed.\n\nLet the total number of sequences listed in FEIS be X. Among those sequences, find the (X/2)-th (rounded up to the nearest integer) lexicographically smallest one.\n\nConstraints\n\n1 \\leq N,K \\leq 3 × 10^5\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK N\n\nOutput\n\nPrint the (X/2)-th (rounded up to the nearest integer) lexicographically smallest sequence listed in FEIS, with spaces in between, where X is the total number of sequences listed in FEIS.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n2 1\n\nThere are 12 sequences listed in FEIS: (1),(1,1),(1,2),(1,3),(2),(2,1),(2,2),(2,3),(3),(3,1),(3,2),(3,3).\nThe (12/2 = 6)-th lexicographically smallest one among them is (2,1).\n\nSample Input 2\n\n2 4\n\nSample Output 2\n\n1 2 2 2\n\nSample Input 3\n\n5 14\n\nSample Output 3\n\n3 3 3 3 3 3 3 3 3 3 3 3 2 2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 716, "cpu_time_ms": 155, "memory_kb": 13048}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s552208694", "group_id": "codeNet:p03561", "input_text": "local k, n = io.read(\"*n\", \"*n\")\nlocal t = {}\n\nif k % 2 == 0 then\n table.insert(t, k / 2)\n for i = 1, n - 1 do table.insert(t, k) end\nelse\n local hk = (k + 1) / 2\n for i = 1, n do t[i] = hk end\n local decnum = math.ceil((n - 1) / 2)\n for i = 1, decnum do\n for j = n, 1, -1 do\n if 0 < t[j] then\n t[j] = t[j] - 1\n if t[j] ~= 0 then\n for s = j + 1, n do\n t[s] = k\n end\n end\n break\n end\n end\n end\n for i = 1, n do\n if t[i] == 0 then\n for j = i, n do\n table.remove(t)\n end\n break\n end\n end\nend\n\nprint(table.concat(t, \" \"))\n", "language": "Lua", "metadata": {"date": 1565977018, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03561.html", "problem_id": "p03561", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03561/input.txt", "sample_output_relpath": "derived/input_output/data/p03561/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03561/Lua/s552208694.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s552208694", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2 1\n", "input_to_evaluate": "local k, n = io.read(\"*n\", \"*n\")\nlocal t = {}\n\nif k % 2 == 0 then\n table.insert(t, k / 2)\n for i = 1, n - 1 do table.insert(t, k) end\nelse\n local hk = (k + 1) / 2\n for i = 1, n do t[i] = hk end\n local decnum = math.ceil((n - 1) / 2)\n for i = 1, decnum do\n for j = n, 1, -1 do\n if 0 < t[j] then\n t[j] = t[j] - 1\n if t[j] ~= 0 then\n for s = j + 1, n do\n t[s] = k\n end\n end\n break\n end\n end\n end\n for i = 1, n do\n if t[i] == 0 then\n for j = i, n do\n table.remove(t)\n end\n break\n end\n end\nend\n\nprint(table.concat(t, \" \"))\n", "problem_context": "Score : 800 points\n\nProblem Statement\n\nIn Finite Encyclopedia of Integer Sequences (FEIS), all integer sequences of lengths between 1 and N (inclusive) consisting of integers between 1 and K (inclusive) are listed.\n\nLet the total number of sequences listed in FEIS be X. Among those sequences, find the (X/2)-th (rounded up to the nearest integer) lexicographically smallest one.\n\nConstraints\n\n1 \\leq N,K \\leq 3 × 10^5\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK N\n\nOutput\n\nPrint the (X/2)-th (rounded up to the nearest integer) lexicographically smallest sequence listed in FEIS, with spaces in between, where X is the total number of sequences listed in FEIS.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n2 1\n\nThere are 12 sequences listed in FEIS: (1),(1,1),(1,2),(1,3),(2),(2,1),(2,2),(2,3),(3),(3,1),(3,2),(3,3).\nThe (12/2 = 6)-th lexicographically smallest one among them is (2,1).\n\nSample Input 2\n\n2 4\n\nSample Output 2\n\n1 2 2 2\n\nSample Input 3\n\n5 14\n\nSample Output 3\n\n3 3 3 3 3 3 3 3 3 3 3 3 2 2", "sample_input": "3 2\n"}, "reference_outputs": ["2 1\n"], "source_document_id": "p03561", "source_text": "Score : 800 points\n\nProblem Statement\n\nIn Finite Encyclopedia of Integer Sequences (FEIS), all integer sequences of lengths between 1 and N (inclusive) consisting of integers between 1 and K (inclusive) are listed.\n\nLet the total number of sequences listed in FEIS be X. Among those sequences, find the (X/2)-th (rounded up to the nearest integer) lexicographically smallest one.\n\nConstraints\n\n1 \\leq N,K \\leq 3 × 10^5\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK N\n\nOutput\n\nPrint the (X/2)-th (rounded up to the nearest integer) lexicographically smallest sequence listed in FEIS, with spaces in between, where X is the total number of sequences listed in FEIS.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n2 1\n\nThere are 12 sequences listed in FEIS: (1),(1,1),(1,2),(1,3),(2),(2,1),(2,2),(2,3),(3),(3,1),(3,2),(3,3).\nThe (12/2 = 6)-th lexicographically smallest one among them is (2,1).\n\nSample Input 2\n\n2 4\n\nSample Output 2\n\n1 2 2 2\n\nSample Input 3\n\n5 14\n\nSample Output 3\n\n3 3 3 3 3 3 3 3 3 3 3 3 2 2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 628, "cpu_time_ms": 2103, "memory_kb": 13048}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s940345486", "group_id": "codeNet:p03567", "input_text": "print(io.read():find(\"AC\")and\"Yes\"or\"No\")", "language": "Lua", "metadata": {"date": 1568866002, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03567.html", "problem_id": "p03567", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03567/input.txt", "sample_output_relpath": "derived/input_output/data/p03567/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03567/Lua/s940345486.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s940345486", "user_id": "u162773977"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "print(io.read():find(\"AC\")and\"Yes\"or\"No\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke built an online judge to hold a programming contest.\n\nWhen a program is submitted to the judge, the judge returns a verdict, which is a two-character string that appears in the string S as a contiguous substring.\n(The judge can return any two-character substring of S.)\n\nDetermine whether the judge can return the string AC as the verdict to a program.\n\nConstraints\n\n2 \\leq |S| \\leq 5\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf the judge can return the string AC as a verdict to a program, print Yes; if it cannot, print No.\n\nSample Input 1\n\nBACD\n\nSample Output 1\n\nYes\n\nThe string AC appears in BACD as a contiguous substring (the second and third characters).\n\nSample Input 2\n\nABCD\n\nSample Output 2\n\nNo\n\nAlthough the string ABCD contains both A and C (the first and third characters), the string AC does not appear in ABCD as a contiguous substring.\n\nSample Input 3\n\nCABD\n\nSample Output 3\n\nNo\n\nSample Input 4\n\nACACA\n\nSample Output 4\n\nYes\n\nSample Input 5\n\nXX\n\nSample Output 5\n\nNo", "sample_input": "BACD\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03567", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke built an online judge to hold a programming contest.\n\nWhen a program is submitted to the judge, the judge returns a verdict, which is a two-character string that appears in the string S as a contiguous substring.\n(The judge can return any two-character substring of S.)\n\nDetermine whether the judge can return the string AC as the verdict to a program.\n\nConstraints\n\n2 \\leq |S| \\leq 5\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf the judge can return the string AC as a verdict to a program, print Yes; if it cannot, print No.\n\nSample Input 1\n\nBACD\n\nSample Output 1\n\nYes\n\nThe string AC appears in BACD as a contiguous substring (the second and third characters).\n\nSample Input 2\n\nABCD\n\nSample Output 2\n\nNo\n\nAlthough the string ABCD contains both A and C (the first and third characters), the string AC does not appear in ABCD as a contiguous substring.\n\nSample Input 3\n\nCABD\n\nSample Output 3\n\nNo\n\nSample Input 4\n\nACACA\n\nSample Output 4\n\nYes\n\nSample Input 5\n\nXX\n\nSample Output 5\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 41, "cpu_time_ms": 8, "memory_kb": 756}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s907377897", "group_id": "codeNet:p03568", "input_text": "n=io.read(\"*n\",\"*l\")\nm=0\nfor i=1,n do\n x=io.read(\"*n\")\n if x%2==0 then\n m=m+1\n end\nend\nprint(math.floor(3^n-2^m))", "language": "Lua", "metadata": {"date": 1588474711, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s907377897.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s907377897", "user_id": "u045238009"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "n=io.read(\"*n\",\"*l\")\nm=0\nfor i=1,n do\n x=io.read(\"*n\")\n if x%2==0 then\n m=m+1\n end\nend\nprint(math.floor(3^n-2^m))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s816078529", "group_id": "codeNet:p03568", "input_text": "local n = io.read(\"*n\")\nlocal r = 1\nfor i = 1, n do\n r = r * 3\nend\nlocal odd = 1\nfor i = 1, n do\n local a = io.read(\"*n\")\n if a % 2 == 0 then\n odd = odd * 2\n end\nend\nprint(r - odd)\n", "language": "Lua", "metadata": {"date": 1572896178, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s816078529.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s816078529", "user_id": "u120582723"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal r = 1\nfor i = 1, n do\n r = r * 3\nend\nlocal odd = 1\nfor i = 1, n do\n local a = io.read(\"*n\")\n if a % 2 == 0 then\n odd = odd * 2\n end\nend\nprint(r - odd)\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 188, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s903057309", "group_id": "codeNet:p03573", "input_text": "print(io.read('n') ~ io.read('n') ~ io.read('n'))\n", "language": "Lua", "metadata": {"date": 1508036544, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03573.html", "problem_id": "p03573", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03573/input.txt", "sample_output_relpath": "derived/input_output/data/p03573/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03573/Lua/s903057309.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s903057309", "user_id": "u785421275"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "print(io.read('n') ~ io.read('n') ~ io.read('n'))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given three integers, A, B and C.\n\nAmong them, two are the same, but the remaining one is different from the rest.\n\nFor example, when A=5,B=7,C=5, A and C are the same, but B is different.\n\nFind the one that is different from the rest among the given three integers.\n\nConstraints\n\n-100 \\leq A,B,C \\leq 100\n\nA, B and C are integers.\n\nThe input satisfies the condition in the statement.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nAmong A, B and C, print the integer that is different from the rest.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\n7\n\nThis is the same case as the one in the statement.\n\nSample Input 2\n\n1 1 7\n\nSample Output 2\n\n7\n\nIn this case, C is the one we seek.\n\nSample Input 3\n\n-100 100 100\n\nSample Output 3\n\n-100", "sample_input": "5 7 5\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03573", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given three integers, A, B and C.\n\nAmong them, two are the same, but the remaining one is different from the rest.\n\nFor example, when A=5,B=7,C=5, A and C are the same, but B is different.\n\nFind the one that is different from the rest among the given three integers.\n\nConstraints\n\n-100 \\leq A,B,C \\leq 100\n\nA, B and C are integers.\n\nThe input satisfies the condition in the statement.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nAmong A, B and C, print the integer that is different from the rest.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\n7\n\nThis is the same case as the one in the statement.\n\nSample Input 2\n\n1 1 7\n\nSample Output 2\n\n7\n\nIn this case, C is the one we seek.\n\nSample Input 3\n\n-100 100 100\n\nSample Output 3\n\n-100", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 107, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s563450729", "group_id": "codeNet:p03575", "input_text": "local n,m=io.read(\"n\",\"n\")\nlocal a={}\nlocal b={}\nlocal visited={}\nlocal graph={}\nfor i=1,n do\n graph[i]={}\n for j=1,n do\n graph[i][j]=false\n end\nend\n\nlocal function dfs(x)\n visited[x]=true\n for y=1,n do\n if graph[x][y]==false then\n goto continue\n end\n if visited[y]==true then\n goto continue\n end\n dfs(y)\n ::continue::\n end\nend\n\nfor i=1,m do\n local x,y=io.read(\"n\",\"n\")\n a[i]=x\n b[i]=y\n graph[x][y]=true\n graph[y][x]=true\nend\n\nlocal counter=0\nfor i=1,m do\n graph[a[i]][b[i]]=false\n graph[b[i]][a[i]]=false\n for j=1,n do\n visited[j]=false\n end\n dfs(1)\n local bridge=false\n for j=1,n do\n if visited[j]==false then\n bridge=true\n end\n end\n if bridge==true then\n counter=counter+1\n end\n graph[a[i]][b[i]]=true\n graph[b[i]][a[i]]=true\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1593879345, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03575.html", "problem_id": "p03575", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03575/input.txt", "sample_output_relpath": "derived/input_output/data/p03575/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03575/Lua/s563450729.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s563450729", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local n,m=io.read(\"n\",\"n\")\nlocal a={}\nlocal b={}\nlocal visited={}\nlocal graph={}\nfor i=1,n do\n graph[i]={}\n for j=1,n do\n graph[i][j]=false\n end\nend\n\nlocal function dfs(x)\n visited[x]=true\n for y=1,n do\n if graph[x][y]==false then\n goto continue\n end\n if visited[y]==true then\n goto continue\n end\n dfs(y)\n ::continue::\n end\nend\n\nfor i=1,m do\n local x,y=io.read(\"n\",\"n\")\n a[i]=x\n b[i]=y\n graph[x][y]=true\n graph[y][x]=true\nend\n\nlocal counter=0\nfor i=1,m do\n graph[a[i]][b[i]]=false\n graph[b[i]][a[i]]=false\n for j=1,n do\n visited[j]=false\n end\n dfs(1)\n local bridge=false\n for j=1,n do\n if visited[j]==false then\n bridge=true\n end\n end\n if bridge==true then\n counter=counter+1\n end\n graph[a[i]][b[i]]=true\n graph[b[i]][a[i]]=true\nend\nprint(counter)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an undirected connected graph with N vertices and M edges that does not contain self-loops and double edges.\n\nThe i-th edge (1 \\leq i \\leq M) connects Vertex a_i and Vertex b_i.\n\nAn edge whose removal disconnects the graph is called a bridge.\n\nFind the number of the edges that are bridges among the M edges.\n\nNotes\n\nA self-loop is an edge i such that a_i=b_i (1 \\leq i \\leq M).\n\nDouble edges are a pair of edges i,j such that a_i=a_j and b_i=b_j (1 \\leq i dfn[p] then\n bridge_count = bridge_count + 1\n end\nend\n\nfor i = 1, n do if dfn[i] == nil then dfs(i, -1) end end\n\nprint(bridge_count)\n", "language": "Lua", "metadata": {"date": 1508035200, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03575.html", "problem_id": "p03575", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03575/input.txt", "sample_output_relpath": "derived/input_output/data/p03575/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03575/Lua/s444564956.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s444564956", "user_id": "u785421275"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "n, m = io.read('n'), io.read('n')\ne = {}\nfor i = 1, n do e[i] = {} end\nfor i = 1, m do\n local u, v = io.read('n'), io.read('n')\n e[u][#e[u] + 1] = v\n e[v][#e[v] + 1] = u\nend\n\ndfn, low = {}, {}\ntot = 0\nbridge_count = 0\n\ndfs = function (u, p)\n tot = tot + 1\n dfn[u] = tot\n low[u] = tot\n for _, v in ipairs(e[u]) do if v ~= p then\n if dfn[v] == nil then\n dfs(v, u)\n low[u] = math.min(low[u], low[v])\n else\n low[u] = math.min(low[u], dfn[v])\n end\n end end\n if p ~= -1 and low[u] > dfn[p] then\n bridge_count = bridge_count + 1\n end\nend\n\nfor i = 1, n do if dfn[i] == nil then dfs(i, -1) end end\n\nprint(bridge_count)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an undirected connected graph with N vertices and M edges that does not contain self-loops and double edges.\n\nThe i-th edge (1 \\leq i \\leq M) connects Vertex a_i and Vertex b_i.\n\nAn edge whose removal disconnects the graph is called a bridge.\n\nFind the number of the edges that are bridges among the M edges.\n\nNotes\n\nA self-loop is an edge i such that a_i=b_i (1 \\leq i \\leq M).\n\nDouble edges are a pair of edges i,j such that a_i=a_j and b_i=b_j (1 \\leq i= k then\n ans = math.min(ans, (rx[r] - rx[l]) * (ry[u] - ry[d]))\n end\n end\n end\n end\nend\n\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1508036508, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03576.html", "problem_id": "p03576", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03576/input.txt", "sample_output_relpath": "derived/input_output/data/p03576/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03576/Lua/s351227162.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s351227162", "user_id": "u785421275"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "n, k = io.read('n'), io.read('n')\nx, y = {}, {}\nfor i = 1, n do x[i], y[i] = io.read('n'), io.read('n') end\n\n-- Discretize\nrx, ry = {}, {}\nfor i = 1, n do rx[i], ry[i] = {x[i], i}, {y[i], i} end\npair_cmp = function (lhs, rhs) return lhs[1] < rhs[1] end\ntable.sort(rx, pair_cmp)\ntable.sort(ry, pair_cmp)\nfor i = 1, n do x[rx[i][2]], y[ry[i][2]] = i, i end\nfor i = 1, n do rx[i], ry[i] = rx[i][1], ry[i][1] end\n\n-- O(n^4)\n-- Prefix sum\np = {}\nfor i = 0, n do\n p[i] = {}\n for j = 0, n do p[i][j] = 0 end\nend\nfor i = 1, n do p[x[i]][y[i]] = 1 end\nfor i = 1, n do\n for j = 1, n do\n p[i][j] = p[i][j] + p[i - 1][j] + p[i][j - 1] - p[i - 1][j - 1]\n end\nend\n\n-- Iteration\nans = 1 << 62\nfor l = 1, n do\n for r = l + 1, n do\n for d = 1, n do\n for u = d + 1, n do\n if p[r][u] - p[l - 1][u] - p[r][d - 1] + p[l - 1][d - 1] >= k then\n ans = math.min(ans, (rx[r] - rx[l]) * (ry[u] - ry[d]))\n end\n end\n end\n end\nend\n\nprint(ans)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N points in a two-dimensional plane.\n\nThe coordinates of the i-th point (1 \\leq i \\leq N) are (x_i,y_i).\n\nLet us consider a rectangle whose sides are parallel to the coordinate axes that contains K or more of the N points in its interior.\n\nHere, points on the sides of the rectangle are considered to be in the interior.\n\nFind the minimum possible area of such a rectangle.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 50\n\n-10^9 \\leq x_i,y_i \\leq 10^9 (1 \\leq i \\leq N)\n\nx_i≠x_j (1 \\leq i x[l] then\n for u = 1, n do\n for d = 1, n do if y[u] > y[d] then\n local count = 0\n for i = 1, n do\n if x[i] >= x[l] and x[i] <= x[r] and\n y[i] >= y[d] and y[i] <= y[u]\n then\n count = count + 1\n end\n end\n if count >= k then\n ans = math.min(ans, (x[r] - x[l]) * (y[u] - y[d]))\n end\n end end\n end\n end end\nend\n\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1508035204, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03576.html", "problem_id": "p03576", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03576/input.txt", "sample_output_relpath": "derived/input_output/data/p03576/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03576/Lua/s485686857.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s485686857", "user_id": "u785421275"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "n, k = io.read('n'), io.read('n')\nx, y = {}, {}\nfor i = 1, n do x[i], y[i] = io.read('n'), io.read('n') end\n\nans = 1 << 62\n\nfor l = 1, n do\n for r = 1, n do if x[r] > x[l] then\n for u = 1, n do\n for d = 1, n do if y[u] > y[d] then\n local count = 0\n for i = 1, n do\n if x[i] >= x[l] and x[i] <= x[r] and\n y[i] >= y[d] and y[i] <= y[u]\n then\n count = count + 1\n end\n end\n if count >= k then\n ans = math.min(ans, (x[r] - x[l]) * (y[u] - y[d]))\n end\n end end\n end\n end end\nend\n\nprint(ans)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N points in a two-dimensional plane.\n\nThe coordinates of the i-th point (1 \\leq i \\leq N) are (x_i,y_i).\n\nLet us consider a rectangle whose sides are parallel to the coordinate axes that contains K or more of the N points in its interior.\n\nHere, points on the sides of the rectangle are considered to be in the interior.\n\nFind the minimum possible area of such a rectangle.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 50\n\n-10^9 \\leq x_i,y_i \\leq 10^9 (1 \\leq i \\leq N)\n\nx_i≠x_j (1 \\leq i0 and a%b==0 then\n local k=math.floor(a/b)\n print(i..\" \"..j..\" \"..k)\n os.exit()\n end\n end\nend", "language": "Lua", "metadata": {"date": 1594522255, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p03583.html", "problem_id": "p03583", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03583/input.txt", "sample_output_relpath": "derived/input_output/data/p03583/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03583/Lua/s578411267.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s578411267", "user_id": "u045238009"}, "prompt_components": {"gold_output": "1 2 2\n", "input_to_evaluate": "local n=io.read(\"n\")\nfor i=1,3500 do\n for j=1,3500 do\n local a=n*i*j\n local b=(4*i*j-n*j-n*i)\n if b>0 and a%b==0 then\n local k=math.floor(a/b)\n print(i..\" \"..j..\" \"..k)\n os.exit()\n end\n end\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFind a triple of positive integers h, n and w such that 4/N = 1/h + 1/n + 1/w.\n\nIf there are multiple solutions, any of them will be accepted.\n\nConstraints\n\nIt is guaranteed that, for the given integer N, there exists a solution such that h,n,w \\leq 3500.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutputs\n\nPrint a triple of positive integers h, n and w that satisfies the condition, in the following format:\n\nh n w\n\nSample Input 1\n\n2\n\nSample Output 1\n\n1 2 2\n\n4/2 = 1/1 + 1/2 + 1/2.\n\nSample Input 2\n\n3485\n\nSample Output 2\n\n872 1012974 1539173474040\n\nIt is allowed to use an integer exceeding 3500 in a solution.\n\nSample Input 3\n\n4664\n\nSample Output 3\n\n3498 3498 3498", "sample_input": "2\n"}, "reference_outputs": ["1 2 2\n"], "source_document_id": "p03583", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFind a triple of positive integers h, n and w such that 4/N = 1/h + 1/n + 1/w.\n\nIf there are multiple solutions, any of them will be accepted.\n\nConstraints\n\nIt is guaranteed that, for the given integer N, there exists a solution such that h,n,w \\leq 3500.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutputs\n\nPrint a triple of positive integers h, n and w that satisfies the condition, in the following format:\n\nh n w\n\nSample Input 1\n\n2\n\nSample Output 1\n\n1 2 2\n\n4/2 = 1/1 + 1/2 + 1/2.\n\nSample Input 2\n\n3485\n\nSample Output 2\n\n872 1012974 1539173474040\n\nIt is allowed to use an integer exceeding 3500 in a solution.\n\nSample Input 3\n\n4664\n\nSample Output 3\n\n3498 3498 3498", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 17, "memory_kb": 2784}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s897725105", "group_id": "codeNet:p03583", "input_text": "local n=io.read(\"n\")\nfor i=1,3500 do\n for j=1,3500 do\n local k=n*i*j/(4*i*j-n*j-n*i)\n if math.fmod(k,1)==0 and k>=0 then\n print(i,j,string.format(\"%d\",k))\n return\n end\n end\nend", "language": "Lua", "metadata": {"date": 1594521455, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03583.html", "problem_id": "p03583", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03583/input.txt", "sample_output_relpath": "derived/input_output/data/p03583/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03583/Lua/s897725105.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s897725105", "user_id": "u045238009"}, "prompt_components": {"gold_output": "1 2 2\n", "input_to_evaluate": "local n=io.read(\"n\")\nfor i=1,3500 do\n for j=1,3500 do\n local k=n*i*j/(4*i*j-n*j-n*i)\n if math.fmod(k,1)==0 and k>=0 then\n print(i,j,string.format(\"%d\",k))\n return\n end\n end\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFind a triple of positive integers h, n and w such that 4/N = 1/h + 1/n + 1/w.\n\nIf there are multiple solutions, any of them will be accepted.\n\nConstraints\n\nIt is guaranteed that, for the given integer N, there exists a solution such that h,n,w \\leq 3500.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutputs\n\nPrint a triple of positive integers h, n and w that satisfies the condition, in the following format:\n\nh n w\n\nSample Input 1\n\n2\n\nSample Output 1\n\n1 2 2\n\n4/2 = 1/1 + 1/2 + 1/2.\n\nSample Input 2\n\n3485\n\nSample Output 2\n\n872 1012974 1539173474040\n\nIt is allowed to use an integer exceeding 3500 in a solution.\n\nSample Input 3\n\n4664\n\nSample Output 3\n\n3498 3498 3498", "sample_input": "2\n"}, "reference_outputs": ["1 2 2\n"], "source_document_id": "p03583", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFind a triple of positive integers h, n and w such that 4/N = 1/h + 1/n + 1/w.\n\nIf there are multiple solutions, any of them will be accepted.\n\nConstraints\n\nIt is guaranteed that, for the given integer N, there exists a solution such that h,n,w \\leq 3500.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutputs\n\nPrint a triple of positive integers h, n and w that satisfies the condition, in the following format:\n\nh n w\n\nSample Input 1\n\n2\n\nSample Output 1\n\n1 2 2\n\n4/2 = 1/1 + 1/2 + 1/2.\n\nSample Input 2\n\n3485\n\nSample Output 2\n\n872 1012974 1539173474040\n\nIt is allowed to use an integer exceeding 3500 in a solution.\n\nSample Input 3\n\n4664\n\nSample Output 3\n\n3498 3498 3498", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 911, "memory_kb": 2880}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s793527219", "group_id": "codeNet:p03584", "input_text": "local mfl = math.floor\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal as, bs = {}, {}\nlocal kdigs = {}\ndo\n local tk = k\n for i = 1, 32 do\n kdigs[i] = tk % 2\n tk = mfl(tk / 2)\n end\nend\nlocal klim = 1\nfor i = 32, 1, -1 do\n if kdigs[i] == 1 then\n klim = i\n break\n end\nend\n\nlocal digs = {}\nlocal maxdig = {}\nfor i = 1, n do\n digs[i] = {}\n local a = io.read(\"*n\")\n bs[i] = io.read(\"*n\")\n for j = 1, 32 do\n digs[i][j] = a % 2\n a = mfl(a / 2)\n end\n maxdig[i] = 1\n for j = 32, 1, -1 do\n if digs[i][j] == 1 then\n maxdig[i] = j\n break\n end\n end\nend\n\nlocal ret = 0\nlocal mma = math.max\nfor lim = 0, klim do\n if lim == 0 or kdigs[lim] == 1 then\n local score = 0\n for i = 1, n do\n local isok = maxdig[i] <= klim\n for dig = 1, klim do\n if dig < lim then\n -- nothing\n elseif dig == lim then\n if digs[i][dig] == 1 then isok = false break end\n else\n if kdigs[dig] < digs[i][dig] then isok = false break end\n end\n end\n if isok then score = score + bs[i] end\n end\n ret = mma(ret, score)\n end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1569851240, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03584.html", "problem_id": "p03584", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03584/input.txt", "sample_output_relpath": "derived/input_output/data/p03584/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03584/Lua/s793527219.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s793527219", "user_id": "u120582723"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "local mfl = math.floor\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal as, bs = {}, {}\nlocal kdigs = {}\ndo\n local tk = k\n for i = 1, 32 do\n kdigs[i] = tk % 2\n tk = mfl(tk / 2)\n end\nend\nlocal klim = 1\nfor i = 32, 1, -1 do\n if kdigs[i] == 1 then\n klim = i\n break\n end\nend\n\nlocal digs = {}\nlocal maxdig = {}\nfor i = 1, n do\n digs[i] = {}\n local a = io.read(\"*n\")\n bs[i] = io.read(\"*n\")\n for j = 1, 32 do\n digs[i][j] = a % 2\n a = mfl(a / 2)\n end\n maxdig[i] = 1\n for j = 32, 1, -1 do\n if digs[i][j] == 1 then\n maxdig[i] = j\n break\n end\n end\nend\n\nlocal ret = 0\nlocal mma = math.max\nfor lim = 0, klim do\n if lim == 0 or kdigs[lim] == 1 then\n local score = 0\n for i = 1, n do\n local isok = maxdig[i] <= klim\n for dig = 1, klim do\n if dig < lim then\n -- nothing\n elseif dig == lim then\n if digs[i][dig] == 1 then isok = false break end\n else\n if kdigs[dig] < digs[i][dig] then isok = false break end\n end\n end\n if isok then score = score + bs[i] end\n end\n ret = mma(ret, score)\n end\nend\nprint(ret)\n", "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": "p03584", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 557, "memory_kb": 33896}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s896392028", "group_id": "codeNet:p03588", "input_text": "local n = io.read(\"*n\")\nlocal amax, ret = 0, 0\nfor i = 1, n do\n local a, b = io.read(\"*n\", \"*n\")\n if amax < a then\n ret = a + b\n amax = a\n end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1573821222, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s896392028.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s896392028", "user_id": "u120582723"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal amax, ret = 0, 0\nfor i = 1, n do\n local a, b = io.read(\"*n\", \"*n\")\n if amax < a then\n ret = a + b\n amax = a\n end\nend\nprint(ret)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA group of people played a game. All players had distinct scores, which are positive integers.\n\nTakahashi knows N facts on the players' scores. The i-th fact is as follows: the A_i-th highest score among the players is B_i.\n\nFind the maximum possible number of players in the game.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\n0 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\nIf i ≠ j, A_i ≠ A_j.\n\nThere exists a possible outcome of the game that are consistent with the facts.\n\nAll input values are integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_N B_N\n\nOutputs\n\nPrint the maximum possible number of players in the game.\n\nSample Input 1\n\n3\n4 7\n2 9\n6 2\n\nSample Output 1\n\n8\n\nThe maximum possible number of players is achieved when, for example, the players have the following scores: 12,9,8,7,5,2,1,0.\n\nSample Input 2\n\n5\n1 10\n3 6\n5 2\n4 4\n2 8\n\nSample Output 2\n\n7\n\nSample Input 3\n\n2\n1 1000000000\n1000000000 1\n\nSample Output 3\n\n1000000001", "sample_input": "3\n4 7\n2 9\n6 2\n"}, "reference_outputs": ["8\n"], "source_document_id": "p03588", "source_text": "Score : 200 points\n\nProblem Statement\n\nA group of people played a game. All players had distinct scores, which are positive integers.\n\nTakahashi knows N facts on the players' scores. The i-th fact is as follows: the A_i-th highest score among the players is B_i.\n\nFind the maximum possible number of players in the game.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\n0 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\nIf i ≠ j, A_i ≠ A_j.\n\nThere exists a possible outcome of the game that are consistent with the facts.\n\nAll input values are integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_N B_N\n\nOutputs\n\nPrint the maximum possible number of players in the game.\n\nSample Input 1\n\n3\n4 7\n2 9\n6 2\n\nSample Output 1\n\n8\n\nThe maximum possible number of players is achieved when, for example, the players have the following scores: 12,9,8,7,5,2,1,0.\n\nSample Input 2\n\n5\n1 10\n3 6\n5 2\n4 4\n2 8\n\nSample Output 2\n\n7\n\nSample Input 3\n\n2\n1 1000000000\n1000000000 1\n\nSample Output 3\n\n1000000001", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 45, "memory_kb": 376}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s237513760", "group_id": "codeNet:p03592", "input_text": "local n, m, k = io.read(\"*n\", \"*n\", \"*n\")\nfor i = 0, n do\n for j = 0, m do\n if k == i * (m - j) + (n - i) * j then\n print(\"Yes\") os.exit()\n end\n end\nend\nprint(\"No\")", "language": "Lua", "metadata": {"date": 1597620522, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s237513760.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s237513760", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local n, m, k = io.read(\"*n\", \"*n\", \"*n\")\nfor i = 0, n do\n for j = 0, m do\n if k == i * (m - j) + (n - i) * j then\n print(\"Yes\") os.exit()\n end\n end\nend\nprint(\"No\")", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 50, "memory_kb": 2620}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s929295948", "group_id": "codeNet:p03593", "input_text": "local h,w=io.read(\"n\",\"n\",\"l\")\nlocal map={}\nfor i=1,h do\n local s=io.read()\n for j=1,w do\n local a=s:sub(j,j)\n map[a]=(map[a] or 0)+1\n end\nend\n\nlocal g1=(h%2)*(w%2)\nlocal g2=(h%2)*(w//2)+(w%2)*(h//2)\nlocal g4=(h*w-2*g2-g1)//4\n\nwhile g1>0 do\n for k,v in pairs(map) do\n if g1==0 then\n break\n end\n if ( v%4==1 or v%4==3 ) and v>0 then\n map[k]=map[k]-1\n g1=g1-1\n end\n end\nend\n\nwhile g2>0 do\n for k,v in pairs(map) do\n if g2==0 then\n break\n end\n if v%4==2 and v>0 then\n map[k]=map[k]-2\n g2=g2-1\n end\n end\nend\n\nwhile g4>0 do\n for k,v in pairs(map) do\n if g4==0 then\n break\n end\n if v%4==0 and v>0 then\n map[k]=map[k]-4\n g4=g4-1\n end\n end\nend\n\nlocal checker=true\nfor k,v in pairs(map) do\n if v~=0 then\n checker=false\n end\nend\nprint(checker and \"Yes\" or \"No\")", "language": "Lua", "metadata": {"date": 1596855931, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s929295948.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s929295948", "user_id": "u045238009"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local h,w=io.read(\"n\",\"n\",\"l\")\nlocal map={}\nfor i=1,h do\n local s=io.read()\n for j=1,w do\n local a=s:sub(j,j)\n map[a]=(map[a] or 0)+1\n end\nend\n\nlocal g1=(h%2)*(w%2)\nlocal g2=(h%2)*(w//2)+(w%2)*(h//2)\nlocal g4=(h*w-2*g2-g1)//4\n\nwhile g1>0 do\n for k,v in pairs(map) do\n if g1==0 then\n break\n end\n if ( v%4==1 or v%4==3 ) and v>0 then\n map[k]=map[k]-1\n g1=g1-1\n end\n end\nend\n\nwhile g2>0 do\n for k,v in pairs(map) do\n if g2==0 then\n break\n end\n if v%4==2 and v>0 then\n map[k]=map[k]-2\n g2=g2-1\n end\n end\nend\n\nwhile g4>0 do\n for k,v in pairs(map) do\n if g4==0 then\n break\n end\n if v%4==0 and v>0 then\n map[k]=map[k]-4\n g4=g4-1\n end\n end\nend\n\nlocal checker=true\nfor k,v in pairs(map) do\n if v~=0 then\n checker=false\n end\nend\nprint(checker and \"Yes\" or \"No\")", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2205, "memory_kb": 2672}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s111829375", "group_id": "codeNet:p03593", "input_text": "local h,w=io.read(\"n\",\"n\",\"l\")\nlocal map={}\nfor i=1,h do\n local s=io.read()\n for j=1,w do\n local a=s:sub(j,j)\n map[a]=((map[a] or 0)+1)\n map[a]=map[a]%4\n end\nend\n\nlocal g1=(h%2)*(w%2)\nlocal g2=(h%2)*(w//2)+(w%2)*(h//2)\nlocal g4=(h*w-2*g2-g1)//4\n\nfor i=1,g1 do\n for k,v in pairs(map) do\n if v==1 or v==3 then\n map[k]=\"checked\"\n g1=g1-1\n break\n end\n end\nend\n\nfor i=1,g2 do\n for k,v in pairs(map) do\n if v==2 then\n map[k]=\"checked\"\n g2=g2-1\n break\n end\n end\nend\n\nfor i=1,g4 do\n for k,v in pairs(map) do\n if v==0 then\n map[k]=\"checked\"\n g4=g4-1\n break\n end\n end\nend\n\nlocal checker=(g1==0 and g2==0 and g4==0)\nprint(checker and \"Yes\" or \"No\")", "language": "Lua", "metadata": {"date": 1596854131, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s111829375.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s111829375", "user_id": "u045238009"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local h,w=io.read(\"n\",\"n\",\"l\")\nlocal map={}\nfor i=1,h do\n local s=io.read()\n for j=1,w do\n local a=s:sub(j,j)\n map[a]=((map[a] or 0)+1)\n map[a]=map[a]%4\n end\nend\n\nlocal g1=(h%2)*(w%2)\nlocal g2=(h%2)*(w//2)+(w%2)*(h//2)\nlocal g4=(h*w-2*g2-g1)//4\n\nfor i=1,g1 do\n for k,v in pairs(map) do\n if v==1 or v==3 then\n map[k]=\"checked\"\n g1=g1-1\n break\n end\n end\nend\n\nfor i=1,g2 do\n for k,v in pairs(map) do\n if v==2 then\n map[k]=\"checked\"\n g2=g2-1\n break\n end\n end\nend\n\nfor i=1,g4 do\n for k,v in pairs(map) do\n if v==0 then\n map[k]=\"checked\"\n g4=g4-1\n break\n end\n end\nend\n\nlocal checker=(g1==0 and g2==0 and g4==0)\nprint(checker and \"Yes\" or \"No\")", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 16, "memory_kb": 2672}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s814905382", "group_id": "codeNet:p03593", "input_text": "local h, w = io.read(\"*n\", \"*n\", \"*l\")\nlocal words = {}\nfor i = 1, h do\n local str = io.read()\n for j = 1, w do\n local sstr = str:sub(j, j)\n if not words[sstr] then words[sstr] = 1 else words[sstr] = words[sstr] + 1 end\n end\nend\nlocal a, b = 0, 0\nfor k, v in pairs(words) do\n if v % 2 == 1 then\n if b == 0 then\n b = v\n else\n b = -1\n end\n elseif v % 4 == 2 then\n a = a + 1\n end\nend\n\nif h % 2 == 0 and w % 2 == 0 then\n if a == 0 and b == 0 then\n print(\"Yes\")\n else\n print(\"No\")\n end\nelseif h % 2 == 1 and w % 2 == 1 then\n if 0 < b then\n if (b - 1) % 4 == 2 then\n a = a + 1\n end\n local hh, hw = (h - 1) // 2, (w - 1) // 2\n if a <= hh + hw then\n print(\"Yes\")\n else\n print(\"No\")\n end\n else\n print(\"No\")\n end\nelse\n if b ~= 0 then\n print(\"No\")\n else\n if h % 2 == 1 then h, w = w, h end\n local hh = h // 2\n if a <= hh then\n print(\"Yes\")\n else\n print(\"No\")\n end\n end\nend\n", "language": "Lua", "metadata": {"date": 1564962504, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s814905382.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s814905382", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local h, w = io.read(\"*n\", \"*n\", \"*l\")\nlocal words = {}\nfor i = 1, h do\n local str = io.read()\n for j = 1, w do\n local sstr = str:sub(j, j)\n if not words[sstr] then words[sstr] = 1 else words[sstr] = words[sstr] + 1 end\n end\nend\nlocal a, b = 0, 0\nfor k, v in pairs(words) do\n if v % 2 == 1 then\n if b == 0 then\n b = v\n else\n b = -1\n end\n elseif v % 4 == 2 then\n a = a + 1\n end\nend\n\nif h % 2 == 0 and w % 2 == 0 then\n if a == 0 and b == 0 then\n print(\"Yes\")\n else\n print(\"No\")\n end\nelseif h % 2 == 1 and w % 2 == 1 then\n if 0 < b then\n if (b - 1) % 4 == 2 then\n a = a + 1\n end\n local hh, hw = (h - 1) // 2, (w - 1) // 2\n if a <= hh + hw then\n print(\"Yes\")\n else\n print(\"No\")\n end\n else\n print(\"No\")\n end\nelse\n if b ~= 0 then\n print(\"No\")\n else\n if h % 2 == 1 then h, w = w, h end\n local hh = h // 2\n if a <= hh then\n print(\"Yes\")\n else\n print(\"No\")\n end\n end\nend\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s118436519", "group_id": "codeNet:p03597", "input_text": "a, b, c=io.read(\"*n\", \"*n\", \"*n\")\nprint(b ..c ..a)", "language": "Lua", "metadata": {"date": 1586050160, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03597.html", "problem_id": "p03597", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03597/input.txt", "sample_output_relpath": "derived/input_output/data/p03597/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03597/Lua/s118436519.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s118436519", "user_id": "u936678048"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "a, b, c=io.read(\"*n\", \"*n\", \"*n\")\nprint(b ..c ..a)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have an N \\times N square grid.\n\nWe will paint each square in the grid either black or white.\n\nIf we paint exactly A squares white, how many squares will be painted black?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq A \\leq N^2\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA\n\nOutputs\n\nPrint the number of squares that will be painted black.\n\nSample Input 1\n\n3\n4\n\nSample Output 1\n\n5\n\nThere are nine squares in a 3 \\times 3 square grid.\nFour of them will be painted white, so the remaining five squares will be painted black.\n\nSample Input 2\n\n19\n100\n\nSample Output 2\n\n261\n\nSample Input 3\n\n10\n0\n\nSample Output 3\n\n100\n\nAs zero squares will be painted white, all the squares will be painted black.", "sample_input": "3\n4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03597", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have an N \\times N square grid.\n\nWe will paint each square in the grid either black or white.\n\nIf we paint exactly A squares white, how many squares will be painted black?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq A \\leq N^2\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA\n\nOutputs\n\nPrint the number of squares that will be painted black.\n\nSample Input 1\n\n3\n4\n\nSample Output 1\n\n5\n\nThere are nine squares in a 3 \\times 3 square grid.\nFour of them will be painted white, so the remaining five squares will be painted black.\n\nSample Input 2\n\n19\n100\n\nSample Output 2\n\n261\n\nSample Input 3\n\n10\n0\n\nSample Output 3\n\n100\n\nAs zero squares will be painted white, all the squares will be painted black.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s925495139", "group_id": "codeNet:p03597", "input_text": "print(math.floor(io.read()^2-io.read()))", "language": "Lua", "metadata": {"date": 1551836529, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03597.html", "problem_id": "p03597", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03597/input.txt", "sample_output_relpath": "derived/input_output/data/p03597/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03597/Lua/s925495139.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s925495139", "user_id": "u837412668"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "print(math.floor(io.read()^2-io.read()))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have an N \\times N square grid.\n\nWe will paint each square in the grid either black or white.\n\nIf we paint exactly A squares white, how many squares will be painted black?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq A \\leq N^2\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA\n\nOutputs\n\nPrint the number of squares that will be painted black.\n\nSample Input 1\n\n3\n4\n\nSample Output 1\n\n5\n\nThere are nine squares in a 3 \\times 3 square grid.\nFour of them will be painted white, so the remaining five squares will be painted black.\n\nSample Input 2\n\n19\n100\n\nSample Output 2\n\n261\n\nSample Input 3\n\n10\n0\n\nSample Output 3\n\n100\n\nAs zero squares will be painted white, all the squares will be painted black.", "sample_input": "3\n4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03597", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have an N \\times N square grid.\n\nWe will paint each square in the grid either black or white.\n\nIf we paint exactly A squares white, how many squares will be painted black?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq A \\leq N^2\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA\n\nOutputs\n\nPrint the number of squares that will be painted black.\n\nSample Input 1\n\n3\n4\n\nSample Output 1\n\n5\n\nThere are nine squares in a 3 \\times 3 square grid.\nFour of them will be painted white, so the remaining five squares will be painted black.\n\nSample Input 2\n\n19\n100\n\nSample Output 2\n\n261\n\nSample Input 3\n\n10\n0\n\nSample Output 3\n\n100\n\nAs zero squares will be painted white, all the squares will be painted black.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 40, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s188597463", "group_id": "codeNet:p03598", "input_text": "local n, k = io.read(\"*n\", \"*n\")\nlocal sum = 0\nfor i = 1, n do\n local a = io.read(\"*n\")\n sum = sum + 2 * math.min(a, math.abs(a - k))\nend\nprint(sum)\n", "language": "Lua", "metadata": {"date": 1581084439, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s188597463.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s188597463", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local n, k = io.read(\"*n\", \"*n\")\nlocal sum = 0\nfor i = 1, n do\n local a = io.read(\"*n\")\n sum = sum + 2 * math.min(a, math.abs(a - k))\nend\nprint(sum)\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 151, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s980749179", "group_id": "codeNet:p03600", "input_text": "local n=io.read(\"n\")\nlocal a={}\nfor i=1,n do\n a[i]={}\n for j=1,n do\n a[i][j]=io.read(\"n\")\n end\nend\n\nlocal d={}\nfor i=1,n do\n d[i]={}\nend\n\nfor k=1,n do\n for i=1,n do\n for j=1,n do\n if a[i][j]>a[i][k]+a[k][j] then\n print(-1)\n return\n elseif a[i][j]==a[i][k]+a[k][j] and a[i][k]>0 and a[k][j]>0 then\n d[i][j]=true\n end\n end\n end\nend\n\nlocal total=0\nfor i=1,n do\n for j=1,i do\n total=total+(not d[i][j] and a[i][j] or 0)\n end\nend\nprint(total)", "language": "Lua", "metadata": {"date": 1598928745, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p03600.html", "problem_id": "p03600", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03600/input.txt", "sample_output_relpath": "derived/input_output/data/p03600/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03600/Lua/s980749179.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s980749179", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal a={}\nfor i=1,n do\n a[i]={}\n for j=1,n do\n a[i][j]=io.read(\"n\")\n end\nend\n\nlocal d={}\nfor i=1,n do\n d[i]={}\nend\n\nfor k=1,n do\n for i=1,n do\n for j=1,n do\n if a[i][j]>a[i][k]+a[k][j] then\n print(-1)\n return\n elseif a[i][j]==a[i][k]+a[k][j] and a[i][k]>0 and a[k][j]>0 then\n d[i][j]=true\n end\n end\n end\nend\n\nlocal total=0\nfor i=1,n do\n for j=1,i do\n total=total+(not d[i][j] and a[i][j] or 0)\n end\nend\nprint(total)", "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": "p03600", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 567, "cpu_time_ms": 258, "memory_kb": 5248}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s110844337", "group_id": "codeNet:p03603", "input_text": "local n = io.read(\"*n\")\nlocal p = {0}\nfor i = 2, n do\n p[i] = io.read(\"*n\")\nend\nlocal base = {}\nlocal t = {}\nlocal x = {}\nfor i = 1, n do\n base[i] = 0\n t[i] = {}\n x[i] = io.read(\"*n\")\nend\nlocal valid = true\nfor i = n, 1, -1 do\n local tgt = x[i] - base[i]\n if tgt < 0 then\n valid = false\n break\n end\n -- get highest value y where dp[y] == true\n local dp = {}\n for j = 1, tgt do\n dp[j] = false\n end\n local sum = base[i]\n for j = 1, #t[i] do\n local tv = t[i][j]\n sum = sum + tv\n for k = tgt - tv, 1, -1 do\n if dp[k] then dp[k + tv] = true end\n end\n if tv <= tgt then dp[tv] = true end\n end\n local r = 0\n for j = tgt, 1, -1 do\n if dp[j] then r = j break end\n end\n if 1 < i then\n local v1 = x[i] -- base[i] + r <= x[i]. \"bese[i] + r\" became x[i].\n local v2 = sum - base[i] - r\n local parent = p[i]\n if v2 < v1 then v1, v2 = v2, v1 end\n base[parent] = base[parent] + v1\n if v1 < v2 then table.insert(t[parent], v2 - v1) end\n end\nend\nprint(valid and \"POSSIBLE\" or \"IMPOSSIBLE\")\n", "language": "Lua", "metadata": {"date": 1586221816, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03603.html", "problem_id": "p03603", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03603/input.txt", "sample_output_relpath": "derived/input_output/data/p03603/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03603/Lua/s110844337.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s110844337", "user_id": "u120582723"}, "prompt_components": {"gold_output": "POSSIBLE\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal p = {0}\nfor i = 2, n do\n p[i] = io.read(\"*n\")\nend\nlocal base = {}\nlocal t = {}\nlocal x = {}\nfor i = 1, n do\n base[i] = 0\n t[i] = {}\n x[i] = io.read(\"*n\")\nend\nlocal valid = true\nfor i = n, 1, -1 do\n local tgt = x[i] - base[i]\n if tgt < 0 then\n valid = false\n break\n end\n -- get highest value y where dp[y] == true\n local dp = {}\n for j = 1, tgt do\n dp[j] = false\n end\n local sum = base[i]\n for j = 1, #t[i] do\n local tv = t[i][j]\n sum = sum + tv\n for k = tgt - tv, 1, -1 do\n if dp[k] then dp[k + tv] = true end\n end\n if tv <= tgt then dp[tv] = true end\n end\n local r = 0\n for j = tgt, 1, -1 do\n if dp[j] then r = j break end\n end\n if 1 < i then\n local v1 = x[i] -- base[i] + r <= x[i]. \"bese[i] + r\" became x[i].\n local v2 = sum - base[i] - r\n local parent = p[i]\n if v2 < v1 then v1, v2 = v2, v1 end\n base[parent] = base[parent] + v1\n if v1 < v2 then table.insert(t[parent], v2 - v1) end\n end\nend\nprint(valid and \"POSSIBLE\" or \"IMPOSSIBLE\")\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nWe have a tree with N vertices. Vertex 1 is the root of the tree, and the parent of Vertex i (2 \\leq i \\leq N) is Vertex P_i.\n\nTo each vertex in the tree, Snuke will allocate a color, either black or white, and a non-negative integer weight.\n\nSnuke has a favorite integer sequence, X_1, X_2, ..., X_N, so he wants to allocate colors and weights so that the following condition is satisfied for all v.\n\nThe total weight of the vertices with the same color as v among the vertices contained in the subtree whose root is v, is X_v.\n\nHere, the subtree whose root is v is the tree consisting of Vertex v and all of its descendants.\n\nDetermine whether it is possible to allocate colors and weights in this way.\n\nConstraints\n\n1 \\leq N \\leq 1 000\n\n1 \\leq P_i \\leq i - 1\n\n0 \\leq X_i \\leq 5 000\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nP_2 P_3 ... P_N\nX_1 X_2 ... X_N\n\nOutputs\n\nIf it is possible to allocate colors and weights to the vertices so that the condition is satisfied, print POSSIBLE; otherwise, print IMPOSSIBLE.\n\nSample Input 1\n\n3\n1 1\n4 3 2\n\nSample Output 1\n\nPOSSIBLE\n\nFor example, the following allocation satisfies the condition:\n\nSet the color of Vertex 1 to white and its weight to 2.\n\nSet the color of Vertex 2 to black and its weight to 3.\n\nSet the color of Vertex 3 to white and its weight to 2.\n\nThere are also other possible allocations.\n\nSample Input 2\n\n3\n1 2\n1 2 3\n\nSample Output 2\n\nIMPOSSIBLE\n\nIf the same color is allocated to Vertex 2 and Vertex 3, Vertex 2 cannot be allocated a non-negative weight.\n\nIf different colors are allocated to Vertex 2 and 3, no matter which color is allocated to Vertex 1, it cannot be allocated a non-negative weight.\n\nThus, there exists no allocation of colors and weights that satisfies the condition.\n\nSample Input 3\n\n8\n1 1 1 3 4 5 5\n4 1 6 2 2 1 3 3\n\nSample Output 3\n\nPOSSIBLE\n\nSample Input 4\n\n1\n\n0\n\nSample Output 4\n\nPOSSIBLE", "sample_input": "3\n1 1\n4 3 2\n"}, "reference_outputs": ["POSSIBLE\n"], "source_document_id": "p03603", "source_text": "Score : 700 points\n\nProblem Statement\n\nWe have a tree with N vertices. Vertex 1 is the root of the tree, and the parent of Vertex i (2 \\leq i \\leq N) is Vertex P_i.\n\nTo each vertex in the tree, Snuke will allocate a color, either black or white, and a non-negative integer weight.\n\nSnuke has a favorite integer sequence, X_1, X_2, ..., X_N, so he wants to allocate colors and weights so that the following condition is satisfied for all v.\n\nThe total weight of the vertices with the same color as v among the vertices contained in the subtree whose root is v, is X_v.\n\nHere, the subtree whose root is v is the tree consisting of Vertex v and all of its descendants.\n\nDetermine whether it is possible to allocate colors and weights in this way.\n\nConstraints\n\n1 \\leq N \\leq 1 000\n\n1 \\leq P_i \\leq i - 1\n\n0 \\leq X_i \\leq 5 000\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nP_2 P_3 ... P_N\nX_1 X_2 ... X_N\n\nOutputs\n\nIf it is possible to allocate colors and weights to the vertices so that the condition is satisfied, print POSSIBLE; otherwise, print IMPOSSIBLE.\n\nSample Input 1\n\n3\n1 1\n4 3 2\n\nSample Output 1\n\nPOSSIBLE\n\nFor example, the following allocation satisfies the condition:\n\nSet the color of Vertex 1 to white and its weight to 2.\n\nSet the color of Vertex 2 to black and its weight to 3.\n\nSet the color of Vertex 3 to white and its weight to 2.\n\nThere are also other possible allocations.\n\nSample Input 2\n\n3\n1 2\n1 2 3\n\nSample Output 2\n\nIMPOSSIBLE\n\nIf the same color is allocated to Vertex 2 and Vertex 3, Vertex 2 cannot be allocated a non-negative weight.\n\nIf different colors are allocated to Vertex 2 and 3, no matter which color is allocated to Vertex 1, it cannot be allocated a non-negative weight.\n\nThus, there exists no allocation of colors and weights that satisfies the condition.\n\nSample Input 3\n\n8\n1 1 1 3 4 5 5\n4 1 6 2 2 1 3 3\n\nSample Output 3\n\nPOSSIBLE\n\nSample Input 4\n\n1\n\n0\n\nSample Output 4\n\nPOSSIBLE", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1040, "cpu_time_ms": 10, "memory_kb": 1704}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s024199687", "group_id": "codeNet:p03605", "input_text": "local n=io.read(\"*n\")\nlocal t = n / 10\nlocal o = n % 10\n\nif t == 9 or o == 9 then\n print(\"Yes\")\nelse\n print(\"No\")\nend", "language": "Lua", "metadata": {"date": 1565561919, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s024199687.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s024199687", "user_id": "u318027064"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local n=io.read(\"*n\")\nlocal t = n / 10\nlocal o = n % 10\n\nif t == 9 or o == 9 then\n print(\"Yes\")\nelse\n print(\"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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 123, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s047571484", "group_id": "codeNet:p03605", "input_text": "print(io.read():match(\"9\")==nil and\"No\"or\"Yes\")", "language": "Lua", "metadata": {"date": 1551836405, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s047571484.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s047571484", "user_id": "u837412668"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "print(io.read():match(\"9\")==nil and\"No\"or\"Yes\")", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 47, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s380358674", "group_id": "codeNet:p03605", "input_text": "print(io.read():match(\"9\")==nil and\"No\"or\"Yes\")", "language": "Lua", "metadata": {"date": 1551836377, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s380358674.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s380358674", "user_id": "u837412668"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "print(io.read():match(\"9\")==nil and\"No\"or\"Yes\")", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 47, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s647458574", "group_id": "codeNet:p03607", "input_text": "n=io.read(\"*n\")\na={}\nfor i=1,n do\n number=io.read(\"*n\")\n if not a[number] then\n a[number]=1\n else\n a[number]=0\n end\nend\n\ncounter=0\nfor _,v in pairs(a) do\n counter=counter+v\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1589151643, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s647458574.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s647458574", "user_id": "u045238009"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "n=io.read(\"*n\")\na={}\nfor i=1,n do\n number=io.read(\"*n\")\n if not a[number] then\n a[number]=1\n else\n a[number]=0\n end\nend\n\ncounter=0\nfor _,v in pairs(a) do\n counter=counter+v\nend\nprint(counter)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 74, "memory_kb": 6508}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s861487850", "group_id": "codeNet:p03608", "input_text": "local mmi, mma = math.min, math.max\nlocal mfl, mce = math.floor, math.ceil\nlocal n, m, r = io.read(\"*n\", \"*n\", \"*n\")\nlocal t = {}\nfor i = 1, r do\n t[i] = io.read(\"*n\")\nend\nlocal inf = 1000000007 * 1000\nlocal len = {}\nfor i = 1, n do\n len[i] = {}\n for j = 1, n do\n len[i][j] = i == j and 0 or inf\n end\nend\nfor i = 1, m do\n local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n len[a][b], len[b][a] = c, c\nend\nfor k = 1, n do\n for i = 1, n do\n for j = 1, n do\n len[i][j] = mmi(len[i][j], len[i][k] + len[k][j])\n end\n end\nend\n\nlocal function getpattern(n, patall, idx)\n local used = {}\n local retary = {}\n local div = patall\n for i = 1, n do used[i] = false end\n for i = n, 1, -1 do\n div = mfl(div / i)\n local v_idx = mfl(idx / div)\n idx = idx % div\n local tmp_idx = 0\n for j = 1, n do\n if not used[j] then\n if tmp_idx == v_idx then\n table.insert(retary, j)\n used[j] = true\n break\n else\n tmp_idx = tmp_idx + 1\n end\n end\n end\n end\n return retary\nend\nlocal tot = 1\nfor i = 1, r do\n tot = tot * i\nend\nlocal ret = inf\nfor i = 0, tot - 1 do\n local pat = getpattern(r, tot, i)\n local z = 0\n for i = 1, r - 1 do\n z = z + len[t[pat[i]]][t[pat[i + 1]]]\n end\n if z < ret then ret = z end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1601347969, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s861487850.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s861487850", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal mfl, mce = math.floor, math.ceil\nlocal n, m, r = io.read(\"*n\", \"*n\", \"*n\")\nlocal t = {}\nfor i = 1, r do\n t[i] = io.read(\"*n\")\nend\nlocal inf = 1000000007 * 1000\nlocal len = {}\nfor i = 1, n do\n len[i] = {}\n for j = 1, n do\n len[i][j] = i == j and 0 or inf\n end\nend\nfor i = 1, m do\n local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n len[a][b], len[b][a] = c, c\nend\nfor k = 1, n do\n for i = 1, n do\n for j = 1, n do\n len[i][j] = mmi(len[i][j], len[i][k] + len[k][j])\n end\n end\nend\n\nlocal function getpattern(n, patall, idx)\n local used = {}\n local retary = {}\n local div = patall\n for i = 1, n do used[i] = false end\n for i = n, 1, -1 do\n div = mfl(div / i)\n local v_idx = mfl(idx / div)\n idx = idx % div\n local tmp_idx = 0\n for j = 1, n do\n if not used[j] then\n if tmp_idx == v_idx then\n table.insert(retary, j)\n used[j] = true\n break\n else\n tmp_idx = tmp_idx + 1\n end\n end\n end\n end\n return retary\nend\nlocal tot = 1\nfor i = 1, r do\n tot = tot * i\nend\nlocal ret = inf\nfor i = 0, tot - 1 do\n local pat = getpattern(r, tot, i)\n local z = 0\n for i = 1, r - 1 do\n z = z + len[t[pat[i]]][t[pat[i + 1]]]\n end\n if z < ret then ret = z end\nend\nprint(ret)\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1302, "cpu_time_ms": 82, "memory_kb": 3756}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s298279657", "group_id": "codeNet:p03608", "input_text": "local n,m,r=io.read(\"n\",\"n\",\"n\")\nlocal town={}\nfor i=1,r do\n town[i]=io.read(\"n\")\nend\n\nlocal disttable={}\nlocal INF=10^14-1\nfor i=1,n do\n disttable[i]={}\n for j=1,n do\n disttable[i][j]=(i==j and 0 or INF)\n end\nend\n\nfor i=1,m do\n local a,b,c=io.read(\"n\",\"n\",\"n\")\n disttable[a][b]=c\n disttable[b][a]=c\nend\n\nfor k=1,n do\n for i=1,n do\n for j=1,n do\n disttable[i][j]=math.min(disttable[i][j],disttable[i][k]+disttable[k][j])\n end\n end\nend\n\nlocal totaldist=0\nfor i=1,r-1 do\n local mindist=INF\n local r1=town[i]\n for j=i+1,r do\n local r2=town[j]\n mindist=math.min(mindist,disttable[r1][r2])\n end\n totaldist=totaldist+mindist\nend\nprint(totaldist)", "language": "Lua", "metadata": {"date": 1598269061, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "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/Lua/s298279657.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s298279657", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n,m,r=io.read(\"n\",\"n\",\"n\")\nlocal town={}\nfor i=1,r do\n town[i]=io.read(\"n\")\nend\n\nlocal disttable={}\nlocal INF=10^14-1\nfor i=1,n do\n disttable[i]={}\n for j=1,n do\n disttable[i][j]=(i==j and 0 or INF)\n end\nend\n\nfor i=1,m do\n local a,b,c=io.read(\"n\",\"n\",\"n\")\n disttable[a][b]=c\n disttable[b][a]=c\nend\n\nfor k=1,n do\n for i=1,n do\n for j=1,n do\n disttable[i][j]=math.min(disttable[i][j],disttable[i][k]+disttable[k][j])\n end\n end\nend\n\nlocal totaldist=0\nfor i=1,r-1 do\n local mindist=INF\n local r1=town[i]\n for j=i+1,r do\n local r2=town[j]\n mindist=math.min(mindist,disttable[r1][r2])\n end\n totaldist=totaldist+mindist\nend\nprint(totaldist)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 727, "cpu_time_ms": 49, "memory_kb": 2956}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s939653798", "group_id": "codeNet:p03608", "input_text": "local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max\n\nlocal n, m, rnum = io.read(\"*n\", \"*n\", \"*n\")\nlocal r = {}\nfor i = 1, rnum do r[i] = io.read(\"*n\") end\nlocal edge = {}\nfor i = 1, n do edge[i] = {} end\nfor i = 1, m do\n local u, v, l = io.read(\"*n\", \"*n\", \"*n\")\n edge[u][v] = l\n edge[v][u] = l\nend\n\nlocal inf = 30000001\n\nlocal function getlength(start_idx, dst_idx)\n local taskstate = {}\n for i = 1, n do taskstate[i] = false end\n local tasks = {}\n local tasknum = 0\n local done = 0\n\n local len = {}\n for i = 1, n do len[i] = inf end\n len[start_idx] = 0\n\n local function addtask(idx)\n if(not taskstate[idx]) then\n taskstate[idx] = true\n tasknum = tasknum + 1\n tasks[tasknum] = idx\n end\n end\n addtask(start_idx)\n\n while(done < tasknum) do\n done = done + 1\n local src = tasks[done]\n taskstate[src] = false\n for dst, cost in pairs(edge[src]) do\n if len[src] + cost < len[dst] then\n len[dst] = len[src] + cost\n addtask(dst)\n end\n end\n end\n return len[dst_idx]\nend\n\nlocal function heldkarp_prepare(n)\n local tot = 1\n local alltask = {}\n local stagetask = {}\n for i = 1, n do\n tot = tot * 2\n alltask[i] = {}\n stagetask[i] = {}\n end\n for i = 1, n do\n for j = 1, tot - 1 do\n alltask[i][j] = 160000001\n end\n end\n for i = 1, tot - 1 do\n local ti = i\n local cnt = 0\n for j = 1, n do\n if ti % 2 == 1 then\n cnt = cnt + 1\n ti = ti - 1\n end\n ti = ti / 2\n end\n table.insert(stagetask[cnt], i)\n end\n -- set first state\n local tmp = 1\n for i = 1, n do\n alltask[i][tmp] = 0\n tmp = tmp * 2\n end\n return tot, alltask, stagetask\nend\n\nlocal function heldkarp_doall(n, alltask, stagetask, len)\n for stage = 1, n - 1 do\n local stlen = #stagetask[stage]\n for i_stagetask = 1, stlen do\n local used = stagetask[stage][i_stagetask]\n local t_used = used\n for i = 1, n do\n if t_used % 2 == 1 then\n local val = alltask[i][used]\n local mul = 1\n local tmp = used\n for j = 1, n do\n if tmp % 2 == 0 then\n alltask[j][used + mul] = mmi(alltask[j][used + mul], val + len[(i - 1) * n + j])\n else\n tmp = tmp - 1\n end\n tmp = tmp / 2\n mul = mul * 2\n end\n t_used = t_used - 1\n end\n t_used = t_used / 2\n end\n end\n end\nend\n\nlocal function heldkarp_getresult(n, tot, alltask)\n local ret = alltask[1][tot - 1]\n for i = 2, n do\n ret = mmi(ret, alltask[i][tot - 1])\n end\n return ret\nend\n\n\nlocal len = {}\nfor i = 1, rnum * rnum do\n len[i] = 0\nend\nfor i = 1, rnum - 1 do\n for j = i + 1, rnum do\n local l = getlength(r[i], r[j])\n len[(i - 1) * rnum + j] = l\n len[(j - 1) * rnum + i] = l\n end\nend\nlocal t1, t2, t3 = heldkarp_prepare(rnum)\nheldkarp_doall(rnum, t2, t3, len)\nprint(heldkarp_getresult(rnum, t1, t2))\n", "language": "Lua", "metadata": {"date": 1563765106, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s939653798.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s939653798", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max\n\nlocal n, m, rnum = io.read(\"*n\", \"*n\", \"*n\")\nlocal r = {}\nfor i = 1, rnum do r[i] = io.read(\"*n\") end\nlocal edge = {}\nfor i = 1, n do edge[i] = {} end\nfor i = 1, m do\n local u, v, l = io.read(\"*n\", \"*n\", \"*n\")\n edge[u][v] = l\n edge[v][u] = l\nend\n\nlocal inf = 30000001\n\nlocal function getlength(start_idx, dst_idx)\n local taskstate = {}\n for i = 1, n do taskstate[i] = false end\n local tasks = {}\n local tasknum = 0\n local done = 0\n\n local len = {}\n for i = 1, n do len[i] = inf end\n len[start_idx] = 0\n\n local function addtask(idx)\n if(not taskstate[idx]) then\n taskstate[idx] = true\n tasknum = tasknum + 1\n tasks[tasknum] = idx\n end\n end\n addtask(start_idx)\n\n while(done < tasknum) do\n done = done + 1\n local src = tasks[done]\n taskstate[src] = false\n for dst, cost in pairs(edge[src]) do\n if len[src] + cost < len[dst] then\n len[dst] = len[src] + cost\n addtask(dst)\n end\n end\n end\n return len[dst_idx]\nend\n\nlocal function heldkarp_prepare(n)\n local tot = 1\n local alltask = {}\n local stagetask = {}\n for i = 1, n do\n tot = tot * 2\n alltask[i] = {}\n stagetask[i] = {}\n end\n for i = 1, n do\n for j = 1, tot - 1 do\n alltask[i][j] = 160000001\n end\n end\n for i = 1, tot - 1 do\n local ti = i\n local cnt = 0\n for j = 1, n do\n if ti % 2 == 1 then\n cnt = cnt + 1\n ti = ti - 1\n end\n ti = ti / 2\n end\n table.insert(stagetask[cnt], i)\n end\n -- set first state\n local tmp = 1\n for i = 1, n do\n alltask[i][tmp] = 0\n tmp = tmp * 2\n end\n return tot, alltask, stagetask\nend\n\nlocal function heldkarp_doall(n, alltask, stagetask, len)\n for stage = 1, n - 1 do\n local stlen = #stagetask[stage]\n for i_stagetask = 1, stlen do\n local used = stagetask[stage][i_stagetask]\n local t_used = used\n for i = 1, n do\n if t_used % 2 == 1 then\n local val = alltask[i][used]\n local mul = 1\n local tmp = used\n for j = 1, n do\n if tmp % 2 == 0 then\n alltask[j][used + mul] = mmi(alltask[j][used + mul], val + len[(i - 1) * n + j])\n else\n tmp = tmp - 1\n end\n tmp = tmp / 2\n mul = mul * 2\n end\n t_used = t_used - 1\n end\n t_used = t_used / 2\n end\n end\n end\nend\n\nlocal function heldkarp_getresult(n, tot, alltask)\n local ret = alltask[1][tot - 1]\n for i = 2, n do\n ret = mmi(ret, alltask[i][tot - 1])\n end\n return ret\nend\n\n\nlocal len = {}\nfor i = 1, rnum * rnum do\n len[i] = 0\nend\nfor i = 1, rnum - 1 do\n for j = i + 1, rnum do\n local l = getlength(r[i], r[j])\n len[(i - 1) * rnum + j] = l\n len[(j - 1) * rnum + i] = l\n end\nend\nlocal t1, t2, t3 = heldkarp_prepare(rnum)\nheldkarp_doall(rnum, t2, t3, len)\nprint(heldkarp_getresult(rnum, t1, t2))\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2960, "cpu_time_ms": 73, "memory_kb": 1024}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s004777822", "group_id": "codeNet:p03609", "input_text": "a, b = io.read(\"*n\", \"*n\")\nprint(math.max(0, a - b))", "language": "Lua", "metadata": {"date": 1593781006, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03609.html", "problem_id": "p03609", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03609/input.txt", "sample_output_relpath": "derived/input_output/data/p03609/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03609/Lua/s004777822.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s004777822", "user_id": "u120582723"}, "prompt_components": {"gold_output": "83\n", "input_to_evaluate": "a, b = io.read(\"*n\", \"*n\")\nprint(math.max(0, a - b))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have a sandglass that runs for X seconds. The sand drops from the upper bulb at a rate of 1 gram per second. That is, the upper bulb initially contains X grams of sand.\n\nHow many grams of sand will the upper bulb contains after t seconds?\n\nConstraints\n\n1≤X≤10^9\n\n1≤t≤10^9\n\nX and t are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nX t\n\nOutput\n\nPrint the number of sand in the upper bulb after t second.\n\nSample Input 1\n\n100 17\n\nSample Output 1\n\n83\n\n17 out of the initial 100 grams of sand will be consumed, resulting in 83 grams.\n\nSample Input 2\n\n48 58\n\nSample Output 2\n\n0\n\nAll 48 grams of sand will be gone, resulting in 0 grams.\n\nSample Input 3\n\n1000000000 1000000000\n\nSample Output 3\n\n0", "sample_input": "100 17\n"}, "reference_outputs": ["83\n"], "source_document_id": "p03609", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have a sandglass that runs for X seconds. The sand drops from the upper bulb at a rate of 1 gram per second. That is, the upper bulb initially contains X grams of sand.\n\nHow many grams of sand will the upper bulb contains after t seconds?\n\nConstraints\n\n1≤X≤10^9\n\n1≤t≤10^9\n\nX and t are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nX t\n\nOutput\n\nPrint the number of sand in the upper bulb after t second.\n\nSample Input 1\n\n100 17\n\nSample Output 1\n\n83\n\n17 out of the initial 100 grams of sand will be consumed, resulting in 83 grams.\n\nSample Input 2\n\n48 58\n\nSample Output 2\n\n0\n\nAll 48 grams of sand will be gone, resulting in 0 grams.\n\nSample Input 3\n\n1000000000 1000000000\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 52, "cpu_time_ms": 24, "memory_kb": 2708}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s405772054", "group_id": "codeNet:p03612", "input_text": "local n = io.read(\"*n\")\nlocal t = {}\nfor i = 1, n do t[i] = io.read(\"*n\") end\nlocal cnt = 0\nif(t[1] == 1) then t[1], t[2], cnt = t[2], t[1], 1 end\nfor i = 2, n do\n if(t[i] == i) then\n t[i], t[i - 1], cnt = t[i - 1], t[i], cnt + 1\n end\nend\nprint(cnt)\n", "language": "Lua", "metadata": {"date": 1558286587, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s405772054.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s405772054", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal t = {}\nfor i = 1, n do t[i] = io.read(\"*n\") end\nlocal cnt = 0\nif(t[1] == 1) then t[1], t[2], cnt = t[2], t[1], 1 end\nfor i = 2, n do\n if(t[i] == i) then\n t[i], t[i - 1], cnt = t[i - 1], t[i], cnt + 1\n end\nend\nprint(cnt)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given a permutation p_1,p_2,...,p_N consisting of 1,2,..,N.\nYou can perform the following operation any number of times (possibly zero):\n\nOperation: Swap two adjacent elements in the permutation.\n\nYou want to have p_i ≠ i for all 1≤i≤N.\nFind the minimum required number of operations to achieve this.\n\nConstraints\n\n2≤N≤10^5\n\np_1,p_2,..,p_N is a permutation of 1,2,..,N.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\np_1 p_2 .. p_N\n\nOutput\n\nPrint the minimum required number of operations\n\nSample Input 1\n\n5\n1 4 3 5 2\n\nSample Output 1\n\n2\n\nSwap 1 and 4, then swap 1 and 3. p is now 4,3,1,5,2 and satisfies the condition.\nThis is the minimum possible number, so the answer is 2.\n\nSample Input 2\n\n2\n1 2\n\nSample Output 2\n\n1\n\nSwapping 1 and 2 satisfies the condition.\n\nSample Input 3\n\n2\n2 1\n\nSample Output 3\n\n0\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n9\n1 2 4 9 5 8 7 3 6\n\nSample Output 4\n\n3", "sample_input": "5\n1 4 3 5 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03612", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given a permutation p_1,p_2,...,p_N consisting of 1,2,..,N.\nYou can perform the following operation any number of times (possibly zero):\n\nOperation: Swap two adjacent elements in the permutation.\n\nYou want to have p_i ≠ i for all 1≤i≤N.\nFind the minimum required number of operations to achieve this.\n\nConstraints\n\n2≤N≤10^5\n\np_1,p_2,..,p_N is a permutation of 1,2,..,N.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\np_1 p_2 .. p_N\n\nOutput\n\nPrint the minimum required number of operations\n\nSample Input 1\n\n5\n1 4 3 5 2\n\nSample Output 1\n\n2\n\nSwap 1 and 4, then swap 1 and 3. p is now 4,3,1,5,2 and satisfies the condition.\nThis is the minimum possible number, so the answer is 2.\n\nSample Input 2\n\n2\n1 2\n\nSample Output 2\n\n1\n\nSwapping 1 and 2 satisfies the condition.\n\nSample Input 3\n\n2\n2 1\n\nSample Output 3\n\n0\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n9\n1 2 4 9 5 8 7 3 6\n\nSample Output 4\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 23, "memory_kb": 1280}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s163103721", "group_id": "codeNet:p03617", "input_text": "t={}\nfor i=1,4 do\n t[i]=io.read(\"*n\")\nend\nn=io.read(\"*n\")\n\nx=math.min(4*t[1],2*t[2],t[3])\nif x<2*t[4] then\n print(n*x)\nelse\n print((n//2)*t[4]+(n%2)*x)\nend", "language": "Lua", "metadata": {"date": 1588127565, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s163103721.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s163103721", "user_id": "u045238009"}, "prompt_components": {"gold_output": "150\n", "input_to_evaluate": "t={}\nfor i=1,4 do\n t[i]=io.read(\"*n\")\nend\nn=io.read(\"*n\")\n\nx=math.min(4*t[1],2*t[2],t[3])\nif x<2*t[4] then\n print(n*x)\nelse\n print((n//2)*t[4]+(n%2)*x)\nend", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s088532823", "group_id": "codeNet:p03618", "input_text": "local s = io.read()\nlocal n = #s\nlocal t = {}\nfor i = 1, 26 do\n t[i] = 0\nend\ndo\n local a = s:sub(1, 1):byte() - 96\n t[a] = t[a] + 1\nend\nlocal ret = 1\nfor i = 2, n do\n local a = s:sub(i, i):byte() - 96\n ret = ret + i - 1 - t[a]\n t[a] = t[a] + 1\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1589937105, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03618.html", "problem_id": "p03618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03618/input.txt", "sample_output_relpath": "derived/input_output/data/p03618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03618/Lua/s088532823.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s088532823", "user_id": "u120582723"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local s = io.read()\nlocal n = #s\nlocal t = {}\nfor i = 1, 26 do\n t[i] = 0\nend\ndo\n local a = s:sub(1, 1):byte() - 96\n t[a] = t[a] + 1\nend\nlocal ret = 1\nfor i = 2, n do\n local a = s:sub(i, i):byte() - 96\n ret = ret + i - 1 - t[a]\n t[a] = t[a] + 1\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou have a string A = A_1 A_2 ... A_n consisting of lowercase English letters.\n\nYou can choose any two indices i and j such that 1 \\leq i \\leq j \\leq n and reverse substring A_i A_{i+1} ... A_j.\n\nYou can perform this operation at most once.\n\nHow many different strings can you obtain?\n\nConstraints\n\n1 \\leq |A| \\leq 200,000\n\nA consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\n\nOutput\n\nPrint the number of different strings you can obtain by reversing any substring in A at most once.\n\nSample Input 1\n\naatt\n\nSample Output 1\n\n5\n\nYou can obtain aatt (don't do anything), atat (reverse A[2..3]), atta (reverse A[2..4]), ttaa (reverse A[1..4]) and taat (reverse A[1..3]).\n\nSample Input 2\n\nxxxxxxxxxx\n\nSample Output 2\n\n1\n\nWhatever substring you reverse, you'll always get xxxxxxxxxx.\n\nSample Input 3\n\nabracadabra\n\nSample Output 3\n\n44", "sample_input": "aatt\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03618", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou have a string A = A_1 A_2 ... A_n consisting of lowercase English letters.\n\nYou can choose any two indices i and j such that 1 \\leq i \\leq j \\leq n and reverse substring A_i A_{i+1} ... A_j.\n\nYou can perform this operation at most once.\n\nHow many different strings can you obtain?\n\nConstraints\n\n1 \\leq |A| \\leq 200,000\n\nA consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\n\nOutput\n\nPrint the number of different strings you can obtain by reversing any substring in A at most once.\n\nSample Input 1\n\naatt\n\nSample Output 1\n\n5\n\nYou can obtain aatt (don't do anything), atat (reverse A[2..3]), atta (reverse A[2..4]), ttaa (reverse A[1..4]) and taat (reverse A[1..3]).\n\nSample Input 2\n\nxxxxxxxxxx\n\nSample Output 2\n\n1\n\nWhatever substring you reverse, you'll always get xxxxxxxxxx.\n\nSample Input 3\n\nabracadabra\n\nSample Output 3\n\n44", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 265, "cpu_time_ms": 65, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s198684035", "group_id": "codeNet:p03629", "input_text": "local s = io.read()\nlocal n = #s\nlocal cycle_end_pos = {}\nlocal box = {}\nfor i = 1, 26 do\n box[i] = false\nend\nlocal t = {}\nfor i = 1, n do\n t[i] = s:sub(i, i):byte() - 96\nend\nlocal boxcnt = 0\nfor i = 1, n do\n local v = t[i]\n if not box[v] then\n box[v] = true\n boxcnt = boxcnt + 1\n if boxcnt == 26 then\n table.insert(cycle_end_pos, i)\n boxcnt = 0\n for j = 1, 26 do box[j] = false end\n end\n end\nend\n-- node = (#cycles + 1) * 26\nlocal edge = {}\nlocal invedge = {}\nlocal canuse = {}\n\nfor i = 1, (#cycle_end_pos + 1) * 26 do\n edge[i] = {}\n invedge[i] = {}\n canuse[i] = false\nend\n\nlocal first_pos = {}\nlocal last_pos = {}\nfor ic = 1, #cycle_end_pos do\n local spos = ic == 1 and 1 or cycle_end_pos[ic - 1] + 1\n local epos = cycle_end_pos[ic]\n for i = 1, 26 do\n box[i] = false\n first_pos[i] = 0\n last_pos[i] = 0\n end\n boxcnt = 0\n for i = spos, epos do\n local v = t[i]\n if first_pos[v] == 0 then\n first_pos[v] = i\n end\n last_pos[v] = i\n end\n for i = 1, 26 do\n local src = (ic - 1) * 26 + i\n for j = 1, 26 do\n if last_pos[j] <= first_pos[i] then\n local dst = ic * 26 + j\n table.insert(edge[src], dst)\n table.insert(invedge[dst], src)\n end\n end\n end\nend\nfor i = 1, 26 do\n local idx = #cycle_end_pos * 26 + i\n canuse[idx] = true\nend\nif #cycle_end_pos == 0 then\n for i = 1, n do\n local v = t[i]\n local idx = #cycle_end_pos * 26 + v\n canuse[idx] = false\n end\nelse\n for i = cycle_end_pos[#cycle_end_pos] + 1, n do\n local v = t[i]\n local idx = #cycle_end_pos * 26 + v\n canuse[idx] = false\n end\nend\nlocal tasks = {}\nfor i = 1, 26 do\n local idx = #cycle_end_pos * 26 + i\n if canuse[idx] then\n table.insert(tasks, idx)\n end\nend\nlocal done = 0\nwhile done < #tasks do\n done = done + 1\n local invsrc = tasks[done]\n for i = 1, #invedge[invsrc] do\n local invdst = invedge[invsrc][i]\n if not canuse[invdst] then\n canuse[invdst] = true\n table.insert(tasks, invdst)\n end\n end\nend\nlocal ret = {}\nlocal curpos = 0\nfor i = 1, 26 do\n if canuse[i] then\n curpos = i\n table.insert(ret, string.char(96 + i))\n break\n end\nend\nfor ic = 1, #cycle_end_pos do\n for i = 1, #edge[curpos] do\n local dst = edge[curpos][i]\n if canuse[dst] then\n curpos = dst\n table.insert(ret, string.char(96 + dst - 26 * ic))\n break\n end\n end\nend\nprint(table.concat(ret))\n", "language": "Lua", "metadata": {"date": 1590028288, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03629.html", "problem_id": "p03629", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03629/input.txt", "sample_output_relpath": "derived/input_output/data/p03629/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03629/Lua/s198684035.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s198684035", "user_id": "u120582723"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "local s = io.read()\nlocal n = #s\nlocal cycle_end_pos = {}\nlocal box = {}\nfor i = 1, 26 do\n box[i] = false\nend\nlocal t = {}\nfor i = 1, n do\n t[i] = s:sub(i, i):byte() - 96\nend\nlocal boxcnt = 0\nfor i = 1, n do\n local v = t[i]\n if not box[v] then\n box[v] = true\n boxcnt = boxcnt + 1\n if boxcnt == 26 then\n table.insert(cycle_end_pos, i)\n boxcnt = 0\n for j = 1, 26 do box[j] = false end\n end\n end\nend\n-- node = (#cycles + 1) * 26\nlocal edge = {}\nlocal invedge = {}\nlocal canuse = {}\n\nfor i = 1, (#cycle_end_pos + 1) * 26 do\n edge[i] = {}\n invedge[i] = {}\n canuse[i] = false\nend\n\nlocal first_pos = {}\nlocal last_pos = {}\nfor ic = 1, #cycle_end_pos do\n local spos = ic == 1 and 1 or cycle_end_pos[ic - 1] + 1\n local epos = cycle_end_pos[ic]\n for i = 1, 26 do\n box[i] = false\n first_pos[i] = 0\n last_pos[i] = 0\n end\n boxcnt = 0\n for i = spos, epos do\n local v = t[i]\n if first_pos[v] == 0 then\n first_pos[v] = i\n end\n last_pos[v] = i\n end\n for i = 1, 26 do\n local src = (ic - 1) * 26 + i\n for j = 1, 26 do\n if last_pos[j] <= first_pos[i] then\n local dst = ic * 26 + j\n table.insert(edge[src], dst)\n table.insert(invedge[dst], src)\n end\n end\n end\nend\nfor i = 1, 26 do\n local idx = #cycle_end_pos * 26 + i\n canuse[idx] = true\nend\nif #cycle_end_pos == 0 then\n for i = 1, n do\n local v = t[i]\n local idx = #cycle_end_pos * 26 + v\n canuse[idx] = false\n end\nelse\n for i = cycle_end_pos[#cycle_end_pos] + 1, n do\n local v = t[i]\n local idx = #cycle_end_pos * 26 + v\n canuse[idx] = false\n end\nend\nlocal tasks = {}\nfor i = 1, 26 do\n local idx = #cycle_end_pos * 26 + i\n if canuse[idx] then\n table.insert(tasks, idx)\n end\nend\nlocal done = 0\nwhile done < #tasks do\n done = done + 1\n local invsrc = tasks[done]\n for i = 1, #invedge[invsrc] do\n local invdst = invedge[invsrc][i]\n if not canuse[invdst] then\n canuse[invdst] = true\n table.insert(tasks, invdst)\n end\n end\nend\nlocal ret = {}\nlocal curpos = 0\nfor i = 1, 26 do\n if canuse[i] then\n curpos = i\n table.insert(ret, string.char(96 + i))\n break\n end\nend\nfor ic = 1, #cycle_end_pos do\n for i = 1, #edge[curpos] do\n local dst = edge[curpos][i]\n if canuse[dst] then\n curpos = dst\n table.insert(ret, string.char(96 + dst - 26 * ic))\n break\n end\n end\nend\nprint(table.concat(ret))\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nA subsequence of a string S is a string that can be obtained by deleting zero or more characters from S without changing the order of the remaining characters.\nFor example, arc, artistic and (an empty string) are all subsequences of artistic; abc and ci are not.\n\nYou are given a string A consisting of lowercase English letters.\nFind the shortest string among the strings consisting of lowercase English letters that are not subsequences of A.\nIf there are more than one such string, find the lexicographically smallest one among them.\n\nConstraints\n\n1 \\leq |A| \\leq 2 \\times 10^5\n\nA consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\n\nOutput\n\nPrint the lexicographically smallest string among the shortest strings consisting of lowercase English letters that are not subsequences of A.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a as a subsequence, but not b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\naa\n\nSample Input 3\n\nfrqnvhydscshfcgdemurlfrutcpzhopfotpifgepnqjxupnskapziurswqazdwnwbgdhyktfyhqqxpoidfhjdakoxraiedxskywuepzfniuyskxiyjpjlxuqnfgmnjcvtlpnclfkpervxmdbvrbrdn\n\nSample Output 3\n\naca", "sample_input": "atcoderregularcontest\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03629", "source_text": "Score : 600 points\n\nProblem Statement\n\nA subsequence of a string S is a string that can be obtained by deleting zero or more characters from S without changing the order of the remaining characters.\nFor example, arc, artistic and (an empty string) are all subsequences of artistic; abc and ci are not.\n\nYou are given a string A consisting of lowercase English letters.\nFind the shortest string among the strings consisting of lowercase English letters that are not subsequences of A.\nIf there are more than one such string, find the lexicographically smallest one among them.\n\nConstraints\n\n1 \\leq |A| \\leq 2 \\times 10^5\n\nA consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\n\nOutput\n\nPrint the lexicographically smallest string among the shortest strings consisting of lowercase English letters that are not subsequences of A.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a as a subsequence, but not b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\naa\n\nSample Input 3\n\nfrqnvhydscshfcgdemurlfrutcpzhopfotpifgepnqjxupnskapziurswqazdwnwbgdhyktfyhqqxpoidfhjdakoxraiedxskywuepzfniuyskxiyjpjlxuqnfgmnjcvtlpnclfkpervxmdbvrbrdn\n\nSample Output 3\n\naca", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2410, "cpu_time_ms": 627, "memory_kb": 92508}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s442823034", "group_id": "codeNet:p03629", "input_text": "local s = io.read()\nlocal n = #s\nlocal t = {}\nfor i = 1, n do t[i] = s:sub(i, i):byte() - 96 end\nlocal endpos = {}\nlocal box = {}\nlocal bc = 0\nlocal function clearbox()\n for i = 1, 26 do\n box[i] = false\n end\n bc = 0\nend\nclearbox()\nfor i = 1, n do\n if not box[t[i]] then\n box[t[i]] = true\n bc = bc + 1\n end\n if bc == 26 then\n table.insert(endpos, i)\n clearbox()\n end\nend\nclearbox()\nif #endpos == 0 then\n for i = 1, n do\n box[t[i]] = true\n end\n for i = 1, 26 do\n if not box[i] then\n print(string.char(96 + i))\n break\n end\n end\nelse\n local ret = {\"a\"}\n local prv = 0\n for i = 1, n do if t[i] == 1 then prv = i break end end\n for i = 1, #endpos do\n clearbox()\n for j = prv + 1, endpos[i] do\n box[t[j]] = true\n end\n for j = 1, 26 do\n if not box[j] then\n table.insert(ret, string.char(96 + j))\n for k = endpos[i] + 1, n do\n if t[k] == j then\n prv = k\n break\n end\n end\n break\n end\n end\n end\n print(table.concat(ret))\nend\n", "language": "Lua", "metadata": {"date": 1573883053, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03629.html", "problem_id": "p03629", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03629/input.txt", "sample_output_relpath": "derived/input_output/data/p03629/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03629/Lua/s442823034.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s442823034", "user_id": "u120582723"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "local s = io.read()\nlocal n = #s\nlocal t = {}\nfor i = 1, n do t[i] = s:sub(i, i):byte() - 96 end\nlocal endpos = {}\nlocal box = {}\nlocal bc = 0\nlocal function clearbox()\n for i = 1, 26 do\n box[i] = false\n end\n bc = 0\nend\nclearbox()\nfor i = 1, n do\n if not box[t[i]] then\n box[t[i]] = true\n bc = bc + 1\n end\n if bc == 26 then\n table.insert(endpos, i)\n clearbox()\n end\nend\nclearbox()\nif #endpos == 0 then\n for i = 1, n do\n box[t[i]] = true\n end\n for i = 1, 26 do\n if not box[i] then\n print(string.char(96 + i))\n break\n end\n end\nelse\n local ret = {\"a\"}\n local prv = 0\n for i = 1, n do if t[i] == 1 then prv = i break end end\n for i = 1, #endpos do\n clearbox()\n for j = prv + 1, endpos[i] do\n box[t[j]] = true\n end\n for j = 1, 26 do\n if not box[j] then\n table.insert(ret, string.char(96 + j))\n for k = endpos[i] + 1, n do\n if t[k] == j then\n prv = k\n break\n end\n end\n break\n end\n end\n end\n print(table.concat(ret))\nend\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nA subsequence of a string S is a string that can be obtained by deleting zero or more characters from S without changing the order of the remaining characters.\nFor example, arc, artistic and (an empty string) are all subsequences of artistic; abc and ci are not.\n\nYou are given a string A consisting of lowercase English letters.\nFind the shortest string among the strings consisting of lowercase English letters that are not subsequences of A.\nIf there are more than one such string, find the lexicographically smallest one among them.\n\nConstraints\n\n1 \\leq |A| \\leq 2 \\times 10^5\n\nA consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\n\nOutput\n\nPrint the lexicographically smallest string among the shortest strings consisting of lowercase English letters that are not subsequences of A.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a as a subsequence, but not b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\naa\n\nSample Input 3\n\nfrqnvhydscshfcgdemurlfrutcpzhopfotpifgepnqjxupnskapziurswqazdwnwbgdhyktfyhqqxpoidfhjdakoxraiedxskywuepzfniuyskxiyjpjlxuqnfgmnjcvtlpnclfkpervxmdbvrbrdn\n\nSample Output 3\n\naca", "sample_input": "atcoderregularcontest\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03629", "source_text": "Score : 600 points\n\nProblem Statement\n\nA subsequence of a string S is a string that can be obtained by deleting zero or more characters from S without changing the order of the remaining characters.\nFor example, arc, artistic and (an empty string) are all subsequences of artistic; abc and ci are not.\n\nYou are given a string A consisting of lowercase English letters.\nFind the shortest string among the strings consisting of lowercase English letters that are not subsequences of A.\nIf there are more than one such string, find the lexicographically smallest one among them.\n\nConstraints\n\n1 \\leq |A| \\leq 2 \\times 10^5\n\nA consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\n\nOutput\n\nPrint the lexicographically smallest string among the shortest strings consisting of lowercase English letters that are not subsequences of A.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a as a subsequence, but not b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\naa\n\nSample Input 3\n\nfrqnvhydscshfcgdemurlfrutcpzhopfotpifgepnqjxupnskapziurswqazdwnwbgdhyktfyhqqxpoidfhjdakoxraiedxskywuepzfniuyskxiyjpjlxuqnfgmnjcvtlpnclfkpervxmdbvrbrdn\n\nSample Output 3\n\naca", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1063, "cpu_time_ms": 2103, "memory_kb": 4788}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s937981900", "group_id": "codeNet:p03631", "input_text": "s = io.read('*l')\nif s:reverse() == s and s % 10 ~= 0 then print('Yes') else print('No') end\n", "language": "Lua", "metadata": {"date": 1502591995, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s937981900.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s937981900", "user_id": "u785421275"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "s = io.read('*l')\nif s:reverse() == s and s % 10 ~= 0 then print('Yes') else print('No') end\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a three-digit positive integer N.\n\nDetermine whether N is a palindromic number.\n\nHere, a palindromic number is an integer that reads the same backward as forward in decimal notation.\n\nConstraints\n\n100≤N≤999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N is a palindromic number, print Yes; otherwise, print No.\n\nSample Input 1\n\n575\n\nSample Output 1\n\nYes\n\nN=575 is also 575 when read backward, so it is a palindromic number. You should print Yes.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\nN=123 becomes 321 when read backward, so it is not a palindromic number. You should print No.\n\nSample Input 3\n\n812\n\nSample Output 3\n\nNo", "sample_input": "575\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03631", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a three-digit positive integer N.\n\nDetermine whether N is a palindromic number.\n\nHere, a palindromic number is an integer that reads the same backward as forward in decimal notation.\n\nConstraints\n\n100≤N≤999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N is a palindromic number, print Yes; otherwise, print No.\n\nSample Input 1\n\n575\n\nSample Output 1\n\nYes\n\nN=575 is also 575 when read backward, so it is a palindromic number. You should print Yes.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\nN=123 becomes 321 when read backward, so it is not a palindromic number. You should print No.\n\nSample Input 3\n\n812\n\nSample Output 3\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s649176655", "group_id": "codeNet:p03634", "input_text": "local ior = io.input()\nlocal n = ior:read(\"*n\")\nlocal lines = {}\nfor i = 1, n do lines[i] = {} end\nfor i = 1, n - 1 do\n local a, b, c = ior:read(\"*n\", \"*n\", \"*n\")\n lines[a][b] = c\n lines[b][a] = c\nend\nlocal q, k = ior:read(\"*n\", \"*n\")\nlocal tasks = {k}\nlocal map = {}\nfor i = 1, n do map[i] = -1 end\nmap[k] = 0\nlocal tasknum, done = 1, 0\nwhile(done < tasknum) do\n done = done + 1\n local taskidx = tasks[done]\n for k, v in pairs(lines[taskidx]) do\n if(map[k] == -1) then\n map[k] = map[taskidx] + v\n table.insert(tasks, k)\n tasknum = tasknum + 1\n end\n end\nend\nfor i = 1, q do\n local x, y = io.read(\"*n\", \"*n\")\n print(map[x] + map[y])\nend\n", "language": "Lua", "metadata": {"date": 1558279698, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03634.html", "problem_id": "p03634", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03634/input.txt", "sample_output_relpath": "derived/input_output/data/p03634/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03634/Lua/s649176655.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s649176655", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n2\n4\n", "input_to_evaluate": "local ior = io.input()\nlocal n = ior:read(\"*n\")\nlocal lines = {}\nfor i = 1, n do lines[i] = {} end\nfor i = 1, n - 1 do\n local a, b, c = ior:read(\"*n\", \"*n\", \"*n\")\n lines[a][b] = c\n lines[b][a] = c\nend\nlocal q, k = ior:read(\"*n\", \"*n\")\nlocal tasks = {k}\nlocal map = {}\nfor i = 1, n do map[i] = -1 end\nmap[k] = 0\nlocal tasknum, done = 1, 0\nwhile(done < tasknum) do\n done = done + 1\n local taskidx = tasks[done]\n for k, v in pairs(lines[taskidx]) do\n if(map[k] == -1) then\n map[k] = map[taskidx] + v\n table.insert(tasks, k)\n tasknum = tasknum + 1\n end\n end\nend\nfor i = 1, q do\n local x, y = io.read(\"*n\", \"*n\")\n print(map[x] + map[y])\nend\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given a tree with N vertices.\n\nHere, a tree is a kind of graph, and more specifically, a connected undirected graph with N-1 edges, where N is the number of its vertices.\n\nThe i-th edge (1≤i≤N-1) connects Vertices a_i and b_i, and has a length of c_i.\n\nYou are also given Q queries and an integer K. In the j-th query (1≤j≤Q):\n\nfind the length of the shortest path from Vertex x_j and Vertex y_j via Vertex K.\n\nConstraints\n\n3≤N≤10^5\n\n1≤a_i,b_i≤N (1≤i≤N-1)\n\n1≤c_i≤10^9 (1≤i≤N-1)\n\nThe given graph is a tree.\n\n1≤Q≤10^5\n\n1≤K≤N\n\n1≤x_j,y_j≤N (1≤j≤Q)\n\nx_j≠y_j (1≤j≤Q)\n\nx_j≠K,y_j≠K (1≤j≤Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\n:\na_{N-1} b_{N-1} c_{N-1}\nQ K\nx_1 y_1\n:\nx_{Q} y_{Q}\n\nOutput\n\nPrint the responses to the queries in Q lines.\n\nIn the j-th line j(1≤j≤Q), print the response to the j-th query.\n\nSample Input 1\n\n5\n1 2 1\n1 3 1\n2 4 1\n3 5 1\n3 1\n2 4\n2 3\n4 5\n\nSample Output 1\n\n3\n2\n4\n\nThe shortest paths for the three queries are as follows:\n\nQuery 1: Vertex 2 → Vertex 1 → Vertex 2 → Vertex 4 : Length 1+1+1=3\n\nQuery 2: Vertex 2 → Vertex 1 → Vertex 3 : Length 1+1=2\n\nQuery 3: Vertex 4 → Vertex 2 → Vertex 1 → Vertex 3 → Vertex 5 : Length 1+1+1+1=4\n\nSample Input 2\n\n7\n1 2 1\n1 3 3\n1 4 5\n1 5 7\n1 6 9\n1 7 11\n3 2\n1 3\n4 5\n6 7\n\nSample Output 2\n\n5\n14\n22\n\nThe path for each query must pass Vertex K=2.\n\nSample Input 3\n\n10\n1 2 1000000000\n2 3 1000000000\n3 4 1000000000\n4 5 1000000000\n5 6 1000000000\n6 7 1000000000\n7 8 1000000000\n8 9 1000000000\n9 10 1000000000\n1 1\n9 10\n\nSample Output 3\n\n17000000000", "sample_input": "5\n1 2 1\n1 3 1\n2 4 1\n3 5 1\n3 1\n2 4\n2 3\n4 5\n"}, "reference_outputs": ["3\n2\n4\n"], "source_document_id": "p03634", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given a tree with N vertices.\n\nHere, a tree is a kind of graph, and more specifically, a connected undirected graph with N-1 edges, where N is the number of its vertices.\n\nThe i-th edge (1≤i≤N-1) connects Vertices a_i and b_i, and has a length of c_i.\n\nYou are also given Q queries and an integer K. In the j-th query (1≤j≤Q):\n\nfind the length of the shortest path from Vertex x_j and Vertex y_j via Vertex K.\n\nConstraints\n\n3≤N≤10^5\n\n1≤a_i,b_i≤N (1≤i≤N-1)\n\n1≤c_i≤10^9 (1≤i≤N-1)\n\nThe given graph is a tree.\n\n1≤Q≤10^5\n\n1≤K≤N\n\n1≤x_j,y_j≤N (1≤j≤Q)\n\nx_j≠y_j (1≤j≤Q)\n\nx_j≠K,y_j≠K (1≤j≤Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\n:\na_{N-1} b_{N-1} c_{N-1}\nQ K\nx_1 y_1\n:\nx_{Q} y_{Q}\n\nOutput\n\nPrint the responses to the queries in Q lines.\n\nIn the j-th line j(1≤j≤Q), print the response to the j-th query.\n\nSample Input 1\n\n5\n1 2 1\n1 3 1\n2 4 1\n3 5 1\n3 1\n2 4\n2 3\n4 5\n\nSample Output 1\n\n3\n2\n4\n\nThe shortest paths for the three queries are as follows:\n\nQuery 1: Vertex 2 → Vertex 1 → Vertex 2 → Vertex 4 : Length 1+1+1=3\n\nQuery 2: Vertex 2 → Vertex 1 → Vertex 3 : Length 1+1=2\n\nQuery 3: Vertex 4 → Vertex 2 → Vertex 1 → Vertex 3 → Vertex 5 : Length 1+1+1+1=4\n\nSample Input 2\n\n7\n1 2 1\n1 3 3\n1 4 5\n1 5 7\n1 6 9\n1 7 11\n3 2\n1 3\n4 5\n6 7\n\nSample Output 2\n\n5\n14\n22\n\nThe path for each query must pass Vertex K=2.\n\nSample Input 3\n\n10\n1 2 1000000000\n2 3 1000000000\n3 4 1000000000\n4 5 1000000000\n5 6 1000000000\n6 7 1000000000\n7 8 1000000000\n8 9 1000000000\n9 10 1000000000\n1 1\n9 10\n\nSample Output 3\n\n17000000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 666, "cpu_time_ms": 298, "memory_kb": 15596}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s353770426", "group_id": "codeNet:p03634", "input_text": "n = io.read('*n')\n\ne = {}\nfor i = 1, n do e[i] = {} end\n\nfor i = 1, n - 1 do\n local a, b, c = io.read('*n'), io.read('*n'), io.read('*n')\n e[a][#e[a] + 1] = { b, c }\n e[b][#e[b] + 1] = { a, c }\nend\n\nfar = {}\n\ndfs = function (u, p, d)\n far[u] = d\n for i = 1, #e[u] do if e[u][i][1] ~= p then\n dfs(e[u][i][1], u, d + e[u][i][2])\n end end\nend\n\nq, k = io.read('*n'), io.read('*n')\n\ndfs(k, -1, 0)\n\nfor i = 1, q do print(far[io.read('*n')] + far[io.read('*n')]) end\n", "language": "Lua", "metadata": {"date": 1502591996, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03634.html", "problem_id": "p03634", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03634/input.txt", "sample_output_relpath": "derived/input_output/data/p03634/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03634/Lua/s353770426.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s353770426", "user_id": "u785421275"}, "prompt_components": {"gold_output": "3\n2\n4\n", "input_to_evaluate": "n = io.read('*n')\n\ne = {}\nfor i = 1, n do e[i] = {} end\n\nfor i = 1, n - 1 do\n local a, b, c = io.read('*n'), io.read('*n'), io.read('*n')\n e[a][#e[a] + 1] = { b, c }\n e[b][#e[b] + 1] = { a, c }\nend\n\nfar = {}\n\ndfs = function (u, p, d)\n far[u] = d\n for i = 1, #e[u] do if e[u][i][1] ~= p then\n dfs(e[u][i][1], u, d + e[u][i][2])\n end end\nend\n\nq, k = io.read('*n'), io.read('*n')\n\ndfs(k, -1, 0)\n\nfor i = 1, q do print(far[io.read('*n')] + far[io.read('*n')]) end\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given a tree with N vertices.\n\nHere, a tree is a kind of graph, and more specifically, a connected undirected graph with N-1 edges, where N is the number of its vertices.\n\nThe i-th edge (1≤i≤N-1) connects Vertices a_i and b_i, and has a length of c_i.\n\nYou are also given Q queries and an integer K. In the j-th query (1≤j≤Q):\n\nfind the length of the shortest path from Vertex x_j and Vertex y_j via Vertex K.\n\nConstraints\n\n3≤N≤10^5\n\n1≤a_i,b_i≤N (1≤i≤N-1)\n\n1≤c_i≤10^9 (1≤i≤N-1)\n\nThe given graph is a tree.\n\n1≤Q≤10^5\n\n1≤K≤N\n\n1≤x_j,y_j≤N (1≤j≤Q)\n\nx_j≠y_j (1≤j≤Q)\n\nx_j≠K,y_j≠K (1≤j≤Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\n:\na_{N-1} b_{N-1} c_{N-1}\nQ K\nx_1 y_1\n:\nx_{Q} y_{Q}\n\nOutput\n\nPrint the responses to the queries in Q lines.\n\nIn the j-th line j(1≤j≤Q), print the response to the j-th query.\n\nSample Input 1\n\n5\n1 2 1\n1 3 1\n2 4 1\n3 5 1\n3 1\n2 4\n2 3\n4 5\n\nSample Output 1\n\n3\n2\n4\n\nThe shortest paths for the three queries are as follows:\n\nQuery 1: Vertex 2 → Vertex 1 → Vertex 2 → Vertex 4 : Length 1+1+1=3\n\nQuery 2: Vertex 2 → Vertex 1 → Vertex 3 : Length 1+1=2\n\nQuery 3: Vertex 4 → Vertex 2 → Vertex 1 → Vertex 3 → Vertex 5 : Length 1+1+1+1=4\n\nSample Input 2\n\n7\n1 2 1\n1 3 3\n1 4 5\n1 5 7\n1 6 9\n1 7 11\n3 2\n1 3\n4 5\n6 7\n\nSample Output 2\n\n5\n14\n22\n\nThe path for each query must pass Vertex K=2.\n\nSample Input 3\n\n10\n1 2 1000000000\n2 3 1000000000\n3 4 1000000000\n4 5 1000000000\n5 6 1000000000\n6 7 1000000000\n7 8 1000000000\n8 9 1000000000\n9 10 1000000000\n1 1\n9 10\n\nSample Output 3\n\n17000000000", "sample_input": "5\n1 2 1\n1 3 1\n2 4 1\n3 5 1\n3 1\n2 4\n2 3\n4 5\n"}, "reference_outputs": ["3\n2\n4\n"], "source_document_id": "p03634", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given a tree with N vertices.\n\nHere, a tree is a kind of graph, and more specifically, a connected undirected graph with N-1 edges, where N is the number of its vertices.\n\nThe i-th edge (1≤i≤N-1) connects Vertices a_i and b_i, and has a length of c_i.\n\nYou are also given Q queries and an integer K. In the j-th query (1≤j≤Q):\n\nfind the length of the shortest path from Vertex x_j and Vertex y_j via Vertex K.\n\nConstraints\n\n3≤N≤10^5\n\n1≤a_i,b_i≤N (1≤i≤N-1)\n\n1≤c_i≤10^9 (1≤i≤N-1)\n\nThe given graph is a tree.\n\n1≤Q≤10^5\n\n1≤K≤N\n\n1≤x_j,y_j≤N (1≤j≤Q)\n\nx_j≠y_j (1≤j≤Q)\n\nx_j≠K,y_j≠K (1≤j≤Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\n:\na_{N-1} b_{N-1} c_{N-1}\nQ K\nx_1 y_1\n:\nx_{Q} y_{Q}\n\nOutput\n\nPrint the responses to the queries in Q lines.\n\nIn the j-th line j(1≤j≤Q), print the response to the j-th query.\n\nSample Input 1\n\n5\n1 2 1\n1 3 1\n2 4 1\n3 5 1\n3 1\n2 4\n2 3\n4 5\n\nSample Output 1\n\n3\n2\n4\n\nThe shortest paths for the three queries are as follows:\n\nQuery 1: Vertex 2 → Vertex 1 → Vertex 2 → Vertex 4 : Length 1+1+1=3\n\nQuery 2: Vertex 2 → Vertex 1 → Vertex 3 : Length 1+1=2\n\nQuery 3: Vertex 4 → Vertex 2 → Vertex 1 → Vertex 3 → Vertex 5 : Length 1+1+1+1=4\n\nSample Input 2\n\n7\n1 2 1\n1 3 3\n1 4 5\n1 5 7\n1 6 9\n1 7 11\n3 2\n1 3\n4 5\n6 7\n\nSample Output 2\n\n5\n14\n22\n\nThe path for each query must pass Vertex K=2.\n\nSample Input 3\n\n10\n1 2 1000000000\n2 3 1000000000\n3 4 1000000000\n4 5 1000000000\n5 6 1000000000\n6 7 1000000000\n7 8 1000000000\n8 9 1000000000\n9 10 1000000000\n1 1\n9 10\n\nSample Output 3\n\n17000000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 485, "cpu_time_ms": 632, "memory_kb": 67832}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s123540027", "group_id": "codeNet:p03635", "input_text": "print((io.read\"*n\"-1)*(io.read\"*n\"-1))", "language": "Lua", "metadata": {"date": 1587328177, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s123540027.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s123540027", "user_id": "u726173718"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "print((io.read\"*n\"-1)*(io.read\"*n\"-1))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 38, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s351293230", "group_id": "codeNet:p03635", "input_text": "a,b=io.read():match(\"(.+)%s(.+)\")\nprint(math.floor((a-1)*(b-1)))", "language": "Lua", "metadata": {"date": 1551835693, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s351293230.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s351293230", "user_id": "u837412668"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "a,b=io.read():match(\"(.+)%s(.+)\")\nprint(math.floor((a-1)*(b-1)))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s694379546", "group_id": "codeNet:p03636", "input_text": "s = io.read()\nio.write(s:sub(1, 1))\nio.write(#s - 2)\nio.write(s:sub(#s, #s))\nio.write(\"\\n\")\n", "language": "Lua", "metadata": {"date": 1575567058, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03636.html", "problem_id": "p03636", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03636/input.txt", "sample_output_relpath": "derived/input_output/data/p03636/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03636/Lua/s694379546.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s694379546", "user_id": "u120582723"}, "prompt_components": {"gold_output": "i18n\n", "input_to_evaluate": "s = io.read()\nio.write(s:sub(1, 1))\nio.write(#s - 2)\nio.write(s:sub(#s, #s))\nio.write(\"\\n\")\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThe word internationalization is sometimes abbreviated to i18n.\nThis comes from the fact that there are 18 letters between the first i and the last n.\n\nYou are given a string s of length at least 3 consisting of lowercase English letters.\nAbbreviate s in the same way.\n\nConstraints\n\n3 ≤ |s| ≤ 100 (|s| denotes the length of s.)\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the abbreviation of s.\n\nSample Input 1\n\ninternationalization\n\nSample Output 1\n\ni18n\n\nSample Input 2\n\nsmiles\n\nSample Output 2\n\ns4s\n\nSample Input 3\n\nxyz\n\nSample Output 3\n\nx1z", "sample_input": "internationalization\n"}, "reference_outputs": ["i18n\n"], "source_document_id": "p03636", "source_text": "Score : 200 points\n\nProblem Statement\n\nThe word internationalization is sometimes abbreviated to i18n.\nThis comes from the fact that there are 18 letters between the first i and the last n.\n\nYou are given a string s of length at least 3 consisting of lowercase English letters.\nAbbreviate s in the same way.\n\nConstraints\n\n3 ≤ |s| ≤ 100 (|s| denotes the length of s.)\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the abbreviation of s.\n\nSample Input 1\n\ninternationalization\n\nSample Output 1\n\ni18n\n\nSample Input 2\n\nsmiles\n\nSample Output 2\n\ns4s\n\nSample Input 3\n\nxyz\n\nSample Output 3\n\nx1z", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 92, "cpu_time_ms": 9, "memory_kb": 880}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s629696457", "group_id": "codeNet:p03637", "input_text": "local n = io.read(\"*n\", \"*l\")\nlocal str = io.read()\nlocal t = {0, 0, 0}\nfor v in str:gmatch(\"%d+\") do\n local a = tonumber(v)\n if a % 4 == 0 then\n t[1] = t[1] + 1\n elseif a % 2 == 0 then\n t[2] = t[2] + 1\n else\n t[3] = t[3] + 1\n end\nend\nif n == 1 then\n if t[3] == 1 then\n print(\"Yes\")\n else\n print(\"No\")\n end\nelseif t[1] + 1 < t[3] then\n print(\"No\")\nelseif t[1] + 1 == t[3] then\n if t[2] == 0 then\n print(\"Yes\")\n else\n print(\"No\")\n end\nelse\n print(\"Yes\")\nend\n", "language": "Lua", "metadata": {"date": 1560717765, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03637.html", "problem_id": "p03637", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03637/input.txt", "sample_output_relpath": "derived/input_output/data/p03637/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03637/Lua/s629696457.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s629696457", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local n = io.read(\"*n\", \"*l\")\nlocal str = io.read()\nlocal t = {0, 0, 0}\nfor v in str:gmatch(\"%d+\") do\n local a = tonumber(v)\n if a % 4 == 0 then\n t[1] = t[1] + 1\n elseif a % 2 == 0 then\n t[2] = t[2] + 1\n else\n t[3] = t[3] + 1\n end\nend\nif n == 1 then\n if t[3] == 1 then\n print(\"Yes\")\n else\n print(\"No\")\n end\nelseif t[1] + 1 < t[3] then\n print(\"No\")\nelseif t[1] + 1 == t[3] then\n if t[2] == 0 then\n print(\"Yes\")\n else\n print(\"No\")\n end\nelse\n print(\"Yes\")\nend\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a sequence of length N, a = (a_1, a_2, ..., a_N).\nEach a_i is a positive integer.\n\nSnuke's objective is to permute the element in a so that the following condition is satisfied:\n\nFor each 1 ≤ i ≤ N - 1, the product of a_i and a_{i + 1} is a multiple of 4.\n\nDetermine whether Snuke can achieve his objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 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\nIf Snuke can achieve his objective, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 10 100\n\nSample Output 1\n\nYes\n\nOne solution is (1, 100, 10).\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\nNo\n\nIt is impossible to permute a so that the condition is satisfied.\n\nSample Input 3\n\n3\n1 4 1\n\nSample Output 3\n\nYes\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n6\n2 7 1 8 2 8\n\nSample Output 5\n\nYes", "sample_input": "3\n1 10 100\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03637", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a sequence of length N, a = (a_1, a_2, ..., a_N).\nEach a_i is a positive integer.\n\nSnuke's objective is to permute the element in a so that the following condition is satisfied:\n\nFor each 1 ≤ i ≤ N - 1, the product of a_i and a_{i + 1} is a multiple of 4.\n\nDetermine whether Snuke can achieve his objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 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\nIf Snuke can achieve his objective, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 10 100\n\nSample Output 1\n\nYes\n\nOne solution is (1, 100, 10).\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\nNo\n\nIt is impossible to permute a so that the condition is satisfied.\n\nSample Input 3\n\n3\n1 4 1\n\nSample Output 3\n\nYes\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n6\n2 7 1 8 2 8\n\nSample Output 5\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 36, "memory_kb": 5296}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s546573770", "group_id": "codeNet:p03646", "input_text": "local k = io.read(\"*n\")\nlocal div = k // 50\nlocal rem = k % 50\nlocal ary = {}\nary[1] = 0\nfor i = 2, 50 do ary[i] = 49 end\nfor i = 1, rem do\n for j = 1, 50 do\n ary[j] = ary[j] + (j == i and 50 or -1)\n end\nend\nfor i = 1, 50 do ary[i] = ary[i] + div end\nprint(50)\nfor i = 1, 50 do\n io.write(ary[i])\n io.write(i == 50 and \"\\n\" or \" \")\nend\n", "language": "Lua", "metadata": {"date": 1558225830, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03646.html", "problem_id": "p03646", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03646/input.txt", "sample_output_relpath": "derived/input_output/data/p03646/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03646/Lua/s546573770.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s546573770", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n3 3 3 3\n", "input_to_evaluate": "local k = io.read(\"*n\")\nlocal div = k // 50\nlocal rem = k % 50\nlocal ary = {}\nary[1] = 0\nfor i = 2, 50 do ary[i] = 49 end\nfor i = 1, rem do\n for j = 1, 50 do\n ary[j] = ary[j] + (j == i and 50 or -1)\n end\nend\nfor i = 1, 50 do ary[i] = ary[i] + div end\nprint(50)\nfor i = 1, 50 do\n io.write(ary[i])\n io.write(i == 50 and \"\\n\" or \" \")\nend\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have a sequence of length N consisting of non-negative integers. Consider performing the following operation on this sequence until the largest element in this sequence becomes N-1 or smaller.\n\nDetermine the largest element in the sequence (if there is more than one, choose one). Decrease the value of this element by N, and increase each of the other elements by 1.\n\nIt can be proved that the largest element in the sequence becomes N-1 or smaller after a finite number of operations.\n\nYou are given an integer K. Find an integer sequence a_i such that the number of times we will perform the above operation is exactly K. It can be shown that there is always such a sequence under the constraints on input and output in this problem.\n\nConstraints\n\n0 ≤ K ≤ 50 \\times 10^{16}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint a solution in the following format:\n\nN\na_1 a_2 ... a_N\n\nHere, 2 ≤ N ≤ 50 and 0 ≤ a_i ≤ 10^{16} + 1000 must hold.\n\nSample Input 1\n\n0\n\nSample Output 1\n\n4\n3 3 3 3\n\nSample Input 2\n\n1\n\nSample Output 2\n\n3\n1 0 3\n\nSample Input 3\n\n2\n\nSample Output 3\n\n2\n2 2\n\nThe operation will be performed twice: [2, 2] -> [0, 3] -> [1, 1].\n\nSample Input 4\n\n3\n\nSample Output 4\n\n7\n27 0 0 0 0 0 0\n\nSample Input 5\n\n1234567894848\n\nSample Output 5\n\n10\n1000 193 256 777 0 1 1192 1234567891011 48 425", "sample_input": "0\n"}, "reference_outputs": ["4\n3 3 3 3\n"], "source_document_id": "p03646", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have a sequence of length N consisting of non-negative integers. Consider performing the following operation on this sequence until the largest element in this sequence becomes N-1 or smaller.\n\nDetermine the largest element in the sequence (if there is more than one, choose one). Decrease the value of this element by N, and increase each of the other elements by 1.\n\nIt can be proved that the largest element in the sequence becomes N-1 or smaller after a finite number of operations.\n\nYou are given an integer K. Find an integer sequence a_i such that the number of times we will perform the above operation is exactly K. It can be shown that there is always such a sequence under the constraints on input and output in this problem.\n\nConstraints\n\n0 ≤ K ≤ 50 \\times 10^{16}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint a solution in the following format:\n\nN\na_1 a_2 ... a_N\n\nHere, 2 ≤ N ≤ 50 and 0 ≤ a_i ≤ 10^{16} + 1000 must hold.\n\nSample Input 1\n\n0\n\nSample Output 1\n\n4\n3 3 3 3\n\nSample Input 2\n\n1\n\nSample Output 2\n\n3\n1 0 3\n\nSample Input 3\n\n2\n\nSample Output 3\n\n2\n2 2\n\nThe operation will be performed twice: [2, 2] -> [0, 3] -> [1, 1].\n\nSample Input 4\n\n3\n\nSample Output 4\n\n7\n27 0 0 0 0 0 0\n\nSample Input 5\n\n1234567894848\n\nSample Output 5\n\n10\n1000 193 256 777 0 1 1192 1234567891011 48 425", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s821416422", "group_id": "codeNet:p03647", "input_text": "n,m=io.read(\"*n\",\"*n\")\nc,d={},{}\nfor i=1,m do\n\tlocal a,b=io.read(\"*n\",\"*n\")\n\tif a==1 then c[#c+1]=b end\n\tif b==n then d[a]=true end\nend\nfor _,i in ipairs(c)do\n\tif d[i] then\n\t\tprint(\"POSSIBLE\")\n\t\tos.exit()\n\tend\nend\nprint(\"IMPOSSIBLE\")", "language": "Lua", "metadata": {"date": 1525645801, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03647.html", "problem_id": "p03647", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03647/input.txt", "sample_output_relpath": "derived/input_output/data/p03647/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03647/Lua/s821416422.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s821416422", "user_id": "u781091740"}, "prompt_components": {"gold_output": "POSSIBLE\n", "input_to_evaluate": "n,m=io.read(\"*n\",\"*n\")\nc,d={},{}\nfor i=1,m do\n\tlocal a,b=io.read(\"*n\",\"*n\")\n\tif a==1 then c[#c+1]=b end\n\tif b==n then d[a]=true end\nend\nfor _,i in ipairs(c)do\n\tif d[i] then\n\t\tprint(\"POSSIBLE\")\n\t\tos.exit()\n\tend\nend\nprint(\"IMPOSSIBLE\")", "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": "p03647", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 97, "memory_kb": 5044}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s212304500", "group_id": "codeNet:p03651", "input_text": "local function getgcd(x, y)\n while 0 < x do\n x, y = y % x, x\n end\n return y\nend\n\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal gcd = io.read(\"*n\")\nlocal max = gcd\nlocal mma = math.max\nfor i = 2, n do\n local t = io.read(\"*n\")\n gcd = getgcd(gcd, t)\n max = mma(max, t)\nend\nlocal r = k % gcd == 0 and k <= max\nprint(r and \"POSSIBLE\" or \"IMPOSSIBLE\")\n", "language": "Lua", "metadata": {"date": 1563218825, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s212304500.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s212304500", "user_id": "u120582723"}, "prompt_components": {"gold_output": "POSSIBLE\n", "input_to_evaluate": "local function getgcd(x, y)\n while 0 < x do\n x, y = y % x, x\n end\n return y\nend\n\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal gcd = io.read(\"*n\")\nlocal max = gcd\nlocal mma = math.max\nfor i = 2, n do\n local t = io.read(\"*n\")\n gcd = getgcd(gcd, t)\n max = mma(max, t)\nend\nlocal r = k % gcd == 0 and k <= max\nprint(r and \"POSSIBLE\" or \"IMPOSSIBLE\")\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 348, "cpu_time_ms": 43, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s793294241", "group_id": "codeNet:p03652", "input_text": "local mmi, mma = math.min, math.max\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal player = {}\nlocal playerpos = {}\nlocal removecnt = 0\nlocal removed = {}\nfor i = 1, m do\n removed[i] = false\nend\nlocal mcnt = {}\nfor i = 1, n do\n player[i] = {}\n playerpos[i] = 1\n for j = 1, m do\n local v = io.read(\"*n\")\n player[i][j] = v\n end\nend\nlocal maxscore = 0\nlocal ret = n\nlocal function calc()\n maxscore = 0\n for i = 1, m do\n mcnt[i] = 0\n end\n for i = 1, n do\n local v = player[i][playerpos[i]]\n mcnt[v] = mcnt[v] + 1\n end\n for i = 1, m do\n maxscore = mma(maxscore, mcnt[i])\n end\n ret = mmi(ret, maxscore)\nend\n\nlocal function remove()\n for i = 1, m do\n if mcnt[i] == maxscore then\n removed[i] = true\n removecnt = removecnt + 1\n end\n end\n if removecnt == m then\n print(ret)\n os.exit()\n end\n for i = 1, n do\n local pi = player[i]\n while removed[pi[playerpos[i]]] do\n playerpos[i] = playerpos[i] + 1\n end\n end\nend\nwhile true do\n calc()\n remove()\nend\n", "language": "Lua", "metadata": {"date": 1589935542, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s793294241.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s793294241", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal player = {}\nlocal playerpos = {}\nlocal removecnt = 0\nlocal removed = {}\nfor i = 1, m do\n removed[i] = false\nend\nlocal mcnt = {}\nfor i = 1, n do\n player[i] = {}\n playerpos[i] = 1\n for j = 1, m do\n local v = io.read(\"*n\")\n player[i][j] = v\n end\nend\nlocal maxscore = 0\nlocal ret = n\nlocal function calc()\n maxscore = 0\n for i = 1, m do\n mcnt[i] = 0\n end\n for i = 1, n do\n local v = player[i][playerpos[i]]\n mcnt[v] = mcnt[v] + 1\n end\n for i = 1, m do\n maxscore = mma(maxscore, mcnt[i])\n end\n ret = mmi(ret, maxscore)\nend\n\nlocal function remove()\n for i = 1, m do\n if mcnt[i] == maxscore then\n removed[i] = true\n removecnt = removecnt + 1\n end\n end\n if removecnt == m then\n print(ret)\n os.exit()\n end\n for i = 1, n do\n local pi = player[i]\n while removed[pi[playerpos[i]]] do\n playerpos[i] = playerpos[i] + 1\n end\n end\nend\nwhile true do\n calc()\n remove()\nend\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 58, "memory_kb": 2680}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s224256972", "group_id": "codeNet:p03652", "input_text": "local mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n -- for i = 1, #ary do self.stage[stagenum][i] = ary[i] end\n -- for i = #ary + 1, mul do self.stage[stagenum][i] = emptyvalue end\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mmi(r, mce((l - 1) / sz) * sz)\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)\n l = newr + 1\n end\n if sz <= r + 1 - l then\n ret = self.func(ret, self.stage[stage][mce(l / sz)])\n l = l + sz\n end\n if l <= r then\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n end\n end\n return ret\nend\nSegTree.setValue = function(self, idx, value, silent)\n self.stage[self.stagenum][idx] = value\n if not silent then\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n end\nend\nSegTree.update = function(self, idx)\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\nend\n\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal x = {}\nfor i = 1, m do\n x[i] = 0\nend\nx[m + 1] = -1\nlocal st = SegTree.new(m, function(a, b)\n return x[a] < x[b] and b or a\nend, m + 1)\n\nlocal t = {}\nfor i = 1, n do\n t[i] = {}\n for j = 1, m do t[i][j] = 0 end\n for j = m, 1, -1 do\n t[i][j] = io.read(\"*n\")\n end\n x[t[i][m]] = x[t[i][m]] + 1\nend\nfor i = 1, m do st:setValue(i, i, true) end\nst:updateAll()\nlocal ret = n + 1\nfor i = 1, m do\n local type = st.stage[1][1]\n local val = x[type]\n ret = mmi(ret, val)\n x[type] = -1\n if i == m then break end\n for j = 1, n do\n local p = t[j][#t[j]]\n if x[p] == -1 then\n while true do\n p = t[j][#t[j]]\n if x[p] == -1 then\n table.remove(t[j])\n else\n x[p] = x[p] + 1\n break\n end\n end\n end\n end\n st:updateAll()\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1569469747, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s224256972.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s224256972", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n -- for i = 1, #ary do self.stage[stagenum][i] = ary[i] end\n -- for i = #ary + 1, mul do self.stage[stagenum][i] = emptyvalue end\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mmi(r, mce((l - 1) / sz) * sz)\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)\n l = newr + 1\n end\n if sz <= r + 1 - l then\n ret = self.func(ret, self.stage[stage][mce(l / sz)])\n l = l + sz\n end\n if l <= r then\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n end\n end\n return ret\nend\nSegTree.setValue = function(self, idx, value, silent)\n self.stage[self.stagenum][idx] = value\n if not silent then\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n end\nend\nSegTree.update = function(self, idx)\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\nend\n\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal x = {}\nfor i = 1, m do\n x[i] = 0\nend\nx[m + 1] = -1\nlocal st = SegTree.new(m, function(a, b)\n return x[a] < x[b] and b or a\nend, m + 1)\n\nlocal t = {}\nfor i = 1, n do\n t[i] = {}\n for j = 1, m do t[i][j] = 0 end\n for j = m, 1, -1 do\n t[i][j] = io.read(\"*n\")\n end\n x[t[i][m]] = x[t[i][m]] + 1\nend\nfor i = 1, m do st:setValue(i, i, true) end\nst:updateAll()\nlocal ret = n + 1\nfor i = 1, m do\n local type = st.stage[1][1]\n local val = x[type]\n ret = mmi(ret, val)\n x[type] = -1\n if i == m then break end\n for j = 1, n do\n local p = t[j][#t[j]]\n if x[p] == -1 then\n while true do\n p = t[j][#t[j]]\n if x[p] == -1 then\n table.remove(t[j])\n else\n x[p] = x[p] + 1\n break\n end\n end\n end\n end\n st:updateAll()\nend\nprint(ret)\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3373, "cpu_time_ms": 41, "memory_kb": 1536}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s957123630", "group_id": "codeNet:p03652", "input_text": "local mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n -- for i = 1, #ary do self.stage[stagenum][i] = ary[i] end\n -- for i = #ary + 1, mul do self.stage[stagenum][i] = emptyvalue end\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mmi(r, mce((l - 1) / sz) * sz)\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)\n l = newr + 1\n end\n if sz <= r + 1 - l then\n ret = self.func(ret, self.stage[stage][mce(l / sz)])\n l = l + sz\n end\n if l <= r then\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n end\n end\n return ret\nend\nSegTree.setValue = function(self, idx, value, silent)\n self.stage[self.stagenum][idx] = value\n if not silent then\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n end\nend\nSegTree.update = function(self, idx)\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\nend\n\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal x = {}\nfor i = 1, m do\n x[i] = 0\nend\nx[m + 1] = -1\nlocal st = SegTree.new(m, function(a, b)\n return x[a] < x[b] and b or a\nend, m + 1)\n\nlocal t = {}\nfor i = 1, n do\n t[i] = {}\n for j = 1, m do t[i][j] = 0 end\n for j = m, 1, -1 do\n t[i][j] = io.read(\"*n\")\n end\n x[t[i][m]] = x[t[i][m]] + 1\nend\nfor i = 1, m do st:setValue(i, i, true) end\nst:updateAll()\nlocal ret = n + 1\nfor i = 1, m do\n local type = st.stage[1][1]\n local val = x[type]\n ret = mmi(ret, val)\n x[type] = -1\n for j = 1, n do\n local p = t[j][#t[j]]\n if x[p] == -1 then\n while 0 < #t[j] do\n p = t[j][#t[j]]\n if x[p] == -1 then\n table.remove(t[j])\n else\n x[p] = x[p] + 1\n st:update(p)\n break\n end\n end\n end\n end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1569469267, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s957123630.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s957123630", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n -- for i = 1, #ary do self.stage[stagenum][i] = ary[i] end\n -- for i = #ary + 1, mul do self.stage[stagenum][i] = emptyvalue end\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mmi(r, mce((l - 1) / sz) * sz)\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)\n l = newr + 1\n end\n if sz <= r + 1 - l then\n ret = self.func(ret, self.stage[stage][mce(l / sz)])\n l = l + sz\n end\n if l <= r then\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n end\n end\n return ret\nend\nSegTree.setValue = function(self, idx, value, silent)\n self.stage[self.stagenum][idx] = value\n if not silent then\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n end\nend\nSegTree.update = function(self, idx)\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\nend\n\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal x = {}\nfor i = 1, m do\n x[i] = 0\nend\nx[m + 1] = -1\nlocal st = SegTree.new(m, function(a, b)\n return x[a] < x[b] and b or a\nend, m + 1)\n\nlocal t = {}\nfor i = 1, n do\n t[i] = {}\n for j = 1, m do t[i][j] = 0 end\n for j = m, 1, -1 do\n t[i][j] = io.read(\"*n\")\n end\n x[t[i][m]] = x[t[i][m]] + 1\nend\nfor i = 1, m do st:setValue(i, i, true) end\nst:updateAll()\nlocal ret = n + 1\nfor i = 1, m do\n local type = st.stage[1][1]\n local val = x[type]\n ret = mmi(ret, val)\n x[type] = -1\n for j = 1, n do\n local p = t[j][#t[j]]\n if x[p] == -1 then\n while 0 < #t[j] do\n p = t[j][#t[j]]\n if x[p] == -1 then\n table.remove(t[j])\n else\n x[p] = x[p] + 1\n st:update(p)\n break\n end\n end\n end\n end\nend\nprint(ret)\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3357, "cpu_time_ms": 48, "memory_kb": 1536}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s341924798", "group_id": "codeNet:p03657", "input_text": "#!/usr/bin/env lua\n\na = io.read(\"*line\")\nnlist = {}\nj = 1\n\nfor i in a:gmatch(\"%S+\") do\n nlist[j] = tonumber(i)\n j = j + 1\nend\narg1 = nlist[1]\narg2 = nlist[2]\n\nif (arg1+arg2) % 3 == 0 then\n print('Possible')\nelse\n print('Impossible')\nend\n", "language": "Lua", "metadata": {"date": 1501026903, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s341924798.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s341924798", "user_id": "u678875535"}, "prompt_components": {"gold_output": "Possible\n", "input_to_evaluate": "#!/usr/bin/env lua\n\na = io.read(\"*line\")\nnlist = {}\nj = 1\n\nfor i in a:gmatch(\"%S+\") do\n nlist[j] = tonumber(i)\n j = j + 1\nend\narg1 = nlist[1]\narg2 = nlist[2]\n\nif (arg1+arg2) % 3 == 0 then\n print('Possible')\nelse\n print('Impossible')\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 265, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s001663368", "group_id": "codeNet:p03657", "input_text": "local arg1, arg2 = ...\n\nif (arg1+arg2) % 3 == 0 then\n print('Possible')\nelse\n print('Impossible')\nend\n", "language": "Lua", "metadata": {"date": 1500943543, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s001663368.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s001663368", "user_id": "u678875535"}, "prompt_components": {"gold_output": "Possible\n", "input_to_evaluate": "local arg1, arg2 = ...\n\nif (arg1+arg2) % 3 == 0 then\n print('Possible')\nelse\n print('Impossible')\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 116, "cpu_time_ms": 16, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s872493463", "group_id": "codeNet:p03660", "input_text": "local mfl = math.floor\nlocal n = io.read(\"*n\")\nlocal edge = {}\nfor i = 1, n do edge[i] = {} end\nfor i = 1, n - 1 do\n local a, b = io.read(\"*n\", \"*n\")\n table.insert(edge[a], b)\n table.insert(edge[b], a)\nend\n\nlocal tasks = {1}\nlocal asked = {false}\nlocal len = {0}\nfor i = 2, n do\n asked[i] = false\n len[i] = 0\nend\nlocal done = false\nwhile not done do\n local src = tasks[#tasks]\n if asked[src] then\n table.remove(tasks)\n else\n asked[src] = true\n for i = 1, #edge[src] do\n local dst = edge[src][i]\n if not asked[dst] then\n len[dst] = len[src] + 1\n table.insert(tasks, dst)\n if dst == n then\n done = true\n break\n end\n end\n end\n end\nend\nlocal halflen = mfl(len[n] / 2)\nlocal pos1, pos2 = 1, n\nfor i = 1, #tasks do\n local pos = tasks[i]\n local l = len[pos]\n if l == halflen then pos1 = pos\n elseif l == halflen + 1 then pos2 = pos end\nend\ntasks = {pos1, pos2}\nfor i = 1, n do asked[i] = 0 end\nasked[pos1], asked[pos2] = 1, 2\nwhile 0 ~= #tasks do\n local src = tasks[#tasks]\n table.remove(tasks)\n for i = 1, #edge[src] do\n local dst = edge[src][i]\n if 0 == asked[dst] then\n asked[dst] = asked[src]\n table.insert(tasks, dst)\n end\n end\nend\nlocal cnt = {0, 0}\nfor i = 1, n do\n cnt[asked[i]] = cnt[asked[i]] + 1\nend\nprint(cnt[1] > cnt[2] and \"Fennec\" or \"Snuke\")\n", "language": "Lua", "metadata": {"date": 1563235461, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03660.html", "problem_id": "p03660", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03660/input.txt", "sample_output_relpath": "derived/input_output/data/p03660/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03660/Lua/s872493463.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s872493463", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Fennec\n", "input_to_evaluate": "local mfl = math.floor\nlocal n = io.read(\"*n\")\nlocal edge = {}\nfor i = 1, n do edge[i] = {} end\nfor i = 1, n - 1 do\n local a, b = io.read(\"*n\", \"*n\")\n table.insert(edge[a], b)\n table.insert(edge[b], a)\nend\n\nlocal tasks = {1}\nlocal asked = {false}\nlocal len = {0}\nfor i = 2, n do\n asked[i] = false\n len[i] = 0\nend\nlocal done = false\nwhile not done do\n local src = tasks[#tasks]\n if asked[src] then\n table.remove(tasks)\n else\n asked[src] = true\n for i = 1, #edge[src] do\n local dst = edge[src][i]\n if not asked[dst] then\n len[dst] = len[src] + 1\n table.insert(tasks, dst)\n if dst == n then\n done = true\n break\n end\n end\n end\n end\nend\nlocal halflen = mfl(len[n] / 2)\nlocal pos1, pos2 = 1, n\nfor i = 1, #tasks do\n local pos = tasks[i]\n local l = len[pos]\n if l == halflen then pos1 = pos\n elseif l == halflen + 1 then pos2 = pos end\nend\ntasks = {pos1, pos2}\nfor i = 1, n do asked[i] = 0 end\nasked[pos1], asked[pos2] = 1, 2\nwhile 0 ~= #tasks do\n local src = tasks[#tasks]\n table.remove(tasks)\n for i = 1, #edge[src] do\n local dst = edge[src][i]\n if 0 == asked[dst] then\n asked[dst] = asked[src]\n table.insert(tasks, dst)\n end\n end\nend\nlocal cnt = {0, 0}\nfor i = 1, n do\n cnt[asked[i]] = cnt[asked[i]] + 1\nend\nprint(cnt[1] > cnt[2] and \"Fennec\" or \"Snuke\")\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFennec and Snuke are playing a board game.\n\nOn the board, there are N cells numbered 1 through N, and N-1 roads, each connecting two cells. Cell a_i is adjacent to Cell b_i through the i-th road. Every cell can be reached from every other cell by repeatedly traveling to an adjacent cell. In terms of graph theory, the graph formed by the cells and the roads is a tree.\n\nInitially, Cell 1 is painted black, and Cell N is painted white. The other cells are not yet colored.\nFennec (who goes first) and Snuke (who goes second) alternately paint an uncolored cell.\nMore specifically, each player performs the following action in her/his turn:\n\nFennec: selects an uncolored cell that is adjacent to a black cell, and paints it black.\n\nSnuke: selects an uncolored cell that is adjacent to a white cell, and paints it white.\n\nA player loses when she/he cannot paint a cell. Determine the winner of the game when Fennec and Snuke play optimally.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i \\leq N\n\nThe given graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\n:\na_{N-1} b_{N-1}\n\nOutput\n\nIf Fennec wins, print Fennec; if Snuke wins, print Snuke.\n\nSample Input 1\n\n7\n3 6\n1 2\n3 1\n7 4\n5 7\n1 4\n\nSample Output 1\n\nFennec\n\nFor example, if Fennec first paints Cell 2 black, she will win regardless of Snuke's moves.\n\nSample Input 2\n\n4\n1 4\n4 2\n2 3\n\nSample Output 2\n\nSnuke", "sample_input": "7\n3 6\n1 2\n3 1\n7 4\n5 7\n1 4\n"}, "reference_outputs": ["Fennec\n"], "source_document_id": "p03660", "source_text": "Score : 400 points\n\nProblem Statement\n\nFennec and Snuke are playing a board game.\n\nOn the board, there are N cells numbered 1 through N, and N-1 roads, each connecting two cells. Cell a_i is adjacent to Cell b_i through the i-th road. Every cell can be reached from every other cell by repeatedly traveling to an adjacent cell. In terms of graph theory, the graph formed by the cells and the roads is a tree.\n\nInitially, Cell 1 is painted black, and Cell N is painted white. The other cells are not yet colored.\nFennec (who goes first) and Snuke (who goes second) alternately paint an uncolored cell.\nMore specifically, each player performs the following action in her/his turn:\n\nFennec: selects an uncolored cell that is adjacent to a black cell, and paints it black.\n\nSnuke: selects an uncolored cell that is adjacent to a white cell, and paints it white.\n\nA player loses when she/he cannot paint a cell. Determine the winner of the game when Fennec and Snuke play optimally.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i \\leq N\n\nThe given graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\n:\na_{N-1} b_{N-1}\n\nOutput\n\nIf Fennec wins, print Fennec; if Snuke wins, print Snuke.\n\nSample Input 1\n\n7\n3 6\n1 2\n3 1\n7 4\n5 7\n1 4\n\nSample Output 1\n\nFennec\n\nFor example, if Fennec first paints Cell 2 black, she will win regardless of Snuke's moves.\n\nSample Input 2\n\n4\n1 4\n4 2\n2 3\n\nSample Output 2\n\nSnuke", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1361, "cpu_time_ms": 115, "memory_kb": 11504}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s955549865", "group_id": "codeNet:p03671", "input_text": "x={}\nfor i in io.read():gmatch(\"%d+\")do\n table.insert(x,i*1)\nend\ntable.sort(x)\nprint(math.floor(x[1]+x[2]))", "language": "Lua", "metadata": {"date": 1551752884, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s955549865.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s955549865", "user_id": "u837412668"}, "prompt_components": {"gold_output": "1300\n", "input_to_evaluate": "x={}\nfor i in io.read():gmatch(\"%d+\")do\n table.insert(x,i*1)\nend\ntable.sort(x)\nprint(math.floor(x[1]+x[2]))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s316047850", "group_id": "codeNet:p03672", "input_text": "s=io.read()\nfor i=#s-2,2,-2 do\n if s:sub(1,i//2)==s:sub(i//2+1,i) then\n print(i)\n return\n end\nend", "language": "Lua", "metadata": {"date": 1589039627, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s316047850.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s316047850", "user_id": "u045238009"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "s=io.read()\nfor i=#s-2,2,-2 do\n if s:sub(1,i//2)==s:sub(i//2+1,i) then\n print(i)\n return\n end\nend", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s441471025", "group_id": "codeNet:p03672", "input_text": "s=io.read()\nfunction check(i)\n if (#s - i) % 2 == 0 then\n l=#s - i\n m=l//2\n a=s:sub(1,m)\n b=s:sub(m+1,#s-i)\n return a==b\n else\n return false\n end\nend\nfor i=1,#s-2 do\n if check(i) then\n print(#s-i)\n return\n end\nend", "language": "Lua", "metadata": {"date": 1569991691, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s441471025.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s441471025", "user_id": "u162773977"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "s=io.read()\nfunction check(i)\n if (#s - i) % 2 == 0 then\n l=#s - i\n m=l//2\n a=s:sub(1,m)\n b=s:sub(m+1,#s-i)\n return a==b\n else\n return false\n end\nend\nfor i=1,#s-2 do\n if check(i) then\n print(#s-i)\n return\n end\nend", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 242, "cpu_time_ms": 4, "memory_kb": 508}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s401071779", "group_id": "codeNet:p03673", "input_text": "local n=io.read(\"*n\")\nlocal b={}\nif n%2==0 then\n for i=1,n do\n if i%2==1 then\n table.insert(b,io.read(\"*n\"))\n else\n table.insert(b,1,io.read(\"*n\"))\n end\n end\nelse\n for i=1,n do\n if i%2==1 then\n table.insert(b,1,io.read(\"*n\"))\n else\n table.insert(b,io.read(\"*n\"))\n end\n end\nend\nprint(table.concat(b,\" \"))", "language": "Lua", "metadata": {"date": 1589508349, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s401071779.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s401071779", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4 2 1 3\n", "input_to_evaluate": "local n=io.read(\"*n\")\nlocal b={}\nif n%2==0 then\n for i=1,n do\n if i%2==1 then\n table.insert(b,io.read(\"*n\"))\n else\n table.insert(b,1,io.read(\"*n\"))\n end\n end\nelse\n for i=1,n do\n if i%2==1 then\n table.insert(b,1,io.read(\"*n\"))\n else\n table.insert(b,io.read(\"*n\"))\n end\n end\nend\nprint(table.concat(b,\" \"))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 401, "cpu_time_ms": 2107, "memory_kb": 1280}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s071664451", "group_id": "codeNet:p03673", "input_text": "local n=io.read(\"*n\")\nlocal b=\"\"\nlocal reverse=false\nfor i=1,n do\n local a=io.read(\"*n\")\n if i%2==1 then\n b=b..\" \"..a\n reverse=true\n else\n b=a..\" \"..b\n reverse=false\n end\nend\nprint(reverse and string.reverse(b) or b)", "language": "Lua", "metadata": {"date": 1589506732, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s071664451.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s071664451", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4 2 1 3\n", "input_to_evaluate": "local n=io.read(\"*n\")\nlocal b=\"\"\nlocal reverse=false\nfor i=1,n do\n local a=io.read(\"*n\")\n if i%2==1 then\n b=b..\" \"..a\n reverse=true\n else\n b=a..\" \"..b\n reverse=false\n end\nend\nprint(reverse and string.reverse(b) or b)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 256, "cpu_time_ms": 2103, "memory_kb": 5948}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s624579797", "group_id": "codeNet:p03673", "input_text": "local n=io.read(\"*n\")\nlocal b={}\nfor i=1,n do\n local a=io.read(\"*n\")\n if i%2==1 then\n table.insert(b,a)\n else\n table.insert(b,1,a)\n end\nend\nprint(table.concat(b,\" \"))", "language": "Lua", "metadata": {"date": 1589506367, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s624579797.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s624579797", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4 2 1 3\n", "input_to_evaluate": "local n=io.read(\"*n\")\nlocal b={}\nfor i=1,n do\n local a=io.read(\"*n\")\n if i%2==1 then\n table.insert(b,a)\n else\n table.insert(b,1,a)\n end\nend\nprint(table.concat(b,\" \"))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 192, "cpu_time_ms": 2103, "memory_kb": 1280}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s249404937", "group_id": "codeNet:p03673", "input_text": "local n = io.read(\"*n\")\nlocal t = {}\nfor i = 1, n do t[i] = 0 end\nif(n % 2 == 0) then\n for i = 1, n do\n local a = io.read(\"*n\")\n if(i % 2 == 0) then\n t[1 + (n - i) / 2] = a\n else\n t[(n + i + 1) / 2] = a\n end\n end\nelse\n for i = 1, n do\n local a = io.read(\"*n\")\n if(i % 2 == 0) then\n t[(n+ i + 1) / 2] = a\n else\n t[1 + (n - i) / 2] = a\n end\n end\nend\nprint(table.concat(t, \" \"))\n", "language": "Lua", "metadata": {"date": 1555594053, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s249404937.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s249404937", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4 2 1 3\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal t = {}\nfor i = 1, n do t[i] = 0 end\nif(n % 2 == 0) then\n for i = 1, n do\n local a = io.read(\"*n\")\n if(i % 2 == 0) then\n t[1 + (n - i) / 2] = a\n else\n t[(n + i + 1) / 2] = a\n end\n end\nelse\n for i = 1, n do\n local a = io.read(\"*n\")\n if(i % 2 == 0) then\n t[(n+ i + 1) / 2] = a\n else\n t[1 + (n - i) / 2] = a\n end\n end\nend\nprint(table.concat(t, \" \"))\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 424, "cpu_time_ms": 219, "memory_kb": 15656}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s762711739", "group_id": "codeNet:p03679", "input_text": "x, a, b = io.read(\"*n\", \"*n\", \"*n\")\nc = b - a\nif c <= 0 then\n print(\"delicious\")\nelseif c <= x then\n print(\"safe\")\nelse\n print(\"dangerous\")\nend", "language": "Lua", "metadata": {"date": 1571112750, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s762711739.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s762711739", "user_id": "u120582723"}, "prompt_components": {"gold_output": "safe\n", "input_to_evaluate": "x, a, b = io.read(\"*n\", \"*n\", \"*n\")\nc = b - a\nif c <= 0 then\n print(\"delicious\")\nelseif c <= x then\n print(\"safe\")\nelse\n print(\"dangerous\")\nend", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s041471178", "group_id": "codeNet:p03681", "input_text": "local a, b = io.read(\"*n\", \"*n\")\nif(1 < math.abs(a - b)) then print(0)\nelse\n local min = math.min(a, b)\n local ret = 1\n local mod = 1000000007\n for i = 2, min do\n ret = (ret * i) % mod\n end\n ret = (ret * ret) % mod\n if(a == b) then\n ret = (ret * 2) % mod\n else\n ret = (ret * (min + 1)) % mod\n end\n print(ret)\nend\n", "language": "Lua", "metadata": {"date": 1555597474, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s041471178.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s041471178", "user_id": "u120582723"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "local a, b = io.read(\"*n\", \"*n\")\nif(1 < math.abs(a - b)) then print(0)\nelse\n local min = math.min(a, b)\n local ret = 1\n local mod = 1000000007\n for i = 2, min do\n ret = (ret * i) % mod\n end\n ret = (ret * ret) % mod\n if(a == b) then\n ret = (ret * 2) % mod\n else\n ret = (ret * (min + 1)) % mod\n end\n print(ret)\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": "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 332, "cpu_time_ms": 25, "memory_kb": 1012}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s012090733", "group_id": "codeNet:p03687", "input_text": "local s=io.read()\nlocal n=#s\nlocal sable={s:byte(1,n)}\n\nlocal min=100\nfor alphabyte=97,122 do\n local before=0\n local counter=0\n for i=1,n do\n if sable[i]==alphabyte then\n counter=math.max(counter,i-before-1)\n before=i\n end\n end\n counter=math.max(counter,n-before)\n min=math.min(min,counter)\nend\nprint(min)", "language": "Lua", "metadata": {"date": 1589419193, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03687.html", "problem_id": "p03687", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03687/input.txt", "sample_output_relpath": "derived/input_output/data/p03687/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03687/Lua/s012090733.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s012090733", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local s=io.read()\nlocal n=#s\nlocal sable={s:byte(1,n)}\n\nlocal min=100\nfor alphabyte=97,122 do\n local before=0\n local counter=0\n for i=1,n do\n if sable[i]==alphabyte then\n counter=math.max(counter,i-before-1)\n before=i\n end\n end\n counter=math.max(counter,n-before)\n min=math.min(min,counter)\nend\nprint(min)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke can change a string t of length N into a string t' of length N - 1 under the following rule:\n\nFor each i (1 ≤ i ≤ N - 1), the i-th character of t' must be either the i-th or (i + 1)-th character of t.\n\nThere is a string s consisting of lowercase English letters.\nSnuke's objective is to apply the above operation to s repeatedly so that all the characters in s are the same.\nFind the minimum necessary number of operations.\n\nConstraints\n\n1 ≤ |s| ≤ 100\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 necessary number of operations to achieve the objective.\n\nSample Input 1\n\nserval\n\nSample Output 1\n\n3\n\nOne solution is: serval → srvvl → svvv → vvv.\n\nSample Input 2\n\njackal\n\nSample Output 2\n\n2\n\nOne solution is: jackal → aacaa → aaaa.\n\nSample Input 3\n\nzzz\n\nSample Output 3\n\n0\n\nAll the characters in s are the same from the beginning.\n\nSample Input 4\n\nwhbrjpjyhsrywlqjxdbrbaomnw\n\nSample Output 4\n\n8\n\nIn 8 operations, he can change s to rrrrrrrrrrrrrrrrrr.", "sample_input": "serval\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03687", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke can change a string t of length N into a string t' of length N - 1 under the following rule:\n\nFor each i (1 ≤ i ≤ N - 1), the i-th character of t' must be either the i-th or (i + 1)-th character of t.\n\nThere is a string s consisting of lowercase English letters.\nSnuke's objective is to apply the above operation to s repeatedly so that all the characters in s are the same.\nFind the minimum necessary number of operations.\n\nConstraints\n\n1 ≤ |s| ≤ 100\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 necessary number of operations to achieve the objective.\n\nSample Input 1\n\nserval\n\nSample Output 1\n\n3\n\nOne solution is: serval → srvvl → svvv → vvv.\n\nSample Input 2\n\njackal\n\nSample Output 2\n\n2\n\nOne solution is: jackal → aacaa → aaaa.\n\nSample Input 3\n\nzzz\n\nSample Output 3\n\n0\n\nAll the characters in s are the same from the beginning.\n\nSample Input 4\n\nwhbrjpjyhsrywlqjxdbrbaomnw\n\nSample Output 4\n\n8\n\nIn 8 operations, he can change s to rrrrrrrrrrrrrrrrrr.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 359, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s542613261", "group_id": "codeNet:p03688", "input_text": "n = io.read(\"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = io.read(\"*n\")\nend\ntable.sort(t)\nlocal function solve()\n if t[1] + 1 < t[n] then\n return false\n end\n if t[1] == t[n] then\n if t[n] == n - 1 then return true end\n end\n local major = 0\n for i = 1, n do\n if t[i] == t[n] then\n major = n + 1 - i\n break\n end\n end\n local minor = n - major\n local minhats = minor + 1\n local maxhats = minor + major // 2\n return minhats <= t[n] and t[n] <= maxhats\nend\n\nprint(solve() and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1569451835, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03688.html", "problem_id": "p03688", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03688/input.txt", "sample_output_relpath": "derived/input_output/data/p03688/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03688/Lua/s542613261.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s542613261", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "n = io.read(\"*n\")\nlocal t = {}\nfor i = 1, n do\n t[i] = io.read(\"*n\")\nend\ntable.sort(t)\nlocal function solve()\n if t[1] + 1 < t[n] then\n return false\n end\n if t[1] == t[n] then\n if t[n] == n - 1 then return true end\n end\n local major = 0\n for i = 1, n do\n if t[i] == t[n] then\n major = n + 1 - i\n break\n end\n end\n local minor = n - major\n local minhats = minor + 1\n local maxhats = minor + major // 2\n return minhats <= t[n] and t[n] <= maxhats\nend\n\nprint(solve() and \"Yes\" or \"No\")\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nThere are N cats.\nWe number them from 1 through N.\n\nEach of the cats wears a hat.\nCat i says: \"there are exactly a_i different colors among the N - 1 hats worn by the cats except me.\"\n\nDetermine whether there exists a sequence of colors of the hats that is consistent with the remarks of the cats.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n1 ≤ a_i ≤ N-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\nPrint Yes if there exists a sequence of colors of the hats that is consistent with the remarks of the cats; print No otherwise.\n\nSample Input 1\n\n3\n1 2 2\n\nSample Output 1\n\nYes\n\nFor example, if cat 1, 2 and 3 wears red, blue and blue hats, respectively, it is consistent with the remarks of the cats.\n\nSample Input 2\n\n3\n1 1 2\n\nSample Output 2\n\nNo\n\nFrom the remark of cat 1, we can see that cat 2 and 3 wear hats of the same color.\nAlso, from the remark of cat 2, we can see that cat 1 and 3 wear hats of the same color.\nTherefore, cat 1 and 2 wear hats of the same color, which contradicts the remark of cat 3.\n\nSample Input 3\n\n5\n4 3 4 3 4\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\n2 2 2\n\nSample Output 4\n\nYes\n\nSample Input 5\n\n4\n2 2 2 2\n\nSample Output 5\n\nYes\n\nSample Input 6\n\n5\n3 3 3 3 3\n\nSample Output 6\n\nNo", "sample_input": "3\n1 2 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03688", "source_text": "Score : 700 points\n\nProblem Statement\n\nThere are N cats.\nWe number them from 1 through N.\n\nEach of the cats wears a hat.\nCat i says: \"there are exactly a_i different colors among the N - 1 hats worn by the cats except me.\"\n\nDetermine whether there exists a sequence of colors of the hats that is consistent with the remarks of the cats.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n1 ≤ a_i ≤ N-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\nPrint Yes if there exists a sequence of colors of the hats that is consistent with the remarks of the cats; print No otherwise.\n\nSample Input 1\n\n3\n1 2 2\n\nSample Output 1\n\nYes\n\nFor example, if cat 1, 2 and 3 wears red, blue and blue hats, respectively, it is consistent with the remarks of the cats.\n\nSample Input 2\n\n3\n1 1 2\n\nSample Output 2\n\nNo\n\nFrom the remark of cat 1, we can see that cat 2 and 3 wear hats of the same color.\nAlso, from the remark of cat 2, we can see that cat 1 and 3 wear hats of the same color.\nTherefore, cat 1 and 2 wear hats of the same color, which contradicts the remark of cat 3.\n\nSample Input 3\n\n5\n4 3 4 3 4\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\n2 2 2\n\nSample Output 4\n\nYes\n\nSample Input 5\n\n4\n2 2 2 2\n\nSample Output 5\n\nYes\n\nSample Input 6\n\n5\n3 3 3 3 3\n\nSample Output 6\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 516, "cpu_time_ms": 85, "memory_kb": 2424}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s432017584", "group_id": "codeNet:p03693", "input_text": "#!/usr/bin/env lua\n\na = io.read(\"*line\")\nnlist = {}\nj = 1\n\nfor i in a:gmatch\"%S+\" do\n nlist[j] = tonumber(i)\n j = j + 1\nend\n\nnum = 100 * nlist[1] + 10 * nlist[2] + nlist[3]\n\nif num % 4 == 0 then\n print(\"YES\")\nelse\n print(\"NO\")\nend\n", "language": "Lua", "metadata": {"date": 1497411542, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s432017584.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s432017584", "user_id": "u678875535"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#!/usr/bin/env lua\n\na = io.read(\"*line\")\nnlist = {}\nj = 1\n\nfor i in a:gmatch\"%S+\" do\n nlist[j] = tonumber(i)\n j = j + 1\nend\n\nnum = 100 * nlist[1] + 10 * nlist[2] + nlist[3]\n\nif num % 4 == 0 then\n print(\"YES\")\nelse\n print(\"NO\")\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 251, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s081056100", "group_id": "codeNet:p03697", "input_text": "a,b=io.read():match(\"(.+)%s(.+)\")\nprint(a+b<10 and math.floor(a+b)or\"error\")", "language": "Lua", "metadata": {"date": 1551751247, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s081056100.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s081056100", "user_id": "u837412668"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "a,b=io.read():match(\"(.+)%s(.+)\")\nprint(a+b<10 and math.floor(a+b)or\"error\")", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s940618262", "group_id": "codeNet:p03697", "input_text": "#!/usr/bin/env lua\n\ns = io.read(\"*line\")\nnlist = {}\nj = 1\nfor i in string.gmatch(s, \"%S+\") do\n nlist[j] = tonumber(i)\n j = j + 1\nend\n\nif nlist[1] + nlist[2] >= 10 then\n print(\"error\")\nelse\n print(nlist[1]+nlist[2])\nend", "language": "Lua", "metadata": {"date": 1496634964, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s940618262.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s940618262", "user_id": "u678875535"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "#!/usr/bin/env lua\n\ns = io.read(\"*line\")\nnlist = {}\nj = 1\nfor i in string.gmatch(s, \"%S+\") do\n nlist[j] = tonumber(i)\n j = j + 1\nend\n\nif nlist[1] + nlist[2] >= 10 then\n print(\"error\")\nelse\n print(nlist[1]+nlist[2])\nend", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s302471076", "group_id": "codeNet:p03697", "input_text": "#!/usr/bin/env lua\n\ns = io.read(\"*line\")\nnlist = {}\nj = 1\nfor i in string.gmatch(s, \"%S+\") do\n nlist[j] = tonumber(i)\n j = j + 1\nend\n\nif nlist[1] + nlist[2] >= 10 then\n print(\"error\")\nelse\n print(nlist[1]+nlist[2])\nend", "language": "Lua", "metadata": {"date": 1496634916, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s302471076.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s302471076", "user_id": "u678875535"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "#!/usr/bin/env lua\n\ns = io.read(\"*line\")\nnlist = {}\nj = 1\nfor i in string.gmatch(s, \"%S+\") do\n nlist[j] = tonumber(i)\n j = j + 1\nend\n\nif nlist[1] + nlist[2] >= 10 then\n print(\"error\")\nelse\n print(nlist[1]+nlist[2])\nend", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s802178605", "group_id": "codeNet:p03698", "input_text": "#!/usr/bin/env lua\n\nk = 0\na = io.read(\"*line\")\n\nfor i in a:gmatch(\".\") do\n for j in a:gmatch(\".\") do\n if i == j then k = k + 1 end\n end\nend\n\nif k == string.len(a) then\n print(\"yes\")\nelse\n print(\"no\")\nend", "language": "Lua", "metadata": {"date": 1496685940, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s802178605.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s802178605", "user_id": "u678875535"}, "prompt_components": {"gold_output": "yes\n", "input_to_evaluate": "#!/usr/bin/env lua\n\nk = 0\na = io.read(\"*line\")\n\nfor i in a:gmatch(\".\") do\n for j in a:gmatch(\".\") do\n if i == j then k = k + 1 end\n end\nend\n\nif k == string.len(a) then\n print(\"yes\")\nelse\n print(\"no\")\nend", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 230, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s998450340", "group_id": "codeNet:p03699", "input_text": "n=io.read(\"*n\",\"*l\")\ns={}\nmax=0\nfor i=1,n do\n s[i]=io.read(\"*n\")\n max=max+s[i]\nend\ntable.sort(s)\n\nfor i=1,n do\n if max%10==0 and s[i]%10~=0 then\n max=max-s[i]\n elseif max%10~=0 then\n break\n end\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1589124001, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s998450340.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s998450340", "user_id": "u045238009"}, "prompt_components": {"gold_output": "25\n", "input_to_evaluate": "n=io.read(\"*n\",\"*l\")\ns={}\nmax=0\nfor i=1,n do\n s[i]=io.read(\"*n\")\n max=max+s[i]\nend\ntable.sort(s)\n\nfor i=1,n do\n if max%10==0 and s[i]%10~=0 then\n max=max-s[i]\n elseif max%10~=0 then\n break\n end\nend\nprint(max)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 10, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s817036485", "group_id": "codeNet:p03700", "input_text": "local mfl, mce = math.floor, math.ceil\nlocal n, a, b = io.read(\"*n\", \"*n\", \"*n\")\nlocal c = a - b\nlocal h = {}\nfor i = 1, n do\n h[i] = io.read(\"*n\")\nend\ntable.sort(h)\n\nlocal function solve(x)\n local cnt = 0\n for i = 1, n do\n if x * b < h[i] then\n cnt = cnt + mce((h[i] - x * b) / c)\n end\n end\n return cnt <= x\nend\n\nlocal min = 0\nlocal max = mce(h[n] / b)\nwhile 1 < max - min do\n local mid = mfl((min + max) / 2)\n if solve(mid) then\n max = mid\n else\n min = mid\n end\nend\nprint(max)\n", "language": "Lua", "metadata": {"date": 1581865369, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s817036485.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s817036485", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local mfl, mce = math.floor, math.ceil\nlocal n, a, b = io.read(\"*n\", \"*n\", \"*n\")\nlocal c = a - b\nlocal h = {}\nfor i = 1, n do\n h[i] = io.read(\"*n\")\nend\ntable.sort(h)\n\nlocal function solve(x)\n local cnt = 0\n for i = 1, n do\n if x * b < h[i] then\n cnt = cnt + mce((h[i] - x * b) / c)\n end\n end\n return cnt <= x\nend\n\nlocal min = 0\nlocal max = mce(h[n] / b)\nwhile 1 < max - min do\n local mid = mfl((min + max) / 2)\n if solve(mid) then\n max = mid\n else\n min = mid\n end\nend\nprint(max)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter N monsters. Each monster has a parameter called health, and the health of the i-th monster is h_i at the moment of encounter. A monster will vanish immediately when its health drops to 0 or below.\n\nFortunately, you are a skilled magician, capable of causing explosions that damage monsters. In one explosion, you can damage monsters as follows:\n\nSelect an alive monster, and cause an explosion centered at that monster. The health of the monster at the center of the explosion will decrease by A, and the health of each of the other monsters will decrease by B. Here, A and B are predetermined parameters, and A > B holds.\n\nAt least how many explosions do you need to cause in order to vanish all the monsters?\n\nConstraints\n\nAll input values are integers.\n\n1 ≤ N ≤ 10^5\n\n1 ≤ B < A ≤ 10^9\n\n1 ≤ h_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\nh_1\nh_2\n:\nh_N\n\nOutput\n\nPrint the minimum number of explosions that needs to be caused in order to vanish all the monsters.\n\nSample Input 1\n\n4 5 3\n8\n7\n4\n2\n\nSample Output 1\n\n2\n\nYou can vanish all the monsters in two explosion, as follows:\n\nFirst, cause an explosion centered at the monster with 8 health. The healths of the four monsters become 3, 4, 1 and -1, respectively, and the last monster vanishes.\n\nSecond, cause an explosion centered at the monster with 4 health remaining. The healths of the three remaining monsters become 0, -1 and -2, respectively, and all the monsters are now vanished.\n\nSample Input 2\n\n2 10 4\n20\n20\n\nSample Output 2\n\n4\n\nYou need to cause two explosions centered at each monster, for a total of four.\n\nSample Input 3\n\n5 2 1\n900000000\n900000000\n1000000000\n1000000000\n1000000000\n\nSample Output 3\n\n800000000", "sample_input": "4 5 3\n8\n7\n4\n2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03700", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter N monsters. Each monster has a parameter called health, and the health of the i-th monster is h_i at the moment of encounter. A monster will vanish immediately when its health drops to 0 or below.\n\nFortunately, you are a skilled magician, capable of causing explosions that damage monsters. In one explosion, you can damage monsters as follows:\n\nSelect an alive monster, and cause an explosion centered at that monster. The health of the monster at the center of the explosion will decrease by A, and the health of each of the other monsters will decrease by B. Here, A and B are predetermined parameters, and A > B holds.\n\nAt least how many explosions do you need to cause in order to vanish all the monsters?\n\nConstraints\n\nAll input values are integers.\n\n1 ≤ N ≤ 10^5\n\n1 ≤ B < A ≤ 10^9\n\n1 ≤ h_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\nh_1\nh_2\n:\nh_N\n\nOutput\n\nPrint the minimum number of explosions that needs to be caused in order to vanish all the monsters.\n\nSample Input 1\n\n4 5 3\n8\n7\n4\n2\n\nSample Output 1\n\n2\n\nYou can vanish all the monsters in two explosion, as follows:\n\nFirst, cause an explosion centered at the monster with 8 health. The healths of the four monsters become 3, 4, 1 and -1, respectively, and the last monster vanishes.\n\nSecond, cause an explosion centered at the monster with 4 health remaining. The healths of the three remaining monsters become 0, -1 and -2, respectively, and all the monsters are now vanished.\n\nSample Input 2\n\n2 10 4\n20\n20\n\nSample Output 2\n\n4\n\nYou need to cause two explosions centered at each monster, for a total of four.\n\nSample Input 3\n\n5 2 1\n900000000\n900000000\n1000000000\n1000000000\n1000000000\n\nSample Output 3\n\n800000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 92, "memory_kb": 1408}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s578529226", "group_id": "codeNet:p03703", "input_text": "local mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n local c = #self.stage[i]\n for j = 1, c - 1 do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n if #self.stage[i + 1] < c * 2 then\n self.stage[i][c] = self.stage[i + 1][c * 2 - 1]\n else\n self.stage[i][c] = self.func(self.stage[i + 1][c * 2 - 1], self.stage[i + 1][c * 2])\n end\n end\nend\nSegTree.create = function(self, ary, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local datasize = #ary\n local datacount = {}\n while 1 < datasize do\n table.insert(datacount, 1, datasize)\n datasize = mce(datasize / 2)\n end\n table.insert(datacount, 1, 1)\n self.stagenum = #datacount\n self.stage, self.size = {}, {}\n local mul = 1\n for i = 1, self.stagenum do\n self.stage[i] = {}\n for j = 1, datacount[i] do self.stage[i][j] = emptyvalue end\n mul = mul * 2\n end\n for i = 1, self.stagenum do\n mul = mul / 2\n self.size[i] = mul\n end\n for i = 1, #ary do self.stage[self.stagenum][i] = ary[i] end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mmi(r, mce((l - 1) / sz) * sz)\n if newr < r then\n table.insert(t1, stage) table.insert(t2, newr + 1) table.insert(t3, r)\n end\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)\n else\n if sz <= r + 1 - l then\n ret = self.func(ret, self.stage[stage][mce(l / sz)])\n l = l + sz\n end\n if l <= r then\n table.insert(t1, 1, stage + 1) table.insert(t2, 1, l) table.insert(t3, 1, r)\n end\n end\n end\n return ret\nend\nSegTree.decValue = function(self, idx)\n self.stage[self.stagenum][idx] = self.stage[self.stagenum][idx] - 1\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n if idx % 2 == 0 then\n self.stage[i][dst] = self.func(self.stage[i + 1][idx - 1], self.stage[i + 1][idx])\n else\n if #self.stage[i + 1] == idx then\n self.stage[i][dst] = self.stage[i + 1][idx]\n else\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][idx + 1])\n end\n end\n idx = dst\n end\nend\nSegTree.new = function(ary, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(ary, func, emptyvalue)\n return obj\nend\n\n\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal sum, tmp, conv = {}, {}, {}\nsum[1] = io.read(\"*n\") - k\nfor i = 2, n do\n sum[i] = sum[i - 1] + io.read(\"*n\") - k\nend\nsum[n + 1] = 0\nfor i = 1, n + 1 do tmp[i] = sum[i] end\ntable.sort(tmp)\nlocal sumTypeCount = 1\nlocal sumTypeList = {}\nconv[tmp[1]] = 1\nsumTypeList[1] = tmp[1]\nfor i = 2, n + 1 do\n if tmp[i] ~= sumTypeList[sumTypeCount] then\n sumTypeCount = sumTypeCount + 1\n conv[tmp[i]] = sumTypeCount\n sumTypeList[sumTypeCount] = tmp[i]\n end\nend\nlocal sumTypeAry = {}\nfor i = 1, sumTypeCount do sumTypeAry[i] = 0 end\nfor i = 1, n do\n local j = conv[sum[i]]\n sumTypeAry[j] = sumTypeAry[j] + 1\nend\nlocal segtree = SegTree.new(sumTypeAry, function(a, b) return a + b end, 0)\nlocal bias = 0\nlocal cnt = 0\nfor i = 1, n do\n cnt = cnt + segtree:getRange(conv[bias], sumTypeCount)\n segtree:decValue(conv[sum[i]])\n bias = sum[i]\nend\nprint(cnt)\n", "language": "Lua", "metadata": {"date": 1566783260, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s578529226.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s578529226", "user_id": "u120582723"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n local c = #self.stage[i]\n for j = 1, c - 1 do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n if #self.stage[i + 1] < c * 2 then\n self.stage[i][c] = self.stage[i + 1][c * 2 - 1]\n else\n self.stage[i][c] = self.func(self.stage[i + 1][c * 2 - 1], self.stage[i + 1][c * 2])\n end\n end\nend\nSegTree.create = function(self, ary, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local datasize = #ary\n local datacount = {}\n while 1 < datasize do\n table.insert(datacount, 1, datasize)\n datasize = mce(datasize / 2)\n end\n table.insert(datacount, 1, 1)\n self.stagenum = #datacount\n self.stage, self.size = {}, {}\n local mul = 1\n for i = 1, self.stagenum do\n self.stage[i] = {}\n for j = 1, datacount[i] do self.stage[i][j] = emptyvalue end\n mul = mul * 2\n end\n for i = 1, self.stagenum do\n mul = mul / 2\n self.size[i] = mul\n end\n for i = 1, #ary do self.stage[self.stagenum][i] = ary[i] end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mmi(r, mce((l - 1) / sz) * sz)\n if newr < r then\n table.insert(t1, stage) table.insert(t2, newr + 1) table.insert(t3, r)\n end\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)\n else\n if sz <= r + 1 - l then\n ret = self.func(ret, self.stage[stage][mce(l / sz)])\n l = l + sz\n end\n if l <= r then\n table.insert(t1, 1, stage + 1) table.insert(t2, 1, l) table.insert(t3, 1, r)\n end\n end\n end\n return ret\nend\nSegTree.decValue = function(self, idx)\n self.stage[self.stagenum][idx] = self.stage[self.stagenum][idx] - 1\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n if idx % 2 == 0 then\n self.stage[i][dst] = self.func(self.stage[i + 1][idx - 1], self.stage[i + 1][idx])\n else\n if #self.stage[i + 1] == idx then\n self.stage[i][dst] = self.stage[i + 1][idx]\n else\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][idx + 1])\n end\n end\n idx = dst\n end\nend\nSegTree.new = function(ary, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(ary, func, emptyvalue)\n return obj\nend\n\n\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal sum, tmp, conv = {}, {}, {}\nsum[1] = io.read(\"*n\") - k\nfor i = 2, n do\n sum[i] = sum[i - 1] + io.read(\"*n\") - k\nend\nsum[n + 1] = 0\nfor i = 1, n + 1 do tmp[i] = sum[i] end\ntable.sort(tmp)\nlocal sumTypeCount = 1\nlocal sumTypeList = {}\nconv[tmp[1]] = 1\nsumTypeList[1] = tmp[1]\nfor i = 2, n + 1 do\n if tmp[i] ~= sumTypeList[sumTypeCount] then\n sumTypeCount = sumTypeCount + 1\n conv[tmp[i]] = sumTypeCount\n sumTypeList[sumTypeCount] = tmp[i]\n end\nend\nlocal sumTypeAry = {}\nfor i = 1, sumTypeCount do sumTypeAry[i] = 0 end\nfor i = 1, n do\n local j = conv[sum[i]]\n sumTypeAry[j] = sumTypeAry[j] + 1\nend\nlocal segtree = SegTree.new(sumTypeAry, function(a, b) return a + b end, 0)\nlocal bias = 0\nlocal cnt = 0\nfor i = 1, n do\n cnt = cnt + segtree:getRange(conv[bias], sumTypeCount)\n segtree:decValue(conv[sum[i]])\n bias = sum[i]\nend\nprint(cnt)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3777, "cpu_time_ms": 2020, "memory_kb": 39720}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s496011839", "group_id": "codeNet:p03703", "input_text": "local mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.stage[i + 1][j * 2 - 1] + self.stage[i + 1][j * 2]\n end\n end\nend\nSegTree.create = function(self, n)\n self.emptyvalue = 0\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n for i = 1, mul do self.stage[stagenum][i] = 0 end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage, mul = 1, 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mce((l - 1) / sz) * sz\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, mmi(r, newr))\n l = newr + 1\n end\n if sz <= r + 1 - l then\n ret = ret + self.stage[stage][mce(l / sz)]\n l = l + sz\n end\n if l <= r then\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n end\n end\n return ret\nend\nSegTree.decValue = function(self, idx)\n self.stage[self.stagenum][idx] = self.stage[self.stagenum][idx] - 1\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.stage[i + 1][idx] + self.stage[i + 1][rem]\n idx = dst\n end\nend\nSegTree.inc = function(self, idx)\n self.stage[self.stagenum][idx] = 1 + self.stage[self.stagenum][idx]\nend\nSegTree.new = function(n)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n -- obj.updateAll = SegTree.updateAll\n -- obj.create = SegTree.create\n -- obj.getRange = SegTree.getRange\n -- obj.inc = SegTree.inc\n -- obj.decValue = SegTree.decValue\n obj:create(n)\n return obj\nend\n\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal sum, tmp, conv = {}, {}, {}\nsum[1] = io.read(\"*n\") - k\nfor i = 2, n do\n sum[i] = sum[i - 1] + io.read(\"*n\") - k\nend\nsum[n + 1] = 0\nfor i = 1, n + 1 do tmp[i] = sum[i] end\ntable.sort(tmp)\nlocal sumTypeCount = 1\nlocal sumTypeList = {}\nconv[tmp[1]] = 1\nsumTypeList[1] = tmp[1]\nfor i = 2, n + 1 do\n if tmp[i] ~= sumTypeList[sumTypeCount] then\n sumTypeCount = sumTypeCount + 1\n conv[tmp[i]] = sumTypeCount\n sumTypeList[sumTypeCount] = tmp[i]\n end\nend\nlocal segtree = SegTree.new(sumTypeCount)\nfor i = 1, n do\n segtree:inc(conv[sum[i]])\nend\nsegtree:updateAll()\nlocal bias = 0\nlocal cnt = 0\nfor i = 1, n do\n cnt = cnt + segtree:getRange(conv[bias], sumTypeCount)\n segtree:decValue(conv[sum[i]])\n bias = sum[i]\nend\nprint(cnt)\nprint(os.clock())\n", "language": "Lua", "metadata": {"date": 1564665692, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s496011839.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s496011839", "user_id": "u120582723"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.stage[i + 1][j * 2 - 1] + self.stage[i + 1][j * 2]\n end\n end\nend\nSegTree.create = function(self, n)\n self.emptyvalue = 0\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n for i = 1, mul do self.stage[stagenum][i] = 0 end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage, mul = 1, 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mce((l - 1) / sz) * sz\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, mmi(r, newr))\n l = newr + 1\n end\n if sz <= r + 1 - l then\n ret = ret + self.stage[stage][mce(l / sz)]\n l = l + sz\n end\n if l <= r then\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n end\n end\n return ret\nend\nSegTree.decValue = function(self, idx)\n self.stage[self.stagenum][idx] = self.stage[self.stagenum][idx] - 1\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.stage[i + 1][idx] + self.stage[i + 1][rem]\n idx = dst\n end\nend\nSegTree.inc = function(self, idx)\n self.stage[self.stagenum][idx] = 1 + self.stage[self.stagenum][idx]\nend\nSegTree.new = function(n)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n -- obj.updateAll = SegTree.updateAll\n -- obj.create = SegTree.create\n -- obj.getRange = SegTree.getRange\n -- obj.inc = SegTree.inc\n -- obj.decValue = SegTree.decValue\n obj:create(n)\n return obj\nend\n\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal sum, tmp, conv = {}, {}, {}\nsum[1] = io.read(\"*n\") - k\nfor i = 2, n do\n sum[i] = sum[i - 1] + io.read(\"*n\") - k\nend\nsum[n + 1] = 0\nfor i = 1, n + 1 do tmp[i] = sum[i] end\ntable.sort(tmp)\nlocal sumTypeCount = 1\nlocal sumTypeList = {}\nconv[tmp[1]] = 1\nsumTypeList[1] = tmp[1]\nfor i = 2, n + 1 do\n if tmp[i] ~= sumTypeList[sumTypeCount] then\n sumTypeCount = sumTypeCount + 1\n conv[tmp[i]] = sumTypeCount\n sumTypeList[sumTypeCount] = tmp[i]\n end\nend\nlocal segtree = SegTree.new(sumTypeCount)\nfor i = 1, n do\n segtree:inc(conv[sum[i]])\nend\nsegtree:updateAll()\nlocal bias = 0\nlocal cnt = 0\nfor i = 1, n do\n cnt = cnt + segtree:getRange(conv[bias], sumTypeCount)\n segtree:decValue(conv[sum[i]])\n bias = sum[i]\nend\nprint(cnt)\nprint(os.clock())\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3091, "cpu_time_ms": 796, "memory_kb": 35624}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s117790769", "group_id": "codeNet:p03703", "input_text": "local mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.stage[i + 1][j * 2 - 1] + self.stage[i + 1][j * 2]\n end\n end\nend\nSegTree.create = function(self, n)\n self.emptyvalue = 0\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n for i = 1, mul do self.stage[stagenum][i] = 0 end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local tasks = {{start_stage, left, right}}\n while 0 < #tasks do\n local task = tasks[#tasks]\n table.remove(tasks)\n local stage, l, r = task[1], task[2], task[3]\n if (l - 1) % self.size[stage] ~= 0 then\n local newr = mce((l - 1) / self.size[stage]) * self.size[stage]\n table.insert(tasks, {stage + 1, l, mmi(r, newr)})\n l = newr + 1\n end\n if self.size[stage] <= r + 1 - l then\n local pos = mce(l / self.size[stage])\n ret = ret + self.stage[stage][pos]\n l = l + self.size[stage]\n end\n if l <= r then\n table.insert(tasks, {stage + 1, l, r})\n end\n end\n return ret\nend\nSegTree.decValue = function(self, idx)\n self.stage[self.stagenum][idx] = self.stage[self.stagenum][idx] - 1\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.stage[i + 1][idx] + self.stage[i + 1][rem]\n idx = dst\n end\nend\nSegTree.inc = function(self, idx)\n self.stage[self.stagenum][idx] = 1 + self.stage[self.stagenum][idx]\nend\nSegTree.new = function(n)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n)\n return obj\nend\n\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal sum, tmp, conv = {}, {}, {}\nsum[1] = io.read(\"*n\") - k\nfor i = 2, n do\n sum[i] = sum[i - 1] + io.read(\"*n\") - k\nend\nsum[n + 1] = 0\nfor i = 1, n + 1 do tmp[i] = sum[i] end\ntable.sort(tmp)\nlocal sumTypeCount = 1\nlocal sumTypeList = {}\nconv[tmp[1]] = 1\nsumTypeList[1] = tmp[1]\nfor i = 2, n + 1 do\n if tmp[i] ~= sumTypeList[sumTypeCount] then\n sumTypeCount = sumTypeCount + 1\n conv[tmp[i]] = sumTypeCount\n sumTypeList[sumTypeCount] = tmp[i]\n end\nend\nlocal segtree = SegTree.new(sumTypeCount)\nfor i = 1, n do\n segtree:inc(conv[sum[i]])\nend\nsegtree:updateAll()\nlocal bias = 0\nlocal cnt = 0\nfor i = 1, n do\n cnt = cnt + segtree:getRange(conv[bias], sumTypeCount)\n segtree:decValue(conv[sum[i]])\n bias = sum[i]\nend\nprint(cnt)\n", "language": "Lua", "metadata": {"date": 1564626270, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s117790769.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s117790769", "user_id": "u120582723"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.stage[i + 1][j * 2 - 1] + self.stage[i + 1][j * 2]\n end\n end\nend\nSegTree.create = function(self, n)\n self.emptyvalue = 0\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n for i = 1, mul do self.stage[stagenum][i] = 0 end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local tasks = {{start_stage, left, right}}\n while 0 < #tasks do\n local task = tasks[#tasks]\n table.remove(tasks)\n local stage, l, r = task[1], task[2], task[3]\n if (l - 1) % self.size[stage] ~= 0 then\n local newr = mce((l - 1) / self.size[stage]) * self.size[stage]\n table.insert(tasks, {stage + 1, l, mmi(r, newr)})\n l = newr + 1\n end\n if self.size[stage] <= r + 1 - l then\n local pos = mce(l / self.size[stage])\n ret = ret + self.stage[stage][pos]\n l = l + self.size[stage]\n end\n if l <= r then\n table.insert(tasks, {stage + 1, l, r})\n end\n end\n return ret\nend\nSegTree.decValue = function(self, idx)\n self.stage[self.stagenum][idx] = self.stage[self.stagenum][idx] - 1\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.stage[i + 1][idx] + self.stage[i + 1][rem]\n idx = dst\n end\nend\nSegTree.inc = function(self, idx)\n self.stage[self.stagenum][idx] = 1 + self.stage[self.stagenum][idx]\nend\nSegTree.new = function(n)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n)\n return obj\nend\n\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal sum, tmp, conv = {}, {}, {}\nsum[1] = io.read(\"*n\") - k\nfor i = 2, n do\n sum[i] = sum[i - 1] + io.read(\"*n\") - k\nend\nsum[n + 1] = 0\nfor i = 1, n + 1 do tmp[i] = sum[i] end\ntable.sort(tmp)\nlocal sumTypeCount = 1\nlocal sumTypeList = {}\nconv[tmp[1]] = 1\nsumTypeList[1] = tmp[1]\nfor i = 2, n + 1 do\n if tmp[i] ~= sumTypeList[sumTypeCount] then\n sumTypeCount = sumTypeCount + 1\n conv[tmp[i]] = sumTypeCount\n sumTypeList[sumTypeCount] = tmp[i]\n end\nend\nlocal segtree = SegTree.new(sumTypeCount)\nfor i = 1, n do\n segtree:inc(conv[sum[i]])\nend\nsegtree:updateAll()\nlocal bias = 0\nlocal cnt = 0\nfor i = 1, n do\n cnt = cnt + segtree:getRange(conv[bias], sumTypeCount)\n segtree:decValue(conv[sum[i]])\n bias = sum[i]\nend\nprint(cnt)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2903, "cpu_time_ms": 1369, "memory_kb": 35360}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s204688383", "group_id": "codeNet:p03716", "input_text": "local PairingHeap={}\n\nPairingHeap.meld=function(self,a,b)\n if not a then\n return b\n elseif not b then\n return a\n elseif a[1]P then\n lsum[i]=lsum[i-1]+A-P\n minq:push(A,A)\n minq:pop()\n else\n lsum[i]=lsum[i-1]\n end\nend\n\nlocal rsum={[0]=0}\nlocal maxq=PairingHeap:new()\nfor i=1,n do\n local A=a[3*n-i+1]\n rsum[i]=rsum[i-1]+A\n maxq:push(-A,A)\nend\nfor i=n+1,2*n do\n local P=maxq:top()\n local A=a[3*n-i+1]\n if A

P then\n lsum[i]=lsum[i-1]+A-P\n minq:push(A,A)\n minq:pop()\n else\n lsum[i]=lsum[i-1]\n end\nend\n\nlocal rsum={[0]=0}\nlocal maxq=PairingHeap:new()\nfor i=1,n do\n local A=a[3*n-i+1]\n rsum[i]=rsum[i-1]+A\n maxq:push(-A,A)\nend\nfor i=n+1,2*n do\n local P=maxq:top()\n local A=a[3*n-i+1]\n if A

P then\n lsum[i]=lsum[i-1]+A-P\n minq:push(A,A)\n minq:pop()\n else\n lsum[i]=lsum[i-1]\n end\nend\n\nlocal rsum={[0]=0}\nlocal maxq=PairingHeap:new()\nfor i=1,n do\n local A=a[3*n-i+1]\n rsum[i]=rsum[i-1]+A\n maxq:push(-A,A)\nend\nfor i=n+1,2*n do\n local P=maxq:top()\n local A=a[3*n-i+1]\n if A

P then\n lsum[i]=lsum[i-1]+A-P\n minq:push(A,A)\n minq:pop()\n else\n lsum[i]=lsum[i-1]\n end\nend\n\nlocal rsum={[0]=0}\nlocal maxq=PairingHeap:new()\nfor i=1,n do\n local A=a[3*n-i+1]\n rsum[i]=rsum[i-1]+A\n maxq:push(-A,A)\nend\nfor i=n+1,2*n do\n local P=maxq:top()\n local A=a[3*n-i+1]\n if A

P then\n lsum[i]=lsum[i-1]+A-P\n minq:push(A,A)\n else\n lsum[i]=lsum[i-1]\n minq:push(P,P)\n end\nend\n\nlocal rsum={[0]=0}\nlocal maxq=PairingHeap:new()\nfor i=1,n do\n local A=a[3*n-i+1]\n rsum[i]=rsum[i-1]+A\n maxq:push(-A,A)\nend\nfor i=n+1,2*n do\n local P=maxq:pop()\n local A=a[3*n-i+1]\n if A

P then\n lsum[i]=lsum[i-1]+A-P\n minq:push(A,A)\n else\n lsum[i]=lsum[i-1]\n minq:push(P,P)\n end\nend\n\nlocal rsum={[0]=0}\nlocal maxq=PairingHeap:new()\nfor i=1,n do\n local A=a[3*n-i+1]\n rsum[i]=rsum[i-1]+A\n maxq:push(-A,A)\nend\nfor i=n+1,2*n do\n local P=maxq:pop()\n local A=a[3*n-i+1]\n if A

=A and C<=B then print(\"Yes\")\nelse print(\"No\") end", "language": "Lua", "metadata": {"date": 1568003765, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03719.html", "problem_id": "p03719", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03719/input.txt", "sample_output_relpath": "derived/input_output/data/p03719/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03719/Lua/s587142694.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s587142694", "user_id": "u162773977"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local A, B, C = io.read(\"n\", \"n\", \"n\")\nif C>=A and C<=B then print(\"Yes\")\nelse print(\"No\") end", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given three integers A, B and C.\nDetermine whether C is not less than A and not greater than B.\n\nConstraints\n\n-100≤A,B,C≤100\n\nA, B and C are all integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the condition is satisfied, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 3 2\n\nSample Output 1\n\nYes\n\nC=2 is not less than A=1 and not greater than B=3, and thus the output should be Yes.\n\nSample Input 2\n\n6 5 4\n\nSample Output 2\n\nNo\n\nC=4 is less than A=6, and thus the output should be No.\n\nSample Input 3\n\n2 2 2\n\nSample Output 3\n\nYes", "sample_input": "1 3 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03719", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given three integers A, B and C.\nDetermine whether C is not less than A and not greater than B.\n\nConstraints\n\n-100≤A,B,C≤100\n\nA, B and C are all integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the condition is satisfied, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 3 2\n\nSample Output 1\n\nYes\n\nC=2 is not less than A=1 and not greater than B=3, and thus the output should be Yes.\n\nSample Input 2\n\n6 5 4\n\nSample Output 2\n\nNo\n\nC=4 is less than A=6, and thus the output should be No.\n\nSample Input 3\n\n2 2 2\n\nSample Output 3\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s204244886", "group_id": "codeNet:p03720", "input_text": "local read = io.read\n\nlocal N, M = read(\"*n\", \"*n\")\nlocal load_s = {}\nfor i = 1, N do\n\tload_s[i] = 0\nend\n\nfor i = 1, 2 * M do\n\tlocal ab_i = read(\"*n\")\n\tload_s[ab_i] = load_s[ab_i] + 1\nend\n\nprint(table.concat(load_s, \"\\n\"))\n", "language": "Lua", "metadata": {"date": 1594998126, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p03720.html", "problem_id": "p03720", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03720/input.txt", "sample_output_relpath": "derived/input_output/data/p03720/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03720/Lua/s204244886.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s204244886", "user_id": "u793881115"}, "prompt_components": {"gold_output": "2\n2\n1\n1\n", "input_to_evaluate": "local read = io.read\n\nlocal N, M = read(\"*n\", \"*n\")\nlocal load_s = {}\nfor i = 1, N do\n\tload_s[i] = 0\nend\n\nfor i = 1, 2 * M do\n\tlocal ab_i = read(\"*n\")\n\tload_s[ab_i] = load_s[ab_i] + 1\nend\n\nprint(table.concat(load_s, \"\\n\"))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N cities and M roads.\nThe i-th road (1≤i≤M) connects two cities a_i and b_i (1≤a_i,b_i≤N) bidirectionally.\nThere may be more than one road that connects the same pair of two cities.\nFor each city, how many roads are connected to the city?\n\nConstraints\n\n2≤N,M≤50\n\n1≤a_i,b_i≤N\n\na_i ≠ b_i\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_M b_M\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line (1≤i≤N), print the number of roads connected to city i.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n1 4\n\nSample Output 1\n\n2\n2\n1\n1\n\nCity 1 is connected to the 1-st and 3-rd roads.\n\nCity 2 is connected to the 1-st and 2-nd roads.\n\nCity 3 is connected to the 2-nd road.\n\nCity 4 is connected to the 3-rd road.\n\nSample Input 2\n\n2 5\n1 2\n2 1\n1 2\n2 1\n1 2\n\nSample Output 2\n\n5\n5\n\nSample Input 3\n\n8 8\n1 2\n3 4\n1 5\n2 8\n3 7\n5 2\n4 1\n6 8\n\nSample Output 3\n\n3\n3\n2\n2\n2\n1\n1\n2", "sample_input": "4 3\n1 2\n2 3\n1 4\n"}, "reference_outputs": ["2\n2\n1\n1\n"], "source_document_id": "p03720", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N cities and M roads.\nThe i-th road (1≤i≤M) connects two cities a_i and b_i (1≤a_i,b_i≤N) bidirectionally.\nThere may be more than one road that connects the same pair of two cities.\nFor each city, how many roads are connected to the city?\n\nConstraints\n\n2≤N,M≤50\n\n1≤a_i,b_i≤N\n\na_i ≠ b_i\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_M b_M\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line (1≤i≤N), print the number of roads connected to city i.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n1 4\n\nSample Output 1\n\n2\n2\n1\n1\n\nCity 1 is connected to the 1-st and 3-rd roads.\n\nCity 2 is connected to the 1-st and 2-nd roads.\n\nCity 3 is connected to the 2-nd road.\n\nCity 4 is connected to the 3-rd road.\n\nSample Input 2\n\n2 5\n1 2\n2 1\n1 2\n2 1\n1 2\n\nSample Output 2\n\n5\n5\n\nSample Input 3\n\n8 8\n1 2\n3 4\n1 5\n2 8\n3 7\n5 2\n4 1\n6 8\n\nSample Output 3\n\n3\n3\n2\n2\n2\n1\n1\n2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 223, "cpu_time_ms": 3, "memory_kb": 2696}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s983980513", "group_id": "codeNet:p03720", "input_text": "line = function()\n\tlocal t = {}\n\tstring.gsub(io.read(),\"(%S+)\", function (v) table.insert(t,tonumber(v)) end)\n\treturn t[1], t[2]\nend\n\nN, M = line()\n\nans = {}\n\nfor i=1, N do\n\tans[i] = 0\t\nend\n\nfor i = 1, M do\n\ta, b = line()\n\tans[a] = ans[a] + 1\n\tans[b] = ans[b] + 1\nend\n\nfor i = 1, N do\n\tprint(ans[i])\t\nend", "language": "Lua", "metadata": {"date": 1494745890, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03720.html", "problem_id": "p03720", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03720/input.txt", "sample_output_relpath": "derived/input_output/data/p03720/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03720/Lua/s983980513.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s983980513", "user_id": "u194412908"}, "prompt_components": {"gold_output": "2\n2\n1\n1\n", "input_to_evaluate": "line = function()\n\tlocal t = {}\n\tstring.gsub(io.read(),\"(%S+)\", function (v) table.insert(t,tonumber(v)) end)\n\treturn t[1], t[2]\nend\n\nN, M = line()\n\nans = {}\n\nfor i=1, N do\n\tans[i] = 0\t\nend\n\nfor i = 1, M do\n\ta, b = line()\n\tans[a] = ans[a] + 1\n\tans[b] = ans[b] + 1\nend\n\nfor i = 1, N do\n\tprint(ans[i])\t\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N cities and M roads.\nThe i-th road (1≤i≤M) connects two cities a_i and b_i (1≤a_i,b_i≤N) bidirectionally.\nThere may be more than one road that connects the same pair of two cities.\nFor each city, how many roads are connected to the city?\n\nConstraints\n\n2≤N,M≤50\n\n1≤a_i,b_i≤N\n\na_i ≠ b_i\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_M b_M\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line (1≤i≤N), print the number of roads connected to city i.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n1 4\n\nSample Output 1\n\n2\n2\n1\n1\n\nCity 1 is connected to the 1-st and 3-rd roads.\n\nCity 2 is connected to the 1-st and 2-nd roads.\n\nCity 3 is connected to the 2-nd road.\n\nCity 4 is connected to the 3-rd road.\n\nSample Input 2\n\n2 5\n1 2\n2 1\n1 2\n2 1\n1 2\n\nSample Output 2\n\n5\n5\n\nSample Input 3\n\n8 8\n1 2\n3 4\n1 5\n2 8\n3 7\n5 2\n4 1\n6 8\n\nSample Output 3\n\n3\n3\n2\n2\n2\n1\n1\n2", "sample_input": "4 3\n1 2\n2 3\n1 4\n"}, "reference_outputs": ["2\n2\n1\n1\n"], "source_document_id": "p03720", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N cities and M roads.\nThe i-th road (1≤i≤M) connects two cities a_i and b_i (1≤a_i,b_i≤N) bidirectionally.\nThere may be more than one road that connects the same pair of two cities.\nFor each city, how many roads are connected to the city?\n\nConstraints\n\n2≤N,M≤50\n\n1≤a_i,b_i≤N\n\na_i ≠ b_i\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_M b_M\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line (1≤i≤N), print the number of roads connected to city i.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n1 4\n\nSample Output 1\n\n2\n2\n1\n1\n\nCity 1 is connected to the 1-st and 3-rd roads.\n\nCity 2 is connected to the 1-st and 2-nd roads.\n\nCity 3 is connected to the 2-nd road.\n\nCity 4 is connected to the 3-rd road.\n\nSample Input 2\n\n2 5\n1 2\n2 1\n1 2\n2 1\n1 2\n\nSample Output 2\n\n5\n5\n\nSample Input 3\n\n8 8\n1 2\n3 4\n1 5\n2 8\n3 7\n5 2\n4 1\n6 8\n\nSample Output 3\n\n3\n3\n2\n2\n2\n1\n1\n2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s822442970", "group_id": "codeNet:p03721", "input_text": "local n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, 100000 do\n t[i] = 0\nend\nfor i = 1, n do\n local a, b = io.read(\"*n\", \"*n\")\n t[a] = t[a] + b\nend\nlocal sum = 0\nfor i = 1, 100000 do\n sum = sum + t[i]\n if k <= sum then print(i) break end\nend", "language": "Lua", "metadata": {"date": 1601240408, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03721.html", "problem_id": "p03721", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03721/input.txt", "sample_output_relpath": "derived/input_output/data/p03721/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03721/Lua/s822442970.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s822442970", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, 100000 do\n t[i] = 0\nend\nfor i = 1, n do\n local a, b = io.read(\"*n\", \"*n\")\n t[a] = t[a] + b\nend\nlocal sum = 0\nfor i = 1, 100000 do\n sum = sum + t[i]\n if k <= sum then print(i) break end\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is an empty array.\nThe following N operations will be performed to insert integers into the array.\nIn the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array.\nFind the K-th smallest integer in the array after the N operations.\nFor example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.\n\nConstraints\n\n1≤N≤10^5\n\n1≤a_i,b_i≤10^5\n\n1≤K≤b_1…+…b_n\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the K-th smallest integer in the array after the N operations.\n\nSample Input 1\n\n3 4\n1 1\n2 2\n3 3\n\nSample Output 1\n\n3\n\nThe resulting array is the same as the one in the problem statement.\n\nSample Input 2\n\n10 500000\n1 100000\n1 100000\n1 100000\n1 100000\n1 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n\nSample Output 2\n\n1", "sample_input": "3 4\n1 1\n2 2\n3 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03721", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is an empty array.\nThe following N operations will be performed to insert integers into the array.\nIn the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array.\nFind the K-th smallest integer in the array after the N operations.\nFor example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.\n\nConstraints\n\n1≤N≤10^5\n\n1≤a_i,b_i≤10^5\n\n1≤K≤b_1…+…b_n\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the K-th smallest integer in the array after the N operations.\n\nSample Input 1\n\n3 4\n1 1\n2 2\n3 3\n\nSample Output 1\n\n3\n\nThe resulting array is the same as the one in the problem statement.\n\nSample Input 2\n\n10 500000\n1 100000\n1 100000\n1 100000\n1 100000\n1 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n\nSample Output 2\n\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 43, "memory_kb": 4276}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s882675179", "group_id": "codeNet:p03721", "input_text": "line = function()\n\tlocal t = {}\n\tstring.gsub(io.read(),\"(%S+)\", function (v) table.insert(t,tonumber(v)) end)\n\treturn t[1], t[2]\nend\n\nN, K = line()\n\ncnt = {}\n\nfor i = 1, 100000 do\n\tcnt[i] = 0\t\nend\n\nfor i = 1, N do\n\ta, b = line()\n\tcnt[a] = cnt[a] + b\nend\n\nindex = 0\n\nfor i = 1, 100000 do\n\tindex = index + cnt[i]\n\tif index >= K then\n\t\tprint(i)\n\t\tbreak\n\tend\nend\n\n", "language": "Lua", "metadata": {"date": 1494746647, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03721.html", "problem_id": "p03721", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03721/input.txt", "sample_output_relpath": "derived/input_output/data/p03721/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03721/Lua/s882675179.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s882675179", "user_id": "u194412908"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "line = function()\n\tlocal t = {}\n\tstring.gsub(io.read(),\"(%S+)\", function (v) table.insert(t,tonumber(v)) end)\n\treturn t[1], t[2]\nend\n\nN, K = line()\n\ncnt = {}\n\nfor i = 1, 100000 do\n\tcnt[i] = 0\t\nend\n\nfor i = 1, N do\n\ta, b = line()\n\tcnt[a] = cnt[a] + b\nend\n\nindex = 0\n\nfor i = 1, 100000 do\n\tindex = index + cnt[i]\n\tif index >= K then\n\t\tprint(i)\n\t\tbreak\n\tend\nend\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is an empty array.\nThe following N operations will be performed to insert integers into the array.\nIn the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array.\nFind the K-th smallest integer in the array after the N operations.\nFor example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.\n\nConstraints\n\n1≤N≤10^5\n\n1≤a_i,b_i≤10^5\n\n1≤K≤b_1…+…b_n\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the K-th smallest integer in the array after the N operations.\n\nSample Input 1\n\n3 4\n1 1\n2 2\n3 3\n\nSample Output 1\n\n3\n\nThe resulting array is the same as the one in the problem statement.\n\nSample Input 2\n\n10 500000\n1 100000\n1 100000\n1 100000\n1 100000\n1 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n\nSample Output 2\n\n1", "sample_input": "3 4\n1 1\n2 2\n3 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03721", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is an empty array.\nThe following N operations will be performed to insert integers into the array.\nIn the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array.\nFind the K-th smallest integer in the array after the N operations.\nFor example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.\n\nConstraints\n\n1≤N≤10^5\n\n1≤a_i,b_i≤10^5\n\n1≤K≤b_1…+…b_n\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the K-th smallest integer in the array after the N operations.\n\nSample Input 1\n\n3 4\n1 1\n2 2\n3 3\n\nSample Output 1\n\n3\n\nThe resulting array is the same as the one in the problem statement.\n\nSample Input 2\n\n10 500000\n1 100000\n1 100000\n1 100000\n1 100000\n1 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n\nSample Output 2\n\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 360, "cpu_time_ms": 256, "memory_kb": 19704}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s007630551", "group_id": "codeNet:p03722", "input_text": "local n, m = io.read(\"*n\", \"*n\")\nlocal edge = {}\nfor i = 1, n do edge[i] = {} end\nfor i = 1, m do\n local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n edge[a][b] = c\nend\n\nlocal taskstate = {}\nfor i = 1, n do taskstate[i] = false end\nlocal tasks = {}\nlocal tasknum = 0\nlocal done = 0\nlocal tasklim = n + 1\nlocal updatecount = 0\nlocal len = {}\nfor i = 1, n do len[i] = -1000000000000 end\nlen[1] = 0\nlocal function addtask(idx)\n if(not taskstate[idx]) then\n taskstate[idx] = true\n tasknum = tasknum + 1\n local taskidx = tasknum % tasklim\n if taskidx == 0 then taskidx = tasklim end\n tasks[taskidx] = idx\n if idx == n then\n updatecount = updatecount + 1\n if n + 2 < updatecount then\n return false\n end\n end\n end\n return true\nend\naddtask(1)\n\nlocal ret = true\nwhile(done < tasknum) do\n done = done + 1\n local taskidx = done % tasklim\n if(taskidx == 0) then taskidx = tasklim end\n local src = tasks[taskidx]\n taskstate[src] = false\n\n for dst, cost in pairs(edge[src]) do\n if len[dst] < len[src] + cost then\n len[dst] = len[src] + cost\n ret = addtask(dst)\n end\n end\n if not ret then break end\n if 5000000 < done then break end\nend\nif ret then\n print(len[n])\nelse\n print(\"inf\")\nend\n", "language": "Lua", "metadata": {"date": 1565052519, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s007630551.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s007630551", "user_id": "u120582723"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "local n, m = io.read(\"*n\", \"*n\")\nlocal edge = {}\nfor i = 1, n do edge[i] = {} end\nfor i = 1, m do\n local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n edge[a][b] = c\nend\n\nlocal taskstate = {}\nfor i = 1, n do taskstate[i] = false end\nlocal tasks = {}\nlocal tasknum = 0\nlocal done = 0\nlocal tasklim = n + 1\nlocal updatecount = 0\nlocal len = {}\nfor i = 1, n do len[i] = -1000000000000 end\nlen[1] = 0\nlocal function addtask(idx)\n if(not taskstate[idx]) then\n taskstate[idx] = true\n tasknum = tasknum + 1\n local taskidx = tasknum % tasklim\n if taskidx == 0 then taskidx = tasklim end\n tasks[taskidx] = idx\n if idx == n then\n updatecount = updatecount + 1\n if n + 2 < updatecount then\n return false\n end\n end\n end\n return true\nend\naddtask(1)\n\nlocal ret = true\nwhile(done < tasknum) do\n done = done + 1\n local taskidx = done % tasklim\n if(taskidx == 0) then taskidx = tasklim end\n local src = tasks[taskidx]\n taskstate[src] = false\n\n for dst, cost in pairs(edge[src]) do\n if len[dst] < len[src] + cost then\n len[dst] = len[src] + cost\n ret = addtask(dst)\n end\n end\n if not ret then break end\n if 5000000 < done then break end\nend\nif ret then\n print(len[n])\nelse\n print(\"inf\")\nend\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a directed graph with N vertices and M edges.\nThe i-th edge (1≤i≤M) points from vertex a_i to vertex b_i, and has a weight c_i.\nWe will play the following single-player game using this graph and a piece.\n\nInitially, the piece is placed at vertex 1, and the score of the player is set to 0.\nThe player can move the piece as follows:\n\nWhen the piece is placed at vertex a_i, move the piece along the i-th edge to vertex b_i. After this move, the score of the player is increased by c_i.\n\nThe player can end the game only when the piece is placed at vertex N.\nThe given graph guarantees that it is possible to traverse from vertex 1 to vertex N.\n\nWhen the player acts optimally to maximize the score at the end of the game, what will the score be?\nIf it is possible to increase the score indefinitely, print inf.\n\nConstraints\n\n2≤N≤1000\n\n1≤M≤min(N(N-1),2000)\n\n1≤a_i,b_i≤N (1≤i≤M)\n\na_i≠b_i (1≤i≤M)\n\na_i≠a_j or b_i≠b_j (1≤i0 and\"inf\"or d[1][n])", "language": "Lua", "metadata": {"date": 1524454699, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s162114128.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s162114128", "user_id": "u781091740"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "n,m=io.read(\"*n\",\"*n\")\nd={}\ne=-1e15\nfor i=1,n do\n\td[i]={}\n\tfor j=1,n do\n\t\td[i][j]=(i==j and 0 or e)\n\tend\nend\n\nfor i=1,m do\n\ta,b,c=io.read(\"*n\",\"*n\",\"*n\")\n\td[a][b]=c\nend\n\nfor k=1,n do\n\tfor i=1,n do\n\t\tlocal c=d[i][k]\n\t\tif c~=e then\n\t\t\tfor j=1,n do\n\t\t\t\tlocal f=d[k][j]\n\t\t\t\tif f~=e then\n\t\t\t\t\tlocal a=c+f\n\t\t\t\t\tlocal b=d[i][j]\n\t\t\t\t\tif b0 and\"inf\"or d[1][n])", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a directed graph with N vertices and M edges.\nThe i-th edge (1≤i≤M) points from vertex a_i to vertex b_i, and has a weight c_i.\nWe will play the following single-player game using this graph and a piece.\n\nInitially, the piece is placed at vertex 1, and the score of the player is set to 0.\nThe player can move the piece as follows:\n\nWhen the piece is placed at vertex a_i, move the piece along the i-th edge to vertex b_i. After this move, the score of the player is increased by c_i.\n\nThe player can end the game only when the piece is placed at vertex N.\nThe given graph guarantees that it is possible to traverse from vertex 1 to vertex N.\n\nWhen the player acts optimally to maximize the score at the end of the game, what will the score be?\nIf it is possible to increase the score indefinitely, print inf.\n\nConstraints\n\n2≤N≤1000\n\n1≤M≤min(N(N-1),2000)\n\n1≤a_i,b_i≤N (1≤i≤M)\n\na_i≠b_i (1≤i≤M)\n\na_i≠a_j or b_i≠b_j (1≤i0 and\"inf\"or d[1][n])", "language": "Lua", "metadata": {"date": 1524446896, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s365106770.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s365106770", "user_id": "u781091740"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "n,m=io.read(\"*n\",\"*n\")\nd={}\ne=-1e15\nfor i=1,n do\n\td[i]={}\n\tfor j=1,n do\n\t\td[i][j]=(i==j and 0 or e)\n\tend\nend\n\nfor i=1,m do\n\ta,b,c=io.read(\"*n\",\"*n\",\"*n\")\n\td[a][b]=c\nend\n\nfor k=1,n do\n\tfor i=1,n do\n\t\tc=d[i][k]\n\t\tif c~=e then\n\t\tfor j,_ in ipairs(d[k]) do\n\t\t\ta=c+d[k][j]\n\t\t\tb=d[i][j]\n\t\t\tif b0 and\"inf\"or d[1][n])", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a directed graph with N vertices and M edges.\nThe i-th edge (1≤i≤M) points from vertex a_i to vertex b_i, and has a weight c_i.\nWe will play the following single-player game using this graph and a piece.\n\nInitially, the piece is placed at vertex 1, and the score of the player is set to 0.\nThe player can move the piece as follows:\n\nWhen the piece is placed at vertex a_i, move the piece along the i-th edge to vertex b_i. After this move, the score of the player is increased by c_i.\n\nThe player can end the game only when the piece is placed at vertex N.\nThe given graph guarantees that it is possible to traverse from vertex 1 to vertex N.\n\nWhen the player acts optimally to maximize the score at the end of the game, what will the score be?\nIf it is possible to increase the score indefinitely, print inf.\n\nConstraints\n\n2≤N≤1000\n\n1≤M≤min(N(N-1),2000)\n\n1≤a_i,b_i≤N (1≤i≤M)\n\na_i≠b_i (1≤i≤M)\n\na_i≠a_j or b_i≠b_j (1≤i0 and\"inf\"or d[1][n])", "language": "Lua", "metadata": {"date": 1524446427, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s780602256.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s780602256", "user_id": "u781091740"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "n,m=io.read(\"*n\",\"*n\")\nd={}\nfor i=1,n do\n\td[i]={}\n\tfor j=1,n do\n\t\td[i][j]=(i==j and 0 or -1e15)\n\tend\nend\n\nfor i=1,m do\n\ta,b,c=io.read(\"*n\",\"*n\",\"*n\")\n\td[a][b]=c\nend\n\nfor k=1,n do\n\tfor i=1,n do\n\t\tc=d[i][k]\n\t\tfor j=1,n do\n\t\t\ta=c+d[k][j]\n\t\t\tb=d[i][j]\n\t\t\tif b0 and\"inf\"or d[1][n])", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a directed graph with N vertices and M edges.\nThe i-th edge (1≤i≤M) points from vertex a_i to vertex b_i, and has a weight c_i.\nWe will play the following single-player game using this graph and a piece.\n\nInitially, the piece is placed at vertex 1, and the score of the player is set to 0.\nThe player can move the piece as follows:\n\nWhen the piece is placed at vertex a_i, move the piece along the i-th edge to vertex b_i. After this move, the score of the player is increased by c_i.\n\nThe player can end the game only when the piece is placed at vertex N.\nThe given graph guarantees that it is possible to traverse from vertex 1 to vertex N.\n\nWhen the player acts optimally to maximize the score at the end of the game, what will the score be?\nIf it is possible to increase the score indefinitely, print inf.\n\nConstraints\n\n2≤N≤1000\n\n1≤M≤min(N(N-1),2000)\n\n1≤a_i,b_i≤N (1≤i≤M)\n\na_i≠b_i (1��i≤M)\n\na_i≠a_j or b_i≠b_j (1≤i0 and\"inf\"or d[1][n])", "language": "Lua", "metadata": {"date": 1524445856, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s446610179.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s446610179", "user_id": "u781091740"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "n,m=io.read(\"*n\",\"*n\")\nd={}\nfor i=1,n do\n\td[i]={}\n\tfor j=1,n do\n\t\td[i][j]=(i==j and 0 or -1e15)\n\tend\nend\n\nfor i=1,m do\n\ta,b,c=io.read(\"*n\",\"*n\",\"*n\")\n\td[a][b]=c\nend\n\t\nfor k=1,n do\n\tfor i=1,n do\n\t\tfor j=1,n do\n\t\t\td[i][j]=math.max(d[i][j],d[i][k]+d[k][j])\n\t\tend\n\tend\nend\n\nprint(d[1][1]>0 and\"inf\"or d[1][n])", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a directed graph with N vertices and M edges.\nThe i-th edge (1≤i≤M) points from vertex a_i to vertex b_i, and has a weight c_i.\nWe will play the following single-player game using this graph and a piece.\n\nInitially, the piece is placed at vertex 1, and the score of the player is set to 0.\nThe player can move the piece as follows:\n\nWhen the piece is placed at vertex a_i, move the piece along the i-th edge to vertex b_i. After this move, the score of the player is increased by c_i.\n\nThe player can end the game only when the piece is placed at vertex N.\nThe given graph guarantees that it is possible to traverse from vertex 1 to vertex N.\n\nWhen the player acts optimally to maximize the score at the end of the game, what will the score be?\nIf it is possible to increase the score indefinitely, print inf.\n\nConstraints\n\n2≤N≤1000\n\n1≤M≤min(N(N-1),2000)\n\n1≤a_i,b_i≤N (1≤i≤M)\n\na_i≠b_i (1≤i≤M)\n\na_i≠a_j or b_i≠b_j (1≤ib and \"GREATER\" or \"LESS\")", "language": "Lua", "metadata": {"date": 1551750086, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s109969509.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s109969509", "user_id": "u837412668"}, "prompt_components": {"gold_output": "GREATER\n", "input_to_evaluate": "a=io.read()\nb=io.read()\na=string.rep(\"0\",101-#a)..a\nb=string.rep(\"0\",101-#b)..b\nprint(a==b and \"EQUAL\" or a>b and \"GREATER\" or \"LESS\")", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 134, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s626279071", "group_id": "codeNet:p03739", "input_text": "local n = io.read(\"*n\")\nlocal a = {}\nfor i = 1, n do a[i] = io.read(\"*n\") end\nlocal ret = 1000000007 * 1000000007\nfor flag = -1, 1, 2 do\n local cur = 0\n local cnt = 0\n for i = 1, n do\n cur = cur + a[i]\n if flag < 0 then\n if 0 <= cur then\n cnt = cnt + cur + 1\n cur = -1\n end\n else\n if cur <= 0 then\n cnt = cnt - cur + 1\n cur = 1\n end\n end\n flag = flag * -1\n end\n ret = math.min(ret, cnt)\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1581897518, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s626279071.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s626279071", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal a = {}\nfor i = 1, n do a[i] = io.read(\"*n\") end\nlocal ret = 1000000007 * 1000000007\nfor flag = -1, 1, 2 do\n local cur = 0\n local cnt = 0\n for i = 1, n do\n cur = cur + a[i]\n if flag < 0 then\n if 0 <= cur then\n cnt = cnt + cur + 1\n cur = -1\n end\n else\n if cur <= 0 then\n cnt = cnt - cur + 1\n cur = 1\n end\n end\n flag = flag * -1\n end\n ret = math.min(ret, cnt)\nend\nprint(ret)\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 44, "memory_kb": 2424}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s375487347", "group_id": "codeNet:p03745", "input_text": "local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max\n\nlocal up = {}\nlocal down = {}\nlocal a = {}\nlocal n = io.read(\"*n\")\nfor i = 1, n do a[i] = io.read(\"*n\") end\nup[1], down[1] = 1, 1\nfor i = 1, n - 1 do\n if(a[i] < a[i + 1]) then\n down[i + 1] = mmi(down[i] + 1, up[i] + 1)\n up[i + 1] = mmi(down[i] + 1, up[i])\n elseif(a[i + 1] < a[i]) then\n down[i + 1] = mmi(down[i], up[i] + 1)\n up[i + 1] = mmi(down[i] + 1, up[i] + 1)\n else\n down[i + 1] = mmi(down[i], up[i] + 1)\n up[i + 1] = mmi(up[i], down[i] + 1)\n end\nend\nprint(mmi(up[n], down[n]))\n", "language": "Lua", "metadata": {"date": 1558223973, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s375487347.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s375487347", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max\n\nlocal up = {}\nlocal down = {}\nlocal a = {}\nlocal n = io.read(\"*n\")\nfor i = 1, n do a[i] = io.read(\"*n\") end\nup[1], down[1] = 1, 1\nfor i = 1, n - 1 do\n if(a[i] < a[i + 1]) then\n down[i + 1] = mmi(down[i] + 1, up[i] + 1)\n up[i + 1] = mmi(down[i] + 1, up[i])\n elseif(a[i + 1] < a[i]) then\n down[i + 1] = mmi(down[i], up[i] + 1)\n up[i + 1] = mmi(down[i] + 1, up[i] + 1)\n else\n down[i + 1] = mmi(down[i], up[i] + 1)\n up[i + 1] = mmi(up[i], down[i] + 1)\n end\nend\nprint(mmi(up[n], down[n]))\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 592, "cpu_time_ms": 27, "memory_kb": 3584}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s260364682", "group_id": "codeNet:p03746", "input_text": "local n, m = io.read(\"*n\", \"*n\")\nlocal edge = {}\nlocal asked = {}\nfor i = 1, n do\n edge[i] = {}\n asked[i] = false\nend\nfor i = 1, m do\n local a, b = io.read(\"*n\", \"*n\")\n edge[a][b], edge[b][a] = true, true\nend\n\nlocal pos1 = 1\nlocal pos2 = next(edge[1])\n\nlocal forward = {pos1}\nlocal backward = {pos2}\nasked[pos1], asked[pos2] = true, true\nlocal hasdst = true\nwhile hasdst do\n asked[pos1] = true\n hasdst = false\n for dst, _u in pairs(edge[pos1]) do\n if not asked[dst] then\n pos1 = dst\n table.insert(forward, dst)\n hasdst = true\n break\n end\n end\nend\nhasdst = true\nwhile hasdst do\n asked[pos2] = true\n hasdst = false\n for dst, _u in pairs(edge[pos2]) do\n if not asked[dst] then\n pos2 = dst\n table.insert(backward, dst)\n hasdst = true\n break\n end\n end\nend\nfor i = 1, math.floor(#backward / 2) do\n backward[i], backward[#backward + 1 - i] = backward[#backward + 1 - i], backward[i]\nend\nfor i = 1, #forward do\n table.insert(backward, forward[i])\nend\nprint(#backward)\nprint(table.concat(backward, \" \"))\n", "language": "Lua", "metadata": {"date": 1569896558, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03746.html", "problem_id": "p03746", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03746/input.txt", "sample_output_relpath": "derived/input_output/data/p03746/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03746/Lua/s260364682.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s260364682", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n2 3 1 4\n", "input_to_evaluate": "local n, m = io.read(\"*n\", \"*n\")\nlocal edge = {}\nlocal asked = {}\nfor i = 1, n do\n edge[i] = {}\n asked[i] = false\nend\nfor i = 1, m do\n local a, b = io.read(\"*n\", \"*n\")\n edge[a][b], edge[b][a] = true, true\nend\n\nlocal pos1 = 1\nlocal pos2 = next(edge[1])\n\nlocal forward = {pos1}\nlocal backward = {pos2}\nasked[pos1], asked[pos2] = true, true\nlocal hasdst = true\nwhile hasdst do\n asked[pos1] = true\n hasdst = false\n for dst, _u in pairs(edge[pos1]) do\n if not asked[dst] then\n pos1 = dst\n table.insert(forward, dst)\n hasdst = true\n break\n end\n end\nend\nhasdst = true\nwhile hasdst do\n asked[pos2] = true\n hasdst = false\n for dst, _u in pairs(edge[pos2]) do\n if not asked[dst] then\n pos2 = dst\n table.insert(backward, dst)\n hasdst = true\n break\n end\n end\nend\nfor i = 1, math.floor(#backward / 2) do\n backward[i], backward[#backward + 1 - i] = backward[#backward + 1 - i], backward[i]\nend\nfor i = 1, #forward do\n table.insert(backward, forward[i])\nend\nprint(#backward)\nprint(table.concat(backward, \" \"))\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a connected undirected simple graph, which has N vertices and M edges.\nThe vertices are numbered 1 through N, and the edges are numbered 1 through M.\nEdge i connects vertices A_i and B_i.\nYour task is to find a path that satisfies the following conditions:\n\nThe path traverses two or more vertices.\n\nThe path does not traverse the same vertex more than once.\n\nA vertex directly connected to at least one of the endpoints of the path, is always contained in the path.\n\nIt can be proved that such a path always exists.\nAlso, if there are more than one solution, any of them will be accepted.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i < B_i \\leq N\n\nThe given graph is connected and simple (that is, for every pair of vertices, there is at most one edge that directly connects them).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n:\nA_M B_M\n\nOutput\n\nFind one path that satisfies the conditions, and print it in the following format.\nIn the first line, print the count of the vertices contained in the path.\nIn the second line, print a space-separated list of the indices of the vertices, in order of appearance in the path.\n\nSample Input 1\n\n5 6\n1 3\n1 4\n2 3\n1 5\n3 5\n2 4\n\nSample Output 1\n\n4\n2 3 1 4\n\nThere are two vertices directly connected to vertex 2: vertices 3 and 4.\nThere are also two vertices directly connected to vertex 4: vertices 1 and 2.\nHence, the path 2 → 3 → 1 → 4 satisfies the conditions.\n\nSample Input 2\n\n7 8\n1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n3 5\n2 6\n\nSample Output 2\n\n7\n1 2 3 4 5 6 7", "sample_input": "5 6\n1 3\n1 4\n2 3\n1 5\n3 5\n2 4\n"}, "reference_outputs": ["4\n2 3 1 4\n"], "source_document_id": "p03746", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a connected undirected simple graph, which has N vertices and M edges.\nThe vertices are numbered 1 through N, and the edges are numbered 1 through M.\nEdge i connects vertices A_i and B_i.\nYour task is to find a path that satisfies the following conditions:\n\nThe path traverses two or more vertices.\n\nThe path does not traverse the same vertex more than once.\n\nA vertex directly connected to at least one of the endpoints of the path, is always contained in the path.\n\nIt can be proved that such a path always exists.\nAlso, if there are more than one solution, any of them will be accepted.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i < B_i \\leq N\n\nThe given graph is connected and simple (that is, for every pair of vertices, there is at most one edge that directly connects them).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n:\nA_M B_M\n\nOutput\n\nFind one path that satisfies the conditions, and print it in the following format.\nIn the first line, print the count of the vertices contained in the path.\nIn the second line, print a space-separated list of the indices of the vertices, in order of appearance in the path.\n\nSample Input 1\n\n5 6\n1 3\n1 4\n2 3\n1 5\n3 5\n2 4\n\nSample Output 1\n\n4\n2 3 1 4\n\nThere are two vertices directly connected to vertex 2: vertices 3 and 4.\nThere are also two vertices directly connected to vertex 4: vertices 1 and 2.\nHence, the path 2 → 3 → 1 → 4 satisfies the conditions.\n\nSample Input 2\n\n7 8\n1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n3 5\n2 6\n\nSample Output 2\n\n7\n1 2 3 4 5 6 7", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1061, "cpu_time_ms": 189, "memory_kb": 19988}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s795121101", "group_id": "codeNet:p03760", "input_text": "o=io.read()\ne=io.read()\n\npassword=\"P\"\nfor i=1,#e do\n password=password..o:sub(i,i)..e:sub(i,i)\nend\nif #o>#e then\n password=password..o:sub(#o,#o)\nend\nprint(password:sub(2))", "language": "Lua", "metadata": {"date": 1587335334, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03760.html", "problem_id": "p03760", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03760/input.txt", "sample_output_relpath": "derived/input_output/data/p03760/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03760/Lua/s795121101.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s795121101", "user_id": "u045238009"}, "prompt_components": {"gold_output": "xaybzc\n", "input_to_evaluate": "o=io.read()\ne=io.read()\n\npassword=\"P\"\nfor i=1,#e do\n password=password..o:sub(i,i)..e:sub(i,i)\nend\nif #o>#e then\n password=password..o:sub(#o,#o)\nend\nprint(password:sub(2))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke signed up for a new website which holds programming competitions.\nHe worried that he might forget his password, and he took notes of it.\nSince directly recording his password would cause him trouble if stolen,\nhe took two notes: one contains the characters at the odd-numbered positions, and the other contains the characters at the even-numbered positions.\n\nYou are given two strings O and E. O contains the characters at the odd-numbered positions retaining their relative order, and E contains the characters at the even-numbered positions retaining their relative order.\nRestore the original password.\n\nConstraints\n\nO and E consists of lowercase English letters (a - z).\n\n1 \\leq |O|,|E| \\leq 50\n\n|O| - |E| is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nO\nE\n\nOutput\n\nPrint the original password.\n\nSample Input 1\n\nxyz\nabc\n\nSample Output 1\n\nxaybzc\n\nThe original password is xaybzc. Extracting the characters at the odd-numbered positions results in xyz, and extracting the characters at the even-numbered positions results in abc.\n\nSample Input 2\n\natcoderbeginnercontest\natcoderregularcontest\n\nSample Output 2\n\naattccooddeerrbreeggiunlnaerrccoonntteesstt", "sample_input": "xyz\nabc\n"}, "reference_outputs": ["xaybzc\n"], "source_document_id": "p03760", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke signed up for a new website which holds programming competitions.\nHe worried that he might forget his password, and he took notes of it.\nSince directly recording his password would cause him trouble if stolen,\nhe took two notes: one contains the characters at the odd-numbered positions, and the other contains the characters at the even-numbered positions.\n\nYou are given two strings O and E. O contains the characters at the odd-numbered positions retaining their relative order, and E contains the characters at the even-numbered positions retaining their relative order.\nRestore the original password.\n\nConstraints\n\nO and E consists of lowercase English letters (a - z).\n\n1 \\leq |O|,|E| \\leq 50\n\n|O| - |E| is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nO\nE\n\nOutput\n\nPrint the original password.\n\nSample Input 1\n\nxyz\nabc\n\nSample Output 1\n\nxaybzc\n\nThe original password is xaybzc. Extracting the characters at the odd-numbered positions results in xyz, and extracting the characters at the even-numbered positions results in abc.\n\nSample Input 2\n\natcoderbeginnercontest\natcoderregularcontest\n\nSample Output 2\n\naattccooddeerrbreeggiunlnaerrccoonntteesstt", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 178, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s765505767", "group_id": "codeNet:p03760", "input_text": "o = io.read()\ne = io.read()\nfor i = 1, #e do\n io.write(string.sub(o, i, i))\n io.write(string.sub(e, i, i))\nend\nif(#e < #o) then\n io.write(string.sub(o, #o, #o))\nend\nio.write(\"\\n\")\n", "language": "Lua", "metadata": {"date": 1555866271, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03760.html", "problem_id": "p03760", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03760/input.txt", "sample_output_relpath": "derived/input_output/data/p03760/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03760/Lua/s765505767.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s765505767", "user_id": "u120582723"}, "prompt_components": {"gold_output": "xaybzc\n", "input_to_evaluate": "o = io.read()\ne = io.read()\nfor i = 1, #e do\n io.write(string.sub(o, i, i))\n io.write(string.sub(e, i, i))\nend\nif(#e < #o) then\n io.write(string.sub(o, #o, #o))\nend\nio.write(\"\\n\")\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke signed up for a new website which holds programming competitions.\nHe worried that he might forget his password, and he took notes of it.\nSince directly recording his password would cause him trouble if stolen,\nhe took two notes: one contains the characters at the odd-numbered positions, and the other contains the characters at the even-numbered positions.\n\nYou are given two strings O and E. O contains the characters at the odd-numbered positions retaining their relative order, and E contains the characters at the even-numbered positions retaining their relative order.\nRestore the original password.\n\nConstraints\n\nO and E consists of lowercase English letters (a - z).\n\n1 \\leq |O|,|E| \\leq 50\n\n|O| - |E| is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nO\nE\n\nOutput\n\nPrint the original password.\n\nSample Input 1\n\nxyz\nabc\n\nSample Output 1\n\nxaybzc\n\nThe original password is xaybzc. Extracting the characters at the odd-numbered positions results in xyz, and extracting the characters at the even-numbered positions results in abc.\n\nSample Input 2\n\natcoderbeginnercontest\natcoderregularcontest\n\nSample Output 2\n\naattccooddeerrbreeggiunlnaerrccoonntteesstt", "sample_input": "xyz\nabc\n"}, "reference_outputs": ["xaybzc\n"], "source_document_id": "p03760", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke signed up for a new website which holds programming competitions.\nHe worried that he might forget his password, and he took notes of it.\nSince directly recording his password would cause him trouble if stolen,\nhe took two notes: one contains the characters at the odd-numbered positions, and the other contains the characters at the even-numbered positions.\n\nYou are given two strings O and E. O contains the characters at the odd-numbered positions retaining their relative order, and E contains the characters at the even-numbered positions retaining their relative order.\nRestore the original password.\n\nConstraints\n\nO and E consists of lowercase English letters (a - z).\n\n1 \\leq |O|,|E| \\leq 50\n\n|O| - |E| is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nO\nE\n\nOutput\n\nPrint the original password.\n\nSample Input 1\n\nxyz\nabc\n\nSample Output 1\n\nxaybzc\n\nThe original password is xaybzc. Extracting the characters at the odd-numbered positions results in xyz, and extracting the characters at the even-numbered positions results in abc.\n\nSample Input 2\n\natcoderbeginnercontest\natcoderregularcontest\n\nSample Output 2\n\naattccooddeerrbreeggiunlnaerrccoonntteesstt", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s353288682", "group_id": "codeNet:p03767", "input_text": "n=io.read(\"*n\",\"*l\")\na={}\nfor i=1,3*n do\n a[i]=io.read(\"*n\")\nend\ntable.sort(a)\n\ntotal=0\nfor i=3*n,n+2,-2 do\n total=total+a[i-1]\nend\nprint(total)", "language": "Lua", "metadata": {"date": 1587932998, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03767.html", "problem_id": "p03767", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03767/input.txt", "sample_output_relpath": "derived/input_output/data/p03767/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03767/Lua/s353288682.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s353288682", "user_id": "u045238009"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "n=io.read(\"*n\",\"*l\")\na={}\nfor i=1,3*n do\n a[i]=io.read(\"*n\")\nend\ntable.sort(a)\n\ntotal=0\nfor i=3*n,n+2,-2 do\n total=total+a[i-1]\nend\nprint(total)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are 3N participants in AtCoder Group Contest.\nThe strength of the i-th participant is represented by an integer a_i.\nThey will form N teams, each consisting of three participants.\nNo participant may belong to multiple teams.\n\nThe strength of a team is defined as the second largest strength among its members.\nFor example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.\n\nFind the maximum possible sum of the strengths of N teams.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ a_i ≤ 10^{9}\n\na_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2\n5 2 8 5 1 5\n\nSample Output 1\n\n10\n\nThe following is one formation of teams that maximizes the sum of the strengths of teams:\n\nTeam 1: consists of the first, fourth and fifth participants.\n\nTeam 2: consists of the second, third and sixth participants.\n\nSample Input 2\n\n10\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 2\n\n10000000000\n\nThe sum of the strengths can be quite large.", "sample_input": "2\n5 2 8 5 1 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03767", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are 3N participants in AtCoder Group Contest.\nThe strength of the i-th participant is represented by an integer a_i.\nThey will form N teams, each consisting of three participants.\nNo participant may belong to multiple teams.\n\nThe strength of a team is defined as the second largest strength among its members.\nFor example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.\n\nFind the maximum possible sum of the strengths of N teams.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ a_i ≤ 10^{9}\n\na_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2\n5 2 8 5 1 5\n\nSample Output 1\n\n10\n\nThe following is one formation of teams that maximizes the sum of the strengths of teams:\n\nTeam 1: consists of the first, fourth and fifth participants.\n\nTeam 2: consists of the second, third and sixth participants.\n\nSample Input 2\n\n10\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 2\n\n10000000000\n\nThe sum of the strengths can be quite large.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 222, "memory_kb": 4352}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s275585629", "group_id": "codeNet:p03767", "input_text": "local n = io.read(\"*n\", \"*l\")\nlocal str = io.read()\nlocal t = {}\nfor v in str:gmatch(\"(%d+)\") do\n table.insert(t, tonumber(v))\nend\ntable.sort(t)\nlocal sum = 0\nfor i = 1, n do\n sum = sum + t[n + 2 * i - 1]\nend\nprint(sum)\n", "language": "Lua", "metadata": {"date": 1558666632, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03767.html", "problem_id": "p03767", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03767/input.txt", "sample_output_relpath": "derived/input_output/data/p03767/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03767/Lua/s275585629.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s275585629", "user_id": "u120582723"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "local n = io.read(\"*n\", \"*l\")\nlocal str = io.read()\nlocal t = {}\nfor v in str:gmatch(\"(%d+)\") do\n table.insert(t, tonumber(v))\nend\ntable.sort(t)\nlocal sum = 0\nfor i = 1, n do\n sum = sum + t[n + 2 * i - 1]\nend\nprint(sum)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are 3N participants in AtCoder Group Contest.\nThe strength of the i-th participant is represented by an integer a_i.\nThey will form N teams, each consisting of three participants.\nNo participant may belong to multiple teams.\n\nThe strength of a team is defined as the second largest strength among its members.\nFor example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.\n\nFind the maximum possible sum of the strengths of N teams.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ a_i ≤ 10^{9}\n\na_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2\n5 2 8 5 1 5\n\nSample Output 1\n\n10\n\nThe following is one formation of teams that maximizes the sum of the strengths of teams:\n\nTeam 1: consists of the first, fourth and fifth participants.\n\nTeam 2: consists of the second, third and sixth participants.\n\nSample Input 2\n\n10\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 2\n\n10000000000\n\nThe sum of the strengths can be quite large.", "sample_input": "2\n5 2 8 5 1 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03767", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are 3N participants in AtCoder Group Contest.\nThe strength of the i-th participant is represented by an integer a_i.\nThey will form N teams, each consisting of three participants.\nNo participant may belong to multiple teams.\n\nThe strength of a team is defined as the second largest strength among its members.\nFor example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.\n\nFind the maximum possible sum of the strengths of N teams.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ a_i ≤ 10^{9}\n\na_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2\n5 2 8 5 1 5\n\nSample Output 1\n\n10\n\nThe following is one formation of teams that maximizes the sum of the strengths of teams:\n\nTeam 1: consists of the first, fourth and fifth participants.\n\nTeam 2: consists of the second, third and sixth participants.\n\nSample Input 2\n\n10\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 2\n\n10000000000\n\nThe sum of the strengths can be quite large.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 385, "memory_kb": 17248}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s426982390", "group_id": "codeNet:p03773", "input_text": "a, b = io.read(\"*n\", \"*n\")\nprint((a + b) % 24)", "language": "Lua", "metadata": {"date": 1572262344, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03773.html", "problem_id": "p03773", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03773/input.txt", "sample_output_relpath": "derived/input_output/data/p03773/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03773/Lua/s426982390.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s426982390", "user_id": "u120582723"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "a, b = io.read(\"*n\", \"*n\")\nprint((a + b) % 24)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nDolphin loves programming contests. Today, he will take part in a contest in AtCoder.\n\nIn this country, 24-hour clock is used. For example, 9:00 p.m. is referred to as \"21 o'clock\".\n\nThe current time is A o'clock, and a contest will begin in exactly B hours.\nWhen will the contest begin? Answer in 24-hour time.\n\nConstraints\n\n0 \\leq A,B \\leq 23\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the hour of the starting time of the contest in 24-hour time.\n\nSample Input 1\n\n9 12\n\nSample Output 1\n\n21\n\nIn this input, the current time is 9 o'clock, and 12 hours later it will be 21 o'clock in 24-hour time.\n\nSample Input 2\n\n19 0\n\nSample Output 2\n\n19\n\nThe contest has just started.\n\nSample Input 3\n\n23 2\n\nSample Output 3\n\n1\n\nThe contest will begin at 1 o'clock the next day.", "sample_input": "9 12\n"}, "reference_outputs": ["21\n"], "source_document_id": "p03773", "source_text": "Score : 100 points\n\nProblem Statement\n\nDolphin loves programming contests. Today, he will take part in a contest in AtCoder.\n\nIn this country, 24-hour clock is used. For example, 9:00 p.m. is referred to as \"21 o'clock\".\n\nThe current time is A o'clock, and a contest will begin in exactly B hours.\nWhen will the contest begin? Answer in 24-hour time.\n\nConstraints\n\n0 \\leq A,B \\leq 23\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the hour of the starting time of the contest in 24-hour time.\n\nSample Input 1\n\n9 12\n\nSample Output 1\n\n21\n\nIn this input, the current time is 9 o'clock, and 12 hours later it will be 21 o'clock in 24-hour time.\n\nSample Input 2\n\n19 0\n\nSample Output 2\n\n19\n\nThe contest has just started.\n\nSample Input 3\n\n23 2\n\nSample Output 3\n\n1\n\nThe contest will begin at 1 o'clock the next day.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 46, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s121575636", "group_id": "codeNet:p03773", "input_text": "a,b=io.read(\"n\",\"n\")\nprint((a+b)%24)", "language": "Lua", "metadata": {"date": 1569816655, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03773.html", "problem_id": "p03773", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03773/input.txt", "sample_output_relpath": "derived/input_output/data/p03773/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03773/Lua/s121575636.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s121575636", "user_id": "u162773977"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "a,b=io.read(\"n\",\"n\")\nprint((a+b)%24)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nDolphin loves programming contests. Today, he will take part in a contest in AtCoder.\n\nIn this country, 24-hour clock is used. For example, 9:00 p.m. is referred to as \"21 o'clock\".\n\nThe current time is A o'clock, and a contest will begin in exactly B hours.\nWhen will the contest begin? Answer in 24-hour time.\n\nConstraints\n\n0 \\leq A,B \\leq 23\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the hour of the starting time of the contest in 24-hour time.\n\nSample Input 1\n\n9 12\n\nSample Output 1\n\n21\n\nIn this input, the current time is 9 o'clock, and 12 hours later it will be 21 o'clock in 24-hour time.\n\nSample Input 2\n\n19 0\n\nSample Output 2\n\n19\n\nThe contest has just started.\n\nSample Input 3\n\n23 2\n\nSample Output 3\n\n1\n\nThe contest will begin at 1 o'clock the next day.", "sample_input": "9 12\n"}, "reference_outputs": ["21\n"], "source_document_id": "p03773", "source_text": "Score : 100 points\n\nProblem Statement\n\nDolphin loves programming contests. Today, he will take part in a contest in AtCoder.\n\nIn this country, 24-hour clock is used. For example, 9:00 p.m. is referred to as \"21 o'clock\".\n\nThe current time is A o'clock, and a contest will begin in exactly B hours.\nWhen will the contest begin? Answer in 24-hour time.\n\nConstraints\n\n0 \\leq A,B \\leq 23\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the hour of the starting time of the contest in 24-hour time.\n\nSample Input 1\n\n9 12\n\nSample Output 1\n\n21\n\nIn this input, the current time is 9 o'clock, and 12 hours later it will be 21 o'clock in 24-hour time.\n\nSample Input 2\n\n19 0\n\nSample Output 2\n\n19\n\nThe contest has just started.\n\nSample Input 3\n\n23 2\n\nSample Output 3\n\n1\n\nThe contest will begin at 1 o'clock the next day.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 36, "cpu_time_ms": 4, "memory_kb": 508}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s963109509", "group_id": "codeNet:p03777", "input_text": "a=io.read()\nif a==\"H H\"or a ==\"D D\"then\n print(\"H\")\nelse\n print(\"D\")\nend", "language": "Lua", "metadata": {"date": 1551658263, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s963109509.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s963109509", "user_id": "u837412668"}, "prompt_components": {"gold_output": "H\n", "input_to_evaluate": "a=io.read()\nif a==\"H H\"or a ==\"D D\"then\n print(\"H\")\nelse\n print(\"D\")\nend", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 74, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s581338035", "group_id": "codeNet:p03778", "input_text": "local w, a, b = io.read(\"*n\", \"*n\", \"*n\")\nif b < a then a, b = b, a end\nif w + a < b then\n print(b - w - a)\nelse\n print(0)\nend\n", "language": "Lua", "metadata": {"date": 1579986100, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03778.html", "problem_id": "p03778", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03778/input.txt", "sample_output_relpath": "derived/input_output/data/p03778/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03778/Lua/s581338035.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s581338035", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local w, a, b = io.read(\"*n\", \"*n\", \"*n\")\nif b < a then a, b = b, a end\nif w + a < b then\n print(b - w - a)\nelse\n print(0)\nend\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer found two rectangles lying on the table, each with height 1 and width W.\nIf we consider the surface of the desk as a two-dimensional plane, the first rectangle covers the vertical range of [0,1] and the horizontal range of [a,a+W], and the second rectangle covers the vertical range of [1,2] and the horizontal range of [b,b+W], as shown in the following figure:\n\nAtCoDeer will move the second rectangle horizontally so that it connects with the first rectangle.\nFind the minimum distance it needs to be moved.\n\nConstraints\n\nAll input values are integers.\n\n1≤W≤10^5\n\n1≤a,b≤10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nW a b\n\nOutput\n\nPrint the minimum distance the second rectangle needs to be moved.\n\nSample Input 1\n\n3 2 6\n\nSample Output 1\n\n1\n\nThis input corresponds to the figure in the statement. In this case, the second rectangle should be moved to the left by a distance of 1.\n\nSample Input 2\n\n3 1 3\n\nSample Output 2\n\n0\n\nThe rectangles are already connected, and thus no move is needed.\n\nSample Input 3\n\n5 10 1\n\nSample Output 3\n\n4", "sample_input": "3 2 6\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03778", "source_text": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer found two rectangles lying on the table, each with height 1 and width W.\nIf we consider the surface of the desk as a two-dimensional plane, the first rectangle covers the vertical range of [0,1] and the horizontal range of [a,a+W], and the second rectangle covers the vertical range of [1,2] and the horizontal range of [b,b+W], as shown in the following figure:\n\nAtCoDeer will move the second rectangle horizontally so that it connects with the first rectangle.\nFind the minimum distance it needs to be moved.\n\nConstraints\n\nAll input values are integers.\n\n1≤W≤10^5\n\n1≤a,b≤10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nW a b\n\nOutput\n\nPrint the minimum distance the second rectangle needs to be moved.\n\nSample Input 1\n\n3 2 6\n\nSample Output 1\n\n1\n\nThis input corresponds to the figure in the statement. In this case, the second rectangle should be moved to the left by a distance of 1.\n\nSample Input 2\n\n3 1 3\n\nSample Output 2\n\n0\n\nThe rectangles are already connected, and thus no move is needed.\n\nSample Input 3\n\n5 10 1\n\nSample Output 3\n\n4", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s650303773", "group_id": "codeNet:p03780", "input_text": "local mmi = math.min\nlocal mma = math.max\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal a = {}\nfor i = 1, n do\n local at = io.read(\"*n\")\n if at < k then\n table.insert(a, at)\n end\nend\nn = #a\ntable.sort(a, function(x, y) return x > y end)\nlocal function solve()\n if n == 0 then return 0 end\n local tail = {}\n for i = 1, n do\n tail[i] = {}\n -- for j = 1, k - 1 do\n -- tail[i][j] = false\n -- end\n end\n tail[n][a[n]] = true\n local curmax = a[n]\n for i = n - 1, 1, -1 do\n for j = 1, curmax do\n if tail[i + 1][j] then\n tail[i][j] = true\n if j + a[i] < k then\n tail[i][j + a[i]] = true\n curmax = mmi(curmax, j + a[i])\n end\n end\n end\n tail[i][a[i]] = true\n curmax = mmi(curmax, a[i])\n end\n local head = {}\n for i = 1, k - 1 do\n head[i] = false\n end\n local cnt = 0\n curmax = 0\n for i = 1, n - 1 do\n local ai = a[i]\n local need = false\n for j = k - ai, k - 1 do\n for p = 1, j - 1 do\n local q = j - p\n if head[p] and tail[i + 1][q] then\n need = true\n break\n end\n end\n if head[j] or tail[i + 1][j] then\n need = true\n end\n if need then break end\n end\n if not need then cnt = cnt + 1 end\n for j = mmi(curmax, k - 1 - ai), 1, -1 do\n if head[j] then head[j + ai] = true end\n end\n head[ai] = true\n curmax = mmi(curmax + ai, k - 1)\n end\n do -- i == n\n local ai = a[n]\n local need = false\n for j = k - ai, k - 1 do\n if head[j] then\n need = true\n break\n end\n end\n if not need then cnt = cnt + 1 end\n end\n return cnt\nend\nprint(solve())\n", "language": "Lua", "metadata": {"date": 1573189662, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03780.html", "problem_id": "p03780", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03780/input.txt", "sample_output_relpath": "derived/input_output/data/p03780/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03780/Lua/s650303773.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s650303773", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local mmi = math.min\nlocal mma = math.max\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal a = {}\nfor i = 1, n do\n local at = io.read(\"*n\")\n if at < k then\n table.insert(a, at)\n end\nend\nn = #a\ntable.sort(a, function(x, y) return x > y end)\nlocal function solve()\n if n == 0 then return 0 end\n local tail = {}\n for i = 1, n do\n tail[i] = {}\n -- for j = 1, k - 1 do\n -- tail[i][j] = false\n -- end\n end\n tail[n][a[n]] = true\n local curmax = a[n]\n for i = n - 1, 1, -1 do\n for j = 1, curmax do\n if tail[i + 1][j] then\n tail[i][j] = true\n if j + a[i] < k then\n tail[i][j + a[i]] = true\n curmax = mmi(curmax, j + a[i])\n end\n end\n end\n tail[i][a[i]] = true\n curmax = mmi(curmax, a[i])\n end\n local head = {}\n for i = 1, k - 1 do\n head[i] = false\n end\n local cnt = 0\n curmax = 0\n for i = 1, n - 1 do\n local ai = a[i]\n local need = false\n for j = k - ai, k - 1 do\n for p = 1, j - 1 do\n local q = j - p\n if head[p] and tail[i + 1][q] then\n need = true\n break\n end\n end\n if head[j] or tail[i + 1][j] then\n need = true\n end\n if need then break end\n end\n if not need then cnt = cnt + 1 end\n for j = mmi(curmax, k - 1 - ai), 1, -1 do\n if head[j] then head[j + ai] = true end\n end\n head[ai] = true\n curmax = mmi(curmax + ai, k - 1)\n end\n do -- i == n\n local ai = a[n]\n local need = false\n for j = k - ai, k - 1 do\n if head[j] then\n need = true\n break\n end\n end\n if not need then cnt = cnt + 1 end\n end\n return cnt\nend\nprint(solve())\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nAtCoDeer the deer has N cards with positive integers written on them. The number on the i-th card (1≤i≤N) is a_i.\nBecause he loves big numbers, he calls a subset of the cards good when the sum of the numbers written on the cards in the subset, is K or greater.\n\nThen, for each card i, he judges whether it is unnecessary or not, as follows:\n\nIf, for any good subset of the cards containing card i, the set that can be obtained by eliminating card i from the subset is also good, card i is unnecessary.\n\nOtherwise, card i is NOT unnecessary.\n\nFind the number of the unnecessary cards. Here, he judges each card independently, and he does not throw away cards that turn out to be unnecessary.\n\nConstraints\n\nAll input values are integers.\n\n1≤N≤5000\n\n1≤K≤5000\n\n1≤a_i≤10^9 (1≤i≤N)\n\nPartial Score\n\n300 points will be awarded for passing the test set satisfying N,K≤400.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of the unnecessary cards.\n\nSample Input 1\n\n3 6\n1 4 3\n\nSample Output 1\n\n1\n\nThere are two good sets: {2,3} and {1,2,3}.\n\nCard 1 is only contained in {1,2,3}, and this set without card 1, {2,3}, is also good. Thus, card 1 is unnecessary.\n\nFor card 2, a good set {2,3} without card 2, {3}, is not good. Thus, card 2 is NOT unnecessary.\n\nNeither is card 3 for a similar reason, hence the answer is 1.\n\nSample Input 2\n\n5 400\n3 1 4 1 5\n\nSample Output 2\n\n5\n\nIn this case, there is no good set. Therefore, all the cards are unnecessary.\n\nSample Input 3\n\n6 20\n10 4 3 10 25 2\n\nSample Output 3\n\n3", "sample_input": "3 6\n1 4 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03780", "source_text": "Score : 600 points\n\nProblem Statement\n\nAtCoDeer the deer has N cards with positive integers written on them. The number on the i-th card (1≤i≤N) is a_i.\nBecause he loves big numbers, he calls a subset of the cards good when the sum of the numbers written on the cards in the subset, is K or greater.\n\nThen, for each card i, he judges whether it is unnecessary or not, as follows:\n\nIf, for any good subset of the cards containing card i, the set that can be obtained by eliminating card i from the subset is also good, card i is unnecessary.\n\nOtherwise, card i is NOT unnecessary.\n\nFind the number of the unnecessary cards. Here, he judges each card independently, and he does not throw away cards that turn out to be unnecessary.\n\nConstraints\n\nAll input values are integers.\n\n1≤N≤5000\n\n1≤K≤5000\n\n1≤a_i≤10^9 (1≤i≤N)\n\nPartial Score\n\n300 points will be awarded for passing the test set satisfying N,K≤400.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of the unnecessary cards.\n\nSample Input 1\n\n3 6\n1 4 3\n\nSample Output 1\n\n1\n\nThere are two good sets: {2,3} and {1,2,3}.\n\nCard 1 is only contained in {1,2,3}, and this set without card 1, {2,3}, is also good. Thus, card 1 is unnecessary.\n\nFor card 2, a good set {2,3} without card 2, {3}, is not good. Thus, card 2 is NOT unnecessary.\n\nNeither is card 3 for a similar reason, hence the answer is 1.\n\nSample Input 2\n\n5 400\n3 1 4 1 5\n\nSample Output 2\n\n5\n\nIn this case, there is no good set. Therefore, all the cards are unnecessary.\n\nSample Input 3\n\n6 20\n10 4 3 10 25 2\n\nSample Output 3\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 1024}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s056945442", "group_id": "codeNet:p03786", "input_text": "local n=io.read(\"n\")\nlocal a={}\nfor i=1,n do\n a[i]=io.read(\"n\")\nend\ntable.sort(a)\n\nlocal suma={a[1]}\nfor i=2,n do\n suma[i]=suma[i-1]+a[i]\nend\n\nlocal counter=n\nfor i=1,n-1 do\n if a[i+1]>2*suma[i] then\n counter=counter-i\n break\n end\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1592161446, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s056945442.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s056945442", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal a={}\nfor i=1,n do\n a[i]=io.read(\"n\")\nend\ntable.sort(a)\n\nlocal suma={a[1]}\nfor i=2,n do\n suma[i]=suma[i-1]+a[i]\nend\n\nlocal counter=n\nfor i=1,n-1 do\n if a[i+1]>2*suma[i] then\n counter=counter-i\n break\n end\nend\nprint(counter)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 103, "memory_kb": 4976}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s816813201", "group_id": "codeNet:p03795", "input_text": "n=io.read()*1\nprint(math.floor( 800*n- n//15 *200))", "language": "Lua", "metadata": {"date": 1551657797, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03795.html", "problem_id": "p03795", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03795/input.txt", "sample_output_relpath": "derived/input_output/data/p03795/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03795/Lua/s816813201.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s816813201", "user_id": "u837412668"}, "prompt_components": {"gold_output": "15800\n", "input_to_evaluate": "n=io.read()*1\nprint(math.floor( 800*n- n//15 *200))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a favorite restaurant.\n\nThe price of any meal served at the restaurant is 800 yen (the currency of Japan), and each time a customer orders 15 meals, the restaurant pays 200 yen back to the customer.\n\nSo far, Snuke has ordered N meals at the restaurant.\nLet the amount of money Snuke has paid to the restaurant be x yen, and let the amount of money the restaurant has paid back to Snuke be y yen.\nFind x-y.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n15800\n\nSo far, Snuke has paid 16000 yen, and the restaurant has paid back 200 yen. Thus, the answer is 15800.\n\nSample Input 2\n\n60\n\nSample Output 2\n\n47200\n\nSnuke has paid 48000 yen for 60 meals, and the restaurant has paid back 800 yen.", "sample_input": "20\n"}, "reference_outputs": ["15800\n"], "source_document_id": "p03795", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a favorite restaurant.\n\nThe price of any meal served at the restaurant is 800 yen (the currency of Japan), and each time a customer orders 15 meals, the restaurant pays 200 yen back to the customer.\n\nSo far, Snuke has ordered N meals at the restaurant.\nLet the amount of money Snuke has paid to the restaurant be x yen, and let the amount of money the restaurant has paid back to Snuke be y yen.\nFind x-y.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n15800\n\nSo far, Snuke has paid 16000 yen, and the restaurant has paid back 200 yen. Thus, the answer is 15800.\n\nSample Input 2\n\n60\n\nSample Output 2\n\n47200\n\nSnuke has paid 48000 yen for 60 meals, and the restaurant has paid back 800 yen.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s165747989", "group_id": "codeNet:p03796", "input_text": "n = io.read(\"*n\")\npower = 1\nfor i = 1, n do\n \tpower = power * i\nend\nprint(power%(10^9+7))", "language": "Lua", "metadata": {"date": 1588591526, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03796.html", "problem_id": "p03796", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03796/input.txt", "sample_output_relpath": "derived/input_output/data/p03796/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03796/Lua/s165747989.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s165747989", "user_id": "u540534068"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "n = io.read(\"*n\")\npower = 1\nfor i = 1, n do\n \tpower = power * i\nend\nprint(power%(10^9+7))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke loves working out. He is now exercising N times.\n\nBefore he starts exercising, his power is 1. After he exercises for the i-th time, his power gets multiplied by i.\n\nFind Snuke's power after he exercises N times. Since the answer can be extremely large, print the answer modulo 10^{9}+7.\n\nConstraints\n\n1 ≤ N ≤ 10^{5}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer modulo 10^{9}+7.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\nAfter Snuke exercises for the first time, his power gets multiplied by 1 and becomes 1.\n\nAfter Snuke exercises for the second time, his power gets multiplied by 2 and becomes 2.\n\nAfter Snuke exercises for the third time, his power gets multiplied by 3 and becomes 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n3628800\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n457992974\n\nPrint the answer modulo 10^{9}+7.", "sample_input": "3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03796", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke loves working out. He is now exercising N times.\n\nBefore he starts exercising, his power is 1. After he exercises for the i-th time, his power gets multiplied by i.\n\nFind Snuke's power after he exercises N times. Since the answer can be extremely large, print the answer modulo 10^{9}+7.\n\nConstraints\n\n1 ≤ N ≤ 10^{5}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer modulo 10^{9}+7.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\nAfter Snuke exercises for the first time, his power gets multiplied by 1 and becomes 1.\n\nAfter Snuke exercises for the second time, his power gets multiplied by 2 and becomes 2.\n\nAfter Snuke exercises for the third time, his power gets multiplied by 3 and becomes 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n3628800\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n457992974\n\nPrint the answer modulo 10^{9}+7.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 90, "cpu_time_ms": 3, "memory_kb": 512}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s971596397", "group_id": "codeNet:p03796", "input_text": "local MOD=1000000007\nlocal function add(a,b)return (a+b)%MOD end\nlocal function sub(a,b)return (a-b)%MOD end\nlocal function mul_(a,b)\n\tlocal ret=0\n\twhile(b>0)do\n\t\tif(b%2==1)then ret=(ret+a)%MOD end\n\t\ta=(a+a)%MOD\n\t\tb=math.floor(b*.5)\n\tend\n\treturn ret\nend\nlocal function mul(a,b)\n\treturn a0)do\n\t\tif(b%2==1)then ret=mul(ret,a)end\n\t\ta=mul(a,a)\n\t\tb=math.floor(b*.5)\n\tend\n\treturn ret\nend\nlocal function inv(x)\n\tlocal a=x\n\tlocal b,u,v=MOD,1,0\n\trepeat\n\t\tlocal t=math.floor(a/b)\n\t\ta,b=b,a-t*b\n\t\tu,v=v,u-t*v\n\tuntil(b==0)\n\treturn u%MOD\nend\nlocal function div(a,b)return mul(a,inv(b))end\n\nN=io.read\"*n\"\nr=1\nfor i=1,N do\n\tr=mul(r,i)\nend\nprint(r)", "language": "Lua", "metadata": {"date": 1586970524, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03796.html", "problem_id": "p03796", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03796/input.txt", "sample_output_relpath": "derived/input_output/data/p03796/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03796/Lua/s971596397.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s971596397", "user_id": "u726173718"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "local MOD=1000000007\nlocal function add(a,b)return (a+b)%MOD end\nlocal function sub(a,b)return (a-b)%MOD end\nlocal function mul_(a,b)\n\tlocal ret=0\n\twhile(b>0)do\n\t\tif(b%2==1)then ret=(ret+a)%MOD end\n\t\ta=(a+a)%MOD\n\t\tb=math.floor(b*.5)\n\tend\n\treturn ret\nend\nlocal function mul(a,b)\n\treturn a0)do\n\t\tif(b%2==1)then ret=mul(ret,a)end\n\t\ta=mul(a,a)\n\t\tb=math.floor(b*.5)\n\tend\n\treturn ret\nend\nlocal function inv(x)\n\tlocal a=x\n\tlocal b,u,v=MOD,1,0\n\trepeat\n\t\tlocal t=math.floor(a/b)\n\t\ta,b=b,a-t*b\n\t\tu,v=v,u-t*v\n\tuntil(b==0)\n\treturn u%MOD\nend\nlocal function div(a,b)return mul(a,inv(b))end\n\nN=io.read\"*n\"\nr=1\nfor i=1,N do\n\tr=mul(r,i)\nend\nprint(r)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke loves working out. He is now exercising N times.\n\nBefore he starts exercising, his power is 1. After he exercises for the i-th time, his power gets multiplied by i.\n\nFind Snuke's power after he exercises N times. Since the answer can be extremely large, print the answer modulo 10^{9}+7.\n\nConstraints\n\n1 ≤ N ≤ 10^{5}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer modulo 10^{9}+7.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\nAfter Snuke exercises for the first time, his power gets multiplied by 1 and becomes 1.\n\nAfter Snuke exercises for the second time, his power gets multiplied by 2 and becomes 2.\n\nAfter Snuke exercises for the third time, his power gets multiplied by 3 and becomes 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n3628800\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n457992974\n\nPrint the answer modulo 10^{9}+7.", "sample_input": "3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03796", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke loves working out. He is now exercising N times.\n\nBefore he starts exercising, his power is 1. After he exercises for the i-th time, his power gets multiplied by i.\n\nFind Snuke's power after he exercises N times. Since the answer can be extremely large, print the answer modulo 10^{9}+7.\n\nConstraints\n\n1 ≤ N ≤ 10^{5}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer modulo 10^{9}+7.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\nAfter Snuke exercises for the first time, his power gets multiplied by 1 and becomes 1.\n\nAfter Snuke exercises for the second time, his power gets multiplied by 2 and becomes 2.\n\nAfter Snuke exercises for the third time, his power gets multiplied by 3 and becomes 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n3628800\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n457992974\n\nPrint the answer modulo 10^{9}+7.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 26, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s052502013", "group_id": "codeNet:p03797", "input_text": "local n, m = io.read(\"*n\", \"*n\")\nlocal a = math.min(n, m // 2)\nm = m - a * 2\na = a + m // 4\nprint(a)\n", "language": "Lua", "metadata": {"date": 1581829284, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03797.html", "problem_id": "p03797", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03797/input.txt", "sample_output_relpath": "derived/input_output/data/p03797/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03797/Lua/s052502013.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s052502013", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n, m = io.read(\"*n\", \"*n\")\nlocal a = math.min(n, m // 2)\nm = m - a * 2\na = a + m // 4\nprint(a)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke loves puzzles.\n\nToday, he is working on a puzzle using S- and c-shaped pieces.\nIn this puzzle, you can combine two c-shaped pieces into one S-shaped piece, as shown in the figure below:\n\nSnuke decided to create as many Scc groups as possible by putting together one S-shaped piece and two c-shaped pieces.\n\nFind the maximum number of Scc groups that can be created when Snuke has N S-shaped pieces and M c-shaped pieces.\n\nConstraints\n\n1 ≤ N,M ≤ 10^{12}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 6\n\nSample Output 1\n\n2\n\nTwo Scc groups can be created as follows:\n\nCombine two c-shaped pieces into one S-shaped piece\n\nCreate two Scc groups, each from one S-shaped piece and two c-shaped pieces\n\nSample Input 2\n\n12345 678901\n\nSample Output 2\n\n175897", "sample_input": "1 6\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03797", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke loves puzzles.\n\nToday, he is working on a puzzle using S- and c-shaped pieces.\nIn this puzzle, you can combine two c-shaped pieces into one S-shaped piece, as shown in the figure below:\n\nSnuke decided to create as many Scc groups as possible by putting together one S-shaped piece and two c-shaped pieces.\n\nFind the maximum number of Scc groups that can be created when Snuke has N S-shaped pieces and M c-shaped pieces.\n\nConstraints\n\n1 ≤ N,M ≤ 10^{12}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 6\n\nSample Output 1\n\n2\n\nTwo Scc groups can be created as follows:\n\nCombine two c-shaped pieces into one S-shaped piece\n\nCreate two Scc groups, each from one S-shaped piece and two c-shaped pieces\n\nSample Input 2\n\n12345 678901\n\nSample Output 2\n\n175897", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 101, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s627372252", "group_id": "codeNet:p03797", "input_text": "function main()\n local input = string.gmatch(io.read(), \"[^ ]+\")\n local n = tonumber(input())\n local m = tonumber(input())\n\n local convert = math.floor((m - 2*n)/2)\n if convert > 0 then\n n = n + math.floor(convert/2)\n m = m - convert\n end\n\n if n < 2*m then\n print(n)\n else\n print(math.floor(m/2))\n end\nend\n\nmain()\n", "language": "Lua", "metadata": {"date": 1492460159, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03797.html", "problem_id": "p03797", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03797/input.txt", "sample_output_relpath": "derived/input_output/data/p03797/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03797/Lua/s627372252.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s627372252", "user_id": "u940915899"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "function main()\n local input = string.gmatch(io.read(), \"[^ ]+\")\n local n = tonumber(input())\n local m = tonumber(input())\n\n local convert = math.floor((m - 2*n)/2)\n if convert > 0 then\n n = n + math.floor(convert/2)\n m = m - convert\n end\n\n if n < 2*m then\n print(n)\n else\n print(math.floor(m/2))\n end\nend\n\nmain()\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke loves puzzles.\n\nToday, he is working on a puzzle using S- and c-shaped pieces.\nIn this puzzle, you can combine two c-shaped pieces into one S-shaped piece, as shown in the figure below:\n\nSnuke decided to create as many Scc groups as possible by putting together one S-shaped piece and two c-shaped pieces.\n\nFind the maximum number of Scc groups that can be created when Snuke has N S-shaped pieces and M c-shaped pieces.\n\nConstraints\n\n1 ≤ N,M ≤ 10^{12}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 6\n\nSample Output 1\n\n2\n\nTwo Scc groups can be created as follows:\n\nCombine two c-shaped pieces into one S-shaped piece\n\nCreate two Scc groups, each from one S-shaped piece and two c-shaped pieces\n\nSample Input 2\n\n12345 678901\n\nSample Output 2\n\n175897", "sample_input": "1 6\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03797", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke loves puzzles.\n\nToday, he is working on a puzzle using S- and c-shaped pieces.\nIn this puzzle, you can combine two c-shaped pieces into one S-shaped piece, as shown in the figure below:\n\nSnuke decided to create as many Scc groups as possible by putting together one S-shaped piece and two c-shaped pieces.\n\nFind the maximum number of Scc groups that can be created when Snuke has N S-shaped pieces and M c-shaped pieces.\n\nConstraints\n\n1 ≤ N,M ≤ 10^{12}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 6\n\nSample Output 1\n\n2\n\nTwo Scc groups can be created as follows:\n\nCombine two c-shaped pieces into one S-shaped piece\n\nCreate two Scc groups, each from one S-shaped piece and two c-shaped pieces\n\nSample Input 2\n\n12345 678901\n\nSample Output 2\n\n175897", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 335, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s733095755", "group_id": "codeNet:p03797", "input_text": "function main()\n local input = string.gmatch(io.read(), \"[^ ]+\")\n local n = tonumber(input())\n local m = tonumber(input())\n\n local ans\n if n < 2*m then\n ans = n\n else\n ans = math.floor(m/2)\n end\n\n m = m - 2*ans\n\n ans = ans + math.floor(m/4)\n\n print(ans)\nend\n\nmain()\n", "language": "Lua", "metadata": {"date": 1492459644, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03797.html", "problem_id": "p03797", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03797/input.txt", "sample_output_relpath": "derived/input_output/data/p03797/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03797/Lua/s733095755.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s733095755", "user_id": "u940915899"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "function main()\n local input = string.gmatch(io.read(), \"[^ ]+\")\n local n = tonumber(input())\n local m = tonumber(input())\n\n local ans\n if n < 2*m then\n ans = n\n else\n ans = math.floor(m/2)\n end\n\n m = m - 2*ans\n\n ans = ans + math.floor(m/4)\n\n print(ans)\nend\n\nmain()\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke loves puzzles.\n\nToday, he is working on a puzzle using S- and c-shaped pieces.\nIn this puzzle, you can combine two c-shaped pieces into one S-shaped piece, as shown in the figure below:\n\nSnuke decided to create as many Scc groups as possible by putting together one S-shaped piece and two c-shaped pieces.\n\nFind the maximum number of Scc groups that can be created when Snuke has N S-shaped pieces and M c-shaped pieces.\n\nConstraints\n\n1 ≤ N,M ≤ 10^{12}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 6\n\nSample Output 1\n\n2\n\nTwo Scc groups can be created as follows:\n\nCombine two c-shaped pieces into one S-shaped piece\n\nCreate two Scc groups, each from one S-shaped piece and two c-shaped pieces\n\nSample Input 2\n\n12345 678901\n\nSample Output 2\n\n175897", "sample_input": "1 6\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03797", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke loves puzzles.\n\nToday, he is working on a puzzle using S- and c-shaped pieces.\nIn this puzzle, you can combine two c-shaped pieces into one S-shaped piece, as shown in the figure below:\n\nSnuke decided to create as many Scc groups as possible by putting together one S-shaped piece and two c-shaped pieces.\n\nFind the maximum number of Scc groups that can be created when Snuke has N S-shaped pieces and M c-shaped pieces.\n\nConstraints\n\n1 ≤ N,M ≤ 10^{12}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 6\n\nSample Output 1\n\n2\n\nTwo Scc groups can be created as follows:\n\nCombine two c-shaped pieces into one S-shaped piece\n\nCreate two Scc groups, each from one S-shaped piece and two c-shaped pieces\n\nSample Input 2\n\n12345 678901\n\nSample Output 2\n\n175897", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 282, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s509358686", "group_id": "codeNet:p03798", "input_text": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal t = {}\nfor i = 1, n do\n t[i] = s:sub(i, i) == \"o\"\nend\nlocal a = {}\nfor ia = 1, 4 do\n a[1] = ia % 2 == 1\n a[2] = 2 < ia\n for i = 2, n do\n if t[i] then\n if a[i] then\n a[i + 1] = a[i - 1]\n else\n a[i + 1] = not a[i - 1]\n end\n else\n if a[i] then\n a[i + 1] = not a[i - 1]\n else\n a[i + 1] = a[i - 1]\n end\n end\n end\n if a[1] == a[n + 1] then\n local v = true\n if t[1] then\n if a[1] then\n v = a[2] == a[n]\n else\n v = a[2] ~= a[n]\n end\n else\n if a[1] then\n v = a[2] ~= a[n]\n else\n v = a[2] == a[n]\n end\n end\n if v then\n for i = 1, n do\n io.write(a[i] and \"S\" or \"W\")\n end\n io.write(\"\\n\")\n os.exit()\n end\n end\nend\nprint(-1)\n", "language": "Lua", "metadata": {"date": 1589588760, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03798.html", "problem_id": "p03798", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03798/input.txt", "sample_output_relpath": "derived/input_output/data/p03798/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03798/Lua/s509358686.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s509358686", "user_id": "u120582723"}, "prompt_components": {"gold_output": "SSSWWS\n", "input_to_evaluate": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal t = {}\nfor i = 1, n do\n t[i] = s:sub(i, i) == \"o\"\nend\nlocal a = {}\nfor ia = 1, 4 do\n a[1] = ia % 2 == 1\n a[2] = 2 < ia\n for i = 2, n do\n if t[i] then\n if a[i] then\n a[i + 1] = a[i - 1]\n else\n a[i + 1] = not a[i - 1]\n end\n else\n if a[i] then\n a[i + 1] = not a[i - 1]\n else\n a[i + 1] = a[i - 1]\n end\n end\n end\n if a[1] == a[n + 1] then\n local v = true\n if t[1] then\n if a[1] then\n v = a[2] == a[n]\n else\n v = a[2] ~= a[n]\n end\n else\n if a[1] then\n v = a[2] ~= a[n]\n else\n v = a[2] == a[n]\n end\n end\n if v then\n for i = 1, n do\n io.write(a[i] and \"S\" or \"W\")\n end\n io.write(\"\\n\")\n os.exit()\n end\n end\nend\nprint(-1)\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": "p03798", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 845, "cpu_time_ms": 74, "memory_kb": 4896}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s848129520", "group_id": "codeNet:p03798", "input_text": "local n = io.read(\"*n\", \"*l\")\nlocal str = io.read()\nlocal t = {}\nfor i = 1, n do\n t[i] = str:sub(i, i) == \"o\"\nend\nlocal found = false\nfor c = 1, 4 do\n local res = {}\n res[1] = c <= 2\n res[2] = c % 2 == 1\n for i = 3, n do\n if res[i - 1] then\n if t[i - 1] then\n res[i] = res[i - 2]\n else\n res[i] = not res[i - 2]\n end\n else\n if t[i - 1] then\n res[i] = not res[i - 2]\n else\n res[i] = res[i - 2]\n end\n end\n end\n local cand1 = false\n if res[n] then\n if t[n] then\n cand1 = res[n - 1]\n else\n cand1 = not res[n - 1]\n end\n else\n if t[n] then\n cand1 = not res[n - 1]\n else\n cand1 = res[n - 1]\n end\n end\n local cand2 = false\n if res[1] then\n if t[1] then cand2 = res[n] else cand2 = not res[n] end\n else\n if t[1] then cand2 = not res[n] else cand2 = res[n] end\n end\n if res[1] == cand1 and res[2] == cand2 then\n for k = 1, n do\n io.write(res[k] and \"S\" or \"W\")\n end\n io.write(\"\\n\")\n found = true\n break\n end\nend\nif not found then print(-1) end\n", "language": "Lua", "metadata": {"date": 1558668809, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03798.html", "problem_id": "p03798", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03798/input.txt", "sample_output_relpath": "derived/input_output/data/p03798/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03798/Lua/s848129520.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s848129520", "user_id": "u120582723"}, "prompt_components": {"gold_output": "SSSWWS\n", "input_to_evaluate": "local n = io.read(\"*n\", \"*l\")\nlocal str = io.read()\nlocal t = {}\nfor i = 1, n do\n t[i] = str:sub(i, i) == \"o\"\nend\nlocal found = false\nfor c = 1, 4 do\n local res = {}\n res[1] = c <= 2\n res[2] = c % 2 == 1\n for i = 3, n do\n if res[i - 1] then\n if t[i - 1] then\n res[i] = res[i - 2]\n else\n res[i] = not res[i - 2]\n end\n else\n if t[i - 1] then\n res[i] = not res[i - 2]\n else\n res[i] = res[i - 2]\n end\n end\n end\n local cand1 = false\n if res[n] then\n if t[n] then\n cand1 = res[n - 1]\n else\n cand1 = not res[n - 1]\n end\n else\n if t[n] then\n cand1 = not res[n - 1]\n else\n cand1 = res[n - 1]\n end\n end\n local cand2 = false\n if res[1] then\n if t[1] then cand2 = res[n] else cand2 = not res[n] end\n else\n if t[1] then cand2 = not res[n] else cand2 = res[n] end\n end\n if res[1] == cand1 and res[2] == cand2 then\n for k = 1, n do\n io.write(res[k] and \"S\" or \"W\")\n end\n io.write(\"\\n\")\n found = true\n break\n end\nend\nif not found then print(-1) end\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": "p03798", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 23, "memory_kb": 5852}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s321604209", "group_id": "codeNet:p03798", "input_text": "local n = io.read(\"*n\", \"*l\")\nlocal str = io.read()\nlocal t = {}\nfor i = 1, n do\n t[i] = str:sub(i, i) == \"o\" and true or false\nend\nlocal found = false\nfor c = 1, 4 do\n local res = {}\n res[1] = c <= 2\n res[2] = c % 2 == 0\n for i = 3, n do\n if res[i - 1] then\n res[i] = t[i - 1] == res[i - 2]\n else\n res[i] = t[i - 1] ~= res[i - 2]\n end\n end\n local cand = false\n if res[n] then\n cand = t[n] == res[n - 1]\n else\n cand = t[n] ~= res[n - 1]\n end\n if res[1] == cand then\n for k = 1, n do\n io.write(res[k] and \"S\" or \"W\")\n end\n io.write(\"\\n\")\n found = true\n break\n end\nend\nif not found then print(-1) end\n", "language": "Lua", "metadata": {"date": 1558667882, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03798.html", "problem_id": "p03798", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03798/input.txt", "sample_output_relpath": "derived/input_output/data/p03798/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03798/Lua/s321604209.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s321604209", "user_id": "u120582723"}, "prompt_components": {"gold_output": "SSSWWS\n", "input_to_evaluate": "local n = io.read(\"*n\", \"*l\")\nlocal str = io.read()\nlocal t = {}\nfor i = 1, n do\n t[i] = str:sub(i, i) == \"o\" and true or false\nend\nlocal found = false\nfor c = 1, 4 do\n local res = {}\n res[1] = c <= 2\n res[2] = c % 2 == 0\n for i = 3, n do\n if res[i - 1] then\n res[i] = t[i - 1] == res[i - 2]\n else\n res[i] = t[i - 1] ~= res[i - 2]\n end\n end\n local cand = false\n if res[n] then\n cand = t[n] == res[n - 1]\n else\n cand = t[n] ~= res[n - 1]\n end\n if res[1] == cand then\n for k = 1, n do\n io.write(res[k] and \"S\" or \"W\")\n end\n io.write(\"\\n\")\n found = true\n break\n end\nend\nif not found then print(-1) end\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": "p03798", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 656, "cpu_time_ms": 11, "memory_kb": 3804}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s077541822", "group_id": "codeNet:p03800", "input_text": "n = io.read('*n')\n_, str = io.read('*l'), io.read('*l')\n\nfunction b2i(b) if b then return 1 else return 0 end end\nfunction check(s1, s2)\n local s = { s1, s2 }\n for i = 3, n do\n s[i] = s[i - 1] ~ s[i - 2] ~ b2i(str:sub(i - 1, i - 1) == 'x')\n end\n if s1 == (s[n] ~ s[n - 1] ~ b2i(str:sub(n, n) == 'x')) and\n s2 == (s[1] ~ s[n] ~ b2i(str:sub(1, 1) == 'x'))\n then\n return s\n end\nend\nfunction print_tab(t)\n for i = 1, #t do if t[i] == 0 then io.write('S') else io.write('W') end end\n io.write('\\n')\nend\n\ns = check(0, 0); if s ~= nil then print_tab(s) return end\ns = check(0, 1); if s ~= nil then print_tab(s) return end\ns = check(1, 0); if s ~= nil then print_tab(s) return end\ns = check(1, 1); if s ~= nil then print_tab(s) return end\nprint('-1')\n", "language": "Lua", "metadata": {"date": 1492137620, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s077541822.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s077541822", "user_id": "u785421275"}, "prompt_components": {"gold_output": "SSSWWS\n", "input_to_evaluate": "n = io.read('*n')\n_, str = io.read('*l'), io.read('*l')\n\nfunction b2i(b) if b then return 1 else return 0 end end\nfunction check(s1, s2)\n local s = { s1, s2 }\n for i = 3, n do\n s[i] = s[i - 1] ~ s[i - 2] ~ b2i(str:sub(i - 1, i - 1) == 'x')\n end\n if s1 == (s[n] ~ s[n - 1] ~ b2i(str:sub(n, n) == 'x')) and\n s2 == (s[1] ~ s[n] ~ b2i(str:sub(1, 1) == 'x'))\n then\n return s\n end\nend\nfunction print_tab(t)\n for i = 1, #t do if t[i] == 0 then io.write('S') else io.write('W') end end\n io.write('\\n')\nend\n\ns = check(0, 0); if s ~= nil then print_tab(s) return end\ns = check(0, 1); if s ~= nil then print_tab(s) return end\ns = check(1, 0); if s ~= nil then print_tab(s) return end\ns = check(1, 1); if s ~= nil then print_tab(s) return end\nprint('-1')\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 788, "cpu_time_ms": 140, "memory_kb": 6672}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s728508363", "group_id": "codeNet:p03803", "input_text": "a,b=io.read():match(\"(.+)%s(.+)\")\nA=a+(a*1==1 and 13 or 0)\nB=b+(b*1==1 and 13 or 0)\nif A==B then\n print(\"Draw\")\nelseif A>B then\n print(\"Alice\")\nelse\n print(\"Bob\")\nend", "language": "Lua", "metadata": {"date": 1551657595, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03803.html", "problem_id": "p03803", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03803/input.txt", "sample_output_relpath": "derived/input_output/data/p03803/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03803/Lua/s728508363.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s728508363", "user_id": "u837412668"}, "prompt_components": {"gold_output": "Alice\n", "input_to_evaluate": "a,b=io.read():match(\"(.+)%s(.+)\")\nA=a+(a*1==1 and 13 or 0)\nB=b+(b*1==1 and 13 or 0)\nif A==B then\n print(\"Draw\")\nelseif A>B then\n print(\"Alice\")\nelse\n print(\"Bob\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAlice and Bob are playing One Card Poker.\n\nOne Card Poker is a two-player game using playing cards.\n\nEach card in this game shows an integer between 1 and 13, inclusive.\n\nThe strength of a card is determined by the number written on it, as follows:\n\nWeak 2 < 3 < 4 < 5 < 6 < 7 < 8 < 9 < 10 < 11 < 12 < 13 < 1 Strong\n\nOne Card Poker is played as follows:\n\nEach player picks one card from the deck. The chosen card becomes the player's hand.\n\nThe players reveal their hands to each other. The player with the stronger card wins the game.\n\nIf their cards are equally strong, the game is drawn.\n\nYou are watching Alice and Bob playing the game, and can see their hands.\n\nThe number written on Alice's card is A, and the number written on Bob's card is B.\n\nWrite a program to determine the outcome of the game.\n\nConstraints\n\n1≦A≦13\n\n1≦B≦13\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint Alice if Alice will win. Print Bob if Bob will win. Print Draw if the game will be drawn.\n\nSample Input 1\n\n8 6\n\nSample Output 1\n\nAlice\n\n8 is written on Alice's card, and 6 is written on Bob's card.\nAlice has the stronger card, and thus the output should be Alice.\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\nDraw\n\nSince their cards have the same number, the game will be drawn.\n\nSample Input 3\n\n13 1\n\nSample Output 3\n\nBob", "sample_input": "8 6\n"}, "reference_outputs": ["Alice\n"], "source_document_id": "p03803", "source_text": "Score : 100 points\n\nProblem Statement\n\nAlice and Bob are playing One Card Poker.\n\nOne Card Poker is a two-player game using playing cards.\n\nEach card in this game shows an integer between 1 and 13, inclusive.\n\nThe strength of a card is determined by the number written on it, as follows:\n\nWeak 2 < 3 < 4 < 5 < 6 < 7 < 8 < 9 < 10 < 11 < 12 < 13 < 1 Strong\n\nOne Card Poker is played as follows:\n\nEach player picks one card from the deck. The chosen card becomes the player's hand.\n\nThe players reveal their hands to each other. The player with the stronger card wins the game.\n\nIf their cards are equally strong, the game is drawn.\n\nYou are watching Alice and Bob playing the game, and can see their hands.\n\nThe number written on Alice's card is A, and the number written on Bob's card is B.\n\nWrite a program to determine the outcome of the game.\n\nConstraints\n\n1≦A≦13\n\n1≦B≦13\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint Alice if Alice will win. Print Bob if Bob will win. Print Draw if the game will be drawn.\n\nSample Input 1\n\n8 6\n\nSample Output 1\n\nAlice\n\n8 is written on Alice's card, and 6 is written on Bob's card.\nAlice has the stronger card, and thus the output should be Alice.\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\nDraw\n\nSince their cards have the same number, the game will be drawn.\n\nSample Input 3\n\n13 1\n\nSample Output 3\n\nBob", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 169, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s866591464", "group_id": "codeNet:p03804", "input_text": "local n,m=io.read(\"n\",\"n\",\"l\")\nlocal a={}\nfor i=1,n do\n a[i]=io.read()\nend\nlocal b={}\nfor i=1,m do\n b[i]=io.read()\nend\n\nfor i=1,n-m+1 do\n for j=1,n-m+1 do\n local flag=true\n for k=1,m do\n if a[i+k-1]:sub(j,j+m-1)~=b[k] then\n flag=false\n end\n end\n if flag then\n print(\"Yes\")\n return\n end\n end\nend\nprint(\"No\")", "language": "Lua", "metadata": {"date": 1591496636, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s866591464.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s866591464", "user_id": "u045238009"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local n,m=io.read(\"n\",\"n\",\"l\")\nlocal a={}\nfor i=1,n do\n a[i]=io.read()\nend\nlocal b={}\nfor i=1,m do\n b[i]=io.read()\nend\n\nfor i=1,n-m+1 do\n for j=1,n-m+1 do\n local flag=true\n for k=1,m do\n if a[i+k-1]:sub(j,j+m-1)~=b[k] then\n flag=false\n end\n end\n if flag then\n print(\"Yes\")\n return\n end\n end\nend\nprint(\"No\")", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 412, "cpu_time_ms": 9, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s559430715", "group_id": "codeNet:p03805", "input_text": "function dp(point, visited, vertexes, memo)\n if not string.find(visited, \"0\") then\n return 1\n elseif memo[point][visited] then\n return memo[point][visited]\n else\n local ans = 0\n for i = 1, #vertexes[point] do\n if string.sub(visited, vertexes[point][i], vertexes[point][i]) == \"0\" then\n ans = ans + dp(vertexes[point][i], string.sub(visited, 1, vertexes[point][i] - 1) .. \"1\" .. string.sub(visited, vertexes[point][i] + 1, #visited), vertexes, memo)\n end\n end\n memo[point][visited] = ans\n return ans\n end\nend\n\nfunction main()\n local input = string.gmatch(io.read(), \"[^ ]+\")\n local n = tonumber(input())\n local m = tonumber(input())\n\n local vertexes = {}\n local memo = {}\n for i = 1, n do\n table.insert(vertexes, {})\n table.insert(memo, {})\n end\n\n for i = 1, m do\n input = string.gmatch(io.read(), \"[^ ]+\")\n local a = tonumber(input())\n local b = tonumber(input())\n table.insert(vertexes[a], b)\n table.insert(vertexes[b], a)\n end\n\n local visited = \"1\"\n for i = 2, n do\n visited = visited .. \"0\"\n end\n\n print(dp(1, visited, vertexes, memo))\nend\n\nmain()\n", "language": "Lua", "metadata": {"date": 1492469548, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s559430715.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s559430715", "user_id": "u940915899"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "function dp(point, visited, vertexes, memo)\n if not string.find(visited, \"0\") then\n return 1\n elseif memo[point][visited] then\n return memo[point][visited]\n else\n local ans = 0\n for i = 1, #vertexes[point] do\n if string.sub(visited, vertexes[point][i], vertexes[point][i]) == \"0\" then\n ans = ans + dp(vertexes[point][i], string.sub(visited, 1, vertexes[point][i] - 1) .. \"1\" .. string.sub(visited, vertexes[point][i] + 1, #visited), vertexes, memo)\n end\n end\n memo[point][visited] = ans\n return ans\n end\nend\n\nfunction main()\n local input = string.gmatch(io.read(), \"[^ ]+\")\n local n = tonumber(input())\n local m = tonumber(input())\n\n local vertexes = {}\n local memo = {}\n for i = 1, n do\n table.insert(vertexes, {})\n table.insert(memo, {})\n end\n\n for i = 1, m do\n input = string.gmatch(io.read(), \"[^ ]+\")\n local a = tonumber(input())\n local b = tonumber(input())\n table.insert(vertexes[a], b)\n table.insert(vertexes[b], a)\n end\n\n local visited = \"1\"\n for i = 2, n do\n visited = visited .. \"0\"\n end\n\n print(dp(1, visited, vertexes, memo))\nend\n\nmain()\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an undirected unweighted graph with N vertices and M edges that contains neither self-loops nor double edges.\n\nHere, a self-loop is an edge where a_i = b_i (1≤i≤M), and double edges are two edges where (a_i,b_i)=(a_j,b_j) or (a_i,b_i)=(b_j,a_j) (1≤i t[b][i] end)\n for idxj = 1, n do\n local j = idx[idxj]\n local tj = t[j][i]\n local right = j == n and n or st:right_bound(tj + 1, j + 1, n) - 1\n local left = j == 1 and 1 or st:left_bound(tj + 1, 1, j - 1) + 1\n st:setValue(j, inf)\n imos[left][j] = imos[left][j] + tj\n imos[left][right + 1] = imos[left][right + 1] - tj\n imos[j + 1][j] = imos[j + 1][j] - tj\n imos[j + 1][right + 1] = imos[j + 1][right + 1] + tj\n end\nend\nfor j = 1, n do\n for i = 2, n do\n imos[i][j] = imos[i][j] + imos[i - 1][j]\n end\nend\nfor i = 1, n do\n for j = 2, n do\n imos[i][j] = imos[i][j] + imos[i][j - 1]\n end\nend\n\nlocal score = 0\nfor i = 1, n do\n for j = i, n do\n score = mma(score, imos[i][j] - pos[j] + pos[i])\n end\nend\nprint(score)\n", "language": "Lua", "metadata": {"date": 1596116670, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p03833.html", "problem_id": "p03833", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03833/input.txt", "sample_output_relpath": "derived/input_output/data/p03833/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03833/Lua/s417338610.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s417338610", "user_id": "u120582723"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "local mfl, mce = math.floor, math.ceil\nlocal mmi, mma = math.min, math.max\nlocal bls, brs = bit.lshift, bit.rshift\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n local cnt = bls(1, i - 1)\n for j = 1, cnt do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.stage = {{}}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.stage[stagenum] = {}\n end\n self.stagenum = stagenum\n self.left_stage = {}\n for i = 1, n do\n local sp, sz = 1, bls(1, stagenum - 1)\n while(i - 1) % sz ~= 0 do\n sp, sz = sp + 1, brs(sz, 1)\n end\n self.left_stage[i] = sp\n end\n self.sz_stage = {}\n local tmp, sp = 1, stagenum\n for i = 1, n do\n if tmp * 2 == i then tmp, sp = tmp * 2, sp - 1 end\n self.sz_stage[i] = sp\n end\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local stagenum = self.stagenum\n local ret = self.emptyvalue\n while left <= right do\n local stage = mma(self.left_stage[left], self.sz_stage[right - left + 1])\n local sz = bls(1, stagenum - stage)\n ret = self.func(ret, self.stage[stage][1 + brs(left - 1, stagenum - stage)])\n left = left + sz\n end\n return ret\nend\nSegTree.update = function(self, idx)\n for i = self.stagenum - 1, 1, -1 do\n local dst = brs(idx + 1, 1)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\nend\nSegTree.setValue = function(self, idx, value, silent)\n self.stage[self.stagenum][idx] = value\n if not silent then\n self:update(idx)\n end\nend\nSegTree.right_bound = function(self, val, left, right)\n local ret, retpos = self.emptyvalue, left - 1\n local l, r = left, right\n local stage = mma(self.left_stage[left], self.sz_stage[right - left + 1])\n local stagenum = self.stagenum\n while true do\n local sz = bls(1, stagenum - stage)\n local tmp = self.func(ret, self.stage[stage][mce(l / sz)])\n if tmp < val then\n ret, retpos = tmp, l + sz - 1\n if retpos == right then break end\n if l + sz <= r then\n l = l + sz\n stage = mma(self.left_stage[l], self.sz_stage[r - l + 1])\n else break end\n else\n if sz ~= 1 then stage, r = stage + 1, l + sz - 2\n else break end\n end\n end\n return retpos + 1\nend\nSegTree.left_bound = function(self, val, left, right)\n local ret, retpos = self.emptyvalue, right + 1\n local stage, l, r = 1, left, right\n local stagenum = self.stagenum\n while true do\n local sz = bls(1, stagenum - stage)\n while r % sz ~= 0 or r + 1 - l < sz do\n stage = stage + 1\n sz = bls(1, stagenum - stage)\n end\n local tmp = self.func(ret, self.stage[stage][mfl(r / sz)])\n if tmp < val then\n ret, retpos = tmp, r - sz + 1\n if l + sz <= r then stage, l, r = 1, l, r - sz\n else break end\n else\n if sz ~= 1 then stage, l, r = stage + 1, r - sz + 2, r\n else break end\n end\n end\n return retpos - 1\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal pos = {0}\nfor i = 1, n - 1 do\n pos[i + 1] = pos[i] + io.read(\"*n\")\nend\nlocal imos = {}\nfor i = 1, n + 1 do\n imos[i] = {}\n for j = 1, n + 1 do\n imos[i][j] = 0\n end\nend\nlocal t = {}\nlocal st = SegTree.new(n, mma, 0)\n\nfor i = 1, n do\n t[i] = {}\n for j = 1, m do\n t[i][j] = io.read(\"*n\")\n end\nend\nlocal inf = 1000000007\nlocal idx = {}\nfor i = 1, n do idx[i] = i end\nfor i = 1, m do\n for j = 1, n do\n st:setValue(j, t[j][i], true)\n end\n st:updateAll()\n table.sort(idx, function(a, b) return t[a][i] > t[b][i] end)\n for idxj = 1, n do\n local j = idx[idxj]\n local tj = t[j][i]\n local right = j == n and n or st:right_bound(tj + 1, j + 1, n) - 1\n local left = j == 1 and 1 or st:left_bound(tj + 1, 1, j - 1) + 1\n st:setValue(j, inf)\n imos[left][j] = imos[left][j] + tj\n imos[left][right + 1] = imos[left][right + 1] - tj\n imos[j + 1][j] = imos[j + 1][j] - tj\n imos[j + 1][right + 1] = imos[j + 1][right + 1] + tj\n end\nend\nfor j = 1, n do\n for i = 2, n do\n imos[i][j] = imos[i][j] + imos[i - 1][j]\n end\nend\nfor i = 1, n do\n for j = 2, n do\n imos[i][j] = imos[i][j] + imos[i][j - 1]\n end\nend\n\nlocal score = 0\nfor i = 1, n do\n for j = i, n do\n score = mma(score, imos[i][j] - pos[j] + pos[i])\n end\nend\nprint(score)\n", "problem_context": "Score : 1000 points\n\nProblem Statement\n\nThere are N barbecue restaurants along a street.\nThe restaurants are numbered 1 through N from west to east, and the distance between restaurant i and restaurant i+1 is A_i.\n\nJoisino has M tickets, numbered 1 through M.\nEvery barbecue restaurant offers barbecue meals in exchange for these tickets.\nRestaurant i offers a meal of deliciousness B_{i,j} in exchange for ticket j.\nEach ticket can only be used once, but any number of tickets can be used at a restaurant.\n\nJoisino wants to have M barbecue meals by starting from a restaurant of her choice, then repeatedly traveling to another barbecue restaurant and using unused tickets at the restaurant at her current location.\nHer eventual happiness is calculated by the following formula: \"(The total deliciousness of the meals eaten) - (The total distance traveled)\".\nFind her maximum possible eventual happiness.\n\nConstraints\n\nAll input values are integers.\n\n2≤N≤5×10^3\n\n1≤M≤200\n\n1≤A_i≤10^9\n\n1≤B_{i,j}≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_{N-1}\nB_{1,1} B_{1,2} ... B_{1,M}\nB_{2,1} B_{2,2} ... B_{2,M}\n:\nB_{N,1} B_{N,2} ... B_{N,M}\n\nOutput\n\nPrint Joisino's maximum possible eventual happiness.\n\nSample Input 1\n\n3 4\n1 4\n2 2 5 1\n1 3 3 2\n2 2 5 1\n\nSample Output 1\n\n11\n\nThe eventual happiness can be maximized by the following strategy: start from restaurant 1 and use tickets 1 and 3, then move to restaurant 2 and use tickets 2 and 4.\n\nSample Input 2\n\n5 3\n1 2 3 4\n10 1 1\n1 1 1\n1 10 1\n1 1 1\n1 1 10\n\nSample Output 2\n\n20", "sample_input": "3 4\n1 4\n2 2 5 1\n1 3 3 2\n2 2 5 1\n"}, "reference_outputs": ["11\n"], "source_document_id": "p03833", "source_text": "Score : 1000 points\n\nProblem Statement\n\nThere are N barbecue restaurants along a street.\nThe restaurants are numbered 1 through N from west to east, and the distance between restaurant i and restaurant i+1 is A_i.\n\nJoisino has M tickets, numbered 1 through M.\nEvery barbecue restaurant offers barbecue meals in exchange for these tickets.\nRestaurant i offers a meal of deliciousness B_{i,j} in exchange for ticket j.\nEach ticket can only be used once, but any number of tickets can be used at a restaurant.\n\nJoisino wants to have M barbecue meals by starting from a restaurant of her choice, then repeatedly traveling to another barbecue restaurant and using unused tickets at the restaurant at her current location.\nHer eventual happiness is calculated by the following formula: \"(The total deliciousness of the meals eaten) - (The total distance traveled)\".\nFind her maximum possible eventual happiness.\n\nConstraints\n\nAll input values are integers.\n\n2≤N≤5×10^3\n\n1≤M≤200\n\n1≤A_i≤10^9\n\n1≤B_{i,j}≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_{N-1}\nB_{1,1} B_{1,2} ... B_{1,M}\nB_{2,1} B_{2,2} ... B_{2,M}\n:\nB_{N,1} B_{N,2} ... B_{N,M}\n\nOutput\n\nPrint Joisino's maximum possible eventual happiness.\n\nSample Input 1\n\n3 4\n1 4\n2 2 5 1\n1 3 3 2\n2 2 5 1\n\nSample Output 1\n\n11\n\nThe eventual happiness can be maximized by the following strategy: start from restaurant 1 and use tickets 1 and 3, then move to restaurant 2 and use tickets 2 and 4.\n\nSample Input 2\n\n5 3\n1 2 3 4\n10 1 1\n1 1 1\n1 10 1\n1 1 1\n1 1 10\n\nSample Output 2\n\n20", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4748, "cpu_time_ms": 2165, "memory_kb": 335012}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s710604900", "group_id": "codeNet:p03833", "input_text": "local function uf_initialize(n)\n local parent = {}\n for i = 1, n do parent[i] = i end\n return parent\nend\n\nlocal function uf_findroot(idx, parent)\n local idx_update = idx\n while parent[idx] ~= idx do\n idx = parent[idx]\n end\n while parent[idx_update] ~= idx do\n parent[idx_update], idx_update = idx, parent[idx_update]\n end\n return idx\nend\n\nlocal function kruskal(n, line)\n -- line.c, line.i1, line.i2\n table.sort(line, function(a, b) return a.c < b.c end)\n local parent = uf_initialize(n)\n local totalcost = 0\n local used = 0\n local linenum = #line\n for i = 1, linenum do\n local c, i1, i2 = line[i].c, line[i].i1, line[i].i2\n local r1, r2 = uf_findroot(i1, parent), uf_findroot(i2, parent)\n parent[i1], parent[i2] = r1, r2\n if r1 ~= r2 then\n parent[r2] = r1\n parent[i2] = r1\n totalcost = totalcost + c\n used = used + 1\n if used == n - 1 then break end\n end\n end\n return totalcost\nend\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal edge = {}\nfor i = 1, n do\n local c = io.read(\"*n\")\n edge[i] = {}\n edge[i].c, edge[i].i1, edge[i].i2 = c, i, n + 1\nend\nfor i = 1, m do\n local a, b, r = io.read(\"*n\", \"*n\", \"*n\")\n edge[n + i] = {}\n edge[n + i].c, edge[n + i].i1, edge[n + i].i2 = r, a, b\nend\nlocal ret = kruskal(n + 1, edge)\nif 99999999999999 < ret then\n print(\"100000000000000\")\nelse\n print(ret)\nend\n", "language": "Lua", "metadata": {"date": 1584071532, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03833.html", "problem_id": "p03833", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03833/input.txt", "sample_output_relpath": "derived/input_output/data/p03833/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03833/Lua/s710604900.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s710604900", "user_id": "u120582723"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "local function uf_initialize(n)\n local parent = {}\n for i = 1, n do parent[i] = i end\n return parent\nend\n\nlocal function uf_findroot(idx, parent)\n local idx_update = idx\n while parent[idx] ~= idx do\n idx = parent[idx]\n end\n while parent[idx_update] ~= idx do\n parent[idx_update], idx_update = idx, parent[idx_update]\n end\n return idx\nend\n\nlocal function kruskal(n, line)\n -- line.c, line.i1, line.i2\n table.sort(line, function(a, b) return a.c < b.c end)\n local parent = uf_initialize(n)\n local totalcost = 0\n local used = 0\n local linenum = #line\n for i = 1, linenum do\n local c, i1, i2 = line[i].c, line[i].i1, line[i].i2\n local r1, r2 = uf_findroot(i1, parent), uf_findroot(i2, parent)\n parent[i1], parent[i2] = r1, r2\n if r1 ~= r2 then\n parent[r2] = r1\n parent[i2] = r1\n totalcost = totalcost + c\n used = used + 1\n if used == n - 1 then break end\n end\n end\n return totalcost\nend\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal edge = {}\nfor i = 1, n do\n local c = io.read(\"*n\")\n edge[i] = {}\n edge[i].c, edge[i].i1, edge[i].i2 = c, i, n + 1\nend\nfor i = 1, m do\n local a, b, r = io.read(\"*n\", \"*n\", \"*n\")\n edge[n + i] = {}\n edge[n + i].c, edge[n + i].i1, edge[n + i].i2 = r, a, b\nend\nlocal ret = kruskal(n + 1, edge)\nif 99999999999999 < ret then\n print(\"100000000000000\")\nelse\n print(ret)\nend\n", "problem_context": "Score : 1000 points\n\nProblem Statement\n\nThere are N barbecue restaurants along a street.\nThe restaurants are numbered 1 through N from west to east, and the distance between restaurant i and restaurant i+1 is A_i.\n\nJoisino has M tickets, numbered 1 through M.\nEvery barbecue restaurant offers barbecue meals in exchange for these tickets.\nRestaurant i offers a meal of deliciousness B_{i,j} in exchange for ticket j.\nEach ticket can only be used once, but any number of tickets can be used at a restaurant.\n\nJoisino wants to have M barbecue meals by starting from a restaurant of her choice, then repeatedly traveling to another barbecue restaurant and using unused tickets at the restaurant at her current location.\nHer eventual happiness is calculated by the following formula: \"(The total deliciousness of the meals eaten) - (The total distance traveled)\".\nFind her maximum possible eventual happiness.\n\nConstraints\n\nAll input values are integers.\n\n2≤N≤5×10^3\n\n1≤M≤200\n\n1≤A_i≤10^9\n\n1≤B_{i,j}≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_{N-1}\nB_{1,1} B_{1,2} ... B_{1,M}\nB_{2,1} B_{2,2} ... B_{2,M}\n:\nB_{N,1} B_{N,2} ... B_{N,M}\n\nOutput\n\nPrint Joisino's maximum possible eventual happiness.\n\nSample Input 1\n\n3 4\n1 4\n2 2 5 1\n1 3 3 2\n2 2 5 1\n\nSample Output 1\n\n11\n\nThe eventual happiness can be maximized by the following strategy: start from restaurant 1 and use tickets 1 and 3, then move to restaurant 2 and use tickets 2 and 4.\n\nSample Input 2\n\n5 3\n1 2 3 4\n10 1 1\n1 1 1\n1 10 1\n1 1 1\n1 1 10\n\nSample Output 2\n\n20", "sample_input": "3 4\n1 4\n2 2 5 1\n1 3 3 2\n2 2 5 1\n"}, "reference_outputs": ["11\n"], "source_document_id": "p03833", "source_text": "Score : 1000 points\n\nProblem Statement\n\nThere are N barbecue restaurants along a street.\nThe restaurants are numbered 1 through N from west to east, and the distance between restaurant i and restaurant i+1 is A_i.\n\nJoisino has M tickets, numbered 1 through M.\nEvery barbecue restaurant offers barbecue meals in exchange for these tickets.\nRestaurant i offers a meal of deliciousness B_{i,j} in exchange for ticket j.\nEach ticket can only be used once, but any number of tickets can be used at a restaurant.\n\nJoisino wants to have M barbecue meals by starting from a restaurant of her choice, then repeatedly traveling to another barbecue restaurant and using unused tickets at the restaurant at her current location.\nHer eventual happiness is calculated by the following formula: \"(The total deliciousness of the meals eaten) - (The total distance traveled)\".\nFind her maximum possible eventual happiness.\n\nConstraints\n\nAll input values are integers.\n\n2≤N≤5×10^3\n\n1≤M≤200\n\n1≤A_i≤10^9\n\n1≤B_{i,j}≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_{N-1}\nB_{1,1} B_{1,2} ... B_{1,M}\nB_{2,1} B_{2,2} ... B_{2,M}\n:\nB_{N,1} B_{N,2} ... B_{N,M}\n\nOutput\n\nPrint Joisino's maximum possible eventual happiness.\n\nSample Input 1\n\n3 4\n1 4\n2 2 5 1\n1 3 3 2\n2 2 5 1\n\nSample Output 1\n\n11\n\nThe eventual happiness can be maximized by the following strategy: start from restaurant 1 and use tickets 1 and 3, then move to restaurant 2 and use tickets 2 and 4.\n\nSample Input 2\n\n5 3\n1 2 3 4\n10 1 1\n1 1 1\n1 10 1\n1 1 1\n1 1 10\n\nSample Output 2\n\n20", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1360, "cpu_time_ms": 10, "memory_kb": 1280}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s320433061", "group_id": "codeNet:p03834", "input_text": "a = io.read():gsub(\",\", \" \")\nprint(a)", "language": "Lua", "metadata": {"date": 1584246850, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03834.html", "problem_id": "p03834", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03834/input.txt", "sample_output_relpath": "derived/input_output/data/p03834/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03834/Lua/s320433061.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s320433061", "user_id": "u120582723"}, "prompt_components": {"gold_output": "happy newyear enjoy\n", "input_to_evaluate": "a = io.read():gsub(\",\", \" \")\nprint(a)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAs a New Year's gift, Dolphin received a string s of length 19.\n\nThe string s has the following format: [five lowercase English letters],[seven lowercase English letters],[five lowercase English letters].\n\nDolphin wants to convert the comma-separated string s into a space-separated string.\n\nWrite a program to perform the conversion for him.\n\nConstraints\n\nThe length of s is 19.\n\nThe sixth and fourteenth characters in s are ,.\n\nThe other characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string after the conversion.\n\nSample Input 1\n\nhappy,newyear,enjoy\n\nSample Output 1\n\nhappy newyear enjoy\n\nReplace all the commas in happy,newyear,enjoy with spaces to obtain happy newyear enjoy.\n\nSample Input 2\n\nhaiku,atcoder,tasks\n\nSample Output 2\n\nhaiku atcoder tasks\n\nSample Input 3\n\nabcde,fghihgf,edcba\n\nSample Output 3\n\nabcde fghihgf edcba", "sample_input": "happy,newyear,enjoy\n"}, "reference_outputs": ["happy newyear enjoy\n"], "source_document_id": "p03834", "source_text": "Score : 100 points\n\nProblem Statement\n\nAs a New Year's gift, Dolphin received a string s of length 19.\n\nThe string s has the following format: [five lowercase English letters],[seven lowercase English letters],[five lowercase English letters].\n\nDolphin wants to convert the comma-separated string s into a space-separated string.\n\nWrite a program to perform the conversion for him.\n\nConstraints\n\nThe length of s is 19.\n\nThe sixth and fourteenth characters in s are ,.\n\nThe other characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string after the conversion.\n\nSample Input 1\n\nhappy,newyear,enjoy\n\nSample Output 1\n\nhappy newyear enjoy\n\nReplace all the commas in happy,newyear,enjoy with spaces to obtain happy newyear enjoy.\n\nSample Input 2\n\nhaiku,atcoder,tasks\n\nSample Output 2\n\nhaiku atcoder tasks\n\nSample Input 3\n\nabcde,fghihgf,edcba\n\nSample Output 3\n\nabcde fghihgf edcba", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 37, "cpu_time_ms": 65, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s631544627", "group_id": "codeNet:p03836", "input_text": "local sx,sy,tx,ty=io.read(\"n\",\"n\",\"n\",\"n\")\nlocal dx=tx-sx\nlocal dy=ty-sy\nlocal path=string.rep(\"U\",dy)..string.rep(\"R\",dx)..\n string.rep(\"D\",dy)..string.rep(\"L\",dx)..\n \"L\"..string.rep(\"U\",dy+1)..string.rep(\"R\",dx+1)..\"D\"..\n \"R\"..string.rep(\"D\",dy+1)..string.rep(\"L\",dx+1)..\"U\"\nprint(path)", "language": "Lua", "metadata": {"date": 1591676027, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03836.html", "problem_id": "p03836", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03836/input.txt", "sample_output_relpath": "derived/input_output/data/p03836/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03836/Lua/s631544627.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s631544627", "user_id": "u045238009"}, "prompt_components": {"gold_output": "UURDDLLUUURRDRDDDLLU\n", "input_to_evaluate": "local sx,sy,tx,ty=io.read(\"n\",\"n\",\"n\",\"n\")\nlocal dx=tx-sx\nlocal dy=ty-sy\nlocal path=string.rep(\"U\",dy)..string.rep(\"R\",dx)..\n string.rep(\"D\",dy)..string.rep(\"L\",dx)..\n \"L\"..string.rep(\"U\",dy+1)..string.rep(\"R\",dx+1)..\"D\"..\n \"R\"..string.rep(\"D\",dy+1)..string.rep(\"L\",dx+1)..\"U\"\nprint(path)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDolphin resides in two-dimensional Cartesian plane, with the positive x-axis pointing right and the positive y-axis pointing up.\n\nCurrently, he is located at the point (sx,sy). In each second, he can move up, down, left or right by a distance of 1.\n\nHere, both the x- and y-coordinates before and after each movement must be integers.\n\nHe will first visit the point (tx,ty) where sx < tx and sy < ty, then go back to the point (sx,sy), then visit the point (tx,ty) again, and lastly go back to the point (sx,sy).\n\nHere, during the whole travel, he is not allowed to pass through the same point more than once, except the points (sx,sy) and (tx,ty).\n\nUnder this condition, find a shortest path for him.\n\nConstraints\n\n-1000 ≤ sx < tx ≤ 1000\n\n-1000 ≤ sy < ty ≤ 1000\n\nsx,sy,tx and ty are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nsx sy tx ty\n\nOutput\n\nPrint a string S that represents a shortest path for Dolphin.\n\nThe i-th character in S should correspond to his i-th movement.\n\nThe directions of the movements should be indicated by the following characters:\n\nU: Up\n\nD: Down\n\nL: Left\n\nR: Right\n\nIf there exist multiple shortest paths under the condition, print any of them.\n\nSample Input 1\n\n0 0 1 2\n\nSample Output 1\n\nUURDDLLUUURRDRDDDLLU\n\nOne possible shortest path is:\n\nGoing from (sx,sy) to (tx,ty) for the first time: (0,0) → (0,1) → (0,2) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the first time: (1,2) → (1,1) → (1,0) → (0,0)\n\nGoing from (sx,sy) to (tx,ty) for the second time: (0,0) → (-1,0) → (-1,1) → (-1,2) → (-1,3) → (0,3) → (1,3) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the second time: (1,2) → (2,2) → (2,1) → (2,0) → (2,-1) → (1,-1) → (0,-1) → (0,0)\n\nSample Input 2\n\n-2 -2 1 1\n\nSample Output 2\n\nUURRURRDDDLLDLLULUUURRURRDDDLLDL", "sample_input": "0 0 1 2\n"}, "reference_outputs": ["UURDDLLUUURRDRDDDLLU\n"], "source_document_id": "p03836", "source_text": "Score : 300 points\n\nProblem Statement\n\nDolphin resides in two-dimensional Cartesian plane, with the positive x-axis pointing right and the positive y-axis pointing up.\n\nCurrently, he is located at the point (sx,sy). In each second, he can move up, down, left or right by a distance of 1.\n\nHere, both the x- and y-coordinates before and after each movement must be integers.\n\nHe will first visit the point (tx,ty) where sx < tx and sy < ty, then go back to the point (sx,sy), then visit the point (tx,ty) again, and lastly go back to the point (sx,sy).\n\nHere, during the whole travel, he is not allowed to pass through the same point more than once, except the points (sx,sy) and (tx,ty).\n\nUnder this condition, find a shortest path for him.\n\nConstraints\n\n-1000 ≤ sx < tx ≤ 1000\n\n-1000 ≤ sy < ty ≤ 1000\n\nsx,sy,tx and ty are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nsx sy tx ty\n\nOutput\n\nPrint a string S that represents a shortest path for Dolphin.\n\nThe i-th character in S should correspond to his i-th movement.\n\nThe directions of the movements should be indicated by the following characters:\n\nU: Up\n\nD: Down\n\nL: Left\n\nR: Right\n\nIf there exist multiple shortest paths under the condition, print any of them.\n\nSample Input 1\n\n0 0 1 2\n\nSample Output 1\n\nUURDDLLUUURRDRDDDLLU\n\nOne possible shortest path is:\n\nGoing from (sx,sy) to (tx,ty) for the first time: (0,0) → (0,1) → (0,2) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the first time: (1,2) → (1,1) → (1,0) → (0,0)\n\nGoing from (sx,sy) to (tx,ty) for the second time: (0,0) → (-1,0) → (-1,1) → (-1,2) → (-1,3) → (0,3) → (1,3) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the second time: (1,2) → (2,2) → (2,1) → (2,0) → (2,-1) → (1,-1) → (0,-1) → (0,0)\n\nSample Input 2\n\n-2 -2 1 1\n\nSample Output 2\n\nUURRURRDDDLLDLLULUUURRURRDDDLLDL", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s563126178", "group_id": "codeNet:p03836", "input_text": "local a, b = io.read(\"*n\", \"*n\")\nlocal c, d = io.read(\"*n\", \"*n\")\na = c - a\nb = d - b\nfor i = 1, a do\n io.write(\"R\")\nend\nfor i = 1, b do\n io.write(\"U\")\nend\nfor i = 1, a do\n io.write(\"L\")\nend\nfor i = 1, b do\n io.write(\"D\")\nend\nio.write(\"D\")\nfor i = 1, a + 1 do\n io.write(\"R\")\nend\nfor i = 1, b + 1 do\n io.write(\"U\")\nend\nio.write(\"LU\")\nfor i = 1, a + 1 do\n io.write(\"L\")\nend\nfor i = 1, b + 1 do\n io.write(\"D\")\nend\nprint(\"R\")\n", "language": "Lua", "metadata": {"date": 1589591111, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03836.html", "problem_id": "p03836", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03836/input.txt", "sample_output_relpath": "derived/input_output/data/p03836/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03836/Lua/s563126178.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s563126178", "user_id": "u120582723"}, "prompt_components": {"gold_output": "UURDDLLUUURRDRDDDLLU\n", "input_to_evaluate": "local a, b = io.read(\"*n\", \"*n\")\nlocal c, d = io.read(\"*n\", \"*n\")\na = c - a\nb = d - b\nfor i = 1, a do\n io.write(\"R\")\nend\nfor i = 1, b do\n io.write(\"U\")\nend\nfor i = 1, a do\n io.write(\"L\")\nend\nfor i = 1, b do\n io.write(\"D\")\nend\nio.write(\"D\")\nfor i = 1, a + 1 do\n io.write(\"R\")\nend\nfor i = 1, b + 1 do\n io.write(\"U\")\nend\nio.write(\"LU\")\nfor i = 1, a + 1 do\n io.write(\"L\")\nend\nfor i = 1, b + 1 do\n io.write(\"D\")\nend\nprint(\"R\")\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDolphin resides in two-dimensional Cartesian plane, with the positive x-axis pointing right and the positive y-axis pointing up.\n\nCurrently, he is located at the point (sx,sy). In each second, he can move up, down, left or right by a distance of 1.\n\nHere, both the x- and y-coordinates before and after each movement must be integers.\n\nHe will first visit the point (tx,ty) where sx < tx and sy < ty, then go back to the point (sx,sy), then visit the point (tx,ty) again, and lastly go back to the point (sx,sy).\n\nHere, during the whole travel, he is not allowed to pass through the same point more than once, except the points (sx,sy) and (tx,ty).\n\nUnder this condition, find a shortest path for him.\n\nConstraints\n\n-1000 ≤ sx < tx ≤ 1000\n\n-1000 ≤ sy < ty ≤ 1000\n\nsx,sy,tx and ty are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nsx sy tx ty\n\nOutput\n\nPrint a string S that represents a shortest path for Dolphin.\n\nThe i-th character in S should correspond to his i-th movement.\n\nThe directions of the movements should be indicated by the following characters:\n\nU: Up\n\nD: Down\n\nL: Left\n\nR: Right\n\nIf there exist multiple shortest paths under the condition, print any of them.\n\nSample Input 1\n\n0 0 1 2\n\nSample Output 1\n\nUURDDLLUUURRDRDDDLLU\n\nOne possible shortest path is:\n\nGoing from (sx,sy) to (tx,ty) for the first time: (0,0) → (0,1) → (0,2) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the first time: (1,2) → (1,1) → (1,0) → (0,0)\n\nGoing from (sx,sy) to (tx,ty) for the second time: (0,0) → (-1,0) → (-1,1) → (-1,2) → (-1,3) → (0,3) → (1,3) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the second time: (1,2) → (2,2) → (2,1) → (2,0) → (2,-1) → (1,-1) → (0,-1) → (0,0)\n\nSample Input 2\n\n-2 -2 1 1\n\nSample Output 2\n\nUURRURRDDDLLDLLULUUURRURRDDDLLDL", "sample_input": "0 0 1 2\n"}, "reference_outputs": ["UURDDLLUUURRDRDDDLLU\n"], "source_document_id": "p03836", "source_text": "Score : 300 points\n\nProblem Statement\n\nDolphin resides in two-dimensional Cartesian plane, with the positive x-axis pointing right and the positive y-axis pointing up.\n\nCurrently, he is located at the point (sx,sy). In each second, he can move up, down, left or right by a distance of 1.\n\nHere, both the x- and y-coordinates before and after each movement must be integers.\n\nHe will first visit the point (tx,ty) where sx < tx and sy < ty, then go back to the point (sx,sy), then visit the point (tx,ty) again, and lastly go back to the point (sx,sy).\n\nHere, during the whole travel, he is not allowed to pass through the same point more than once, except the points (sx,sy) and (tx,ty).\n\nUnder this condition, find a shortest path for him.\n\nConstraints\n\n-1000 ≤ sx < tx ≤ 1000\n\n-1000 ≤ sy < ty ≤ 1000\n\nsx,sy,tx and ty are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nsx sy tx ty\n\nOutput\n\nPrint a string S that represents a shortest path for Dolphin.\n\nThe i-th character in S should correspond to his i-th movement.\n\nThe directions of the movements should be indicated by the following characters:\n\nU: Up\n\nD: Down\n\nL: Left\n\nR: Right\n\nIf there exist multiple shortest paths under the condition, print any of them.\n\nSample Input 1\n\n0 0 1 2\n\nSample Output 1\n\nUURDDLLUUURRDRDDDLLU\n\nOne possible shortest path is:\n\nGoing from (sx,sy) to (tx,ty) for the first time: (0,0) → (0,1) → (0,2) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the first time: (1,2) → (1,1) → (1,0) → (0,0)\n\nGoing from (sx,sy) to (tx,ty) for the second time: (0,0) → (-1,0) → (-1,1) → (-1,2) → (-1,3) → (0,3) → (1,3) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the second time: (1,2) → (2,2) → (2,1) → (2,0) → (2,-1) → (1,-1) → (0,-1) → (0,0)\n\nSample Input 2\n\n-2 -2 1 1\n\nSample Output 2\n\nUURRURRDDDLLDLLULUUURRURRDDDLLDL", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 430, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s296850361", "group_id": "codeNet:p03836", "input_text": "local sx, sy, tx, ty = io.read(\"n\",\"n\",\"n\",\"n\")\nlocal t = {}\nlocal function _p(a) table.insert(t, a) end\nlocal function pp(a,c) for i=1,c do _p(a) end end\ntx = tx - sx\nty = ty - sy\n\nlocal h_to = tx > 0 and \"R\" or \"L\"\nlocal h_bk = tx > 0 and \"L\" or \"R\"\nlocal v_to = ty > 0 and \"U\" or \"D\"\nlocal v_bk = ty > 0 and \"D\" or \"U\"\n\npp(h_to, math.abs(tx))\npp(v_to, math.abs(ty))\npp(h_bk, math.abs(tx))\npp(v_bk, math.abs(ty))\npp(v_bk, 1)\npp(h_to, math.abs(tx))\npp(h_to, 1)\npp(v_to, 1)\npp(v_to, math.abs(ty))\npp(h_bk, 1)\npp(v_to, 1)\npp(h_bk, math.abs(tx))\npp(h_bk, 1)\npp(v_bk, math.abs(ty))\npp(v_bk, 1)\npp(h_to, 1)\n\nprint(table.concat(t,\"\"))", "language": "Lua", "metadata": {"date": 1571027842, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03836.html", "problem_id": "p03836", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03836/input.txt", "sample_output_relpath": "derived/input_output/data/p03836/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03836/Lua/s296850361.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s296850361", "user_id": "u162773977"}, "prompt_components": {"gold_output": "UURDDLLUUURRDRDDDLLU\n", "input_to_evaluate": "local sx, sy, tx, ty = io.read(\"n\",\"n\",\"n\",\"n\")\nlocal t = {}\nlocal function _p(a) table.insert(t, a) end\nlocal function pp(a,c) for i=1,c do _p(a) end end\ntx = tx - sx\nty = ty - sy\n\nlocal h_to = tx > 0 and \"R\" or \"L\"\nlocal h_bk = tx > 0 and \"L\" or \"R\"\nlocal v_to = ty > 0 and \"U\" or \"D\"\nlocal v_bk = ty > 0 and \"D\" or \"U\"\n\npp(h_to, math.abs(tx))\npp(v_to, math.abs(ty))\npp(h_bk, math.abs(tx))\npp(v_bk, math.abs(ty))\npp(v_bk, 1)\npp(h_to, math.abs(tx))\npp(h_to, 1)\npp(v_to, 1)\npp(v_to, math.abs(ty))\npp(h_bk, 1)\npp(v_to, 1)\npp(h_bk, math.abs(tx))\npp(h_bk, 1)\npp(v_bk, math.abs(ty))\npp(v_bk, 1)\npp(h_to, 1)\n\nprint(table.concat(t,\"\"))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDolphin resides in two-dimensional Cartesian plane, with the positive x-axis pointing right and the positive y-axis pointing up.\n\nCurrently, he is located at the point (sx,sy). In each second, he can move up, down, left or right by a distance of 1.\n\nHere, both the x- and y-coordinates before and after each movement must be integers.\n\nHe will first visit the point (tx,ty) where sx < tx and sy < ty, then go back to the point (sx,sy), then visit the point (tx,ty) again, and lastly go back to the point (sx,sy).\n\nHere, during the whole travel, he is not allowed to pass through the same point more than once, except the points (sx,sy) and (tx,ty).\n\nUnder this condition, find a shortest path for him.\n\nConstraints\n\n-1000 ≤ sx < tx ≤ 1000\n\n-1000 ≤ sy < ty ≤ 1000\n\nsx,sy,tx and ty are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nsx sy tx ty\n\nOutput\n\nPrint a string S that represents a shortest path for Dolphin.\n\nThe i-th character in S should correspond to his i-th movement.\n\nThe directions of the movements should be indicated by the following characters:\n\nU: Up\n\nD: Down\n\nL: Left\n\nR: Right\n\nIf there exist multiple shortest paths under the condition, print any of them.\n\nSample Input 1\n\n0 0 1 2\n\nSample Output 1\n\nUURDDLLUUURRDRDDDLLU\n\nOne possible shortest path is:\n\nGoing from (sx,sy) to (tx,ty) for the first time: (0,0) → (0,1) → (0,2) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the first time: (1,2) → (1,1) → (1,0) → (0,0)\n\nGoing from (sx,sy) to (tx,ty) for the second time: (0,0) → (-1,0) → (-1,1) → (-1,2) → (-1,3) → (0,3) → (1,3) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the second time: (1,2) → (2,2) → (2,1) → (2,0) → (2,-1) → (1,-1) → (0,-1) → (0,0)\n\nSample Input 2\n\n-2 -2 1 1\n\nSample Output 2\n\nUURRURRDDDLLDLLULUUURRURRDDDLLDL", "sample_input": "0 0 1 2\n"}, "reference_outputs": ["UURDDLLUUURRDRDDDLLU\n"], "source_document_id": "p03836", "source_text": "Score : 300 points\n\nProblem Statement\n\nDolphin resides in two-dimensional Cartesian plane, with the positive x-axis pointing right and the positive y-axis pointing up.\n\nCurrently, he is located at the point (sx,sy). In each second, he can move up, down, left or right by a distance of 1.\n\nHere, both the x- and y-coordinates before and after each movement must be integers.\n\nHe will first visit the point (tx,ty) where sx < tx and sy < ty, then go back to the point (sx,sy), then visit the point (tx,ty) again, and lastly go back to the point (sx,sy).\n\nHere, during the whole travel, he is not allowed to pass through the same point more than once, except the points (sx,sy) and (tx,ty).\n\nUnder this condition, find a shortest path for him.\n\nConstraints\n\n-1000 ≤ sx < tx ≤ 1000\n\n-1000 ≤ sy < ty ≤ 1000\n\nsx,sy,tx and ty are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nsx sy tx ty\n\nOutput\n\nPrint a string S that represents a shortest path for Dolphin.\n\nThe i-th character in S should correspond to his i-th movement.\n\nThe directions of the movements should be indicated by the following characters:\n\nU: Up\n\nD: Down\n\nL: Left\n\nR: Right\n\nIf there exist multiple shortest paths under the condition, print any of them.\n\nSample Input 1\n\n0 0 1 2\n\nSample Output 1\n\nUURDDLLUUURRDRDDDLLU\n\nOne possible shortest path is:\n\nGoing from (sx,sy) to (tx,ty) for the first time: (0,0) → (0,1) → (0,2) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the first time: (1,2) → (1,1) → (1,0) → (0,0)\n\nGoing from (sx,sy) to (tx,ty) for the second time: (0,0) → (-1,0) → (-1,1) → (-1,2) → (-1,3) → (0,3) → (1,3) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the second time: (1,2) → (2,2) → (2,1) → (2,0) → (2,-1) → (1,-1) → (0,-1) → (0,0)\n\nSample Input 2\n\n-2 -2 1 1\n\nSample Output 2\n\nUURRURRDDDLLDLLULUUURRURRDDDLLDL", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 629, "cpu_time_ms": 5, "memory_kb": 632}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s232344900", "group_id": "codeNet:p03837", "input_text": "local n, m = io.read(\"*n\", \"*n\")\nlocal edge = {}\nlocal edgeidx = {}\nfor i = 1, n do\n edge[i] = {}\n edgeidx[i] = {}\nend\nlocal edgeuse = {}\nfor i = 1, m do\n edgeuse[i] = false\n local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n edge[a][b] = c\n edgeidx[a][b] = i\n edge[b][a] = c\n edgeidx[b][a] = i\nend\nlocal inf = 1000000007\nlocal len = {}\nlocal asked = {}\nlocal function getpos()\n local cand = 0\n for i = 1, n do\n if not asked[i] then\n if cand == 0 or len[i] < len[cand] then\n cand = i\n end\n end\n end\n return cand\nend\nlocal function solve(spos)\n for i = 1, n do\n asked[i] = false\n len[i] = i == spos and 0 or inf\n end\n for i = 1, n do\n local src = getpos()\n asked[src] = true\n for dst, cost in pairs(edge[src]) do\n if len[dst] + cost == len[src] then\n edgeuse[edgeidx[dst][src]] = true\n end\n if len[src] + cost < len[dst] then\n len[dst] = len[src] + cost\n end\n end\n end\nend\n\nfor i = 1, n do\n solve(i)\nend\n\nlocal ret = 0\nfor i = 1, m do\n if not edgeuse[i] then ret = ret + 1 end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1589590709, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03837.html", "problem_id": "p03837", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03837/input.txt", "sample_output_relpath": "derived/input_output/data/p03837/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03837/Lua/s232344900.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s232344900", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local n, m = io.read(\"*n\", \"*n\")\nlocal edge = {}\nlocal edgeidx = {}\nfor i = 1, n do\n edge[i] = {}\n edgeidx[i] = {}\nend\nlocal edgeuse = {}\nfor i = 1, m do\n edgeuse[i] = false\n local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n edge[a][b] = c\n edgeidx[a][b] = i\n edge[b][a] = c\n edgeidx[b][a] = i\nend\nlocal inf = 1000000007\nlocal len = {}\nlocal asked = {}\nlocal function getpos()\n local cand = 0\n for i = 1, n do\n if not asked[i] then\n if cand == 0 or len[i] < len[cand] then\n cand = i\n end\n end\n end\n return cand\nend\nlocal function solve(spos)\n for i = 1, n do\n asked[i] = false\n len[i] = i == spos and 0 or inf\n end\n for i = 1, n do\n local src = getpos()\n asked[src] = true\n for dst, cost in pairs(edge[src]) do\n if len[dst] + cost == len[src] then\n edgeuse[edgeidx[dst][src]] = true\n end\n if len[src] + cost < len[dst] then\n len[dst] = len[src] + cost\n end\n end\n end\nend\n\nfor i = 1, n do\n solve(i)\nend\n\nlocal ret = 0\nfor i = 1, m do\n if not edgeuse[i] then ret = ret + 1 end\nend\nprint(ret)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given an undirected connected weighted graph with N vertices and M edges that contains neither self-loops nor double edges.\n\nThe i-th (1≤i≤M) edge connects vertex a_i and vertex b_i with a distance of c_i.\n\nHere, a self-loop is an edge where a_i = b_i (1≤i≤M), and double edges are two edges where (a_i,b_i)=(a_j,b_j) or (a_i,b_i)=(b_j,a_j) (1≤i 0 and self.lower(ku, k) do\n self:_swap(ku, k)\n k = k//2\n ku = ku//2\n end\nend\n\nfunction Heap:insertq(e)\n table.insert(self.a, e)\n self:upheap(#self.a)\nend\n\nfunction Heap:downheap(newk)\n local k = newk\n while k <= #self.a//2 do\n local kdl = k*2\n local kdr = kdl + 1\n local kd\n if kdr <= #self.a and self.lower(kdl, kdr) then\n kd = kdr\n else\n kd = kdl\n end\n if self.upper(k, kd) then\n break\n end\n self:_swap(k, kd)\n k = kd\n end\nend\n\nfunction Heap:top()\n assert(#self.a >= 1)\n return self.a[1]\nend\n\nfunction Heap:remove_top()\n assert(#self.a >= 1)\n local v = self.a[1]\n self:_swap(1, #self.a)\n table.remove(self.a)\n self:downheap(1)\n return v\nend\n\nfunction Heap:replace_top(e)\n assert(#self.a >= 1)\n local old_v = self.a[1]\n local swapped = false\n if self.upper_func(old_v, e) then\n self.a[1] = e\n self:downheap(1)\n swapped = true\n end\n return swapped, old_v\nend\n\n-- dijkstra's algorithm\nlocal function find_shortest_path_all(adj_list, src)\n local from1 = {}\n from1[src] = 0\n local prevs = {}\n local q = Heap.new(function (v1, v2)\n return v1[2] < v2[2]\n end)\n local proved = {}\n q:insertq({src, 0, {}})\n while q:count() > 0 do\n local elem = q:remove_top()\n local cur_v, cur_cost, path = table.unpack(elem)\n if not proved[cur_v] then\n proved[cur_v] = true\n --[[\n if cur_v == dst then\n return cur_cost\n end\n ]]\n path = {table.unpack(path), cur_v}\n for _, link in ipairs(adj_list[cur_v]) do\n local to, cost = table.unpack(link)\n if not proved[to] then\n -- compare costs\n local before = from1[to]\n local candidate = cur_cost + cost\n if not before or candidate < before then\n from1[to] = candidate\n prevs[to] = cur_v\n q:insertq({to, candidate, path})\n end\n end\n end\n end\n end\n return from1, prevs\nend\n\nlocal function make_path(prevs, src, dst)\n local path = {}\n path[#path+1] = dst\n local cur = dst\n while cur ~= src do\n local next = prevs[cur]\n path[#path+1] = next\n cur = next\n end\n -- reverse\n for i=1, #path//2 do\n path[i], path[#path-i+1] = path[#path-i+1], path[i]\n end\n return path\nend\n\n-- main\nlocal N, M = io.read(\"n\", \"n\")\n\nlocal edges = {}\nfor i=1,M do\n local a, b, cost = io.read(\"n\", \"n\", \"n\")\n edges[#edges+1] = {a, b, cost}\nend\n\nlocal adj_list = {}\nfor i=1,N do\n adj_list[i] = {}\nend\n\nlocal edge_check = {}\nfor s=1,N do\n edge_check[s] = {}\nend\n\nfor i=1,M do\n local a, b, cost = table.unpack(edges[i])\n local list = adj_list[a]\n list[#list+1] = {b, cost}\n local list2 = adj_list[b]\n list2[#list2+1] = {a, cost}\n local small = math.min(a, b)\n local big = math.max(a, b)\n edge_check[small][big] = 0\nend\n\n\nfor s=1,N do\n local c, prevs = find_shortest_path_all(adj_list, s)\n for dd=1,N do\n if dd ~= s then\n local ss = prevs[dd]\n local small = math.min(ss, dd)\n local big = math.max(ss, dd)\n edge_check[small][big] = edge_check[small][big] + 1\n end\n end\nend\n\nlocal ans = 0\nfor s=1,N do\n for d=s+1,N do\n local count = edge_check[s][d]\n if count then\n --print(s,d,count)\n if count == 0 then\n ans = ans + 1\n end\n end\n end\nend\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1558612575, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03837.html", "problem_id": "p03837", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03837/input.txt", "sample_output_relpath": "derived/input_output/data/p03837/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03837/Lua/s414586648.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s414586648", "user_id": "u162773977"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "-- heap\nlocal Heap = {}\nfunction Heap.new(upper_func)\n local self = setmetatable({}, {__index = Heap})\n self.a = {}\n self.upper_func = upper_func\n self.upper = function(k1, k2)\n assert(k1 < k2)\n if k1 == 0 then\n return false\n else\n return upper_func(self.a[k1], self.a[k2])\n end\n end\n self.lower = function(k1, k2)\n return not self.upper(k1, k2)\n end\n return self\nend\n\nfunction Heap:count()\n return #self.a\nend\n\nfunction Heap:_swap(k1, k2)\n local old_k1 = self.a[k1]\n self.a[k1] = self.a[k2]\n self.a[k2] = old_k1\nend\n\nfunction Heap:upheap(newk)\n local ku = newk // 2\n local k = newk\n while ku > 0 and self.lower(ku, k) do\n self:_swap(ku, k)\n k = k//2\n ku = ku//2\n end\nend\n\nfunction Heap:insertq(e)\n table.insert(self.a, e)\n self:upheap(#self.a)\nend\n\nfunction Heap:downheap(newk)\n local k = newk\n while k <= #self.a//2 do\n local kdl = k*2\n local kdr = kdl + 1\n local kd\n if kdr <= #self.a and self.lower(kdl, kdr) then\n kd = kdr\n else\n kd = kdl\n end\n if self.upper(k, kd) then\n break\n end\n self:_swap(k, kd)\n k = kd\n end\nend\n\nfunction Heap:top()\n assert(#self.a >= 1)\n return self.a[1]\nend\n\nfunction Heap:remove_top()\n assert(#self.a >= 1)\n local v = self.a[1]\n self:_swap(1, #self.a)\n table.remove(self.a)\n self:downheap(1)\n return v\nend\n\nfunction Heap:replace_top(e)\n assert(#self.a >= 1)\n local old_v = self.a[1]\n local swapped = false\n if self.upper_func(old_v, e) then\n self.a[1] = e\n self:downheap(1)\n swapped = true\n end\n return swapped, old_v\nend\n\n-- dijkstra's algorithm\nlocal function find_shortest_path_all(adj_list, src)\n local from1 = {}\n from1[src] = 0\n local prevs = {}\n local q = Heap.new(function (v1, v2)\n return v1[2] < v2[2]\n end)\n local proved = {}\n q:insertq({src, 0, {}})\n while q:count() > 0 do\n local elem = q:remove_top()\n local cur_v, cur_cost, path = table.unpack(elem)\n if not proved[cur_v] then\n proved[cur_v] = true\n --[[\n if cur_v == dst then\n return cur_cost\n end\n ]]\n path = {table.unpack(path), cur_v}\n for _, link in ipairs(adj_list[cur_v]) do\n local to, cost = table.unpack(link)\n if not proved[to] then\n -- compare costs\n local before = from1[to]\n local candidate = cur_cost + cost\n if not before or candidate < before then\n from1[to] = candidate\n prevs[to] = cur_v\n q:insertq({to, candidate, path})\n end\n end\n end\n end\n end\n return from1, prevs\nend\n\nlocal function make_path(prevs, src, dst)\n local path = {}\n path[#path+1] = dst\n local cur = dst\n while cur ~= src do\n local next = prevs[cur]\n path[#path+1] = next\n cur = next\n end\n -- reverse\n for i=1, #path//2 do\n path[i], path[#path-i+1] = path[#path-i+1], path[i]\n end\n return path\nend\n\n-- main\nlocal N, M = io.read(\"n\", \"n\")\n\nlocal edges = {}\nfor i=1,M do\n local a, b, cost = io.read(\"n\", \"n\", \"n\")\n edges[#edges+1] = {a, b, cost}\nend\n\nlocal adj_list = {}\nfor i=1,N do\n adj_list[i] = {}\nend\n\nlocal edge_check = {}\nfor s=1,N do\n edge_check[s] = {}\nend\n\nfor i=1,M do\n local a, b, cost = table.unpack(edges[i])\n local list = adj_list[a]\n list[#list+1] = {b, cost}\n local list2 = adj_list[b]\n list2[#list2+1] = {a, cost}\n local small = math.min(a, b)\n local big = math.max(a, b)\n edge_check[small][big] = 0\nend\n\n\nfor s=1,N do\n local c, prevs = find_shortest_path_all(adj_list, s)\n for dd=1,N do\n if dd ~= s then\n local ss = prevs[dd]\n local small = math.min(ss, dd)\n local big = math.max(ss, dd)\n edge_check[small][big] = edge_check[small][big] + 1\n end\n end\nend\n\nlocal ans = 0\nfor s=1,N do\n for d=s+1,N do\n local count = edge_check[s][d]\n if count then\n --print(s,d,count)\n if count == 0 then\n ans = ans + 1\n end\n end\n end\nend\nprint(ans)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given an undirected connected weighted graph with N vertices and M edges that contains neither self-loops nor double edges.\n\nThe i-th (1≤i≤M) edge connects vertex a_i and vertex b_i with a distance of c_i.\n\nHere, a self-loop is an edge where a_i = b_i (1≤i≤M), and double edges are two edges where (a_i,b_i)=(a_j,b_j) or (a_i,b_i)=(b_j,a_j) (1≤i 0 and self.lower(ku, k) do\n self:_swap(ku, k)\n k = k//2\n ku = ku//2\n end\nend\n\nfunction Heap:insertq(e)\n table.insert(self.a, e)\n self:upheap(#self.a)\nend\n\nfunction Heap:downheap(newk)\n local k = newk\n while k <= #self.a//2 do\n local kdl = k*2\n local kdr = kdl + 1\n local kd\n if kdr <= #self.a and self.lower(kdl, kdr) then\n kd = kdr\n else\n kd = kdl\n end\n if self.upper(k, kd) then\n break\n end\n self:_swap(k, kd)\n k = kd\n end\nend\n\nfunction Heap:top()\n assert(#self.a >= 1)\n return self.a[1]\nend\n\nfunction Heap:remove_top()\n assert(#self.a >= 1)\n local v = self.a[1]\n self:_swap(1, #self.a)\n table.remove(self.a)\n self:downheap(1)\n return v\nend\n\nfunction Heap:replace_top(e)\n assert(#self.a >= 1)\n local old_v = self.a[1]\n local swapped = false\n if self.upper_func(old_v, e) then\n self.a[1] = e\n self:downheap(1)\n swapped = true\n end\n return swapped, old_v\nend\n\n-- dijkstra's algorithm\nlocal function find_shortest_path_all(adj_list, src)\n local from1 = {}\n local prevs = {}\n local q = Heap.new(function (v1, v2)\n return v1[2] < v2[2]\n end)\n local proved = {}\n q:insertq({src, 0, {}})\n while q:count() > 0 do\n local elem = q:remove_top()\n local cur_v, cur_cost, path = table.unpack(elem)\n if not proved[cur_v] then\n proved[cur_v] = true\n --[[\n if cur_v == dst then\n return cur_cost\n end\n ]]\n path = {table.unpack(path), cur_v}\n for _, link in ipairs(adj_list[cur_v]) do\n local to, cost = table.unpack(link)\n if not proved[to] then\n -- compare costs\n local before = from1[to]\n local candidate = cur_cost + cost\n if not before or candidate < before then\n from1[to] = candidate\n prevs[to] = cur_v\n q:insertq({to, candidate, path})\n end\n end\n end\n end\n end\n return from1, prevs\nend\n\nlocal function make_path(prevs, src, dst)\n local path = {}\n path[#path+1] = dst\n local cur = dst\n while cur ~= src do\n local next = prevs[cur]\n path[#path+1] = next\n cur = next\n end\n -- reverse\n for i=1, #path//2 do\n path[i], path[#path-i+1] = path[#path-i+1], path[i]\n end\n return path\nend\n\n-- main\nlocal N, M = io.read(\"n\", \"n\")\n\nlocal edges = {}\nfor i=1,M do\n local a, b, cost = io.read(\"n\", \"n\", \"n\")\n edges[#edges+1] = {a, b, cost}\nend\n\nlocal adj_list = {}\nfor i=1,N do\n adj_list[i] = {}\nend\n\nlocal edge_check = {}\nfor s=1,N do\n edge_check[s] = {}\nend\n\nfor i=1,M do\n local a, b, cost = table.unpack(edges[i])\n local list = adj_list[a]\n list[#list+1] = {b, cost}\n local list2 = adj_list[b]\n list2[#list2+1] = {a, cost}\n local small = math.min(a, b)\n local big = math.max(a, b)\n edge_check[small][big] = 0\nend\n\n\nfor s=1,N do\n local c, prevs = find_shortest_path_all(adj_list, s)\n for dd=1,N do\n if dd ~= s then\n local ss = prevs[dd]\n local small = math.min(ss, dd)\n local big = math.max(ss, dd)\n edge_check[small][big] = edge_check[small][big] + 1\n end\n end\nend\n\nlocal ans = 0\nfor s=1,N do\n for d=s+1,N do\n local count = edge_check[s][d]\n if count then\n --print(s,d,count)\n if count == 0 then\n ans = ans + 1\n end\n end\n end\nend\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1558612259, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03837.html", "problem_id": "p03837", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03837/input.txt", "sample_output_relpath": "derived/input_output/data/p03837/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03837/Lua/s432699764.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s432699764", "user_id": "u162773977"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "-- heap\nlocal Heap = {}\nfunction Heap.new(upper_func)\n local self = setmetatable({}, {__index = Heap})\n self.a = {}\n self.upper_func = upper_func\n self.upper = function(k1, k2)\n assert(k1 < k2)\n if k1 == 0 then\n return false\n else\n return upper_func(self.a[k1], self.a[k2])\n end\n end\n self.lower = function(k1, k2)\n return not self.upper(k1, k2)\n end\n return self\nend\n\nfunction Heap:count()\n return #self.a\nend\n\nfunction Heap:_swap(k1, k2)\n local old_k1 = self.a[k1]\n self.a[k1] = self.a[k2]\n self.a[k2] = old_k1\nend\n\nfunction Heap:upheap(newk)\n local ku = newk // 2\n local k = newk\n while ku > 0 and self.lower(ku, k) do\n self:_swap(ku, k)\n k = k//2\n ku = ku//2\n end\nend\n\nfunction Heap:insertq(e)\n table.insert(self.a, e)\n self:upheap(#self.a)\nend\n\nfunction Heap:downheap(newk)\n local k = newk\n while k <= #self.a//2 do\n local kdl = k*2\n local kdr = kdl + 1\n local kd\n if kdr <= #self.a and self.lower(kdl, kdr) then\n kd = kdr\n else\n kd = kdl\n end\n if self.upper(k, kd) then\n break\n end\n self:_swap(k, kd)\n k = kd\n end\nend\n\nfunction Heap:top()\n assert(#self.a >= 1)\n return self.a[1]\nend\n\nfunction Heap:remove_top()\n assert(#self.a >= 1)\n local v = self.a[1]\n self:_swap(1, #self.a)\n table.remove(self.a)\n self:downheap(1)\n return v\nend\n\nfunction Heap:replace_top(e)\n assert(#self.a >= 1)\n local old_v = self.a[1]\n local swapped = false\n if self.upper_func(old_v, e) then\n self.a[1] = e\n self:downheap(1)\n swapped = true\n end\n return swapped, old_v\nend\n\n-- dijkstra's algorithm\nlocal function find_shortest_path_all(adj_list, src)\n local from1 = {}\n local prevs = {}\n local q = Heap.new(function (v1, v2)\n return v1[2] < v2[2]\n end)\n local proved = {}\n q:insertq({src, 0, {}})\n while q:count() > 0 do\n local elem = q:remove_top()\n local cur_v, cur_cost, path = table.unpack(elem)\n if not proved[cur_v] then\n proved[cur_v] = true\n --[[\n if cur_v == dst then\n return cur_cost\n end\n ]]\n path = {table.unpack(path), cur_v}\n for _, link in ipairs(adj_list[cur_v]) do\n local to, cost = table.unpack(link)\n if not proved[to] then\n -- compare costs\n local before = from1[to]\n local candidate = cur_cost + cost\n if not before or candidate < before then\n from1[to] = candidate\n prevs[to] = cur_v\n q:insertq({to, candidate, path})\n end\n end\n end\n end\n end\n return from1, prevs\nend\n\nlocal function make_path(prevs, src, dst)\n local path = {}\n path[#path+1] = dst\n local cur = dst\n while cur ~= src do\n local next = prevs[cur]\n path[#path+1] = next\n cur = next\n end\n -- reverse\n for i=1, #path//2 do\n path[i], path[#path-i+1] = path[#path-i+1], path[i]\n end\n return path\nend\n\n-- main\nlocal N, M = io.read(\"n\", \"n\")\n\nlocal edges = {}\nfor i=1,M do\n local a, b, cost = io.read(\"n\", \"n\", \"n\")\n edges[#edges+1] = {a, b, cost}\nend\n\nlocal adj_list = {}\nfor i=1,N do\n adj_list[i] = {}\nend\n\nlocal edge_check = {}\nfor s=1,N do\n edge_check[s] = {}\nend\n\nfor i=1,M do\n local a, b, cost = table.unpack(edges[i])\n local list = adj_list[a]\n list[#list+1] = {b, cost}\n local list2 = adj_list[b]\n list2[#list2+1] = {a, cost}\n local small = math.min(a, b)\n local big = math.max(a, b)\n edge_check[small][big] = 0\nend\n\n\nfor s=1,N do\n local c, prevs = find_shortest_path_all(adj_list, s)\n for dd=1,N do\n if dd ~= s then\n local ss = prevs[dd]\n local small = math.min(ss, dd)\n local big = math.max(ss, dd)\n edge_check[small][big] = edge_check[small][big] + 1\n end\n end\nend\n\nlocal ans = 0\nfor s=1,N do\n for d=s+1,N do\n local count = edge_check[s][d]\n if count then\n --print(s,d,count)\n if count == 0 then\n ans = ans + 1\n end\n end\n end\nend\nprint(ans)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given an undirected connected weighted graph with N vertices and M edges that contains neither self-loops nor double edges.\n\nThe i-th (1≤i≤M) edge connects vertex a_i and vertex b_i with a distance of c_i.\n\nHere, a self-loop is an edge where a_i = b_i (1≤i≤M), and double edges are two edges where (a_i,b_i)=(a_j,b_j) or (a_i,b_i)=(b_j,a_j) (1≤i=0 and y>=0 then\n print(math.abs(x-y))\nelseif x>=0 and 0>y then\n print(math.abs(x+y)+1)\nelseif 0>x and 0>y then\n print(math.abs(x-y)+2)\nend", "language": "Lua", "metadata": {"date": 1590341439, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03838.html", "problem_id": "p03838", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03838/input.txt", "sample_output_relpath": "derived/input_output/data/p03838/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03838/Lua/s629539038.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s629539038", "user_id": "u045238009"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "local x,y=io.read(\"*n\",\"*n\")\nif x>=0 and y>=0 then\n print(math.abs(x-y))\nelseif x>=0 and 0>y then\n print(math.abs(x+y)+1)\nelseif 0>x and 0>y then\n print(math.abs(x-y)+2)\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has a calculator. It has a display and two buttons.\n\nInitially, the display shows an integer x.\nSnuke wants to change this value into another integer y, by pressing the following two buttons some number of times in arbitrary order:\n\nButton A: When pressed, the value on the display is incremented by 1.\n\nButton B: When pressed, the sign of the value on the display is reversed.\n\nFind the minimum number of times Snuke needs to press the buttons to achieve his objective.\nIt can be shown that the objective is always achievable regardless of the values of the integers x and y.\n\nConstraints\n\nx and y are integers.\n\n|x|, |y| ≤ 10^9\n\nx and y are different.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx y\n\nOutput\n\nPrint the minimum number of times Snuke needs to press the buttons to achieve his objective.\n\nSample Input 1\n\n10 20\n\nSample Output 1\n\n10\n\nPress button A ten times.\n\nSample Input 2\n\n10 -10\n\nSample Output 2\n\n1\n\nPress button B once.\n\nSample Input 3\n\n-10 -20\n\nSample Output 3\n\n12\n\nPress the buttons as follows:\n\nPress button B once.\n\nPress button A ten times.\n\nPress button B once.", "sample_input": "10 20\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03838", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has a calculator. It has a display and two buttons.\n\nInitially, the display shows an integer x.\nSnuke wants to change this value into another integer y, by pressing the following two buttons some number of times in arbitrary order:\n\nButton A: When pressed, the value on the display is incremented by 1.\n\nButton B: When pressed, the sign of the value on the display is reversed.\n\nFind the minimum number of times Snuke needs to press the buttons to achieve his objective.\nIt can be shown that the objective is always achievable regardless of the values of the integers x and y.\n\nConstraints\n\nx and y are integers.\n\n|x|, |y| ≤ 10^9\n\nx and y are different.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx y\n\nOutput\n\nPrint the minimum number of times Snuke needs to press the buttons to achieve his objective.\n\nSample Input 1\n\n10 20\n\nSample Output 1\n\n10\n\nPress button A ten times.\n\nSample Input 2\n\n10 -10\n\nSample Output 2\n\n1\n\nPress button B once.\n\nSample Input 3\n\n-10 -20\n\nSample Output 3\n\n12\n\nPress the buttons as follows:\n\nPress button B once.\n\nPress button A ten times.\n\nPress button B once.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 182, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s523484194", "group_id": "codeNet:p03838", "input_text": "local x, y = io.read(\"*n\", \"*n\")\nif 0 <= x and 0 <= y then\n if x <= y then\n print(y - x)\n else\n print(2 + x - y)\n end\nelseif x < 0 and 0 <= y then\n print(1 + math.abs(x + y))\nelseif x < 0 and y < 0 then\n if x <= y then\n print(y - x)\n else\n print(2 + x - y)\n end\nelse\n print(1 + math.abs(x + y))\nend\n", "language": "Lua", "metadata": {"date": 1563283406, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03838.html", "problem_id": "p03838", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03838/input.txt", "sample_output_relpath": "derived/input_output/data/p03838/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03838/Lua/s523484194.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s523484194", "user_id": "u120582723"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "local x, y = io.read(\"*n\", \"*n\")\nif 0 <= x and 0 <= y then\n if x <= y then\n print(y - x)\n else\n print(2 + x - y)\n end\nelseif x < 0 and 0 <= y then\n print(1 + math.abs(x + y))\nelseif x < 0 and y < 0 then\n if x <= y then\n print(y - x)\n else\n print(2 + x - y)\n end\nelse\n print(1 + math.abs(x + y))\nend\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has a calculator. It has a display and two buttons.\n\nInitially, the display shows an integer x.\nSnuke wants to change this value into another integer y, by pressing the following two buttons some number of times in arbitrary order:\n\nButton A: When pressed, the value on the display is incremented by 1.\n\nButton B: When pressed, the sign of the value on the display is reversed.\n\nFind the minimum number of times Snuke needs to press the buttons to achieve his objective.\nIt can be shown that the objective is always achievable regardless of the values of the integers x and y.\n\nConstraints\n\nx and y are integers.\n\n|x|, |y| ≤ 10^9\n\nx and y are different.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx y\n\nOutput\n\nPrint the minimum number of times Snuke needs to press the buttons to achieve his objective.\n\nSample Input 1\n\n10 20\n\nSample Output 1\n\n10\n\nPress button A ten times.\n\nSample Input 2\n\n10 -10\n\nSample Output 2\n\n1\n\nPress button B once.\n\nSample Input 3\n\n-10 -20\n\nSample Output 3\n\n12\n\nPress the buttons as follows:\n\nPress button B once.\n\nPress button A ten times.\n\nPress button B once.", "sample_input": "10 20\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03838", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has a calculator. It has a display and two buttons.\n\nInitially, the display shows an integer x.\nSnuke wants to change this value into another integer y, by pressing the following two buttons some number of times in arbitrary order:\n\nButton A: When pressed, the value on the display is incremented by 1.\n\nButton B: When pressed, the sign of the value on the display is reversed.\n\nFind the minimum number of times Snuke needs to press the buttons to achieve his objective.\nIt can be shown that the objective is always achievable regardless of the values of the integers x and y.\n\nConstraints\n\nx and y are integers.\n\n|x|, |y| ≤ 10^9\n\nx and y are different.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx y\n\nOutput\n\nPrint the minimum number of times Snuke needs to press the buttons to achieve his objective.\n\nSample Input 1\n\n10 20\n\nSample Output 1\n\n10\n\nPress button A ten times.\n\nSample Input 2\n\n10 -10\n\nSample Output 2\n\n1\n\nPress button B once.\n\nSample Input 3\n\n-10 -20\n\nSample Output 3\n\n12\n\nPress the buttons as follows:\n\nPress button B once.\n\nPress button A ten times.\n\nPress button B once.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 632}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s239104831", "group_id": "codeNet:p03840", "input_text": "t = {}\nfor i = 1, 7 do\n t[i] = io.read(\"*n\")\nend\nr = t[2]\nr1 = 2 * (t[1] // 2 + t[4] // 2 + t[5] // 2)\nif 0 < t[1] and 0 < t[4] and 0 < t[5] then\n r2 = 3 + 2 * ((t[1] - 1) // 2 + (t[4] - 1) // 2 + (t[5] - 1) // 2)\n if r1 < r2 then r1 = r2 end\nend\nprint(r + r1)\n", "language": "Lua", "metadata": {"date": 1589243873, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03840.html", "problem_id": "p03840", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03840/input.txt", "sample_output_relpath": "derived/input_output/data/p03840/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03840/Lua/s239104831.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s239104831", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "t = {}\nfor i = 1, 7 do\n t[i] = io.read(\"*n\")\nend\nr = t[2]\nr1 = 2 * (t[1] // 2 + t[4] // 2 + t[5] // 2)\nif 0 < t[1] and 0 < t[4] and 0 < t[5] then\n r2 = 3 + 2 * ((t[1] - 1) // 2 + (t[4] - 1) // 2 + (t[5] - 1) // 2)\n if r1 < r2 then r1 = r2 end\nend\nprint(r + r1)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nA tetromino is a figure formed by joining four squares edge to edge.\nWe will refer to the following seven kinds of tetromino as I-, O-, T-, J-, L-, S- and Z-tetrominos, respectively:\n\nSnuke has many tetrominos. The number of I-, O-, T-, J-, L-, S- and Z-tetrominos in his possession are a_I, a_O, a_T, a_J, a_L, a_S and a_Z, respectively.\nSnuke will join K of his tetrominos to form a rectangle that is two squares tall and 2K squares wide.\nHere, the following rules must be followed:\n\nWhen placing each tetromino, rotation is allowed, but reflection is not.\n\nEach square in the rectangle must be covered by exactly one tetromino.\n\nNo part of each tetromino may be outside the rectangle.\n\nSnuke wants to form as large a rectangle as possible.\nFind the maximum possible value of K.\n\nConstraints\n\n0≤a_I,a_O,a_T,a_J,a_L,a_S,a_Z≤10^9\n\na_I+a_O+a_T+a_J+a_L+a_S+a_Z≥1\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na_I a_O a_T a_J a_L a_S a_Z\n\nOutput\n\nPrint the maximum possible value of K. If no rectangle can be formed, print 0.\n\nSample Input 1\n\n2 1 1 0 0 0 0\n\nSample Output 1\n\n3\n\nOne possible way to form the largest rectangle is shown in the following figure:\n\nSample Input 2\n\n0 0 10 0 0 0 0\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.", "sample_input": "2 1 1 0 0 0 0\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03840", "source_text": "Score : 600 points\n\nProblem Statement\n\nA tetromino is a figure formed by joining four squares edge to edge.\nWe will refer to the following seven kinds of tetromino as I-, O-, T-, J-, L-, S- and Z-tetrominos, respectively:\n\nSnuke has many tetrominos. The number of I-, O-, T-, J-, L-, S- and Z-tetrominos in his possession are a_I, a_O, a_T, a_J, a_L, a_S and a_Z, respectively.\nSnuke will join K of his tetrominos to form a rectangle that is two squares tall and 2K squares wide.\nHere, the following rules must be followed:\n\nWhen placing each tetromino, rotation is allowed, but reflection is not.\n\nEach square in the rectangle must be covered by exactly one tetromino.\n\nNo part of each tetromino may be outside the rectangle.\n\nSnuke wants to form as large a rectangle as possible.\nFind the maximum possible value of K.\n\nConstraints\n\n0≤a_I,a_O,a_T,a_J,a_L,a_S,a_Z≤10^9\n\na_I+a_O+a_T+a_J+a_L+a_S+a_Z≥1\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na_I a_O a_T a_J a_L a_S a_Z\n\nOutput\n\nPrint the maximum possible value of K. If no rectangle can be formed, print 0.\n\nSample Input 1\n\n2 1 1 0 0 0 0\n\nSample Output 1\n\n3\n\nOne possible way to form the largest rectangle is shown in the following figure:\n\nSample Input 2\n\n0 0 10 0 0 0 0\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s359361759", "group_id": "codeNet:p03844", "input_text": "load(\"a=\"..io.read())()print(a)", "language": "Lua", "metadata": {"date": 1586408605, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03844.html", "problem_id": "p03844", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03844/input.txt", "sample_output_relpath": "derived/input_output/data/p03844/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03844/Lua/s359361759.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s359361759", "user_id": "u726173718"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "load(\"a=\"..io.read())()print(a)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nJoisino wants to evaluate the formula \"A op B\".\nHere, A and B are integers, and the binary operator op is either + or -.\nYour task is to evaluate the formula instead of her.\n\nConstraints\n\n1≦A,B≦10^9\n\nop is either + or -.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA op B\n\nOutput\n\nEvaluate the formula and print the result.\n\nSample Input 1\n\n1 + 2\n\nSample Output 1\n\n3\n\nSince 1 + 2 = 3, the output should be 3.\n\nSample Input 2\n\n5 - 7\n\nSample Output 2\n\n-2", "sample_input": "1 + 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03844", "source_text": "Score : 100 points\n\nProblem Statement\n\nJoisino wants to evaluate the formula \"A op B\".\nHere, A and B are integers, and the binary operator op is either + or -.\nYour task is to evaluate the formula instead of her.\n\nConstraints\n\n1≦A,B≦10^9\n\nop is either + or -.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA op B\n\nOutput\n\nEvaluate the formula and print the result.\n\nSample Input 1\n\n1 + 2\n\nSample Output 1\n\n3\n\nSince 1 + 2 = 3, the output should be 3.\n\nSample Input 2\n\n5 - 7\n\nSample Output 2\n\n-2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 31, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s174611197", "group_id": "codeNet:p03844", "input_text": "s = io.read()\na, op, b = s:match(\"(%d+) (%+) (%d+)\")\nif a then\n print(tonumber(a) + tonumber(b))\nelse\n a, op, b = s:match(\"(%d+) (%-) (%d+)\")\n print(tonumber(a) - tonumber(b))\nend\n", "language": "Lua", "metadata": {"date": 1570248766, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03844.html", "problem_id": "p03844", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03844/input.txt", "sample_output_relpath": "derived/input_output/data/p03844/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03844/Lua/s174611197.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s174611197", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "s = io.read()\na, op, b = s:match(\"(%d+) (%+) (%d+)\")\nif a then\n print(tonumber(a) + tonumber(b))\nelse\n a, op, b = s:match(\"(%d+) (%-) (%d+)\")\n print(tonumber(a) - tonumber(b))\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nJoisino wants to evaluate the formula \"A op B\".\nHere, A and B are integers, and the binary operator op is either + or -.\nYour task is to evaluate the formula instead of her.\n\nConstraints\n\n1≦A,B≦10^9\n\nop is either + or -.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA op B\n\nOutput\n\nEvaluate the formula and print the result.\n\nSample Input 1\n\n1 + 2\n\nSample Output 1\n\n3\n\nSince 1 + 2 = 3, the output should be 3.\n\nSample Input 2\n\n5 - 7\n\nSample Output 2\n\n-2", "sample_input": "1 + 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03844", "source_text": "Score : 100 points\n\nProblem Statement\n\nJoisino wants to evaluate the formula \"A op B\".\nHere, A and B are integers, and the binary operator op is either + or -.\nYour task is to evaluate the formula instead of her.\n\nConstraints\n\n1≦A,B≦10^9\n\nop is either + or -.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA op B\n\nOutput\n\nEvaluate the formula and print the result.\n\nSample Input 1\n\n1 + 2\n\nSample Output 1\n\n3\n\nSince 1 + 2 = 3, the output should be 3.\n\nSample Input 2\n\n5 - 7\n\nSample Output 2\n\n-2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s146467807", "group_id": "codeNet:p03848", "input_text": "local n=io.read(\"*n\")\nlocal a_map={}\nfor i=(n%2==0 and 1 or 0),n,2 do\n a_map[i]=(i==0 and 1 or 2)\nend\n\nlocal a={}\nfor i=1,n do\n local input=io.read(\"*n\")\n a[input]=(a[input] or 0)+1\nend\n\nlocal counter=1\nfor k,v in pairs(a) do\n local checker=(a[k] and a_map[k] and a[k]==a_map[k])\n counter=(checker and counter*v%1000000007 or 0)\nend\nprint(counter)\n", "language": "Lua", "metadata": {"date": 1592193466, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s146467807.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s146467807", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local n=io.read(\"*n\")\nlocal a_map={}\nfor i=(n%2==0 and 1 or 0),n,2 do\n a_map[i]=(i==0 and 1 or 2)\nend\n\nlocal a={}\nfor i=1,n do\n local input=io.read(\"*n\")\n a[input]=(a[input] or 0)+1\nend\n\nlocal counter=1\nfor k,v in pairs(a) do\n local checker=(a[k] and a_map[k] and a[k]==a_map[k])\n counter=(checker and counter*v%1000000007 or 0)\nend\nprint(counter)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N people, conveniently numbered 1 through N.\nThey were standing in a row yesterday, but now they are unsure of the order in which they were standing.\nHowever, each person remembered the following fact: the absolute difference of the number of the people who were standing to the left of that person, and the number of the people who were standing to the right of that person.\nAccording to their reports, the difference above for person i is A_i.\n\nBased on these reports, find the number of the possible orders in which they were standing.\nSince it can be extremely large, print the answer modulo 10^9+7.\nNote that the reports may be incorrect and thus there may be no consistent order.\nIn such a case, print 0.\n\nConstraints\n\n1≦N≦10^5\n\n0≦A_i≦N-1\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of the possible orders in which they were standing, modulo 10^9+7.\n\nSample Input 1\n\n5\n2 4 4 0 2\n\nSample Output 1\n\n4\n\nThere are four possible orders, as follows:\n\n2,1,4,5,3\n\n2,5,4,1,3\n\n3,1,4,5,2\n\n3,5,4,1,2\n\nSample Input 2\n\n7\n6 4 0 2 4 0 2\n\nSample Output 2\n\n0\n\nAny order would be inconsistent with the reports, thus the answer is 0.\n\nSample Input 3\n\n8\n7 5 1 1 7 3 5 3\n\nSample Output 3\n\n16", "sample_input": "5\n2 4 4 0 2\n"}, "reference_outputs": ["4\n"], "source_document_id": "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 32, "memory_kb": 3256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s777918640", "group_id": "codeNet:p03848", "input_text": "local n=io.read(\"*n\")\nlocal a_map={}\nfor i=(n%2==0 and 1 or 0),n,2 do\n a_map[i]=(i==0 and 1 or 2)\nend\n\nlocal a={}\nfor i=1,n do\n local input=io.read(\"*n\")\n a[input]=(a[input] or 0)+1\nend\n\nif #a~=#a_map then\n print(0)\n return\nend\n\nlocal counter=1\nfor k,v in pairs(a_map) do\n counter=(a[k]==a_map[k] and counter*v%1000000007 or 0)\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1592190025, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s777918640.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s777918640", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local n=io.read(\"*n\")\nlocal a_map={}\nfor i=(n%2==0 and 1 or 0),n,2 do\n a_map[i]=(i==0 and 1 or 2)\nend\n\nlocal a={}\nfor i=1,n do\n local input=io.read(\"*n\")\n a[input]=(a[input] or 0)+1\nend\n\nif #a~=#a_map then\n print(0)\n return\nend\n\nlocal counter=1\nfor k,v in pairs(a_map) do\n counter=(a[k]==a_map[k] and counter*v%1000000007 or 0)\nend\nprint(counter)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 30, "memory_kb": 3256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s523108272", "group_id": "codeNet:p03852", "input_text": "c = io.read()\nif string.find(c , \"a\" or \"i\" or \"u\" or \"e\" or \"o\") == nil then\n\tprint(\"consonant\")\nelse\n\tprint(\"vowel\")\nend", "language": "Lua", "metadata": {"date": 1588580027, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s523108272.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s523108272", "user_id": "u540534068"}, "prompt_components": {"gold_output": "vowel\n", "input_to_evaluate": "c = io.read()\nif string.find(c , \"a\" or \"i\" or \"u\" or \"e\" or \"o\") == nil then\n\tprint(\"consonant\")\nelse\n\tprint(\"vowel\")\nend", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s063488445", "group_id": "codeNet:p03852", "input_text": "c = io.read()\nif(c == \"a\" or c == \"e\" or c == \"i\" or c == \"o\" or c == \"u\") then print(\"vowel\") else print(\"consonant\") end", "language": "Lua", "metadata": {"date": 1554902524, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s063488445.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s063488445", "user_id": "u120582723"}, "prompt_components": {"gold_output": "vowel\n", "input_to_evaluate": "c = io.read()\nif(c == \"a\" or c == \"e\" or c == \"i\" or c == \"o\" or c == \"u\") then print(\"vowel\") else print(\"consonant\") end", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s085595246", "group_id": "codeNet:p03853", "input_text": "h,w=io.read(\"*n\",\"*n\",\"*l\")\nc={}\nfor i=1,h do\n c[i]=io.read()\nend\nfor i=1,2*h do\n print(c[(i+1)//2])\nend", "language": "Lua", "metadata": {"date": 1587334951, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s085595246.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s085595246", "user_id": "u045238009"}, "prompt_components": {"gold_output": "*.\n*.\n.*\n.*\n", "input_to_evaluate": "h,w=io.read(\"*n\",\"*n\",\"*l\")\nc={}\nfor i=1,h do\n c[i]=io.read()\nend\nfor i=1,2*h do\n print(c[(i+1)//2])\nend", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Lua:s971033553", "group_id": "codeNet:p03853", "input_text": "h,w=io.read(\"*n\",\"*n\",\"*l\")\nc={}\nfor i=1,h do\n c[i]={}\n for j=1,w do\n c[i][j]=io.read()\n end\nend\nfor i=1,2*h do\n for j=1,w do\n print(c[(i+1)//2][j])\n end\nend", "language": "Lua", "metadata": {"date": 1587333518, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s971033553.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s971033553", "user_id": "u045238009"}, "prompt_components": {"gold_output": "*.\n*.\n.*\n.*\n", "input_to_evaluate": "h,w=io.read(\"*n\",\"*n\",\"*l\")\nc={}\nfor i=1,h do\n c[i]={}\n for j=1,w do\n c[i][j]=io.read()\n end\nend\nfor i=1,2*h do\n for j=1,w do\n print(c[(i+1)//2][j])\n end\nend", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 42, "memory_kb": 376}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s159126888", "group_id": "codeNet:p03855", "input_text": "local n, k, l = io.read(\"*n\", \"*n\", \"*n\")\n\nlocal function uf_initialize(n)\n local parent = {}\n for i = 1, n do parent[i] = i end\n return parent\nend\n\nlocal function uf_findroot(idx, parent)\n local idx_update = idx\n while parent[idx] ~= idx do\n idx = parent[idx]\n end\n while parent[idx_update] ~= idx do\n parent[idx_update], idx_update = idx, parent[idx_update]\n end\n return idx\nend\n\nlocal p1 = uf_initialize(n)\nfor i = 1, k do\n local p, q = io.read(\"*n\", \"*n\")\n local pr, qr = uf_findroot(p, p1), uf_findroot(q, p1)\n p1[qr], p1[q] = pr, pr\nend\n\nlocal p2 = uf_initialize(n)\nfor i = 1, l do\n local r, s = io.read(\"*n\", \"*n\")\n local rr, sr = uf_findroot(r, p2), uf_findroot(s, p2)\n p2[sr], p2[s] = rr, rr\nend\n\nlocal group = {}\nfor i = 1, n do\n local r1, r2 = uf_findroot(i, p1), uf_findroot(i, p2)\n if not group[r1] then group[r1] = {} end\n if not group[r1][r2] then\n group[r1][r2] = 1\n else\n group[r1][r2] = group[r1][r2] + 1\n end\nend\nfor i = 1, n do\n local r1, r2 = uf_findroot(i, p1), uf_findroot(i, p2)\n io.write(group[r1][r2])\n io.write(i == n and \"\\n\" or \" \")\nend\n", "language": "Lua", "metadata": {"date": 1589247988, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03855.html", "problem_id": "p03855", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03855/input.txt", "sample_output_relpath": "derived/input_output/data/p03855/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03855/Lua/s159126888.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s159126888", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1 2 2 1\n", "input_to_evaluate": "local n, k, l = io.read(\"*n\", \"*n\", \"*n\")\n\nlocal function uf_initialize(n)\n local parent = {}\n for i = 1, n do parent[i] = i end\n return parent\nend\n\nlocal function uf_findroot(idx, parent)\n local idx_update = idx\n while parent[idx] ~= idx do\n idx = parent[idx]\n end\n while parent[idx_update] ~= idx do\n parent[idx_update], idx_update = idx, parent[idx_update]\n end\n return idx\nend\n\nlocal p1 = uf_initialize(n)\nfor i = 1, k do\n local p, q = io.read(\"*n\", \"*n\")\n local pr, qr = uf_findroot(p, p1), uf_findroot(q, p1)\n p1[qr], p1[q] = pr, pr\nend\n\nlocal p2 = uf_initialize(n)\nfor i = 1, l do\n local r, s = io.read(\"*n\", \"*n\")\n local rr, sr = uf_findroot(r, p2), uf_findroot(s, p2)\n p2[sr], p2[s] = rr, rr\nend\n\nlocal group = {}\nfor i = 1, n do\n local r1, r2 = uf_findroot(i, p1), uf_findroot(i, p2)\n if not group[r1] then group[r1] = {} end\n if not group[r1][r2] then\n group[r1][r2] = 1\n else\n group[r1][r2] = group[r1][r2] + 1\n end\nend\nfor i = 1, n do\n local r1, r2 = uf_findroot(i, p1), uf_findroot(i, p2)\n io.write(group[r1][r2])\n io.write(i == n and \"\\n\" or \" \")\nend\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N cities. There are also K roads and L railways, extending between the cities.\nThe i-th road bidirectionally connects the p_i-th and q_i-th cities, and the i-th railway bidirectionally connects the r_i-th and s_i-th cities.\nNo two roads connect the same pair of cities. Similarly, no two railways connect the same pair of cities.\n\nWe will say city A and B are connected by roads if city B is reachable from city A by traversing some number of roads. Here, any city is considered to be connected to itself by roads.\nWe will also define connectivity by railways similarly.\n\nFor each city, find the number of the cities connected to that city by both roads and railways.\n\nConstraints\n\n2 ≦ N ≦ 2*10^5\n\n1 ≦ K, L≦ 10^5\n\n1 ≦ p_i, q_i, r_i, s_i ≦ N\n\np_i < q_i\n\nr_i < s_i\n\nWhen i ≠ j, (p_i, q_i) ≠ (p_j, q_j)\n\nWhen i ≠ j, (r_i, s_i) ≠ (r_j, s_j)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K L\np_1 q_1\n:\np_K q_K\nr_1 s_1\n:\nr_L s_L\n\nOutput\n\nPrint N integers. The i-th of them should represent the number of the cities connected to the i-th city by both roads and railways.\n\nSample Input 1\n\n4 3 1\n1 2\n2 3\n3 4\n2 3\n\nSample Output 1\n\n1 2 2 1\n\nAll the four cities are connected to each other by roads.\n\nBy railways, only the second and third cities are connected. Thus, the answers for the cities are 1, 2, 2 and 1, respectively.\n\nSample Input 2\n\n4 2 2\n1 2\n2 3\n1 4\n2 3\n\nSample Output 2\n\n1 2 2 1\n\nSample Input 3\n\n7 4 4\n1 2\n2 3\n2 5\n6 7\n3 5\n4 5\n3 4\n6 7\n\nSample Output 3\n\n1 1 2 1 2 2 2", "sample_input": "4 3 1\n1 2\n2 3\n3 4\n2 3\n"}, "reference_outputs": ["1 2 2 1\n"], "source_document_id": "p03855", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N cities. There are also K roads and L railways, extending between the cities.\nThe i-th road bidirectionally connects the p_i-th and q_i-th cities, and the i-th railway bidirectionally connects the r_i-th and s_i-th cities.\nNo two roads connect the same pair of cities. Similarly, no two railways connect the same pair of cities.\n\nWe will say city A and B are connected by roads if city B is reachable from city A by traversing some number of roads. Here, any city is considered to be connected to itself by roads.\nWe will also define connectivity by railways similarly.\n\nFor each city, find the number of the cities connected to that city by both roads and railways.\n\nConstraints\n\n2 ≦ N ≦ 2*10^5\n\n1 ≦ K, L≦ 10^5\n\n1 ≦ p_i, q_i, r_i, s_i ≦ N\n\np_i < q_i\n\nr_i < s_i\n\nWhen i ≠ j, (p_i, q_i) ≠ (p_j, q_j)\n\nWhen i ≠ j, (r_i, s_i) ≠ (r_j, s_j)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K L\np_1 q_1\n:\np_K q_K\nr_1 s_1\n:\nr_L s_L\n\nOutput\n\nPrint N integers. The i-th of them should represent the number of the cities connected to the i-th city by both roads and railways.\n\nSample Input 1\n\n4 3 1\n1 2\n2 3\n3 4\n2 3\n\nSample Output 1\n\n1 2 2 1\n\nAll the four cities are connected to each other by roads.\n\nBy railways, only the second and third cities are connected. Thus, the answers for the cities are 1, 2, 2 and 1, respectively.\n\nSample Input 2\n\n4 2 2\n1 2\n2 3\n1 4\n2 3\n\nSample Output 2\n\n1 2 2 1\n\nSample Input 3\n\n7 4 4\n1 2\n2 3\n2 5\n6 7\n3 5\n4 5\n3 4\n6 7\n\nSample Output 3\n\n1 1 2 1 2 2 2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1101, "cpu_time_ms": 494, "memory_kb": 33004}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s783584715", "group_id": "codeNet:p03860", "input_text": "print(\"A\"..io.read():match(\"%s(.).*%s\")..\"C\")", "language": "Lua", "metadata": {"date": 1551656894, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03860.html", "problem_id": "p03860", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03860/input.txt", "sample_output_relpath": "derived/input_output/data/p03860/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03860/Lua/s783584715.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s783584715", "user_id": "u837412668"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "print(\"A\"..io.read():match(\"%s(.).*%s\")..\"C\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke is going to open a contest named \"AtCoder s Contest\".\nHere, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.\n\nSnuke has decided to abbreviate the name of the contest as \"AxC\".\nHere, x is the uppercase English letter at the beginning of s.\n\nGiven the name of the contest, print the abbreviation of the name.\n\nConstraints\n\nThe length of s is between 1 and 100, inclusive.\n\nThe first character in s is an uppercase English letter.\n\nThe second and subsequent characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nAtCoder s Contest\n\nOutput\n\nPrint the abbreviation of the name of the contest.\n\nSample Input 1\n\nAtCoder Beginner Contest\n\nSample Output 1\n\nABC\n\nThe contest in which you are participating now.\n\nSample Input 2\n\nAtCoder Snuke Contest\n\nSample Output 2\n\nASC\n\nThis contest does not actually exist.\n\nSample Input 3\n\nAtCoder X Contest\n\nSample Output 3\n\nAXC", "sample_input": "AtCoder Beginner Contest\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03860", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke is going to open a contest named \"AtCoder s Contest\".\nHere, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.\n\nSnuke has decided to abbreviate the name of the contest as \"AxC\".\nHere, x is the uppercase English letter at the beginning of s.\n\nGiven the name of the contest, print the abbreviation of the name.\n\nConstraints\n\nThe length of s is between 1 and 100, inclusive.\n\nThe first character in s is an uppercase English letter.\n\nThe second and subsequent characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nAtCoder s Contest\n\nOutput\n\nPrint the abbreviation of the name of the contest.\n\nSample Input 1\n\nAtCoder Beginner Contest\n\nSample Output 1\n\nABC\n\nThe contest in which you are participating now.\n\nSample Input 2\n\nAtCoder Snuke Contest\n\nSample Output 2\n\nASC\n\nThis contest does not actually exist.\n\nSample Input 3\n\nAtCoder X Contest\n\nSample Output 3\n\nAXC", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 45, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s005087419", "group_id": "codeNet:p03861", "input_text": "a,b,x=io.read(\"n\",\"n\",\"n\") print(b//x-(a-1)//x)", "language": "Lua", "metadata": {"date": 1591145272, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03861.html", "problem_id": "p03861", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03861/input.txt", "sample_output_relpath": "derived/input_output/data/p03861/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03861/Lua/s005087419.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s005087419", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "a,b,x=io.read(\"n\",\"n\",\"n\") print(b//x-(a-1)//x)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given nonnegative integers a and b (a ≤ b), and a positive integer x.\nAmong the integers between a and b, inclusive, how many are divisible by x?\n\nConstraints\n\n0 ≤ a ≤ b ≤ 10^{18}\n\n1 ≤ x ≤ 10^{18}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the number of the integers between a and b, inclusive, that are divisible by x.\n\nSample Input 1\n\n4 8 2\n\nSample Output 1\n\n3\n\nThere are three integers between 4 and 8, inclusive, that are divisible by 2: 4, 6 and 8.\n\nSample Input 2\n\n0 5 1\n\nSample Output 2\n\n6\n\nThere are six integers between 0 and 5, inclusive, that are divisible by 1: 0, 1, 2, 3, 4 and 5.\n\nSample Input 3\n\n9 9 2\n\nSample Output 3\n\n0\n\nThere are no integer between 9 and 9, inclusive, that is divisible by 2.\n\nSample Input 4\n\n1 1000000000000000000 3\n\nSample Output 4\n\n333333333333333333\n\nWatch out for integer overflows.", "sample_input": "4 8 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03861", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given nonnegative integers a and b (a ≤ b), and a positive integer x.\nAmong the integers between a and b, inclusive, how many are divisible by x?\n\nConstraints\n\n0 ≤ a ≤ b ≤ 10^{18}\n\n1 ≤ x ≤ 10^{18}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the number of the integers between a and b, inclusive, that are divisible by x.\n\nSample Input 1\n\n4 8 2\n\nSample Output 1\n\n3\n\nThere are three integers between 4 and 8, inclusive, that are divisible by 2: 4, 6 and 8.\n\nSample Input 2\n\n0 5 1\n\nSample Output 2\n\n6\n\nThere are six integers between 0 and 5, inclusive, that are divisible by 1: 0, 1, 2, 3, 4 and 5.\n\nSample Input 3\n\n9 9 2\n\nSample Output 3\n\n0\n\nThere are no integer between 9 and 9, inclusive, that is divisible by 2.\n\nSample Input 4\n\n1 1000000000000000000 3\n\nSample Output 4\n\n333333333333333333\n\nWatch out for integer overflows.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 47, "cpu_time_ms": 6, "memory_kb": 756}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s357336104", "group_id": "codeNet:p03862", "input_text": "local n,x=io.read(\"n\",\"n\")\nlocal a={}\nfor i=1,n do\n a[i]=io.read(\"n\")\nend\n\nlocal counter=0\nfor i=1,n do\n local sum=a[i]+a[i+1]\n if sum>x then\n local diff=sum-x\n counter=counter+diff\n if diffx then\n local diff=sum-x\n counter=counter+diff\n if diff x_i within the rectangle.\n\nIf a_i = 3, he painted the region satisfying y < y_i within the rectangle.\n\nIf a_i = 4, he painted the region satisfying y > y_i within the rectangle.\n\nFind the area of the white region within the rectangle after he finished painting.\n\nConstraints\n\n1 ≦ W, H ≦ 100\n\n1 ≦ N ≦ 100\n\n0 ≦ x_i ≦ W (1 ≦ i ≦ N)\n\n0 ≦ y_i ≦ H (1 ≦ i ≦ N)\n\nW, H (21:32, added), x_i and y_i are integers.\n\na_i (1 ≦ i ≦ N) is 1, 2, 3 or 4.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nW H N\nx_1 y_1 a_1\nx_2 y_2 a_2\n:\nx_N y_N a_N\n\nOutput\n\nPrint the area of the white region within the rectangle after Snuke finished painting.\n\nSample Input 1\n\n5 4 2\n2 1 1\n3 3 4\n\nSample Output 1\n\n9\n\nThe figure below shows the rectangle before Snuke starts painting.\n\nFirst, as (x_1, y_1) = (2, 1) and a_1 = 1, he paints the region satisfying x < 2 within the rectangle:\n\nThen, as (x_2, y_2) = (3, 3) and a_2 = 4, he paints the region satisfying y > 3 within the rectangle:\n\nNow, the area of the white region within the rectangle is 9.\n\nSample Input 2\n\n5 4 3\n2 1 1\n3 3 4\n1 4 2\n\nSample Output 2\n\n0\n\nIt is possible that the whole region within the rectangle is painted black.\n\nSample Input 3\n\n10 10 5\n1 6 1\n4 1 3\n6 9 4\n9 4 2\n3 1 3\n\nSample Output 3\n\n64", "sample_input": "5 4 2\n2 1 1\n3 3 4\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03944", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere is a rectangle in the xy-plane, with its lower left corner at (0, 0) and its upper right corner at (W, H). Each of its sides is parallel to the x-axis or y-axis. Initially, the whole region within the rectangle is painted white.\n\nSnuke plotted N points into the rectangle. The coordinate of the i-th (1 ≦ i ≦ N) point was (x_i, y_i).\n\nThen, he created an integer sequence a of length N, and for each 1 ≦ i ≦ N, he painted some region within the rectangle black, as follows:\n\nIf a_i = 1, he painted the region satisfying x < x_i within the rectangle.\n\nIf a_i = 2, he painted the region satisfying x > x_i within the rectangle.\n\nIf a_i = 3, he painted the region satisfying y < y_i within the rectangle.\n\nIf a_i = 4, he painted the region satisfying y > y_i within the rectangle.\n\nFind the area of the white region within the rectangle after he finished painting.\n\nConstraints\n\n1 ≦ W, H ≦ 100\n\n1 ≦ N ≦ 100\n\n0 ≦ x_i ≦ W (1 ≦ i ≦ N)\n\n0 ≦ y_i ≦ H (1 ≦ i ≦ N)\n\nW, H (21:32, added), x_i and y_i are integers.\n\na_i (1 ≦ i ≦ N) is 1, 2, 3 or 4.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nW H N\nx_1 y_1 a_1\nx_2 y_2 a_2\n:\nx_N y_N a_N\n\nOutput\n\nPrint the area of the white region within the rectangle after Snuke finished painting.\n\nSample Input 1\n\n5 4 2\n2 1 1\n3 3 4\n\nSample Output 1\n\n9\n\nThe figure below shows the rectangle before Snuke starts painting.\n\nFirst, as (x_1, y_1) = (2, 1) and a_1 = 1, he paints the region satisfying x < 2 within the rectangle:\n\nThen, as (x_2, y_2) = (3, 3) and a_2 = 4, he paints the region satisfying y > 3 within the rectangle:\n\nNow, the area of the white region within the rectangle is 9.\n\nSample Input 2\n\n5 4 3\n2 1 1\n3 3 4\n1 4 2\n\nSample Output 2\n\n0\n\nIt is possible that the whole region within the rectangle is painted black.\n\nSample Input 3\n\n10 10 5\n1 6 1\n4 1 3\n6 9 4\n9 4 2\n3 1 3\n\nSample Output 3\n\n64", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 25, "memory_kb": 1136}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s647921383", "group_id": "codeNet:p03951", "input_text": "local n=io.read(\"*n\",\"*l\")\nlocal s=io.read()\nlocal t=io.read()\n\nlocal common=0\nfor i=1,n do\n if s:sub(#s-i+1,#s)==t:sub(1,i) then\n common=math.max(common,#t:sub(1,i))\n end\nend\nprint(n+n-common)", "language": "Lua", "metadata": {"date": 1589253249, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03951.html", "problem_id": "p03951", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03951/input.txt", "sample_output_relpath": "derived/input_output/data/p03951/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03951/Lua/s647921383.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s647921383", "user_id": "u045238009"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local n=io.read(\"*n\",\"*l\")\nlocal s=io.read()\nlocal t=io.read()\n\nlocal common=0\nfor i=1,n do\n if s:sub(#s-i+1,#s)==t:sub(1,i) then\n common=math.max(common,#t:sub(1,i))\n end\nend\nprint(n+n-common)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke is interested in strings that satisfy the following conditions:\n\nThe length of the string is at least N.\n\nThe first N characters equal to the string s.\n\nThe last N characters equal to the string t.\n\nFind the length of the shortest string that satisfies the conditions.\n\nConstraints\n\n1≤N≤100\n\nThe lengths of s and t are both N.\n\ns and t consist of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\ns\nt\n\nOutput\n\nPrint the length of the shortest string that satisfies the conditions.\n\nSample Input 1\n\n3\nabc\ncde\n\nSample Output 1\n\n5\n\nThe shortest string is abcde.\n\nSample Input 2\n\n1\na\nz\n\nSample Output 2\n\n2\n\nThe shortest string is az.\n\nSample Input 3\n\n4\nexpr\nexpr\n\nSample Output 3\n\n4\n\nThe shortest string is expr.", "sample_input": "3\nabc\ncde\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03951", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke is interested in strings that satisfy the following conditions:\n\nThe length of the string is at least N.\n\nThe first N characters equal to the string s.\n\nThe last N characters equal to the string t.\n\nFind the length of the shortest string that satisfies the conditions.\n\nConstraints\n\n1≤N≤100\n\nThe lengths of s and t are both N.\n\ns and t consist of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\ns\nt\n\nOutput\n\nPrint the length of the shortest string that satisfies the conditions.\n\nSample Input 1\n\n3\nabc\ncde\n\nSample Output 1\n\n5\n\nThe shortest string is abcde.\n\nSample Input 2\n\n1\na\nz\n\nSample Output 2\n\n2\n\nThe shortest string is az.\n\nSample Input 3\n\n4\nexpr\nexpr\n\nSample Output 3\n\n4\n\nThe shortest string is expr.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 508}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s017545526", "group_id": "codeNet:p03952", "input_text": "local n, x = io.read(\"*n\", \"*n\")\nif x == 1 or x == 2 * n - 1 then\n print(\"No\")\nelseif n == 2 then\n print(\"Yes\\n1\\n2\\n3\")\nelse\n print(\"Yes\")\n if x == 2 then\n for i = 1, n - 3 do\n print(i + 4)\n end\n print(\"4\\n1\\n2\\n3\")\n for i = n + 2, 2 * n - 1 do\n print(i)\n end\n else\n for i = 1, n - 2 do\n if i <= x - 3 then\n print(i)\n else\n print(i + 4)\n end\n end\n print(x - 1 .. \"\\n\" .. x .. \"\\n\" .. x + 1 .. \"\\n\" .. x - 2)\n for i = n - 1, 2 * n - 5 do\n if i <= x - 3 then\n print(i)\n else\n print(i + 4)\n end\n end\n end\nend\n", "language": "Lua", "metadata": {"date": 1564359908, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s017545526.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s017545526", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n1\n6\n3\n7\n4\n5\n2\n", "input_to_evaluate": "local n, x = io.read(\"*n\", \"*n\")\nif x == 1 or x == 2 * n - 1 then\n print(\"No\")\nelseif n == 2 then\n print(\"Yes\\n1\\n2\\n3\")\nelse\n print(\"Yes\")\n if x == 2 then\n for i = 1, n - 3 do\n print(i + 4)\n end\n print(\"4\\n1\\n2\\n3\")\n for i = n + 2, 2 * n - 1 do\n print(i)\n end\n else\n for i = 1, n - 2 do\n if i <= x - 3 then\n print(i)\n else\n print(i + 4)\n end\n end\n print(x - 1 .. \"\\n\" .. x .. \"\\n\" .. x + 1 .. \"\\n\" .. x - 2)\n for i = n - 1, 2 * n - 5 do\n if i <= x - 3 then\n print(i)\n else\n print(i + 4)\n end\n end\n end\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 515, "memory_kb": 1784}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s039586033", "group_id": "codeNet:p03958", "input_text": "local mma = math.max\nlocal mfl, mce, mmi = math.floor, math.ceil, math.min\n\nlocal AvlTree = {}\nAvlTree.makenode = function(self, val, parent)\n local i = self.box[#self.box]\n if not i then i = #self.v + 1\n else table.remove(self.box)\n end\n self.v[i], self.p[i] = val, parent\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 1, 1\n return i\nend\nAvlTree.create = function(self, lessthan, n)\n self.lessthan = lessthan\n self.root = 1\n self.box = {}\n for i = n + 1, 2, -1 do table.insert(self.box, i) end\n -- value, leftCount, rightCount, left, right, parent\n self.v, self.lc, self.rc, self.l, self.r, self.p = {}, {}, {}, {}, {}, {}\n for i = 1, n + 1 do\n self.v[i], self.p[i] = 0, 1\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 1, 1\n end\nend\n\nAvlTree.recalc = function(self, i)\n local kl, kr = self.l[i], self.r[i]\n if 1 < kl then self.lc[i] = 1 + mma(self.lc[kl], self.rc[kl])\n else self.lc[i] = 0\n end\n if 1 < kr then self.rc[i] = 1 + mma(self.lc[kr], self.rc[kr])\n else self.rc[i] = 0\n end\nend\nAvlTree.recalcAll = function(self, i)\n while 1 < i do\n self:recalc(i)\n i = self.p[i]\n end\nend\n\nAvlTree.rotR = function(self, parent)\n local granp, child = self.p[parent], self.l[parent]\n self.r[child], self.l[parent] = parent, self.r[child]\n self.p[child], self.p[parent] = granp, child\n self.p[self.l[parent]] = parent\n if 1 < granp then\n if self.l[granp] == parent then\n self.l[granp] = child\n else\n self.r[granp] = child\n end\n else\n self.root = child\n end\nend\n\nAvlTree.rotL = function(self, parent)\n local granp, child = self.p[parent], self.r[parent]\n self.l[child], self.r[parent] = parent, self.l[child]\n self.p[child], self.p[parent] = granp, child\n self.p[self.r[parent]] = parent\n if 1 < granp then\n if self.r[granp] == parent then\n self.r[granp] = child\n else\n self.l[granp] = child\n end\n else\n self.root = child\n end\nend\n\nAvlTree.rotLR = function(self, lparent, rparent)\n local sp, sl, sr = self.p, self.l, self.r\n local granp, d = sp[rparent], sr[lparent]\n sp[lparent], sr[lparent] = d, sl[d]\n sp[rparent], sl[rparent] = d, sr[d]\n sp[sl[d]], sp[sr[d]] = lparent, rparent\n sp[d], sl[d], sr[d] = granp, lparent, rparent\n if 1 < granp then\n if sr[granp] == rparent then sr[granp] = d\n else sl[granp] = d\n end\n else self.root = d\n end\nend\n\nAvlTree.rotRL = function(self, rparent, lparent)\n local sp, sl, sr = self.p, self.l, self.r\n local granp, d = sp[lparent], sl[rparent]\n sp[rparent], sl[rparent] = d, sr[d]\n sp[lparent], sr[lparent] = d, sl[d]\n sp[sr[d]], sp[sl[d]] = rparent, lparent\n sp[d], sr[d], sl[d] = granp, rparent, lparent\n if 1 < granp then\n if sl[granp] == lparent then sl[granp] = d\n else sr[granp] = d\n end\n else self.root = d\n end\nend\n\nAvlTree.empty = function(self) return self.root <= 1 end\n\nAvlTree.push = function(self, val)\n if self.root <= 1 then self.root = self:makenode(val, 1) return end\n local pos = self.root\n while true do\n if self.lessthan(val, self.v[pos]) then\n if 1 < self.l[pos] then\n pos = self.l[pos]\n else\n self.l[pos] = self:makenode(val, pos)\n pos = self.l[pos]\n break\n end\n else\n if 1 < self.r[pos] then\n pos = self.r[pos]\n else\n self.r[pos] = self:makenode(val, pos)\n pos = self.r[pos]\n break\n end\n end\n end\n while 1 < pos do\n local child, parent = pos, self.p[pos]\n if parent <= 1 then\n break\n end\n self:recalc(parent)\n local lcp_m_rcp = self.lc[parent] - self.rc[parent]\n if lcp_m_rcp % 2 ~= 0 then -- 1 or -1\n pos = parent\n elseif lcp_m_rcp == 2 then\n if self.lc[child] - 1 == self.rc[child] then\n self:rotR(parent)\n self:recalcAll(parent)\n else\n self:rotLR(child, parent)\n self:recalc(child)\n self:recalcAll(parent)\n end\n break\n elseif lcp_m_rcp == -2 then\n if self.rc[child] - 1 == self.lc[child] then\n self:rotL(parent)\n self:recalcAll(parent)\n else\n self:rotRL(child, parent)\n self:recalc(child)\n self:recalcAll(parent)\n end\n break\n else\n break\n end\n end\nend\n\nAvlTree.rmsub = function(self, node)\n while 1 < node do\n self:recalc(node)\n if self.lc[node] == self.rc[node] then\n node = self.p[node]\n elseif self.lc[node] + 1 == self.rc[node] then\n self:recalcAll(self.p[node])\n break\n else\n if self.lc[self.r[node]] == self.rc[self.r[node]] then\n self:rotL(node)\n self:recalcAll(node)\n break\n elseif self.lc[self.r[node]] + 1 == self.rc[self.r[node]] then\n local nr = self.r[node]\n self:rotL(node)\n self:recalc(node)\n node = nr\n else\n local nr = self.r[node]\n local nrl = self.l[nr]\n self:rotRL(nr, node)\n self:recalc(nr)\n self:recalc(node)\n node = nrl\n end\n end\n end\nend\n\nAvlTree.pop = function(self)\n local node = self.root\n while 1 < self.l[node] do\n node = self.l[node]\n end\n local v = self.v[node]\n local kp = self.p[node]\n self.p[self.r[node]] = kp\n if 1 < kp then\n self.l[kp] = self.r[node]\n self:rmsub(kp)\n else\n self.root = self.r[node]\n end\n table.insert(self.box, node)\n return v\nend\n\nAvlTree.new = function(lessthan, n)\n local obj = {}\n setmetatable(obj, {__index = AvlTree})\n obj:create(lessthan, n)\n return obj\nend\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal a = {}\nfor i = 1, m do\n a[i] = io.read(\"*n\")\nend\n\nlocal function lt(p, q)\n return a[p] > a[q]\nend\nlocal avl = AvlTree.new(lt, m)\nfor i = 1, m do avl:push(i) end\nwhile true do\n local top = avl:pop()\n if avl:empty() then\n print(a[top] - 1)\n break\n else\n local nxt = avl:pop()\n a[top] = a[top] - 1\n a[nxt] = a[nxt] - 1\n if 0 < a[nxt] then\n avl:push(nxt)\n avl:push(top)\n elseif 0 < a[top] then\n avl:push(top)\n end\n if avl:empty() then print(0) break end\n end\nend\n", "language": "Lua", "metadata": {"date": 1600811180, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p03958.html", "problem_id": "p03958", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03958/input.txt", "sample_output_relpath": "derived/input_output/data/p03958/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03958/Lua/s039586033.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s039586033", "user_id": "u120582723"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "local mma = math.max\nlocal mfl, mce, mmi = math.floor, math.ceil, math.min\n\nlocal AvlTree = {}\nAvlTree.makenode = function(self, val, parent)\n local i = self.box[#self.box]\n if not i then i = #self.v + 1\n else table.remove(self.box)\n end\n self.v[i], self.p[i] = val, parent\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 1, 1\n return i\nend\nAvlTree.create = function(self, lessthan, n)\n self.lessthan = lessthan\n self.root = 1\n self.box = {}\n for i = n + 1, 2, -1 do table.insert(self.box, i) end\n -- value, leftCount, rightCount, left, right, parent\n self.v, self.lc, self.rc, self.l, self.r, self.p = {}, {}, {}, {}, {}, {}\n for i = 1, n + 1 do\n self.v[i], self.p[i] = 0, 1\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 1, 1\n end\nend\n\nAvlTree.recalc = function(self, i)\n local kl, kr = self.l[i], self.r[i]\n if 1 < kl then self.lc[i] = 1 + mma(self.lc[kl], self.rc[kl])\n else self.lc[i] = 0\n end\n if 1 < kr then self.rc[i] = 1 + mma(self.lc[kr], self.rc[kr])\n else self.rc[i] = 0\n end\nend\nAvlTree.recalcAll = function(self, i)\n while 1 < i do\n self:recalc(i)\n i = self.p[i]\n end\nend\n\nAvlTree.rotR = function(self, parent)\n local granp, child = self.p[parent], self.l[parent]\n self.r[child], self.l[parent] = parent, self.r[child]\n self.p[child], self.p[parent] = granp, child\n self.p[self.l[parent]] = parent\n if 1 < granp then\n if self.l[granp] == parent then\n self.l[granp] = child\n else\n self.r[granp] = child\n end\n else\n self.root = child\n end\nend\n\nAvlTree.rotL = function(self, parent)\n local granp, child = self.p[parent], self.r[parent]\n self.l[child], self.r[parent] = parent, self.l[child]\n self.p[child], self.p[parent] = granp, child\n self.p[self.r[parent]] = parent\n if 1 < granp then\n if self.r[granp] == parent then\n self.r[granp] = child\n else\n self.l[granp] = child\n end\n else\n self.root = child\n end\nend\n\nAvlTree.rotLR = function(self, lparent, rparent)\n local sp, sl, sr = self.p, self.l, self.r\n local granp, d = sp[rparent], sr[lparent]\n sp[lparent], sr[lparent] = d, sl[d]\n sp[rparent], sl[rparent] = d, sr[d]\n sp[sl[d]], sp[sr[d]] = lparent, rparent\n sp[d], sl[d], sr[d] = granp, lparent, rparent\n if 1 < granp then\n if sr[granp] == rparent then sr[granp] = d\n else sl[granp] = d\n end\n else self.root = d\n end\nend\n\nAvlTree.rotRL = function(self, rparent, lparent)\n local sp, sl, sr = self.p, self.l, self.r\n local granp, d = sp[lparent], sl[rparent]\n sp[rparent], sl[rparent] = d, sr[d]\n sp[lparent], sr[lparent] = d, sl[d]\n sp[sr[d]], sp[sl[d]] = rparent, lparent\n sp[d], sr[d], sl[d] = granp, rparent, lparent\n if 1 < granp then\n if sl[granp] == lparent then sl[granp] = d\n else sr[granp] = d\n end\n else self.root = d\n end\nend\n\nAvlTree.empty = function(self) return self.root <= 1 end\n\nAvlTree.push = function(self, val)\n if self.root <= 1 then self.root = self:makenode(val, 1) return end\n local pos = self.root\n while true do\n if self.lessthan(val, self.v[pos]) then\n if 1 < self.l[pos] then\n pos = self.l[pos]\n else\n self.l[pos] = self:makenode(val, pos)\n pos = self.l[pos]\n break\n end\n else\n if 1 < self.r[pos] then\n pos = self.r[pos]\n else\n self.r[pos] = self:makenode(val, pos)\n pos = self.r[pos]\n break\n end\n end\n end\n while 1 < pos do\n local child, parent = pos, self.p[pos]\n if parent <= 1 then\n break\n end\n self:recalc(parent)\n local lcp_m_rcp = self.lc[parent] - self.rc[parent]\n if lcp_m_rcp % 2 ~= 0 then -- 1 or -1\n pos = parent\n elseif lcp_m_rcp == 2 then\n if self.lc[child] - 1 == self.rc[child] then\n self:rotR(parent)\n self:recalcAll(parent)\n else\n self:rotLR(child, parent)\n self:recalc(child)\n self:recalcAll(parent)\n end\n break\n elseif lcp_m_rcp == -2 then\n if self.rc[child] - 1 == self.lc[child] then\n self:rotL(parent)\n self:recalcAll(parent)\n else\n self:rotRL(child, parent)\n self:recalc(child)\n self:recalcAll(parent)\n end\n break\n else\n break\n end\n end\nend\n\nAvlTree.rmsub = function(self, node)\n while 1 < node do\n self:recalc(node)\n if self.lc[node] == self.rc[node] then\n node = self.p[node]\n elseif self.lc[node] + 1 == self.rc[node] then\n self:recalcAll(self.p[node])\n break\n else\n if self.lc[self.r[node]] == self.rc[self.r[node]] then\n self:rotL(node)\n self:recalcAll(node)\n break\n elseif self.lc[self.r[node]] + 1 == self.rc[self.r[node]] then\n local nr = self.r[node]\n self:rotL(node)\n self:recalc(node)\n node = nr\n else\n local nr = self.r[node]\n local nrl = self.l[nr]\n self:rotRL(nr, node)\n self:recalc(nr)\n self:recalc(node)\n node = nrl\n end\n end\n end\nend\n\nAvlTree.pop = function(self)\n local node = self.root\n while 1 < self.l[node] do\n node = self.l[node]\n end\n local v = self.v[node]\n local kp = self.p[node]\n self.p[self.r[node]] = kp\n if 1 < kp then\n self.l[kp] = self.r[node]\n self:rmsub(kp)\n else\n self.root = self.r[node]\n end\n table.insert(self.box, node)\n return v\nend\n\nAvlTree.new = function(lessthan, n)\n local obj = {}\n setmetatable(obj, {__index = AvlTree})\n obj:create(lessthan, n)\n return obj\nend\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal a = {}\nfor i = 1, m do\n a[i] = io.read(\"*n\")\nend\n\nlocal function lt(p, q)\n return a[p] > a[q]\nend\nlocal avl = AvlTree.new(lt, m)\nfor i = 1, m do avl:push(i) end\nwhile true do\n local top = avl:pop()\n if avl:empty() then\n print(a[top] - 1)\n break\n else\n local nxt = avl:pop()\n a[top] = a[top] - 1\n a[nxt] = a[nxt] - 1\n if 0 < a[nxt] then\n avl:push(nxt)\n avl:push(top)\n elseif 0 < a[top] then\n avl:push(top)\n end\n if avl:empty() then print(0) break end\n end\nend\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are K pieces of cakes.\nMr. Takahashi would like to eat one cake per day, taking K days to eat them all.\n\nThere are T types of cake, and the number of the cakes of type i (1 ≤ i ≤ T) is a_i.\n\nEating the same type of cake two days in a row would be no fun,\nso Mr. Takahashi would like to decide the order for eating cakes that minimizes the number of days on which he has to eat the same type of cake as the day before.\n\nCompute the minimum number of days on which the same type of cake as the previous day will be eaten.\n\nConstraints\n\n1 ≤ K ≤ 10000\n\n1 ≤ T ≤ 100\n\n1 ≤ a_i ≤ 100\n\na_1 + a_2 + ... + a_T = K\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK T\na_1 a_2 ... a_T\n\nOutput\n\nPrint the minimum number of days on which the same type of cake as the previous day will be eaten.\n\nSample Input 1\n\n7 3\n3 2 2\n\nSample Output 1\n\n0\n\nFor example, if Mr. Takahashi eats cakes in the order of 2, 1, 2, 3, 1, 3, 1, he can avoid eating the same type of cake as the previous day.\n\nSample Input 2\n\n6 3\n1 4 1\n\nSample Output 2\n\n1\n\nThere are 6 cakes.\nFor example, if Mr. Takahashi eats cakes in the order of 2, 3, 2, 2, 1, 2, he has to eat the same type of cake (i.e., type 2) as the previous day only on the fourth day.\nSince this is the minimum number, the answer is 1.\n\nSample Input 3\n\n100 1\n100\n\nSample Output 3\n\n99\n\nSince Mr. Takahashi has only one type of cake, he has no choice but to eat the same type of cake as the previous day from the second day and after.", "sample_input": "7 3\n3 2 2\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03958", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are K pieces of cakes.\nMr. Takahashi would like to eat one cake per day, taking K days to eat them all.\n\nThere are T types of cake, and the number of the cakes of type i (1 ≤ i ≤ T) is a_i.\n\nEating the same type of cake two days in a row would be no fun,\nso Mr. Takahashi would like to decide the order for eating cakes that minimizes the number of days on which he has to eat the same type of cake as the day before.\n\nCompute the minimum number of days on which the same type of cake as the previous day will be eaten.\n\nConstraints\n\n1 ≤ K ≤ 10000\n\n1 �� T ≤ 100\n\n1 ≤ a_i ≤ 100\n\na_1 + a_2 + ... + a_T = K\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK T\na_1 a_2 ... a_T\n\nOutput\n\nPrint the minimum number of days on which the same type of cake as the previous day will be eaten.\n\nSample Input 1\n\n7 3\n3 2 2\n\nSample Output 1\n\n0\n\nFor example, if Mr. Takahashi eats cakes in the order of 2, 1, 2, 3, 1, 3, 1, he can avoid eating the same type of cake as the previous day.\n\nSample Input 2\n\n6 3\n1 4 1\n\nSample Output 2\n\n1\n\nThere are 6 cakes.\nFor example, if Mr. Takahashi eats cakes in the order of 2, 3, 2, 2, 1, 2, he has to eat the same type of cake (i.e., type 2) as the previous day only on the fourth day.\nSince this is the minimum number, the answer is 1.\n\nSample Input 3\n\n100 1\n100\n\nSample Output 3\n\n99\n\nSince Mr. Takahashi has only one type of cake, he has no choice but to eat the same type of cake as the previous day from the second day and after.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5993, "cpu_time_ms": 17, "memory_kb": 2724}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s391974890", "group_id": "codeNet:p03958", "input_text": "local k, n = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n local tmp = {}\n tmp.cnt = io.read(\"*n\")\n tmp.idx = i\n t[i] = tmp\nend\ntable.sort(t, function(a, b) return a.cnt < b.cnt end)\nlocal vanish = 0\nlocal lastate = 0\nwhile vanish < n - 1 do\n local tgt = n\n if lastate == t[n].idx then\n tgt = n - 1\n end\n t[tgt].cnt = t[tgt].cnt - 1\n if t[tgt].cnt == 0 then vanish = vanish + 1 end\n table.sort(t, function(a, b) return a.cnt < b.cnt end)\n lastate = t[tgt].idx\nend\nprint(t[n].cnt - 1)\n", "language": "Lua", "metadata": {"date": 1563849341, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03958.html", "problem_id": "p03958", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03958/input.txt", "sample_output_relpath": "derived/input_output/data/p03958/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03958/Lua/s391974890.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s391974890", "user_id": "u120582723"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "local k, n = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n local tmp = {}\n tmp.cnt = io.read(\"*n\")\n tmp.idx = i\n t[i] = tmp\nend\ntable.sort(t, function(a, b) return a.cnt < b.cnt end)\nlocal vanish = 0\nlocal lastate = 0\nwhile vanish < n - 1 do\n local tgt = n\n if lastate == t[n].idx then\n tgt = n - 1\n end\n t[tgt].cnt = t[tgt].cnt - 1\n if t[tgt].cnt == 0 then vanish = vanish + 1 end\n table.sort(t, function(a, b) return a.cnt < b.cnt end)\n lastate = t[tgt].idx\nend\nprint(t[n].cnt - 1)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are K pieces of cakes.\nMr. Takahashi would like to eat one cake per day, taking K days to eat them all.\n\nThere are T types of cake, and the number of the cakes of type i (1 ≤ i ≤ T) is a_i.\n\nEating the same type of cake two days in a row would be no fun,\nso Mr. Takahashi would like to decide the order for eating cakes that minimizes the number of days on which he has to eat the same type of cake as the day before.\n\nCompute the minimum number of days on which the same type of cake as the previous day will be eaten.\n\nConstraints\n\n1 ≤ K ≤ 10000\n\n1 ≤ T ≤ 100\n\n1 ≤ a_i ≤ 100\n\na_1 + a_2 + ... + a_T = K\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK T\na_1 a_2 ... a_T\n\nOutput\n\nPrint the minimum number of days on which the same type of cake as the previous day will be eaten.\n\nSample Input 1\n\n7 3\n3 2 2\n\nSample Output 1\n\n0\n\nFor example, if Mr. Takahashi eats cakes in the order of 2, 1, 2, 3, 1, 3, 1, he can avoid eating the same type of cake as the previous day.\n\nSample Input 2\n\n6 3\n1 4 1\n\nSample Output 2\n\n1\n\nThere are 6 cakes.\nFor example, if Mr. Takahashi eats cakes in the order of 2, 3, 2, 2, 1, 2, he has to eat the same type of cake (i.e., type 2) as the previous day only on the fourth day.\nSince this is the minimum number, the answer is 1.\n\nSample Input 3\n\n100 1\n100\n\nSample Output 3\n\n99\n\nSince Mr. Takahashi has only one type of cake, he has no choice but to eat the same type of cake as the previous day from the second day and after.", "sample_input": "7 3\n3 2 2\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03958", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are K pieces of cakes.\nMr. Takahashi would like to eat one cake per day, taking K days to eat them all.\n\nThere are T types of cake, and the number of the cakes of type i (1 ≤ i ≤ T) is a_i.\n\nEating the same type of cake two days in a row would be no fun,\nso Mr. Takahashi would like to decide the order for eating cakes that minimizes the number of days on which he has to eat the same type of cake as the day before.\n\nCompute the minimum number of days on which the same type of cake as the previous day will be eaten.\n\nConstraints\n\n1 ≤ K ≤ 10000\n\n1 ≤ T ≤ 100\n\n1 ≤ a_i ≤ 100\n\na_1 + a_2 + ... + a_T = K\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK T\na_1 a_2 ... a_T\n\nOutput\n\nPrint the minimum number of days on which the same type of cake as the previous day will be eaten.\n\nSample Input 1\n\n7 3\n3 2 2\n\nSample Output 1\n\n0\n\nFor example, if Mr. Takahashi eats cakes in the order of 2, 1, 2, 3, 1, 3, 1, he can avoid eating the same type of cake as the previous day.\n\nSample Input 2\n\n6 3\n1 4 1\n\nSample Output 2\n\n1\n\nThere are 6 cakes.\nFor example, if Mr. Takahashi eats cakes in the order of 2, 3, 2, 2, 1, 2, he has to eat the same type of cake (i.e., type 2) as the previous day only on the fourth day.\nSince this is the minimum number, the answer is 1.\n\nSample Input 3\n\n100 1\n100\n\nSample Output 3\n\n99\n\nSince Mr. Takahashi has only one type of cake, he has no choice but to eat the same type of cake as the previous day from the second day and after.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 346, "memory_kb": 384}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s086184058", "group_id": "codeNet:p03962", "input_text": "a, b, c = io.read(\"*n\", \"*n\", \"*n\")\nif a ~= b and b ~= c and c ~= a then\n\tprint(3)\nelseif a == b and b == c and c == a then\n\tprint(1)\nelse\n\tprint(2)\nend", "language": "Lua", "metadata": {"date": 1588578041, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03962.html", "problem_id": "p03962", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03962/input.txt", "sample_output_relpath": "derived/input_output/data/p03962/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03962/Lua/s086184058.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s086184058", "user_id": "u540534068"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "a, b, c = io.read(\"*n\", \"*n\", \"*n\")\nif a ~= b and b ~= c and c ~= a then\n\tprint(3)\nelseif a == b and b == c and c == a then\n\tprint(1)\nelse\n\tprint(2)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer recently bought three paint cans.\nThe color of the one he bought two days ago is a, the color of the one he bought yesterday is b, and the color of the one he bought today is c.\nHere, the color of each paint can is represented by an integer between 1 and 100, inclusive.\n\nSince he is forgetful, he might have bought more than one paint can in the same color.\nCount the number of different kinds of colors of these paint cans and tell him.\n\nConstraints\n\n1≦a,b,c≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint the number of different kinds of colors of the paint cans.\n\nSample Input 1\n\n3 1 4\n\nSample Output 1\n\n3\n\nThree different colors: 1, 3, and 4.\n\nSample Input 2\n\n3 3 33\n\nSample Output 2\n\n2\n\nTwo different colors: 3 and 33.", "sample_input": "3 1 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03962", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer recently bought three paint cans.\nThe color of the one he bought two days ago is a, the color of the one he bought yesterday is b, and the color of the one he bought today is c.\nHere, the color of each paint can is represented by an integer between 1 and 100, inclusive.\n\nSince he is forgetful, he might have bought more than one paint can in the same color.\nCount the number of different kinds of colors of these paint cans and tell him.\n\nConstraints\n\n1≦a,b,c≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint the number of different kinds of colors of the paint cans.\n\nSample Input 1\n\n3 1 4\n\nSample Output 1\n\n3\n\nThree different colors: 1, 3, and 4.\n\nSample Input 2\n\n3 3 33\n\nSample Output 2\n\n2\n\nTwo different colors: 3 and 33.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s346332644", "group_id": "codeNet:p03962", "input_text": "local t = {}\nfor i = 1, 3 do\n\tt[io.read(\"*n\")] = true\nend\nlocal ans = 0\nfor i = 1, 100 do\n if t[i] then\n ans = ans + 1\n end\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1572840855, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03962.html", "problem_id": "p03962", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03962/input.txt", "sample_output_relpath": "derived/input_output/data/p03962/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03962/Lua/s346332644.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s346332644", "user_id": "u413686817"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local t = {}\nfor i = 1, 3 do\n\tt[io.read(\"*n\")] = true\nend\nlocal ans = 0\nfor i = 1, 100 do\n if t[i] then\n ans = ans + 1\n end\nend\nprint(ans)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer recently bought three paint cans.\nThe color of the one he bought two days ago is a, the color of the one he bought yesterday is b, and the color of the one he bought today is c.\nHere, the color of each paint can is represented by an integer between 1 and 100, inclusive.\n\nSince he is forgetful, he might have bought more than one paint can in the same color.\nCount the number of different kinds of colors of these paint cans and tell him.\n\nConstraints\n\n1≦a,b,c≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint the number of different kinds of colors of the paint cans.\n\nSample Input 1\n\n3 1 4\n\nSample Output 1\n\n3\n\nThree different colors: 1, 3, and 4.\n\nSample Input 2\n\n3 3 33\n\nSample Output 2\n\n2\n\nTwo different colors: 3 and 33.", "sample_input": "3 1 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03962", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer recently bought three paint cans.\nThe color of the one he bought two days ago is a, the color of the one he bought yesterday is b, and the color of the one he bought today is c.\nHere, the color of each paint can is represented by an integer between 1 and 100, inclusive.\n\nSince he is forgetful, he might have bought more than one paint can in the same color.\nCount the number of different kinds of colors of these paint cans and tell him.\n\nConstraints\n\n1≦a,b,c≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint the number of different kinds of colors of the paint cans.\n\nSample Input 1\n\n3 1 4\n\nSample Output 1\n\n3\n\nThree different colors: 1, 3, and 4.\n\nSample Input 2\n\n3 3 33\n\nSample Output 2\n\n2\n\nTwo different colors: 3 and 33.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 143, "cpu_time_ms": 8, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s652398673", "group_id": "codeNet:p03962", "input_text": "t = {}\nfor i = 1, 3 do t[io.read(\"*n\")] = true end\nc = 0\nfor k, v in pairs(t) do c = c + 1 end\nprint(c)\n", "language": "Lua", "metadata": {"date": 1565413428, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03962.html", "problem_id": "p03962", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03962/input.txt", "sample_output_relpath": "derived/input_output/data/p03962/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03962/Lua/s652398673.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s652398673", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "t = {}\nfor i = 1, 3 do t[io.read(\"*n\")] = true end\nc = 0\nfor k, v in pairs(t) do c = c + 1 end\nprint(c)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer recently bought three paint cans.\nThe color of the one he bought two days ago is a, the color of the one he bought yesterday is b, and the color of the one he bought today is c.\nHere, the color of each paint can is represented by an integer between 1 and 100, inclusive.\n\nSince he is forgetful, he might have bought more than one paint can in the same color.\nCount the number of different kinds of colors of these paint cans and tell him.\n\nConstraints\n\n1≦a,b,c≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint the number of different kinds of colors of the paint cans.\n\nSample Input 1\n\n3 1 4\n\nSample Output 1\n\n3\n\nThree different colors: 1, 3, and 4.\n\nSample Input 2\n\n3 3 33\n\nSample Output 2\n\n2\n\nTwo different colors: 3 and 33.", "sample_input": "3 1 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03962", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer recently bought three paint cans.\nThe color of the one he bought two days ago is a, the color of the one he bought yesterday is b, and the color of the one he bought today is c.\nHere, the color of each paint can is represented by an integer between 1 and 100, inclusive.\n\nSince he is forgetful, he might have bought more than one paint can in the same color.\nCount the number of different kinds of colors of these paint cans and tell him.\n\nConstraints\n\n1≦a,b,c≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint the number of different kinds of colors of the paint cans.\n\nSample Input 1\n\n3 1 4\n\nSample Output 1\n\n3\n\nThree different colors: 1, 3, and 4.\n\nSample Input 2\n\n3 3 33\n\nSample Output 2\n\n2\n\nTwo different colors: 3 and 33.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 104, "cpu_time_ms": 8, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s291849983", "group_id": "codeNet:p03986", "input_text": "local n = io.read()\n\nlocal function getABC(str)\n\tlocal result\n\tfor i=#str, 2, -1 do\n\t\tlocal a = string.sub(str, i, i)\n\t\tif a == \"T\" then\n\t\t\tlocal b = string.sub(str, i-1, i-1)\n\t\t\tif b == \"S\" then\n\t\t\t\tresult = #str - i\n\t\t\t\tbreak\n\t\t\tend\n\t\tend\n\tend\n\n\tif not result then\n\t\tresult = #str\n\tend\n\tif result % 2 ~= 0 then\n\t\tresult = result + 1\n\tend\n\treturn result\nend\n\nlocal r = getABC(n)\nprint(r)", "language": "Lua", "metadata": {"date": 1553560040, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s291849983.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s291849983", "user_id": "u863370423"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local n = io.read()\n\nlocal function getABC(str)\n\tlocal result\n\tfor i=#str, 2, -1 do\n\t\tlocal a = string.sub(str, i, i)\n\t\tif a == \"T\" then\n\t\t\tlocal b = string.sub(str, i-1, i-1)\n\t\t\tif b == \"S\" then\n\t\t\t\tresult = #str - i\n\t\t\t\tbreak\n\t\t\tend\n\t\tend\n\tend\n\n\tif not result then\n\t\tresult = #str\n\tend\n\tif result % 2 ~= 0 then\n\t\tresult = result + 1\n\tend\n\treturn result\nend\n\nlocal r = getABC(n)\nprint(r)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 388, "cpu_time_ms": 2, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s510094367", "group_id": "codeNet:p03986", "input_text": "local str = io.read(\"*l\")\n\nlocal len = string.len(str)\n\nlocal snum = 0\nlocal tnum = 0\nfor i = 1,len do\n\tlocal j = string.sub(str,i,i)\n\tif j == \"S\" then\n\t\tsnum = snum + 1\n\telseif j == \"T\" then\n\t\tif snum > 0 then\n\t\t\tsnum = snum - 1\n\t\telse\n\t\t\ttnum = tnum + 1\n\t\tend\n\tend\nend\nlocal ret = snum + tnum\nprint(ret)", "language": "Lua", "metadata": {"date": 1553559392, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s510094367.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s510094367", "user_id": "u353919145"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local str = io.read(\"*l\")\n\nlocal len = string.len(str)\n\nlocal snum = 0\nlocal tnum = 0\nfor i = 1,len do\n\tlocal j = string.sub(str,i,i)\n\tif j == \"S\" then\n\t\tsnum = snum + 1\n\telseif j == \"T\" then\n\t\tif snum > 0 then\n\t\t\tsnum = snum - 1\n\t\telse\n\t\t\ttnum = tnum + 1\n\t\tend\n\tend\nend\nlocal ret = snum + tnum\nprint(ret)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 29, "memory_kb": 760}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s278338754", "group_id": "codeNet:p03986", "input_text": "local X = io.read()\n\nlocal function main(str)\n\tlocal sPos = string.find(str, \"ST\")\n\tif sPos then\n\t\tstr = string.sub(str, 2, string.len(str))\n\t\treturn main(str)\n\tend\n\tprint(string.len(str))\nend\n\nmain(X)", "language": "Lua", "metadata": {"date": 1553559243, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s278338754.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s278338754", "user_id": "u816631826"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local X = io.read()\n\nlocal function main(str)\n\tlocal sPos = string.find(str, \"ST\")\n\tif sPos then\n\t\tstr = string.sub(str, 2, string.len(str))\n\t\treturn main(str)\n\tend\n\tprint(string.len(str))\nend\n\nmain(X)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1055, "memory_kb": 1972}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s376348424", "group_id": "codeNet:p03987", "input_text": "local mfl, mce = math.floor, math.ceil\nlocal mmi, mma = math.min, math.max\nlocal pow2 = {1}\nfor i = 2, 26 do\n pow2[i] = 2 * pow2[i - 1]\nend\nlocal function bls(a, b)\n return a * pow2[b + 1]\nend\nlocal function brs(a, b)\n return a // pow2[b + 1]\nend\n\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n local cnt = bls(1, i - 1)\n for j = 1, cnt do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.stage = {{}}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.stage[stagenum] = {}\n end\n self.stagenum = stagenum\n self.left_stage = {}\n for i = 1, n do\n local sp, sz = 1, bls(1, stagenum - 1)\n while(i - 1) % sz ~= 0 do\n sp, sz = sp + 1, brs(sz, 1)\n end\n self.left_stage[i] = sp\n end\n self.sz_stage = {}\n local tmp, sp = 1, stagenum\n for i = 1, n do\n if tmp * 2 == i then tmp, sp = tmp * 2, sp - 1 end\n self.sz_stage[i] = sp\n end\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.setValue = function(self, idx, value, silent)\n self.stage[self.stagenum][idx] = value\n if not silent then\n for i = self.stagenum - 1, 1, -1 do\n local dst = brs(idx + 1, 1)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n end\nend\nSegTree.right_bound = function(self, val, left, right)\n local ret, retpos = self.emptyvalue, left - 1\n local l, r = left, right\n local stage = mma(self.left_stage[left], self.sz_stage[right - left + 1])\n local stagenum = self.stagenum\n while true do\n local sz = bls(1, stagenum - stage)\n local tmp = self.func(ret, self.stage[stage][mce(l / sz)])\n if tmp < val then\n ret, retpos = tmp, l + sz - 1\n if retpos == right then break end\n if l + sz <= r then\n l = l + sz\n stage = mma(self.left_stage[l], self.sz_stage[r - l + 1])\n else break end\n else\n if sz ~= 1 then stage, r = stage + 1, l + sz - 2\n else break end\n end\n end\n return retpos + 1\nend\nSegTree.left_bound = function(self, val, left, right)\n local ret, retpos = self.emptyvalue, right + 1\n local stage, l, r = 1, left, right\n local stagenum = self.stagenum\n while true do\n local sz = bls(1, stagenum - stage)\n while r % sz ~= 0 or r + 1 - l < sz do\n stage = stage + 1\n sz = bls(1, stagenum - stage)\n end\n local tmp = self.func(ret, self.stage[stage][mfl(r / sz)])\n if tmp < val then\n ret, retpos = tmp, r - sz + 1\n if l + sz <= r then stage, l, r = 1, l, r - sz\n else break end\n else\n if sz ~= 1 then stage, l, r = stage + 1, r - sz + 2, r\n else break end\n end\n end\n return retpos - 1\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal n = io.read(\"*n\")\nlocal st = SegTree.new(n, mma, -n-1)\nlocal invpos = {}\nfor i = 1, n do invpos[i] = i end\nfor i = 1, n do\n local z = io.read(\"*n\")\n st:setValue(i, -z, true)\n invpos[z] = i\nend\nst:updateAll()\nlocal ret = 0\nfor i = 1, n do\n local pos = invpos[i]\n local rb = st:right_bound(-i + 1, pos, n)\n local lb = st:left_bound(-i + 1, 1, pos)\n ret = ret + i * (rb - pos) * (pos - lb)\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1589922680, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03987.html", "problem_id": "p03987", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03987/input.txt", "sample_output_relpath": "derived/input_output/data/p03987/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03987/Lua/s376348424.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s376348424", "user_id": "u120582723"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "local mfl, mce = math.floor, math.ceil\nlocal mmi, mma = math.min, math.max\nlocal pow2 = {1}\nfor i = 2, 26 do\n pow2[i] = 2 * pow2[i - 1]\nend\nlocal function bls(a, b)\n return a * pow2[b + 1]\nend\nlocal function brs(a, b)\n return a // pow2[b + 1]\nend\n\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n local cnt = bls(1, i - 1)\n for j = 1, cnt do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.stage = {{}}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.stage[stagenum] = {}\n end\n self.stagenum = stagenum\n self.left_stage = {}\n for i = 1, n do\n local sp, sz = 1, bls(1, stagenum - 1)\n while(i - 1) % sz ~= 0 do\n sp, sz = sp + 1, brs(sz, 1)\n end\n self.left_stage[i] = sp\n end\n self.sz_stage = {}\n local tmp, sp = 1, stagenum\n for i = 1, n do\n if tmp * 2 == i then tmp, sp = tmp * 2, sp - 1 end\n self.sz_stage[i] = sp\n end\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.setValue = function(self, idx, value, silent)\n self.stage[self.stagenum][idx] = value\n if not silent then\n for i = self.stagenum - 1, 1, -1 do\n local dst = brs(idx + 1, 1)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n end\nend\nSegTree.right_bound = function(self, val, left, right)\n local ret, retpos = self.emptyvalue, left - 1\n local l, r = left, right\n local stage = mma(self.left_stage[left], self.sz_stage[right - left + 1])\n local stagenum = self.stagenum\n while true do\n local sz = bls(1, stagenum - stage)\n local tmp = self.func(ret, self.stage[stage][mce(l / sz)])\n if tmp < val then\n ret, retpos = tmp, l + sz - 1\n if retpos == right then break end\n if l + sz <= r then\n l = l + sz\n stage = mma(self.left_stage[l], self.sz_stage[r - l + 1])\n else break end\n else\n if sz ~= 1 then stage, r = stage + 1, l + sz - 2\n else break end\n end\n end\n return retpos + 1\nend\nSegTree.left_bound = function(self, val, left, right)\n local ret, retpos = self.emptyvalue, right + 1\n local stage, l, r = 1, left, right\n local stagenum = self.stagenum\n while true do\n local sz = bls(1, stagenum - stage)\n while r % sz ~= 0 or r + 1 - l < sz do\n stage = stage + 1\n sz = bls(1, stagenum - stage)\n end\n local tmp = self.func(ret, self.stage[stage][mfl(r / sz)])\n if tmp < val then\n ret, retpos = tmp, r - sz + 1\n if l + sz <= r then stage, l, r = 1, l, r - sz\n else break end\n else\n if sz ~= 1 then stage, l, r = stage + 1, r - sz + 2, r\n else break end\n end\n end\n return retpos - 1\nend\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal n = io.read(\"*n\")\nlocal st = SegTree.new(n, mma, -n-1)\nlocal invpos = {}\nfor i = 1, n do invpos[i] = i end\nfor i = 1, n do\n local z = io.read(\"*n\")\n st:setValue(i, -z, true)\n invpos[z] = i\nend\nst:updateAll()\nlocal ret = 0\nfor i = 1, n do\n local pos = invpos[i]\n local rb = st:right_bound(-i + 1, pos, n)\n local lb = st:left_bound(-i + 1, 1, pos)\n ret = ret + i * (rb - pos) * (pos - lb)\nend\nprint(ret)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nOne day, Snuke was given a permutation of length N, a_1, a_2, ..., a_N, from his friend.\n\nFind the following:\n\nConstraints\n\n1 ≦ N ≦ 200,000\n\n(a_1, a_2, ..., a_N) is a permutation of (1, 2, ..., N).\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 answer.\n\nNote that the answer may not fit into a 32-bit integer.\n\nSample Input 1\n\n3\n2 1 3\n\nSample Output 1\n\n9\n\nSample Input 2\n\n4\n1 3 2 4\n\nSample Output 2\n\n19\n\nSample Input 3\n\n8\n5 4 8 1 2 6 7 3\n\nSample Output 3\n\n85", "sample_input": "3\n2 1 3\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03987", "source_text": "Score : 400 points\n\nProblem Statement\n\nOne day, Snuke was given a permutation of length N, a_1, a_2, ..., a_N, from his friend.\n\nFind the following:\n\nConstraints\n\n1 ≦ N ≦ 200,000\n\n(a_1, a_2, ..., a_N) is a permutation of (1, 2, ..., N).\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 answer.\n\nNote that the answer may not fit into a 32-bit integer.\n\nSample Input 1\n\n3\n2 1 3\n\nSample Output 1\n\n9\n\nSample Input 2\n\n4\n1 3 2 4\n\nSample Output 2\n\n19\n\nSample Input 3\n\n8\n5 4 8 1 2 6 7 3\n\nSample Output 3\n\n85", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3497, "cpu_time_ms": 2108, "memory_kb": 20856}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s661693869", "group_id": "codeNet:p03993", "input_text": "n=io.read(\"*n\",\"*l\")\na={}\nfor i=1,n do\n a[i]=io.read(\"*n\")\nend\n\ncounter=0\nfor i=1,n do\n if a[a[i]]==i then\n counter=counter+1\n end\nend\nprint(counter//2)", "language": "Lua", "metadata": {"date": 1588478635, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s661693869.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s661693869", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "n=io.read(\"*n\",\"*l\")\na={}\nfor i=1,n do\n a[i]=io.read(\"*n\")\nend\n\ncounter=0\nfor i=1,n do\n if a[a[i]]==i then\n counter=counter+1\n end\nend\nprint(counter//2)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 168, "cpu_time_ms": 44, "memory_kb": 2424}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s708086086", "group_id": "codeNet:p03993", "input_text": "local n = io.read(\"*n\")\nlocal a = {}\nfor i = 1, n do a[i] = io.read(\"*n\") end\nlocal cnt = 0\nfor i = 1, n - 1 do\n if(i < a[i] and a[a[i]] == i) then\n cnt = cnt + 1\n end\nend\nprint(cnt)\n", "language": "Lua", "metadata": {"date": 1558232012, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s708086086.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s708086086", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal a = {}\nfor i = 1, n do a[i] = io.read(\"*n\") end\nlocal cnt = 0\nfor i = 1, n - 1 do\n if(i < a[i] and a[a[i]] == i) then\n cnt = cnt + 1\n end\nend\nprint(cnt)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N rabbits, numbered 1 through N.\n\nThe i-th (1≤i≤N) rabbit likes rabbit a_i.\nNote that no rabbit can like itself, that is, a_i≠i.\n\nFor a pair of rabbits i and j (i＜j), we call the pair (i，j) a friendly pair if the following condition is met.\n\nRabbit i likes rabbit j and rabbit j likes rabbit i.\n\nCalculate the number of the friendly pairs.\n\nConstraints\n\n2≤N≤10^5\n\n1≤a_i≤N\n\na_i≠i\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of the friendly pairs.\n\nSample Input 1\n\n4\n2 1 4 3\n\nSample Output 1\n\n2\n\nThere are two friendly pairs: (1，2) and (3，4).\n\nSample Input 2\n\n3\n2 3 1\n\nSample Output 2\n\n0\n\nThere are no friendly pairs.\n\nSample Input 3\n\n5\n5 5 5 5 1\n\nSample Output 3\n\n1\n\nThere is one friendly pair: (1，5).", "sample_input": "4\n2 1 4 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03993", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N rabbits, numbered 1 through N.\n\nThe i-th (1≤i≤N) rabbit likes rabbit a_i.\nNote that no rabbit can like itself, that is, a_i≠i.\n\nFor a pair of rabbits i and j (i＜j), we call the pair (i，j) a friendly pair if the following condition is met.\n\nRabbit i likes rabbit j and rabbit j likes rabbit i.\n\nCalculate the number of the friendly pairs.\n\nConstraints\n\n2≤N≤10^5\n\n1≤a_i≤N\n\na_i≠i\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of the friendly pairs.\n\nSample Input 1\n\n4\n2 1 4 3\n\nSample Output 1\n\n2\n\nThere are two friendly pairs: (1，2) and (3，4).\n\nSample Input 2\n\n3\n2 3 1\n\nSample Output 2\n\n0\n\nThere are no friendly pairs.\n\nSample Input 3\n\n5\n5 5 5 5 1\n\nSample Output 3\n\n1\n\nThere is one friendly pair: (1，5).", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 33, "memory_kb": 2424}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s824700004", "group_id": "codeNet:p03994", "input_text": "local s=io.read()\nlocal sable={}\nfor i=1,#s do\n sable[i]=s:byte(i)-97\nend\nlocal k=io.read(\"n\")\nfor i=1,#s do\n local a=sable[i]\n if i~=#s and k>=26-a and a>0 then\n sable[i]=string.char(97)\n k=k-(26-a)\n elseif i==#s then\n sable[i]=string.char((sable[i]+k)%26+97)\n else\n sable[i]=string.char(sable[i]+97)\n end\nend\nprint(table.concat(sable,\"\"))", "language": "Lua", "metadata": {"date": 1593663806, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p03994.html", "problem_id": "p03994", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03994/input.txt", "sample_output_relpath": "derived/input_output/data/p03994/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03994/Lua/s824700004.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s824700004", "user_id": "u045238009"}, "prompt_components": {"gold_output": "aya\n", "input_to_evaluate": "local s=io.read()\nlocal sable={}\nfor i=1,#s do\n sable[i]=s:byte(i)-97\nend\nlocal k=io.read(\"n\")\nfor i=1,#s do\n local a=sable[i]\n if i~=#s and k>=26-a and a>0 then\n sable[i]=string.char(97)\n k=k-(26-a)\n elseif i==#s then\n sable[i]=string.char((sable[i]+k)%26+97)\n else\n sable[i]=string.char(sable[i]+97)\n end\nend\nprint(table.concat(sable,\"\"))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nMr. Takahashi has a string s consisting of lowercase English letters.\nHe repeats the following operation on s exactly K times.\n\nChoose an arbitrary letter on s and change that letter to the next alphabet. Note that the next letter of z is a.\n\nFor example, if you perform an operation for the second letter on aaz, aaz becomes abz.\nIf you then perform an operation for the third letter on abz, abz becomes aba.\n\nMr. Takahashi wants to have the lexicographically smallest string after performing exactly K operations on s.\nFind the such string.\n\nConstraints\n\n1≤|s|≤10^5\n\nAll letters in s are lowercase English letters.\n\n1≤K≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\nK\n\nOutput\n\nPrint the lexicographically smallest string after performing exactly K operations on s.\n\nSample Input 1\n\nxyz\n4\n\nSample Output 1\n\naya\n\nFor example, you can perform the following operations: xyz, yyz, zyz, ayz, aya.\n\nSample Input 2\n\na\n25\n\nSample Output 2\n\nz\n\nYou have to perform exactly K operations.\n\nSample Input 3\n\ncodefestival\n100\n\nSample Output 3\n\naaaafeaaivap", "sample_input": "xyz\n4\n"}, "reference_outputs": ["aya\n"], "source_document_id": "p03994", "source_text": "Score : 400 points\n\nProblem Statement\n\nMr. Takahashi has a string s consisting of lowercase English letters.\nHe repeats the following operation on s exactly K times.\n\nChoose an arbitrary letter on s and change that letter to the next alphabet. Note that the next letter of z is a.\n\nFor example, if you perform an operation for the second letter on aaz, aaz becomes abz.\nIf you then perform an operation for the third letter on abz, abz becomes aba.\n\nMr. Takahashi wants to have the lexicographically smallest string after performing exactly K operations on s.\nFind the such string.\n\nConstraints\n\n1≤|s|≤10^5\n\nAll letters in s are lowercase English letters.\n\n1≤K≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\nK\n\nOutput\n\nPrint the lexicographically smallest string after performing exactly K operations on s.\n\nSample Input 1\n\nxyz\n4\n\nSample Output 1\n\naya\n\nFor example, you can perform the following operations: xyz, yyz, zyz, ayz, aya.\n\nSample Input 2\n\na\n25\n\nSample Output 2\n\nz\n\nYou have to perform exactly K operations.\n\nSample Input 3\n\ncodefestival\n100\n\nSample Output 3\n\naaaafeaaivap", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 14, "memory_kb": 3924}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s681418607", "group_id": "codeNet:p03994", "input_text": "local s = io.read()\nlocal k = io.read(\"*n\")\nlocal n = #s\nlocal t = {}\nlocal sch = string.char\nfor i = 1, n - 1 do\n local ti = s:sub(i, i):byte() - 97\n if 0 < ti then\n local cost = 26 - ti\n if cost <= k then\n k = k - cost\n ti = 0\n end\n end\n t[i] = sch(ti + 97)\nend\nlocal last = (s:sub(n, n):byte() - 97 + k) % 26\nt[n] = sch(last + 97)\nprint(table.concat(t))\n", "language": "Lua", "metadata": {"date": 1564365950, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03994.html", "problem_id": "p03994", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03994/input.txt", "sample_output_relpath": "derived/input_output/data/p03994/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03994/Lua/s681418607.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s681418607", "user_id": "u120582723"}, "prompt_components": {"gold_output": "aya\n", "input_to_evaluate": "local s = io.read()\nlocal k = io.read(\"*n\")\nlocal n = #s\nlocal t = {}\nlocal sch = string.char\nfor i = 1, n - 1 do\n local ti = s:sub(i, i):byte() - 97\n if 0 < ti then\n local cost = 26 - ti\n if cost <= k then\n k = k - cost\n ti = 0\n end\n end\n t[i] = sch(ti + 97)\nend\nlocal last = (s:sub(n, n):byte() - 97 + k) % 26\nt[n] = sch(last + 97)\nprint(table.concat(t))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nMr. Takahashi has a string s consisting of lowercase English letters.\nHe repeats the following operation on s exactly K times.\n\nChoose an arbitrary letter on s and change that letter to the next alphabet. Note that the next letter of z is a.\n\nFor example, if you perform an operation for the second letter on aaz, aaz becomes abz.\nIf you then perform an operation for the third letter on abz, abz becomes aba.\n\nMr. Takahashi wants to have the lexicographically smallest string after performing exactly K operations on s.\nFind the such string.\n\nConstraints\n\n1≤|s|≤10^5\n\nAll letters in s are lowercase English letters.\n\n1≤K≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\nK\n\nOutput\n\nPrint the lexicographically smallest string after performing exactly K operations on s.\n\nSample Input 1\n\nxyz\n4\n\nSample Output 1\n\naya\n\nFor example, you can perform the following operations: xyz, yyz, zyz, ayz, aya.\n\nSample Input 2\n\na\n25\n\nSample Output 2\n\nz\n\nYou have to perform exactly K operations.\n\nSample Input 3\n\ncodefestival\n100\n\nSample Output 3\n\naaaafeaaivap", "sample_input": "xyz\n4\n"}, "reference_outputs": ["aya\n"], "source_document_id": "p03994", "source_text": "Score : 400 points\n\nProblem Statement\n\nMr. Takahashi has a string s consisting of lowercase English letters.\nHe repeats the following operation on s exactly K times.\n\nChoose an arbitrary letter on s and change that letter to the next alphabet. Note that the next letter of z is a.\n\nFor example, if you perform an operation for the second letter on aaz, aaz becomes abz.\nIf you then perform an operation for the third letter on abz, abz becomes aba.\n\nMr. Takahashi wants to have the lexicographically smallest string after performing exactly K operations on s.\nFind the such string.\n\nConstraints\n\n1≤|s|≤10^5\n\nAll letters in s are lowercase English letters.\n\n1≤K≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\nK\n\nOutput\n\nPrint the lexicographically smallest string after performing exactly K operations on s.\n\nSample Input 1\n\nxyz\n4\n\nSample Output 1\n\naya\n\nFor example, you can perform the following operations: xyz, yyz, zyz, ayz, aya.\n\nSample Input 2\n\na\n25\n\nSample Output 2\n\nz\n\nYou have to perform exactly K operations.\n\nSample Input 3\n\ncodefestival\n100\n\nSample Output 3\n\naaaafeaaivap", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 380, "cpu_time_ms": 16, "memory_kb": 1884}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s290280884", "group_id": "codeNet:p03997", "input_text": "a,b,h=io.read(\"*n\",\"*n\",\"*n\")\nprint((a+b)*h/2)", "language": "Lua", "metadata": {"date": 1588572583, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s290280884.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s290280884", "user_id": "u540534068"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "a,b,h=io.read(\"*n\",\"*n\",\"*n\")\nprint((a+b)*h/2)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 46, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s645096607", "group_id": "codeNet:p03997", "input_text": "local a, b, h = io.read(\"*n\", \"*n\", \"*n\")\nlocal ans = (a + b) * h / 2\nprint(ans)", "language": "Lua", "metadata": {"date": 1572840946, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s645096607.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s645096607", "user_id": "u413686817"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "local a, b, h = io.read(\"*n\", \"*n\", \"*n\")\nlocal ans = (a + b) * h / 2\nprint(ans)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 80, "cpu_time_ms": 8, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s152984502", "group_id": "codeNet:p03998", "input_text": "local S={}\nS[\"a\"]=io.read()\nS[\"b\"]=io.read()\nS[\"c\"]=io.read()\n\nlocal discard=\"a\"\nwhile true do\n if #S[discard]==0 then\n print(discard:upper())\n break\n end\n discard=S[discard]:sub(1,1)\n S[discard]=S[discard]:sub(2)\nend", "language": "Lua", "metadata": {"date": 1590291147, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "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/Lua/s152984502.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s152984502", "user_id": "u045238009"}, "prompt_components": {"gold_output": "A\n", "input_to_evaluate": "local S={}\nS[\"a\"]=io.read()\nS[\"b\"]=io.read()\nS[\"c\"]=io.read()\n\nlocal discard=\"a\"\nwhile true do\n if #S[discard]==0 then\n print(discard:upper())\n break\n end\n discard=S[discard]:sub(1,1)\n S[discard]=S[discard]:sub(2)\nend", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s658196331", "group_id": "codeNet:p03998", "input_text": "local S={}\nS[\"a\"]=io.read()\nS[\"b\"]=io.read()\nS[\"c\"]=io.read()\n\nlocal discard=\"a\"\nwhile true do\n if #S[discard]==0 then\n print(discard:upper())\n break\n end\n discard=S[discard]:sub(1,1)\n S[discard]=S[discard]:sub(2)\nend", "language": "Lua", "metadata": {"date": 1590290057, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s658196331.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s658196331", "user_id": "u045238009"}, "prompt_components": {"gold_output": "A\n", "input_to_evaluate": "local S={}\nS[\"a\"]=io.read()\nS[\"b\"]=io.read()\nS[\"c\"]=io.read()\n\nlocal discard=\"a\"\nwhile true do\n if #S[discard]==0 then\n print(discard:upper())\n break\n end\n discard=S[discard]:sub(1,1)\n S[discard]=S[discard]:sub(2)\nend", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 888}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s308152030", "group_id": "codeNet:p03998", "input_text": "local S={}\nS[\"a\"]=io.read()\nS[\"b\"]=io.read()\nS[\"c\"]=io.read()\n\nlocal discard=\"a\"\nwhile true do\n discard=S[discard]:sub(1,1)\n S[discard]=S[discard]:sub(2,#S[discard])\n if S[discard]==\"\" then\n print(discard:upper())\n break\n end\nend", "language": "Lua", "metadata": {"date": 1590288929, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s308152030.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s308152030", "user_id": "u045238009"}, "prompt_components": {"gold_output": "A\n", "input_to_evaluate": "local S={}\nS[\"a\"]=io.read()\nS[\"b\"]=io.read()\nS[\"c\"]=io.read()\n\nlocal discard=\"a\"\nwhile true do\n discard=S[discard]:sub(1,1)\n S[discard]=S[discard]:sub(2,#S[discard])\n if S[discard]==\"\" then\n print(discard:upper())\n break\n end\nend", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 752}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s147237416", "group_id": "codeNet:p04000", "input_text": "local h, w, n = io.read(\"*n\", \"*n\", \"*n\")\nlocal t = {}\n\nlocal function add(i_h, i_w)\n local idx = i_h .. \":\" .. i_w --(i_h - 1) * 1000000000 + i_w\n local v = t[idx]\n if v then t[idx] = v + 1 else t[idx] = 1 end\nend\n\nlocal function subtask(ah, bw)\n if 3 <= bw then add(ah, bw - 2) end\n if 2 <= bw and bw < w then add(ah, bw - 1) end\n if bw < w - 1 then add(ah, bw) end\nend\n\nfor i = 1, n do\n local ah, bw = io.read(\"*n\", \"*n\")\n if 3 <= ah then subtask(ah - 2, bw) end\n if 2 <= ah and ah < h then subtask(ah - 1, bw) end\n if ah < h - 1 then subtask(ah, bw) end\nend\n\nlocal sum = 0LL\nlocal tbl = {}\nfor i = 1, 9 do tbl[i] = 0 end\nfor k, v in pairs(t) do\n tbl[v] = tbl[v] + 1\n sum = sum + 1LL\nend\nlocal rem = (h - 2LL) * (w - 2LL) - sum\nlocal str = tostring(rem):gsub(\"LL\", \"\")\nprint(str)\nfor i = 1, 9 do print(tbl[i]) end\n", "language": "Lua", "metadata": {"date": 1565014360, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p04000.html", "problem_id": "p04000", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04000/input.txt", "sample_output_relpath": "derived/input_output/data/p04000/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04000/Lua/s147237416.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s147237416", "user_id": "u120582723"}, "prompt_components": {"gold_output": "0\n0\n0\n2\n4\n0\n0\n0\n0\n0\n", "input_to_evaluate": "local h, w, n = io.read(\"*n\", \"*n\", \"*n\")\nlocal t = {}\n\nlocal function add(i_h, i_w)\n local idx = i_h .. \":\" .. i_w --(i_h - 1) * 1000000000 + i_w\n local v = t[idx]\n if v then t[idx] = v + 1 else t[idx] = 1 end\nend\n\nlocal function subtask(ah, bw)\n if 3 <= bw then add(ah, bw - 2) end\n if 2 <= bw and bw < w then add(ah, bw - 1) end\n if bw < w - 1 then add(ah, bw) end\nend\n\nfor i = 1, n do\n local ah, bw = io.read(\"*n\", \"*n\")\n if 3 <= ah then subtask(ah - 2, bw) end\n if 2 <= ah and ah < h then subtask(ah - 1, bw) end\n if ah < h - 1 then subtask(ah, bw) end\nend\n\nlocal sum = 0LL\nlocal tbl = {}\nfor i = 1, 9 do tbl[i] = 0 end\nfor k, v in pairs(t) do\n tbl[v] = tbl[v] + 1\n sum = sum + 1LL\nend\nlocal rem = (h - 2LL) * (w - 2LL) - sum\nlocal str = tostring(rem):gsub(\"LL\", \"\")\nprint(str)\nfor i = 1, 9 do print(tbl[i]) end\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a grid with H rows and W columns. At first, all cells were painted white.\n\nSnuke painted N of these cells. The i-th ( 1 \\leq i \\leq N ) cell he painted is the cell at the a_i-th row and b_i-th column.\n\nCompute the following:\n\nFor each integer j ( 0 \\leq j \\leq 9 ), how many subrectangles of size 3×3 of the grid contains exactly j black cells, after Snuke painted N cells?\n\nConstraints\n\n3 \\leq H \\leq 10^9\n\n3 \\leq W \\leq 10^9\n\n0 \\leq N \\leq min(10^5,H×W)\n\n1 \\leq a_i \\leq H (1 \\leq i \\leq N)\n\n1 \\leq b_i \\leq W (1 \\leq i \\leq N)\n\n(a_i, b_i) \\neq (a_j, b_j) (i \\neq j)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W N\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint 10 lines.\nThe (j+1)-th ( 0 \\leq j \\leq 9 ) line should contain the number of the subrectangles of size 3×3 of the grid that contains exactly j black cells.\n\nSample Input 1\n\n4 5 8\n1 1\n1 4\n1 5\n2 3\n3 1\n3 2\n3 4\n4 4\n\nSample Output 1\n\n0\n0\n0\n2\n4\n0\n0\n0\n0\n0\n\nThere are six subrectangles of size 3×3. Two of them contain three black cells each, and the remaining four contain four black cells each.\n\nSample Input 2\n\n10 10 20\n1 1\n1 4\n1 9\n2 5\n3 10\n4 2\n4 7\n5 9\n6 4\n6 6\n6 7\n7 1\n7 3\n7 7\n8 1\n8 5\n8 10\n9 2\n10 4\n10 9\n\nSample Output 2\n\n4\n26\n22\n10\n2\n0\n0\n0\n0\n0\n\nSample Input 3\n\n1000000000 1000000000 0\n\nSample Output 3\n\n999999996000000004\n0\n0\n0\n0\n0\n0\n0\n0\n0", "sample_input": "4 5 8\n1 1\n1 4\n1 5\n2 3\n3 1\n3 2\n3 4\n4 4\n"}, "reference_outputs": ["0\n0\n0\n2\n4\n0\n0\n0\n0\n0\n"], "source_document_id": "p04000", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a grid with H rows and W columns. At first, all cells were painted white.\n\nSnuke painted N of these cells. The i-th ( 1 \\leq i \\leq N ) cell he painted is the cell at the a_i-th row and b_i-th column.\n\nCompute the following:\n\nFor each integer j ( 0 \\leq j \\leq 9 ), how many subrectangles of size 3×3 of the grid contains exactly j black cells, after Snuke painted N cells?\n\nConstraints\n\n3 \\leq H \\leq 10^9\n\n3 \\leq W \\leq 10^9\n\n0 \\leq N \\leq min(10^5,H×W)\n\n1 \\leq a_i \\leq H (1 \\leq i \\leq N)\n\n1 \\leq b_i \\leq W (1 \\leq i \\leq N)\n\n(a_i, b_i) \\neq (a_j, b_j) (i \\neq j)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W N\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint 10 lines.\nThe (j+1)-th ( 0 \\leq j \\leq 9 ) line should contain the number of the subrectangles of size 3×3 of the grid that contains exactly j black cells.\n\nSample Input 1\n\n4 5 8\n1 1\n1 4\n1 5\n2 3\n3 1\n3 2\n3 4\n4 4\n\nSample Output 1\n\n0\n0\n0\n2\n4\n0\n0\n0\n0\n0\n\nThere are six subrectangles of size 3×3. Two of them contain three black cells each, and the remaining four contain four black cells each.\n\nSample Input 2\n\n10 10 20\n1 1\n1 4\n1 9\n2 5\n3 10\n4 2\n4 7\n5 9\n6 4\n6 6\n6 7\n7 1\n7 3\n7 7\n8 1\n8 5\n8 10\n9 2\n10 4\n10 9\n\nSample Output 2\n\n4\n26\n22\n10\n2\n0\n0\n0\n0\n0\n\nSample Input 3\n\n1000000000 1000000000 0\n\nSample Output 3\n\n999999996000000004\n0\n0\n0\n0\n0\n0\n0\n0\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 830, "cpu_time_ms": 2354, "memory_kb": 113036}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s578744479", "group_id": "codeNet:p04003", "input_text": "local mma = math.max\nlocal mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegForAvl = {}\nSegForAvl.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.stage[i + 1][j * 2 - 1]\n end\n end\nend\nSegForAvl.create = function(self, n)\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n for i = 1, mul do self.stage[stagenum][i] = i end\n self:updateAll()\nend\nSegForAvl.hold = function(self)\n local idx = self.stage[1][1]\n local ridx = idx\n self.stage[self.stagenum][idx] = false\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.stage[i + 1][idx] or self.stage[i + 1][rem]\n idx = dst\n end\n return ridx\nend\nSegForAvl.release = function(self, idx)\n self.stage[self.stagenum][idx] = idx\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.stage[i + 1][idx] or self.stage[i + 1][rem]\n idx = dst\n end\nend\nSegForAvl.new = function(n)\n local obj = {}\n setmetatable(obj, {__index = SegForAvl})\n obj:create(n)\n return obj\nend\n\nlocal SegAvlTree = {}\nSegAvlTree.makenode = function(self, val, parent)\n local i = self.seg:hold()\n self.v[i], self.u[i], self.p[i] = val, true, parent\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 0, 0\n return i\nend\nSegAvlTree.create = function(self, lessthan, n)\n self.lessthan = lessthan\n self.seg = SegForAvl.new(n)\n -- value, leftCount, rightCount, left, right, parent, used\n self.v, self.lc, self.rc, self.l, self.r, self.p, self.u = {}, {}, {}, {}, {}, {}, {}\n for i = 1, n do\n self.v[i], self.u[i], self.p[i] = 0, false, 0\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 0, 0\n end\nend\n\nSegAvlTree.recalcCount = function(self, i)\n if self.u[i] then\n if self.u[self.l[i]] then self.lc[i] = 1 + mma(self.lc[self.l[i]], self.rc[self.l[i]])\n else self.lc[i] = 0\n end\n if self.u[self.r[i]] then self.rc[i] = 1 + mma(self.lc[self.r[i]], self.rc[self.r[i]])\n else self.rc[i] = 0\n end\n end\nend\nSegAvlTree.recalcCountAll = function(self, i)\n while self.u[i] do\n self:recalcCount(i)\n i = self.p[i]\n end\nend\n\nSegAvlTree.rotR = function(self, child, parent)\n local granp = self.p[parent]\n self.r[child], self.l[parent] = parent, self.r[child]\n self.p[child], self.p[parent] = granp, child\n if self.u[self.l[parent]] then self.p[self.l[parent]] = parent end\n if self.u[granp] then\n if self.l[granp] == parent then\n self.l[granp] = child\n else\n self.r[granp] = child\n end\n else\n self.root = child\n end\n self:recalcCountAll(parent)\nend\n\nSegAvlTree.rotL = function(self, child, parent)\n local granp = self.p[parent]\n self.l[child], self.r[parent] = parent, self.l[child]\n self.p[child], self.p[parent] = granp, child\n if self.u[self.r[parent]] then self.p[self.r[parent]] = parent end\n if self.u[granp] then\n if self.r[granp] == parent then\n self.r[granp] = child\n else\n self.l[granp] = child\n end\n else\n self.root = child\n end\n self:recalcCountAll(parent)\nend\n\nSegAvlTree.add = function(self, val)\n if not self.u[self.root] then self.root = self:makenode(val, 0) return end\n local pos = self.root\n local added = false\n while not added do\n if self.lessthan(val, self.v[pos]) then\n if self.u[self.l[pos]] then\n pos = self.l[pos]\n else\n self.l[pos] = self:makenode(val, pos)\n pos = self.l[pos]\n added = true\n end\n else\n if self.u[self.r[pos]] then\n pos = self.r[pos]\n else\n self.r[pos] = self:makenode(val, pos)\n pos = self.r[pos]\n added = true\n end\n end\n end\n while self.u[pos] do\n local child, parent = pos, self.p[pos]\n if not self.u[parent] then\n break\n end\n self:recalcCount(parent)\n if self.l[parent] == child then\n if self.lc[parent] - 1 == self.rc[parent] then\n pos = parent\n elseif self.lc[parent] - 2 == self.rc[parent] then\n self:recalcCount(child)\n if self.lc[child] - 1 == self.rc[child] then\n self:rotR(child, parent)\n else\n local cr = self.r[child]\n self:rotL(cr, child)\n self:rotR(cr, parent)\n end\n pos = nil\n else\n self:recalcCountAll(child)\n pos = nil\n end\n else -- parent.r == child\n if self.rc[parent] - 1 == self.lc[parent] then\n pos = parent\n elseif self.rc[parent] - 2 == self.lc[parent] then\n self:recalcCount(child)\n if self.rc[child] - 1 == self.lc[child] then\n self:rotL(child, parent)\n else\n local cl = self.l[child]\n self:rotR(cl, child)\n self:rotL(cl, parent)\n end\n pos = nil\n else\n self:recalcCountAll(child)\n pos = nil\n end\n end\n end\nend\n\nSegAvlTree.rmsub = function(self, node)\n while self.u[node] do\n self:recalcCount(node)\n if self.lc[node] == self.rc[node] then\n node = self.p[node]\n elseif self.lc[node] + 1 == self.rc[node] then\n self:recalcCountAll(self.p[node])\n node = nil\n else\n if self.lc[self.r[node]] == self.rc[self.r[node]] then\n self:rotL(self.r[node], node)\n self:recalcCountAll(node)\n node = nil\n elseif self.lc[self.r[node]] + 1 == self.rc[self.r[node]] then\n local nr = self.r[node]\n self:rotL(nr, node)\n node = nr\n else\n local nrl = self.l[self.r[node]]\n self:rotR(nrl, self.r[node])\n self:rotL(nrl, node)\n node = nrl\n end\n end\n end\nend\n\nSegAvlTree.pop = function(self)\n local node = self.root\n while self.u[self.l[node]] do\n node = self.l[node]\n end\n local v = self.v[node]\n if self.u[self.p[node]] then\n if self.u[self.r[node]] then self.p[self.r[node]] = self.p[node] end\n self.l[self.p[node]] = self.r[node]\n self:rmsub(self.p[node])\n else\n if self.r[node] then self.p[self.r[node]] = 0 end\n self.root = self.r[node]\n end\n self.seg:release(node)\n return v\nend\n\nSegAvlTree.new = function(lessthan, n)\n local obj = {}\n setmetatable(obj, {__index = SegAvlTree})\n obj:create(lessthan, n)\n return obj\nend\n\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal ps, qs, cs = {}, {}, {}\nlocal companies = {}\nlocal stations = {}\nfor i = 1, n do\n stations[i] = {}\nend\nfor i = 1, m do\n local p, q, c = io.read(\"*n\", \"*n\", \"*n\")\n if not companies[c] then companies[c] = {} end\n if stations[p][c] and stations[q][c] then\n if stations[p][c] ~= stations[q][c] then\n local ci_p, ci_q = stations[p][c], stations[q][c]\n if #companies[c][ci_p] < #companies[c][ci_q] then\n for j = 1, #companies[c][ci_p] do\n local st = companies[c][ci_p][j]\n stations[st][c] = ci_q\n table.insert(companies[c][ci_q], st)\n end\n companies[c][ci_p] = {}\n else\n for j = 1, #companies[c][ci_q] do\n local st = companies[c][ci_q][j]\n stations[st][c] = ci_p\n table.insert(companies[c][ci_p], st)\n end\n companies[c][ci_q] = {}\n end\n end\n elseif not stations[p][c] and not stations[q][c] then\n table.insert(companies[c], {p, q})\n stations[p][c] = #companies[c]\n stations[q][c] = #companies[c]\n elseif stations[p][c] then\n local idx = stations[p][c]\n stations[q][c] = idx\n table.insert(companies[c][idx], q)\n else\n local idx = stations[q][c]\n stations[p][c] = idx\n table.insert(companies[c][idx], p)\n end\nend\nlocal len = {}\nlocal asked = {}\nlocal tasknum = 0\nlocal done = 0\nlocal tasktree = SegAvlTree.new(function(x, y) return len[x[1]][x[2]] < len[y[1]][y[2]] end, 200000)\nfor i = 1, n do\n asked[i] = false\n len[i] = {}\n for company, group in pairs(stations[i]) do\n len[i][company] = -1\n end\nend\nlocal function addtask(station, company)\n tasknum = tasknum + 1\n tasktree:add({station, company})\nend\nfor company, group in pairs(stations[1]) do\n len[1][company] = 1\n addtask(1, company)\nend\nlocal e,f = 0,0\nwhile done < tasknum do\n done = done + 1\n local taskidx = tasktree:pop()\n local src_station, src_company = taskidx[1], taskidx[2]\n local src_group = stations[src_station][src_company]\n local srclen = len[src_station][src_company]\n if not asked[src_station] then\n asked[src_station] = true\n for dst_company, _g in pairs(stations[src_station]) do\n if src_company ~= dst_company then\n local dstlen = len[src_station][dst_company]\n if dstlen == -1 or srclen + 1 < dstlen then\n len[src_station][dst_company] = srclen + 1\n addtask(src_station, dst_company)\n end\n end\n end\n end\n if 0 < #companies[src_company][src_group] then\n for i = 1, #companies[src_company][src_group] do\n local dst_station = companies[src_company][src_group][i]\n local dstlen = len[dst_station][src_company]\n if dstlen == -1 or srclen < dstlen then\n len[dst_station][src_company] = srclen\n addtask(dst_station, src_company)\n end\n end\n companies[src_company][src_group] = {}\n end\nend\nlocal ret = -1\nlocal mmi = math.min\nfor company, group in pairs(stations[n]) do\n local dstlen = len[n][company]\n if 0 < dstlen then\n if ret == -1 then\n ret = dstlen\n else\n ret = mmi(ret, dstlen)\n end\n end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1568126354, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p04003.html", "problem_id": "p04003", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04003/input.txt", "sample_output_relpath": "derived/input_output/data/p04003/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04003/Lua/s578744479.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s578744479", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local mma = math.max\nlocal mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegForAvl = {}\nSegForAvl.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.stage[i + 1][j * 2 - 1]\n end\n end\nend\nSegForAvl.create = function(self, n)\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n for i = 1, mul do self.stage[stagenum][i] = i end\n self:updateAll()\nend\nSegForAvl.hold = function(self)\n local idx = self.stage[1][1]\n local ridx = idx\n self.stage[self.stagenum][idx] = false\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.stage[i + 1][idx] or self.stage[i + 1][rem]\n idx = dst\n end\n return ridx\nend\nSegForAvl.release = function(self, idx)\n self.stage[self.stagenum][idx] = idx\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.stage[i + 1][idx] or self.stage[i + 1][rem]\n idx = dst\n end\nend\nSegForAvl.new = function(n)\n local obj = {}\n setmetatable(obj, {__index = SegForAvl})\n obj:create(n)\n return obj\nend\n\nlocal SegAvlTree = {}\nSegAvlTree.makenode = function(self, val, parent)\n local i = self.seg:hold()\n self.v[i], self.u[i], self.p[i] = val, true, parent\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 0, 0\n return i\nend\nSegAvlTree.create = function(self, lessthan, n)\n self.lessthan = lessthan\n self.seg = SegForAvl.new(n)\n -- value, leftCount, rightCount, left, right, parent, used\n self.v, self.lc, self.rc, self.l, self.r, self.p, self.u = {}, {}, {}, {}, {}, {}, {}\n for i = 1, n do\n self.v[i], self.u[i], self.p[i] = 0, false, 0\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 0, 0\n end\nend\n\nSegAvlTree.recalcCount = function(self, i)\n if self.u[i] then\n if self.u[self.l[i]] then self.lc[i] = 1 + mma(self.lc[self.l[i]], self.rc[self.l[i]])\n else self.lc[i] = 0\n end\n if self.u[self.r[i]] then self.rc[i] = 1 + mma(self.lc[self.r[i]], self.rc[self.r[i]])\n else self.rc[i] = 0\n end\n end\nend\nSegAvlTree.recalcCountAll = function(self, i)\n while self.u[i] do\n self:recalcCount(i)\n i = self.p[i]\n end\nend\n\nSegAvlTree.rotR = function(self, child, parent)\n local granp = self.p[parent]\n self.r[child], self.l[parent] = parent, self.r[child]\n self.p[child], self.p[parent] = granp, child\n if self.u[self.l[parent]] then self.p[self.l[parent]] = parent end\n if self.u[granp] then\n if self.l[granp] == parent then\n self.l[granp] = child\n else\n self.r[granp] = child\n end\n else\n self.root = child\n end\n self:recalcCountAll(parent)\nend\n\nSegAvlTree.rotL = function(self, child, parent)\n local granp = self.p[parent]\n self.l[child], self.r[parent] = parent, self.l[child]\n self.p[child], self.p[parent] = granp, child\n if self.u[self.r[parent]] then self.p[self.r[parent]] = parent end\n if self.u[granp] then\n if self.r[granp] == parent then\n self.r[granp] = child\n else\n self.l[granp] = child\n end\n else\n self.root = child\n end\n self:recalcCountAll(parent)\nend\n\nSegAvlTree.add = function(self, val)\n if not self.u[self.root] then self.root = self:makenode(val, 0) return end\n local pos = self.root\n local added = false\n while not added do\n if self.lessthan(val, self.v[pos]) then\n if self.u[self.l[pos]] then\n pos = self.l[pos]\n else\n self.l[pos] = self:makenode(val, pos)\n pos = self.l[pos]\n added = true\n end\n else\n if self.u[self.r[pos]] then\n pos = self.r[pos]\n else\n self.r[pos] = self:makenode(val, pos)\n pos = self.r[pos]\n added = true\n end\n end\n end\n while self.u[pos] do\n local child, parent = pos, self.p[pos]\n if not self.u[parent] then\n break\n end\n self:recalcCount(parent)\n if self.l[parent] == child then\n if self.lc[parent] - 1 == self.rc[parent] then\n pos = parent\n elseif self.lc[parent] - 2 == self.rc[parent] then\n self:recalcCount(child)\n if self.lc[child] - 1 == self.rc[child] then\n self:rotR(child, parent)\n else\n local cr = self.r[child]\n self:rotL(cr, child)\n self:rotR(cr, parent)\n end\n pos = nil\n else\n self:recalcCountAll(child)\n pos = nil\n end\n else -- parent.r == child\n if self.rc[parent] - 1 == self.lc[parent] then\n pos = parent\n elseif self.rc[parent] - 2 == self.lc[parent] then\n self:recalcCount(child)\n if self.rc[child] - 1 == self.lc[child] then\n self:rotL(child, parent)\n else\n local cl = self.l[child]\n self:rotR(cl, child)\n self:rotL(cl, parent)\n end\n pos = nil\n else\n self:recalcCountAll(child)\n pos = nil\n end\n end\n end\nend\n\nSegAvlTree.rmsub = function(self, node)\n while self.u[node] do\n self:recalcCount(node)\n if self.lc[node] == self.rc[node] then\n node = self.p[node]\n elseif self.lc[node] + 1 == self.rc[node] then\n self:recalcCountAll(self.p[node])\n node = nil\n else\n if self.lc[self.r[node]] == self.rc[self.r[node]] then\n self:rotL(self.r[node], node)\n self:recalcCountAll(node)\n node = nil\n elseif self.lc[self.r[node]] + 1 == self.rc[self.r[node]] then\n local nr = self.r[node]\n self:rotL(nr, node)\n node = nr\n else\n local nrl = self.l[self.r[node]]\n self:rotR(nrl, self.r[node])\n self:rotL(nrl, node)\n node = nrl\n end\n end\n end\nend\n\nSegAvlTree.pop = function(self)\n local node = self.root\n while self.u[self.l[node]] do\n node = self.l[node]\n end\n local v = self.v[node]\n if self.u[self.p[node]] then\n if self.u[self.r[node]] then self.p[self.r[node]] = self.p[node] end\n self.l[self.p[node]] = self.r[node]\n self:rmsub(self.p[node])\n else\n if self.r[node] then self.p[self.r[node]] = 0 end\n self.root = self.r[node]\n end\n self.seg:release(node)\n return v\nend\n\nSegAvlTree.new = function(lessthan, n)\n local obj = {}\n setmetatable(obj, {__index = SegAvlTree})\n obj:create(lessthan, n)\n return obj\nend\n\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal ps, qs, cs = {}, {}, {}\nlocal companies = {}\nlocal stations = {}\nfor i = 1, n do\n stations[i] = {}\nend\nfor i = 1, m do\n local p, q, c = io.read(\"*n\", \"*n\", \"*n\")\n if not companies[c] then companies[c] = {} end\n if stations[p][c] and stations[q][c] then\n if stations[p][c] ~= stations[q][c] then\n local ci_p, ci_q = stations[p][c], stations[q][c]\n if #companies[c][ci_p] < #companies[c][ci_q] then\n for j = 1, #companies[c][ci_p] do\n local st = companies[c][ci_p][j]\n stations[st][c] = ci_q\n table.insert(companies[c][ci_q], st)\n end\n companies[c][ci_p] = {}\n else\n for j = 1, #companies[c][ci_q] do\n local st = companies[c][ci_q][j]\n stations[st][c] = ci_p\n table.insert(companies[c][ci_p], st)\n end\n companies[c][ci_q] = {}\n end\n end\n elseif not stations[p][c] and not stations[q][c] then\n table.insert(companies[c], {p, q})\n stations[p][c] = #companies[c]\n stations[q][c] = #companies[c]\n elseif stations[p][c] then\n local idx = stations[p][c]\n stations[q][c] = idx\n table.insert(companies[c][idx], q)\n else\n local idx = stations[q][c]\n stations[p][c] = idx\n table.insert(companies[c][idx], p)\n end\nend\nlocal len = {}\nlocal asked = {}\nlocal tasknum = 0\nlocal done = 0\nlocal tasktree = SegAvlTree.new(function(x, y) return len[x[1]][x[2]] < len[y[1]][y[2]] end, 200000)\nfor i = 1, n do\n asked[i] = false\n len[i] = {}\n for company, group in pairs(stations[i]) do\n len[i][company] = -1\n end\nend\nlocal function addtask(station, company)\n tasknum = tasknum + 1\n tasktree:add({station, company})\nend\nfor company, group in pairs(stations[1]) do\n len[1][company] = 1\n addtask(1, company)\nend\nlocal e,f = 0,0\nwhile done < tasknum do\n done = done + 1\n local taskidx = tasktree:pop()\n local src_station, src_company = taskidx[1], taskidx[2]\n local src_group = stations[src_station][src_company]\n local srclen = len[src_station][src_company]\n if not asked[src_station] then\n asked[src_station] = true\n for dst_company, _g in pairs(stations[src_station]) do\n if src_company ~= dst_company then\n local dstlen = len[src_station][dst_company]\n if dstlen == -1 or srclen + 1 < dstlen then\n len[src_station][dst_company] = srclen + 1\n addtask(src_station, dst_company)\n end\n end\n end\n end\n if 0 < #companies[src_company][src_group] then\n for i = 1, #companies[src_company][src_group] do\n local dst_station = companies[src_company][src_group][i]\n local dstlen = len[dst_station][src_company]\n if dstlen == -1 or srclen < dstlen then\n len[dst_station][src_company] = srclen\n addtask(dst_station, src_company)\n end\n end\n companies[src_company][src_group] = {}\n end\nend\nlocal ret = -1\nlocal mmi = math.min\nfor company, group in pairs(stations[n]) do\n local dstlen = len[n][company]\n if 0 < dstlen then\n if ret == -1 then\n ret = dstlen\n else\n ret = mmi(ret, dstlen)\n end\n end\nend\nprint(ret)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke's town has a subway system, consisting of N stations and M railway lines. The stations are numbered 1 through N. Each line is operated by a company. Each company has an identification number.\n\nThe i-th ( 1 \\leq i \\leq M ) line connects station p_i and q_i bidirectionally. There is no intermediate station. This line is operated by company c_i.\n\nYou can change trains at a station where multiple lines are available.\n\nThe fare system used in this subway system is a bit strange. When a passenger only uses lines that are operated by the same company, the fare is 1 yen (the currency of Japan). Whenever a passenger changes to a line that is operated by a different company from the current line, the passenger is charged an additional fare of 1 yen. In a case where a passenger who changed from some company A's line to another company's line changes to company A's line again, the additional fare is incurred again.\n\nSnuke is now at station 1 and wants to travel to station N by subway. Find the minimum required fare.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 2×10^5\n\n1 \\leq p_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq q_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq c_i \\leq 10^6 (1 \\leq i \\leq M)\n\np_i \\neq q_i (1 \\leq i \\leq M)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\np_1 q_1 c_1\n:\np_M q_M c_M\n\nOutput\n\nPrint the minimum required fare. If it is impossible to get to station N by subway, print -1 instead.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n3 1 2\n\nSample Output 1\n\n1\n\nUse company 1's lines: 1 → 2 → 3. The fare is 1 yen.\n\nSample Input 2\n\n8 11\n1 3 1\n1 4 2\n2 3 1\n2 5 1\n3 4 3\n3 6 3\n3 7 3\n4 8 4\n5 6 1\n6 7 5\n7 8 5\n\nSample Output 2\n\n2\n\nFirst, use company 1's lines: 1 → 3 → 2 → 5 → 6. Then, use company 5's lines: 6 → 7 → 8. The fare is 2 yen.\n\nSample Input 3\n\n2 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 2 1\n2 3 1\n3 1 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p04003", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke's town has a subway system, consisting of N stations and M railway lines. The stations are numbered 1 through N. Each line is operated by a company. Each company has an identification number.\n\nThe i-th ( 1 \\leq i \\leq M ) line connects station p_i and q_i bidirectionally. There is no intermediate station. This line is operated by company c_i.\n\nYou can change trains at a station where multiple lines are available.\n\nThe fare system used in this subway system is a bit strange. When a passenger only uses lines that are operated by the same company, the fare is 1 yen (the currency of Japan). Whenever a passenger changes to a line that is operated by a different company from the current line, the passenger is charged an additional fare of 1 yen. In a case where a passenger who changed from some company A's line to another company's line changes to company A's line again, the additional fare is incurred again.\n\nSnuke is now at station 1 and wants to travel to station N by subway. Find the minimum required fare.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 2×10^5\n\n1 \\leq p_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq q_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq c_i \\leq 10^6 (1 \\leq i \\leq M)\n\np_i \\neq q_i (1 \\leq i \\leq M)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\np_1 q_1 c_1\n:\np_M q_M c_M\n\nOutput\n\nPrint the minimum required fare. If it is impossible to get to station N by subway, print -1 instead.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n3 1 2\n\nSample Output 1\n\n1\n\nUse company 1's lines: 1 → 2 → 3. The fare is 1 yen.\n\nSample Input 2\n\n8 11\n1 3 1\n1 4 2\n2 3 1\n2 5 1\n3 4 3\n3 6 3\n3 7 3\n4 8 4\n5 6 1\n6 7 5\n7 8 5\n\nSample Output 2\n\n2\n\nFirst, use company 1's lines: 1 → 3 → 2 → 5 → 6. Then, use company 5's lines: 6 → 7 → 8. The fare is 2 yen.\n\nSample Input 3\n\n2 0\n\nSample Output 3\n\n-1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 9608, "cpu_time_ms": 2148, "memory_kb": 120728}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s851202499", "group_id": "codeNet:p04003", "input_text": "local mma = math.max\nlocal mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegForAvl = {}\nlocal segavl_mergefunc = function(x, y)\n if x and y then return mmi(x, y)\n elseif x then return x\n elseif y then return y\n else return false end\nend\nSegForAvl.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.stage[i + 1][j * 2 - 1]\n end\n end\nend\nSegForAvl.create = function(self, n)\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n for i = 1, mul do self.stage[stagenum][i] = i end\n self:updateAll()\nend\nSegForAvl.hold = function(self)\n local idx = self.stage[1][1]\n local ridx = idx\n self.stage[self.stagenum][idx] = false\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = segavl_mergefunc(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n return ridx\nend\nSegForAvl.release = function(self, idx)\n self.stage[self.stagenum][idx] = idx\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = segavl_mergefunc(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\nend\nSegForAvl.new = function(n)\n local obj = {}\n setmetatable(obj, {__index = SegForAvl})\n obj:create(n)\n return obj\nend\n\nlocal SegAvlTree = {}\nSegAvlTree.makenode = function(self, val, parent)\n local i = self.seg:hold()\n self.v[i], self.u[i], self.p[i] = val, true, parent\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 0, 0\n return i\nend\nSegAvlTree.create = function(self, lessthan, n)\n self.lessthan = lessthan\n self.seg = SegForAvl.new(n)\n -- value, leftCount, rightCount, left, right, parent, used\n self.v, self.lc, self.rc, self.l, self.r, self.p, self.u = {}, {}, {}, {}, {}, {}, {}\n for i = 1, n do\n self.v[i], self.u[i], self.p[i] = 0, false, 0\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 0, 0\n end\nend\n\nSegAvlTree.recalcCount = function(self, i)\n if self.u[i] then\n if self.u[self.l[i]] then self.lc[i] = 1 + mma(self.lc[self.l[i]], self.rc[self.l[i]])\n else self.lc[i] = 0\n end\n if self.u[self.r[i]] then self.rc[i] = 1 + mma(self.lc[self.r[i]], self.rc[self.r[i]])\n else self.rc[i] = 0\n end\n end\nend\nSegAvlTree.recalcCountAll = function(self, i)\n while self.u[i] do\n self:recalcCount(i)\n i = self.p[i]\n end\nend\n\nSegAvlTree.rotR = function(self, child, parent)\n local granp = self.p[parent]\n self.r[child], self.l[parent] = parent, self.r[child]\n self.p[child], self.p[parent] = granp, child\n if self.u[self.l[parent]] then self.p[self.l[parent]] = parent end\n if self.u[granp] then\n if self.l[granp] == parent then\n self.l[granp] = child\n else\n self.r[granp] = child\n end\n else\n self.root = child\n end\n self:recalcCountAll(parent)\nend\n\nSegAvlTree.rotL = function(self, child, parent)\n local granp = self.p[parent]\n self.l[child], self.r[parent] = parent, self.l[child]\n self.p[child], self.p[parent] = granp, child\n if self.u[self.r[parent]] then self.p[self.r[parent]] = parent end\n if self.u[granp] then\n if self.r[granp] == parent then\n self.r[granp] = child\n else\n self.l[granp] = child\n end\n else\n self.root = child\n end\n self:recalcCountAll(parent)\nend\n\nSegAvlTree.add = function(self, val)\n if not self.u[self.root] then self.root = self:makenode(val, 0) return end\n local pos = self.root\n local added = false\n while not added do\n if self.lessthan(val, self.v[pos]) then\n if self.u[self.l[pos]] then\n pos = self.l[pos]\n else\n self.l[pos] = self:makenode(val, pos)\n pos = self.l[pos]\n added = true\n end\n else\n if self.u[self.r[pos]] then\n pos = self.r[pos]\n else\n self.r[pos] = self:makenode(val, pos)\n pos = self.r[pos]\n added = true\n end\n end\n end\n while self.u[pos] do\n local child, parent = pos, self.p[pos]\n if not self.u[parent] then\n break\n end\n self:recalcCount(parent)\n if self.l[parent] == child then\n if self.lc[parent] - 1 == self.rc[parent] then\n pos = parent\n elseif self.lc[parent] - 2 == self.rc[parent] then\n self:recalcCount(child)\n if self.lc[child] - 1 == self.rc[child] then\n self:rotR(child, parent)\n else\n local cr = self.r[child]\n self:rotL(cr, child)\n self:rotR(cr, parent)\n end\n self:recalcCountAll(child)\n pos = nil\n else\n self:recalcCountAll(child)\n pos = nil\n end\n else -- parent.r == child\n if self.rc[parent] - 1 == self.lc[parent] then\n pos = parent\n elseif self.rc[parent] - 2 == self.lc[parent] then\n self:recalcCount(child)\n if self.rc[child] - 1 == self.lc[child] then\n self:rotL(child, parent)\n else\n local cl = self.l[child]\n self:rotR(cl, child)\n self:rotL(cl, parent)\n end\n self:recalcCountAll(child)\n pos = nil\n else\n self:recalcCountAll(child)\n pos = nil\n end\n end\n end\nend\n\nSegAvlTree.rmsub = function(self, node)\n while self.u[node] do\n self:recalcCount(node)\n if self.lc[node] == self.rc[node] then\n node = self.p[node]\n elseif self.lc[node] + 1 == self.rc[node] then\n self:recalcCountAll(self.p[node])\n node = nil\n else\n if self.lc[self.r[node]] == self.rc[self.r[node]] then\n self:rotL(self.r[node], node)\n self:recalcCountAll(node)\n node = nil\n elseif self.lc[self.r[node]] + 1 == self.rc[self.r[node]] then\n local nr = self.r[node]\n self:rotL(nr, node)\n node = nr\n else\n local nrl = self.l[self.r[node]]\n self:rotR(nrl, self.r[node])\n self:rotL(nrl, node)\n node = nrl\n end\n end\n end\nend\n\nSegAvlTree.pop = function(self)\n local node = self.root\n while self.u[self.l[node]] do\n node = self.l[node]\n end\n local v = self.v[node]\n if self.u[self.p[node]] then\n if self.u[self.r[node]] then self.p[self.r[node]] = self.p[node] end\n self.l[self.p[node]] = self.r[node]\n self:rmsub(self.p[node])\n else\n if self.r[node] then self.p[self.r[node]] = 0 end\n self.root = self.r[node]\n end\n self.seg:release(node)\n return v\nend\n\nSegAvlTree.new = function(lessthan, n)\n local obj = {}\n setmetatable(obj, {__index = SegAvlTree})\n obj:create(lessthan, n)\n return obj\nend\n\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal ps, qs, cs = {}, {}, {}\nlocal companies = {}\nlocal stations = {}\nfor i = 1, n do\n stations[i] = {}\nend\nfor i = 1, m do\n local p, q, c = io.read(\"*n\", \"*n\", \"*n\")\n if not companies[c] then companies[c] = {} end\n if stations[p][c] and stations[q][c] then\n if stations[p][c] ~= stations[q][c] then\n local ci_p, ci_q = stations[p][c], stations[q][c]\n if #companies[c][ci_p] < #companies[c][ci_q] then\n for j = 1, #companies[c][ci_p] do\n local st = companies[c][ci_p][j]\n stations[st][c] = ci_q\n table.insert(companies[c][ci_q], st)\n end\n companies[c][ci_p] = {}\n else\n for j = 1, #companies[c][ci_q] do\n local st = companies[c][ci_q][j]\n stations[st][c] = ci_p\n table.insert(companies[c][ci_p], st)\n end\n companies[c][ci_q] = {}\n end\n end\n elseif not stations[p][c] and not stations[q][c] then\n table.insert(companies[c], {p, q})\n stations[p][c] = #companies[c]\n stations[q][c] = #companies[c]\n elseif stations[p][c] then\n local idx = stations[p][c]\n stations[q][c] = idx\n table.insert(companies[c][idx], q)\n else\n local idx = stations[q][c]\n stations[p][c] = idx\n table.insert(companies[c][idx], p)\n end\nend\nlocal len = {}\nlocal tasknum = 0\nlocal done = 0\nlocal tasktree = SegAvlTree.new(function(x, y) return len[x[1]][x[2]] < len[y[1]][y[2]] end, 200000)\nfor company, groups in pairs(companies) do\n len[company] = {}\n for i = 1, #groups do\n len[company][i] = -1\n end\nend\nlocal function addtask(company, group)\n tasknum = tasknum + 1\n tasktree:add({company, group})\nend\nfor company, group in pairs(stations[1]) do\n len[company][group] = 1\n addtask(company, group)\nend\nwhile done < tasknum do\n done = done + 1\n local taskidx = tasktree:pop()\n local src_company, src_group =taskidx[1], taskidx[2]\n local srclen = len[src_company][src_group]\n for i = 1, #companies[src_company][src_group] do\n local station = companies[src_company][src_group][i]\n for dst_company, dst_group in pairs(stations[station]) do\n if src_company ~= dst_company then\n local dstlen = len[dst_company][dst_group]\n if dstlen == -1 or srclen + 1 < dstlen then\n len[dst_company][dst_group] = srclen + 1\n addtask(dst_company, dst_group)\n end\n end\n end\n end\nend\nlocal ret = -1\nlocal mmi = math.min\nfor company, group in pairs(stations[n]) do\n local dstlen = len[company][group]\n if 0 < dstlen then\n if ret == -1 then\n ret = dstlen\n else\n ret = mmi(ret, dstlen)\n end\n end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1567992451, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p04003.html", "problem_id": "p04003", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04003/input.txt", "sample_output_relpath": "derived/input_output/data/p04003/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04003/Lua/s851202499.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s851202499", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local mma = math.max\nlocal mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegForAvl = {}\nlocal segavl_mergefunc = function(x, y)\n if x and y then return mmi(x, y)\n elseif x then return x\n elseif y then return y\n else return false end\nend\nSegForAvl.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.stage[i + 1][j * 2 - 1]\n end\n end\nend\nSegForAvl.create = function(self, n)\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n for i = 1, mul do self.stage[stagenum][i] = i end\n self:updateAll()\nend\nSegForAvl.hold = function(self)\n local idx = self.stage[1][1]\n local ridx = idx\n self.stage[self.stagenum][idx] = false\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = segavl_mergefunc(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n return ridx\nend\nSegForAvl.release = function(self, idx)\n self.stage[self.stagenum][idx] = idx\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = segavl_mergefunc(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\nend\nSegForAvl.new = function(n)\n local obj = {}\n setmetatable(obj, {__index = SegForAvl})\n obj:create(n)\n return obj\nend\n\nlocal SegAvlTree = {}\nSegAvlTree.makenode = function(self, val, parent)\n local i = self.seg:hold()\n self.v[i], self.u[i], self.p[i] = val, true, parent\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 0, 0\n return i\nend\nSegAvlTree.create = function(self, lessthan, n)\n self.lessthan = lessthan\n self.seg = SegForAvl.new(n)\n -- value, leftCount, rightCount, left, right, parent, used\n self.v, self.lc, self.rc, self.l, self.r, self.p, self.u = {}, {}, {}, {}, {}, {}, {}\n for i = 1, n do\n self.v[i], self.u[i], self.p[i] = 0, false, 0\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 0, 0\n end\nend\n\nSegAvlTree.recalcCount = function(self, i)\n if self.u[i] then\n if self.u[self.l[i]] then self.lc[i] = 1 + mma(self.lc[self.l[i]], self.rc[self.l[i]])\n else self.lc[i] = 0\n end\n if self.u[self.r[i]] then self.rc[i] = 1 + mma(self.lc[self.r[i]], self.rc[self.r[i]])\n else self.rc[i] = 0\n end\n end\nend\nSegAvlTree.recalcCountAll = function(self, i)\n while self.u[i] do\n self:recalcCount(i)\n i = self.p[i]\n end\nend\n\nSegAvlTree.rotR = function(self, child, parent)\n local granp = self.p[parent]\n self.r[child], self.l[parent] = parent, self.r[child]\n self.p[child], self.p[parent] = granp, child\n if self.u[self.l[parent]] then self.p[self.l[parent]] = parent end\n if self.u[granp] then\n if self.l[granp] == parent then\n self.l[granp] = child\n else\n self.r[granp] = child\n end\n else\n self.root = child\n end\n self:recalcCountAll(parent)\nend\n\nSegAvlTree.rotL = function(self, child, parent)\n local granp = self.p[parent]\n self.l[child], self.r[parent] = parent, self.l[child]\n self.p[child], self.p[parent] = granp, child\n if self.u[self.r[parent]] then self.p[self.r[parent]] = parent end\n if self.u[granp] then\n if self.r[granp] == parent then\n self.r[granp] = child\n else\n self.l[granp] = child\n end\n else\n self.root = child\n end\n self:recalcCountAll(parent)\nend\n\nSegAvlTree.add = function(self, val)\n if not self.u[self.root] then self.root = self:makenode(val, 0) return end\n local pos = self.root\n local added = false\n while not added do\n if self.lessthan(val, self.v[pos]) then\n if self.u[self.l[pos]] then\n pos = self.l[pos]\n else\n self.l[pos] = self:makenode(val, pos)\n pos = self.l[pos]\n added = true\n end\n else\n if self.u[self.r[pos]] then\n pos = self.r[pos]\n else\n self.r[pos] = self:makenode(val, pos)\n pos = self.r[pos]\n added = true\n end\n end\n end\n while self.u[pos] do\n local child, parent = pos, self.p[pos]\n if not self.u[parent] then\n break\n end\n self:recalcCount(parent)\n if self.l[parent] == child then\n if self.lc[parent] - 1 == self.rc[parent] then\n pos = parent\n elseif self.lc[parent] - 2 == self.rc[parent] then\n self:recalcCount(child)\n if self.lc[child] - 1 == self.rc[child] then\n self:rotR(child, parent)\n else\n local cr = self.r[child]\n self:rotL(cr, child)\n self:rotR(cr, parent)\n end\n self:recalcCountAll(child)\n pos = nil\n else\n self:recalcCountAll(child)\n pos = nil\n end\n else -- parent.r == child\n if self.rc[parent] - 1 == self.lc[parent] then\n pos = parent\n elseif self.rc[parent] - 2 == self.lc[parent] then\n self:recalcCount(child)\n if self.rc[child] - 1 == self.lc[child] then\n self:rotL(child, parent)\n else\n local cl = self.l[child]\n self:rotR(cl, child)\n self:rotL(cl, parent)\n end\n self:recalcCountAll(child)\n pos = nil\n else\n self:recalcCountAll(child)\n pos = nil\n end\n end\n end\nend\n\nSegAvlTree.rmsub = function(self, node)\n while self.u[node] do\n self:recalcCount(node)\n if self.lc[node] == self.rc[node] then\n node = self.p[node]\n elseif self.lc[node] + 1 == self.rc[node] then\n self:recalcCountAll(self.p[node])\n node = nil\n else\n if self.lc[self.r[node]] == self.rc[self.r[node]] then\n self:rotL(self.r[node], node)\n self:recalcCountAll(node)\n node = nil\n elseif self.lc[self.r[node]] + 1 == self.rc[self.r[node]] then\n local nr = self.r[node]\n self:rotL(nr, node)\n node = nr\n else\n local nrl = self.l[self.r[node]]\n self:rotR(nrl, self.r[node])\n self:rotL(nrl, node)\n node = nrl\n end\n end\n end\nend\n\nSegAvlTree.pop = function(self)\n local node = self.root\n while self.u[self.l[node]] do\n node = self.l[node]\n end\n local v = self.v[node]\n if self.u[self.p[node]] then\n if self.u[self.r[node]] then self.p[self.r[node]] = self.p[node] end\n self.l[self.p[node]] = self.r[node]\n self:rmsub(self.p[node])\n else\n if self.r[node] then self.p[self.r[node]] = 0 end\n self.root = self.r[node]\n end\n self.seg:release(node)\n return v\nend\n\nSegAvlTree.new = function(lessthan, n)\n local obj = {}\n setmetatable(obj, {__index = SegAvlTree})\n obj:create(lessthan, n)\n return obj\nend\n\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal ps, qs, cs = {}, {}, {}\nlocal companies = {}\nlocal stations = {}\nfor i = 1, n do\n stations[i] = {}\nend\nfor i = 1, m do\n local p, q, c = io.read(\"*n\", \"*n\", \"*n\")\n if not companies[c] then companies[c] = {} end\n if stations[p][c] and stations[q][c] then\n if stations[p][c] ~= stations[q][c] then\n local ci_p, ci_q = stations[p][c], stations[q][c]\n if #companies[c][ci_p] < #companies[c][ci_q] then\n for j = 1, #companies[c][ci_p] do\n local st = companies[c][ci_p][j]\n stations[st][c] = ci_q\n table.insert(companies[c][ci_q], st)\n end\n companies[c][ci_p] = {}\n else\n for j = 1, #companies[c][ci_q] do\n local st = companies[c][ci_q][j]\n stations[st][c] = ci_p\n table.insert(companies[c][ci_p], st)\n end\n companies[c][ci_q] = {}\n end\n end\n elseif not stations[p][c] and not stations[q][c] then\n table.insert(companies[c], {p, q})\n stations[p][c] = #companies[c]\n stations[q][c] = #companies[c]\n elseif stations[p][c] then\n local idx = stations[p][c]\n stations[q][c] = idx\n table.insert(companies[c][idx], q)\n else\n local idx = stations[q][c]\n stations[p][c] = idx\n table.insert(companies[c][idx], p)\n end\nend\nlocal len = {}\nlocal tasknum = 0\nlocal done = 0\nlocal tasktree = SegAvlTree.new(function(x, y) return len[x[1]][x[2]] < len[y[1]][y[2]] end, 200000)\nfor company, groups in pairs(companies) do\n len[company] = {}\n for i = 1, #groups do\n len[company][i] = -1\n end\nend\nlocal function addtask(company, group)\n tasknum = tasknum + 1\n tasktree:add({company, group})\nend\nfor company, group in pairs(stations[1]) do\n len[company][group] = 1\n addtask(company, group)\nend\nwhile done < tasknum do\n done = done + 1\n local taskidx = tasktree:pop()\n local src_company, src_group =taskidx[1], taskidx[2]\n local srclen = len[src_company][src_group]\n for i = 1, #companies[src_company][src_group] do\n local station = companies[src_company][src_group][i]\n for dst_company, dst_group in pairs(stations[station]) do\n if src_company ~= dst_company then\n local dstlen = len[dst_company][dst_group]\n if dstlen == -1 or srclen + 1 < dstlen then\n len[dst_company][dst_group] = srclen + 1\n addtask(dst_company, dst_group)\n end\n end\n end\n end\nend\nlocal ret = -1\nlocal mmi = math.min\nfor company, group in pairs(stations[n]) do\n local dstlen = len[company][group]\n if 0 < dstlen then\n if ret == -1 then\n ret = dstlen\n else\n ret = mmi(ret, dstlen)\n end\n end\nend\nprint(ret)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke's town has a subway system, consisting of N stations and M railway lines. The stations are numbered 1 through N. Each line is operated by a company. Each company has an identification number.\n\nThe i-th ( 1 \\leq i \\leq M ) line connects station p_i and q_i bidirectionally. There is no intermediate station. This line is operated by company c_i.\n\nYou can change trains at a station where multiple lines are available.\n\nThe fare system used in this subway system is a bit strange. When a passenger only uses lines that are operated by the same company, the fare is 1 yen (the currency of Japan). Whenever a passenger changes to a line that is operated by a different company from the current line, the passenger is charged an additional fare of 1 yen. In a case where a passenger who changed from some company A's line to another company's line changes to company A's line again, the additional fare is incurred again.\n\nSnuke is now at station 1 and wants to travel to station N by subway. Find the minimum required fare.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 2×10^5\n\n1 \\leq p_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq q_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq c_i \\leq 10^6 (1 \\leq i \\leq M)\n\np_i \\neq q_i (1 \\leq i \\leq M)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\np_1 q_1 c_1\n:\np_M q_M c_M\n\nOutput\n\nPrint the minimum required fare. If it is impossible to get to station N by subway, print -1 instead.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n3 1 2\n\nSample Output 1\n\n1\n\nUse company 1's lines: 1 → 2 → 3. The fare is 1 yen.\n\nSample Input 2\n\n8 11\n1 3 1\n1 4 2\n2 3 1\n2 5 1\n3 4 3\n3 6 3\n3 7 3\n4 8 4\n5 6 1\n6 7 5\n7 8 5\n\nSample Output 2\n\n2\n\nFirst, use company 1's lines: 1 → 3 → 2 → 5 → 6. Then, use company 5's lines: 6 → 7 → 8. The fare is 2 yen.\n\nSample Input 3\n\n2 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 2 1\n2 3 1\n3 1 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p04003", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke's town has a subway system, consisting of N stations and M railway lines. The stations are numbered 1 through N. Each line is operated by a company. Each company has an identification number.\n\nThe i-th ( 1 \\leq i \\leq M ) line connects station p_i and q_i bidirectionally. There is no intermediate station. This line is operated by company c_i.\n\nYou can change trains at a station where multiple lines are available.\n\nThe fare system used in this subway system is a bit strange. When a passenger only uses lines that are operated by the same company, the fare is 1 yen (the currency of Japan). Whenever a passenger changes to a line that is operated by a different company from the current line, the passenger is charged an additional fare of 1 yen. In a case where a passenger who changed from some company A's line to another company's line changes to company A's line again, the additional fare is incurred again.\n\nSnuke is now at station 1 and wants to travel to station N by subway. Find the minimum required fare.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 2×10^5\n\n1 \\leq p_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq q_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq c_i \\leq 10^6 (1 \\leq i \\leq M)\n\np_i \\neq q_i (1 \\leq i \\leq M)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\np_1 q_1 c_1\n:\np_M q_M c_M\n\nOutput\n\nPrint the minimum required fare. If it is impossible to get to station N by subway, print -1 instead.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n3 1 2\n\nSample Output 1\n\n1\n\nUse company 1's lines: 1 → 2 → 3. The fare is 1 yen.\n\nSample Input 2\n\n8 11\n1 3 1\n1 4 2\n2 3 1\n2 5 1\n3 4 3\n3 6 3\n3 7 3\n4 8 4\n5 6 1\n6 7 5\n7 8 5\n\nSample Output 2\n\n2\n\nFirst, use company 1's lines: 1 → 3 → 2 → 5 → 6. Then, use company 5's lines: 6 → 7 → 8. The fare is 2 yen.\n\nSample Input 3\n\n2 0\n\nSample Output 3\n\n-1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 9394, "cpu_time_ms": 3161, "memory_kb": 100932}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s873711791", "group_id": "codeNet:p04003", "input_text": "local mma = math.max\nlocal mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegForAvl = {}\nlocal segavl_mergefunc = function(x, y)\n if x and y then return mmi(x, y)\n elseif x then return x\n elseif y then return y\n else return false end\nend\nSegForAvl.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.stage[i + 1][j * 2 - 1]\n end\n end\nend\nSegForAvl.create = function(self, n)\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n for i = 1, mul do self.stage[stagenum][i] = i end\n self:updateAll()\nend\nSegForAvl.hold = function(self)\n local idx = self.stage[1][1]\n local ridx = idx\n self.stage[self.stagenum][idx] = false\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = segavl_mergefunc(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n return ridx\nend\nSegForAvl.release = function(self, idx)\n self.stage[self.stagenum][idx] = idx\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = segavl_mergefunc(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\nend\nSegForAvl.new = function(n)\n local obj = {}\n setmetatable(obj, {__index = SegForAvl})\n obj:create(n)\n return obj\nend\n\nlocal SegAvlTree = {}\nSegAvlTree.makenode = function(self, val, parent)\n local i = self.seg:hold()\n self.v[i], self.u[i], self.p[i] = val, true, parent\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 0, 0\n return i\nend\nSegAvlTree.create = function(self, lessthan, n)\n self.lessthan = lessthan\n self.seg = SegForAvl.new(n)\n -- value, leftCount, rightCount, left, right, parent, used\n self.v, self.lc, self.rc, self.l, self.r, self.p, self.u = {}, {}, {}, {}, {}, {}, {}\n for i = 1, n do\n self.v[i], self.u[i], self.p[i] = 0, false, 0\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 0, 0\n end\nend\n\nSegAvlTree.recalcCount = function(self, i)\n if self.u[i] then\n if self.u[self.l[i]] then self.lc[i] = 1 + mma(self.lc[self.l[i]], self.rc[self.l[i]])\n else self.lc[i] = 0\n end\n if self.u[self.r[i]] then self.rc[i] = 1 + mma(self.lc[self.r[i]], self.rc[self.r[i]])\n else self.rc[i] = 0\n end\n end\nend\nSegAvlTree.recalcCountAll = function(self, i)\n while self.u[i] do\n self:recalcCount(i)\n i = self.p[i]\n end\nend\n\nSegAvlTree.rotR = function(self, child, parent)\n local granp = self.p[parent]\n self.r[child], self.l[parent] = parent, self.r[child]\n self.p[child], self.p[parent] = granp, child\n if self.u[self.l[parent]] then self.p[self.l[parent]] = parent end\n if self.u[granp] then\n if self.l[granp] == parent then\n self.l[granp] = child\n else\n self.r[granp] = child\n end\n else\n self.root = child\n end\n self:recalcCountAll(parent)\nend\n\nSegAvlTree.rotL = function(self, child, parent)\n local granp = self.p[parent]\n self.l[child], self.r[parent] = parent, self.l[child]\n self.p[child], self.p[parent] = granp, child\n if self.u[self.r[parent]] then self.p[self.r[parent]] = parent end\n if self.u[granp] then\n if self.r[granp] == parent then\n self.r[granp] = child\n else\n self.l[granp] = child\n end\n else\n self.root = child\n end\n self:recalcCountAll(parent)\nend\n\nSegAvlTree.add = function(self, val)\n if not self.root then self.root = self:makenode(val, 0) return end\n local pos = self.root\n local added = false\n while not added do\n if self.lessthan(val, self.v[pos]) then\n if self.u[self.l[pos]] then\n pos = self.l[pos]\n else\n self.l[pos] = self:makenode(val, pos)\n pos = self.l[pos]\n added = true\n end\n else\n if self.u[self.r[pos]] then\n pos = self.r[pos]\n else\n self.r[pos] = self:makenode(val, pos)\n pos = self.r[pos]\n added = true\n end\n end\n end\n while self.u[pos] do\n local child, parent = pos, self.p[pos]\n if not self.u[parent] then\n break\n end\n self:recalcCount(parent)\n if self.l[parent] == child then\n if self.lc[parent] - 1 == self.rc[parent] then\n pos = parent\n elseif self.lc[parent] - 2 == self.rc[parent] then\n self:recalcCount(child)\n if self.lc[child] - 1 == self.rc[child] then\n self:rotR(child, parent)\n else\n local cr = self.r[child]\n self:rotL(cr, child)\n self:rotR(cr, parent)\n end\n self:recalcCountAll(child)\n pos = nil\n else\n self:recalcCountAll(child)\n pos = nil\n end\n else -- parent.r == child\n if self.rc[parent] - 1 == self.lc[parent] then\n pos = parent\n elseif self.rc[parent] - 2 == self.lc[parent] then\n self:recalcCount(child)\n if self.rc[child] - 1 == self.lc[child] then\n self:rotL(child, parent)\n else\n local cl = self.l[child]\n self:rotR(cl, child)\n self:rotL(cl, parent)\n end\n self:recalcCountAll(child)\n pos = nil\n else\n self:recalcCountAll(child)\n pos = nil\n end\n end\n end\nend\n\nSegAvlTree.rmsub = function(self, node)\n while self.u[node] do\n self:recalcCount(node)\n if self.lc[node] == self.rc[node] then\n node = self.p[node]\n elseif self.lc[node] + 1 == self.rc[node] then\n self:recalcCountAll(self.p[node])\n node = nil\n else\n if self.lc[self.r[node]] == self.rc[self.r[node]] then\n self:rotL(self.r[node], node)\n self:recalcCountAll(node)\n node = nil\n elseif self.lc[self.r[node]] + 1 == self.rc[self.r[node]] then\n local nr = self.r[node]\n self:rotL(nr, node)\n node = nr\n else\n local nrl = self.l[self.r[node]]\n self:rotR(nrl, self.r[node])\n self:rotL(nrl, node)\n node = nrl\n end\n end\n end\nend\n\nSegAvlTree.pop = function(self)\n local node = self.root\n while self.u[self.l[node]] do\n node = self.l[node]\n end\n local v = self.v[node]\n if self.u[self.p[node]] then\n if self.u[self.r[node]] then self.p[self.r[node]] = self.p[node] end\n self.l[self.p[node]] = self.r[node]\n self:rmsub(self.p[node])\n else\n if self.r[node] then self.p[self.r[node]] = 0 end\n self.root = self.r[node]\n end\n self.seg:release(node)\n return v\nend\n\nSegAvlTree.new = function(lessthan, n)\n local obj = {}\n setmetatable(obj, {__index = SegAvlTree})\n obj:create(lessthan, n)\n return obj\nend\n\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal ps, qs, cs = {}, {}, {}\nlocal companies = {}\nlocal stations = {}\nfor i = 1, n do\n stations[i] = {}\nend\nfor i = 1, m do\n local p, q, c = io.read(\"*n\", \"*n\", \"*n\")\n if not companies[c] then companies[c] = {} end\n if stations[p][c] and stations[q][c] then\n if stations[p][c] ~= stations[q][c] then\n local ci_p, ci_q = stations[p][c], stations[q][c]\n if #companies[c][ci_p] < #companies[c][ci_q] then\n for j = 1, #companies[c][ci_p] do\n local st = companies[c][ci_p][j]\n stations[st][c] = ci_q\n table.insert(companies[c][ci_q], st)\n end\n companies[c][ci_p] = {}\n else\n for j = 1, #companies[c][ci_q] do\n local st = companies[c][ci_q][j]\n stations[st][c] = ci_p\n table.insert(companies[c][ci_p], st)\n end\n companies[c][ci_q] = {}\n end\n end\n elseif not stations[p][c] and not stations[q][c] then\n table.insert(companies[c], {p, q})\n stations[p][c] = #companies[c]\n stations[q][c] = #companies[c]\n elseif stations[p][c] then\n local idx = stations[p][c]\n stations[q][c] = idx\n table.insert(companies[c][idx], q)\n else\n local idx = stations[q][c]\n stations[p][c] = idx\n table.insert(companies[c][idx], p)\n end\nend\nlocal len = {}\nlocal tasknum = 0\nlocal done = 0\nlocal tasktree = SegAvlTree.new(function(x, y) return len[x[1]][x[2]] < len[y[1]][y[2]] end, 200000)\nfor company, groups in pairs(companies) do\n len[company] = {}\n for i = 1, #groups do\n len[company][i] = -1\n end\nend\nlocal function addtask(company, group)\n tasknum = tasknum + 1\n tasktree:add({company, group})\nend\nfor company, group in pairs(stations[1]) do\n len[company][group] = 1\n addtask(company, group)\nend\nwhile done < tasknum do\n done = done + 1\n local taskidx = tasktree:pop()\n local src_company, src_group =taskidx[1], taskidx[2]\n local srclen = len[src_company][src_group]\n for i = 1, #companies[src_company][src_group] do\n local station = companies[src_company][src_group][i]\n for dst_company, dst_group in pairs(stations[station]) do\n if src_company ~= dst_company then\n local dstlen = len[dst_company][dst_group]\n if dstlen == -1 or srclen + 1 < dstlen then\n len[dst_company][dst_group] = srclen + 1\n addtask(dst_company, dst_group)\n end\n end\n end\n end\nend\nlocal ret = -1\nlocal mmi = math.min\nfor company, group in pairs(stations[n]) do\n local dstlen = len[company][group]\n if 0 < dstlen then\n if ret == -1 then\n ret = dstlen\n else\n ret = mmi(ret, dstlen)\n end\n end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1567991721, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p04003.html", "problem_id": "p04003", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04003/input.txt", "sample_output_relpath": "derived/input_output/data/p04003/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04003/Lua/s873711791.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s873711791", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local mma = math.max\nlocal mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal SegForAvl = {}\nlocal segavl_mergefunc = function(x, y)\n if x and y then return mmi(x, y)\n elseif x then return x\n elseif y then return y\n else return false end\nend\nSegForAvl.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.stage[i + 1][j * 2 - 1]\n end\n end\nend\nSegForAvl.create = function(self, n)\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n for i = 1, mul do self.stage[stagenum][i] = i end\n self:updateAll()\nend\nSegForAvl.hold = function(self)\n local idx = self.stage[1][1]\n local ridx = idx\n self.stage[self.stagenum][idx] = false\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = segavl_mergefunc(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n return ridx\nend\nSegForAvl.release = function(self, idx)\n self.stage[self.stagenum][idx] = idx\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = segavl_mergefunc(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\nend\nSegForAvl.new = function(n)\n local obj = {}\n setmetatable(obj, {__index = SegForAvl})\n obj:create(n)\n return obj\nend\n\nlocal SegAvlTree = {}\nSegAvlTree.makenode = function(self, val, parent)\n local i = self.seg:hold()\n self.v[i], self.u[i], self.p[i] = val, true, parent\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 0, 0\n return i\nend\nSegAvlTree.create = function(self, lessthan, n)\n self.lessthan = lessthan\n self.seg = SegForAvl.new(n)\n -- value, leftCount, rightCount, left, right, parent, used\n self.v, self.lc, self.rc, self.l, self.r, self.p, self.u = {}, {}, {}, {}, {}, {}, {}\n for i = 1, n do\n self.v[i], self.u[i], self.p[i] = 0, false, 0\n self.lc[i], self.rc[i], self.l[i], self.r[i] = 0, 0, 0, 0\n end\nend\n\nSegAvlTree.recalcCount = function(self, i)\n if self.u[i] then\n if self.u[self.l[i]] then self.lc[i] = 1 + mma(self.lc[self.l[i]], self.rc[self.l[i]])\n else self.lc[i] = 0\n end\n if self.u[self.r[i]] then self.rc[i] = 1 + mma(self.lc[self.r[i]], self.rc[self.r[i]])\n else self.rc[i] = 0\n end\n end\nend\nSegAvlTree.recalcCountAll = function(self, i)\n while self.u[i] do\n self:recalcCount(i)\n i = self.p[i]\n end\nend\n\nSegAvlTree.rotR = function(self, child, parent)\n local granp = self.p[parent]\n self.r[child], self.l[parent] = parent, self.r[child]\n self.p[child], self.p[parent] = granp, child\n if self.u[self.l[parent]] then self.p[self.l[parent]] = parent end\n if self.u[granp] then\n if self.l[granp] == parent then\n self.l[granp] = child\n else\n self.r[granp] = child\n end\n else\n self.root = child\n end\n self:recalcCountAll(parent)\nend\n\nSegAvlTree.rotL = function(self, child, parent)\n local granp = self.p[parent]\n self.l[child], self.r[parent] = parent, self.l[child]\n self.p[child], self.p[parent] = granp, child\n if self.u[self.r[parent]] then self.p[self.r[parent]] = parent end\n if self.u[granp] then\n if self.r[granp] == parent then\n self.r[granp] = child\n else\n self.l[granp] = child\n end\n else\n self.root = child\n end\n self:recalcCountAll(parent)\nend\n\nSegAvlTree.add = function(self, val)\n if not self.root then self.root = self:makenode(val, 0) return end\n local pos = self.root\n local added = false\n while not added do\n if self.lessthan(val, self.v[pos]) then\n if self.u[self.l[pos]] then\n pos = self.l[pos]\n else\n self.l[pos] = self:makenode(val, pos)\n pos = self.l[pos]\n added = true\n end\n else\n if self.u[self.r[pos]] then\n pos = self.r[pos]\n else\n self.r[pos] = self:makenode(val, pos)\n pos = self.r[pos]\n added = true\n end\n end\n end\n while self.u[pos] do\n local child, parent = pos, self.p[pos]\n if not self.u[parent] then\n break\n end\n self:recalcCount(parent)\n if self.l[parent] == child then\n if self.lc[parent] - 1 == self.rc[parent] then\n pos = parent\n elseif self.lc[parent] - 2 == self.rc[parent] then\n self:recalcCount(child)\n if self.lc[child] - 1 == self.rc[child] then\n self:rotR(child, parent)\n else\n local cr = self.r[child]\n self:rotL(cr, child)\n self:rotR(cr, parent)\n end\n self:recalcCountAll(child)\n pos = nil\n else\n self:recalcCountAll(child)\n pos = nil\n end\n else -- parent.r == child\n if self.rc[parent] - 1 == self.lc[parent] then\n pos = parent\n elseif self.rc[parent] - 2 == self.lc[parent] then\n self:recalcCount(child)\n if self.rc[child] - 1 == self.lc[child] then\n self:rotL(child, parent)\n else\n local cl = self.l[child]\n self:rotR(cl, child)\n self:rotL(cl, parent)\n end\n self:recalcCountAll(child)\n pos = nil\n else\n self:recalcCountAll(child)\n pos = nil\n end\n end\n end\nend\n\nSegAvlTree.rmsub = function(self, node)\n while self.u[node] do\n self:recalcCount(node)\n if self.lc[node] == self.rc[node] then\n node = self.p[node]\n elseif self.lc[node] + 1 == self.rc[node] then\n self:recalcCountAll(self.p[node])\n node = nil\n else\n if self.lc[self.r[node]] == self.rc[self.r[node]] then\n self:rotL(self.r[node], node)\n self:recalcCountAll(node)\n node = nil\n elseif self.lc[self.r[node]] + 1 == self.rc[self.r[node]] then\n local nr = self.r[node]\n self:rotL(nr, node)\n node = nr\n else\n local nrl = self.l[self.r[node]]\n self:rotR(nrl, self.r[node])\n self:rotL(nrl, node)\n node = nrl\n end\n end\n end\nend\n\nSegAvlTree.pop = function(self)\n local node = self.root\n while self.u[self.l[node]] do\n node = self.l[node]\n end\n local v = self.v[node]\n if self.u[self.p[node]] then\n if self.u[self.r[node]] then self.p[self.r[node]] = self.p[node] end\n self.l[self.p[node]] = self.r[node]\n self:rmsub(self.p[node])\n else\n if self.r[node] then self.p[self.r[node]] = 0 end\n self.root = self.r[node]\n end\n self.seg:release(node)\n return v\nend\n\nSegAvlTree.new = function(lessthan, n)\n local obj = {}\n setmetatable(obj, {__index = SegAvlTree})\n obj:create(lessthan, n)\n return obj\nend\n\n\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal ps, qs, cs = {}, {}, {}\nlocal companies = {}\nlocal stations = {}\nfor i = 1, n do\n stations[i] = {}\nend\nfor i = 1, m do\n local p, q, c = io.read(\"*n\", \"*n\", \"*n\")\n if not companies[c] then companies[c] = {} end\n if stations[p][c] and stations[q][c] then\n if stations[p][c] ~= stations[q][c] then\n local ci_p, ci_q = stations[p][c], stations[q][c]\n if #companies[c][ci_p] < #companies[c][ci_q] then\n for j = 1, #companies[c][ci_p] do\n local st = companies[c][ci_p][j]\n stations[st][c] = ci_q\n table.insert(companies[c][ci_q], st)\n end\n companies[c][ci_p] = {}\n else\n for j = 1, #companies[c][ci_q] do\n local st = companies[c][ci_q][j]\n stations[st][c] = ci_p\n table.insert(companies[c][ci_p], st)\n end\n companies[c][ci_q] = {}\n end\n end\n elseif not stations[p][c] and not stations[q][c] then\n table.insert(companies[c], {p, q})\n stations[p][c] = #companies[c]\n stations[q][c] = #companies[c]\n elseif stations[p][c] then\n local idx = stations[p][c]\n stations[q][c] = idx\n table.insert(companies[c][idx], q)\n else\n local idx = stations[q][c]\n stations[p][c] = idx\n table.insert(companies[c][idx], p)\n end\nend\nlocal len = {}\nlocal tasknum = 0\nlocal done = 0\nlocal tasktree = SegAvlTree.new(function(x, y) return len[x[1]][x[2]] < len[y[1]][y[2]] end, 200000)\nfor company, groups in pairs(companies) do\n len[company] = {}\n for i = 1, #groups do\n len[company][i] = -1\n end\nend\nlocal function addtask(company, group)\n tasknum = tasknum + 1\n tasktree:add({company, group})\nend\nfor company, group in pairs(stations[1]) do\n len[company][group] = 1\n addtask(company, group)\nend\nwhile done < tasknum do\n done = done + 1\n local taskidx = tasktree:pop()\n local src_company, src_group =taskidx[1], taskidx[2]\n local srclen = len[src_company][src_group]\n for i = 1, #companies[src_company][src_group] do\n local station = companies[src_company][src_group][i]\n for dst_company, dst_group in pairs(stations[station]) do\n if src_company ~= dst_company then\n local dstlen = len[dst_company][dst_group]\n if dstlen == -1 or srclen + 1 < dstlen then\n len[dst_company][dst_group] = srclen + 1\n addtask(dst_company, dst_group)\n end\n end\n end\n end\nend\nlocal ret = -1\nlocal mmi = math.min\nfor company, group in pairs(stations[n]) do\n local dstlen = len[company][group]\n if 0 < dstlen then\n if ret == -1 then\n ret = dstlen\n else\n ret = mmi(ret, dstlen)\n end\n end\nend\nprint(ret)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke's town has a subway system, consisting of N stations and M railway lines. The stations are numbered 1 through N. Each line is operated by a company. Each company has an identification number.\n\nThe i-th ( 1 \\leq i \\leq M ) line connects station p_i and q_i bidirectionally. There is no intermediate station. This line is operated by company c_i.\n\nYou can change trains at a station where multiple lines are available.\n\nThe fare system used in this subway system is a bit strange. When a passenger only uses lines that are operated by the same company, the fare is 1 yen (the currency of Japan). Whenever a passenger changes to a line that is operated by a different company from the current line, the passenger is charged an additional fare of 1 yen. In a case where a passenger who changed from some company A's line to another company's line changes to company A's line again, the additional fare is incurred again.\n\nSnuke is now at station 1 and wants to travel to station N by subway. Find the minimum required fare.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 2×10^5\n\n1 \\leq p_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq q_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq c_i \\leq 10^6 (1 \\leq i \\leq M)\n\np_i \\neq q_i (1 \\leq i \\leq M)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\np_1 q_1 c_1\n:\np_M q_M c_M\n\nOutput\n\nPrint the minimum required fare. If it is impossible to get to station N by subway, print -1 instead.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n3 1 2\n\nSample Output 1\n\n1\n\nUse company 1's lines: 1 → 2 → 3. The fare is 1 yen.\n\nSample Input 2\n\n8 11\n1 3 1\n1 4 2\n2 3 1\n2 5 1\n3 4 3\n3 6 3\n3 7 3\n4 8 4\n5 6 1\n6 7 5\n7 8 5\n\nSample Output 2\n\n2\n\nFirst, use company 1's lines: 1 → 3 → 2 → 5 → 6. Then, use company 5's lines: 6 → 7 → 8. The fare is 2 yen.\n\nSample Input 3\n\n2 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 2 1\n2 3 1\n3 1 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p04003", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke's town has a subway system, consisting of N stations and M railway lines. The stations are numbered 1 through N. Each line is operated by a company. Each company has an identification number.\n\nThe i-th ( 1 \\leq i \\leq M ) line connects station p_i and q_i bidirectionally. There is no intermediate station. This line is operated by company c_i.\n\nYou can change trains at a station where multiple lines are available.\n\nThe fare system used in this subway system is a bit strange. When a passenger only uses lines that are operated by the same company, the fare is 1 yen (the currency of Japan). Whenever a passenger changes to a line that is operated by a different company from the current line, the passenger is charged an additional fare of 1 yen. In a case where a passenger who changed from some company A's line to another company's line changes to company A's line again, the additional fare is incurred again.\n\nSnuke is now at station 1 and wants to travel to station N by subway. Find the minimum required fare.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 2×10^5\n\n1 \\leq p_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq q_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq c_i \\leq 10^6 (1 \\leq i \\leq M)\n\np_i \\neq q_i (1 \\leq i \\leq M)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\np_1 q_1 c_1\n:\np_M q_M c_M\n\nOutput\n\nPrint the minimum required fare. If it is impossible to get to station N by subway, print -1 instead.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n3 1 2\n\nSample Output 1\n\n1\n\nUse company 1's lines: 1 → 2 → 3. The fare is 1 yen.\n\nSample Input 2\n\n8 11\n1 3 1\n1 4 2\n2 3 1\n2 5 1\n3 4 3\n3 6 3\n3 7 3\n4 8 4\n5 6 1\n6 7 5\n7 8 5\n\nSample Output 2\n\n2\n\nFirst, use company 1's lines: 1 → 3 → 2 → 5 → 6. Then, use company 5's lines: 6 → 7 → 8. The fare is 2 yen.\n\nSample Input 3\n\n2 0\n\nSample Output 3\n\n-1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 9386, "cpu_time_ms": 3160, "memory_kb": 100932}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s863409819", "group_id": "codeNet:p04003", "input_text": "local n, m = io.read(\"*n\", \"*n\")\nlocal ps, qs, cs = {}, {}, {}\nlocal companies = {}\nlocal stations = {}\nfor i = 1, n do\n stations[i] = {}\nend\nfor i = 1, m do\n local p, q, c = io.read(\"*n\", \"*n\", \"*n\")\n if not companies[c] then companies[c] = {} end\n if stations[p][c] and stations[q][c] then\n if stations[p][c] ~= stations[q][c] then\n local ci_p, ci_q = stations[p][c], stations[q][c]\n if #companies[c][ci_p] < #companies[c][ci_q] then\n for j = 1, #companies[c][ci_p] do\n local st = companies[c][ci_p][j]\n stations[st][c] = ci_q\n table.insert(companies[c][ci_q], st)\n end\n companies[c][ci_p] = {}\n else\n for j = 1, #companies[c][ci_q] do\n local st = companies[c][ci_q][j]\n stations[st][c] = ci_p\n table.insert(companies[c][ci_p], st)\n end\n companies[c][ci_q] = {}\n end\n end\n elseif not stations[p][c] and not stations[q][c] then\n table.insert(companies[c], {p, q})\n stations[p][c] = #companies[c]\n stations[q][c] = #companies[c]\n elseif stations[p][c] then\n local idx = stations[p][c]\n stations[q][c] = idx\n table.insert(companies[c][idx], q)\n else\n local idx = stations[q][c]\n stations[p][c] = idx\n table.insert(companies[c][idx], p)\n end\nend\nlocal len = {}\nfor company, groups in pairs(companies) do\n len[company] = {}\n for i = 1, #groups do\n len[company][i] = -1\n end\nend\n\nlocal tasks = {}\nfor company, group in pairs(stations[1]) do\n len[company][group] = 1\n table.insert(tasks, {company, group})\nend\nwhile 0 < #tasks do\n local src_company, src_group = tasks[#tasks][1], tasks[#tasks][2]\n local srclen = len[src_company][src_group]\n table.remove(tasks)\n for i = 1, #companies[src_company][src_group] do\n local station = companies[src_company][src_group][i]\n for dst_company, dst_group in pairs(stations[station]) do\n if src_company ~= dst_company then\n local dstlen = len[dst_company][dst_group]\n if dstlen == -1 or srclen + 1 < dstlen then\n len[dst_company][dst_group] = srclen + 1\n table.insert(tasks, {dst_company, dst_group})\n end\n end\n end\n end\nend\nlocal ret = -1\nlocal mmi = math.min\nfor company, group in pairs(stations[n]) do\n local dstlen = len[company][group]\n if 0 < dstlen then\n if ret == -1 then\n ret = dstlen\n else\n ret = mmi(ret, dstlen)\n end\n end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1567636756, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p04003.html", "problem_id": "p04003", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04003/input.txt", "sample_output_relpath": "derived/input_output/data/p04003/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04003/Lua/s863409819.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s863409819", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local n, m = io.read(\"*n\", \"*n\")\nlocal ps, qs, cs = {}, {}, {}\nlocal companies = {}\nlocal stations = {}\nfor i = 1, n do\n stations[i] = {}\nend\nfor i = 1, m do\n local p, q, c = io.read(\"*n\", \"*n\", \"*n\")\n if not companies[c] then companies[c] = {} end\n if stations[p][c] and stations[q][c] then\n if stations[p][c] ~= stations[q][c] then\n local ci_p, ci_q = stations[p][c], stations[q][c]\n if #companies[c][ci_p] < #companies[c][ci_q] then\n for j = 1, #companies[c][ci_p] do\n local st = companies[c][ci_p][j]\n stations[st][c] = ci_q\n table.insert(companies[c][ci_q], st)\n end\n companies[c][ci_p] = {}\n else\n for j = 1, #companies[c][ci_q] do\n local st = companies[c][ci_q][j]\n stations[st][c] = ci_p\n table.insert(companies[c][ci_p], st)\n end\n companies[c][ci_q] = {}\n end\n end\n elseif not stations[p][c] and not stations[q][c] then\n table.insert(companies[c], {p, q})\n stations[p][c] = #companies[c]\n stations[q][c] = #companies[c]\n elseif stations[p][c] then\n local idx = stations[p][c]\n stations[q][c] = idx\n table.insert(companies[c][idx], q)\n else\n local idx = stations[q][c]\n stations[p][c] = idx\n table.insert(companies[c][idx], p)\n end\nend\nlocal len = {}\nfor company, groups in pairs(companies) do\n len[company] = {}\n for i = 1, #groups do\n len[company][i] = -1\n end\nend\n\nlocal tasks = {}\nfor company, group in pairs(stations[1]) do\n len[company][group] = 1\n table.insert(tasks, {company, group})\nend\nwhile 0 < #tasks do\n local src_company, src_group = tasks[#tasks][1], tasks[#tasks][2]\n local srclen = len[src_company][src_group]\n table.remove(tasks)\n for i = 1, #companies[src_company][src_group] do\n local station = companies[src_company][src_group][i]\n for dst_company, dst_group in pairs(stations[station]) do\n if src_company ~= dst_company then\n local dstlen = len[dst_company][dst_group]\n if dstlen == -1 or srclen + 1 < dstlen then\n len[dst_company][dst_group] = srclen + 1\n table.insert(tasks, {dst_company, dst_group})\n end\n end\n end\n end\nend\nlocal ret = -1\nlocal mmi = math.min\nfor company, group in pairs(stations[n]) do\n local dstlen = len[company][group]\n if 0 < dstlen then\n if ret == -1 then\n ret = dstlen\n else\n ret = mmi(ret, dstlen)\n end\n end\nend\nprint(ret)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke's town has a subway system, consisting of N stations and M railway lines. The stations are numbered 1 through N. Each line is operated by a company. Each company has an identification number.\n\nThe i-th ( 1 \\leq i \\leq M ) line connects station p_i and q_i bidirectionally. There is no intermediate station. This line is operated by company c_i.\n\nYou can change trains at a station where multiple lines are available.\n\nThe fare system used in this subway system is a bit strange. When a passenger only uses lines that are operated by the same company, the fare is 1 yen (the currency of Japan). Whenever a passenger changes to a line that is operated by a different company from the current line, the passenger is charged an additional fare of 1 yen. In a case where a passenger who changed from some company A's line to another company's line changes to company A's line again, the additional fare is incurred again.\n\nSnuke is now at station 1 and wants to travel to station N by subway. Find the minimum required fare.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 2×10^5\n\n1 \\leq p_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq q_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq c_i \\leq 10^6 (1 \\leq i \\leq M)\n\np_i \\neq q_i (1 \\leq i \\leq M)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\np_1 q_1 c_1\n:\np_M q_M c_M\n\nOutput\n\nPrint the minimum required fare. If it is impossible to get to station N by subway, print -1 instead.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n3 1 2\n\nSample Output 1\n\n1\n\nUse company 1's lines: 1 → 2 → 3. The fare is 1 yen.\n\nSample Input 2\n\n8 11\n1 3 1\n1 4 2\n2 3 1\n2 5 1\n3 4 3\n3 6 3\n3 7 3\n4 8 4\n5 6 1\n6 7 5\n7 8 5\n\nSample Output 2\n\n2\n\nFirst, use company 1's lines: 1 → 3 → 2 → 5 → 6. Then, use company 5's lines: 6 → 7 → 8. The fare is 2 yen.\n\nSample Input 3\n\n2 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 2 1\n2 3 1\n3 1 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p04003", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke's town has a subway system, consisting of N stations and M railway lines. The stations are numbered 1 through N. Each line is operated by a company. Each company has an identification number.\n\nThe i-th ( 1 \\leq i \\leq M ) line connects station p_i and q_i bidirectionally. There is no intermediate station. This line is operated by company c_i.\n\nYou can change trains at a station where multiple lines are available.\n\nThe fare system used in this subway system is a bit strange. When a passenger only uses lines that are operated by the same company, the fare is 1 yen (the currency of Japan). Whenever a passenger changes to a line that is operated by a different company from the current line, the passenger is charged an additional fare of 1 yen. In a case where a passenger who changed from some company A's line to another company's line changes to company A's line again, the additional fare is incurred again.\n\nSnuke is now at station 1 and wants to travel to station N by subway. Find the minimum required fare.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 2×10^5\n\n1 \\leq p_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq q_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq c_i \\leq 10^6 (1 \\leq i \\leq M)\n\np_i \\neq q_i (1 \\leq i \\leq M)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\np_1 q_1 c_1\n:\np_M q_M c_M\n\nOutput\n\nPrint the minimum required fare. If it is impossible to get to station N by subway, print -1 instead.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n3 1 2\n\nSample Output 1\n\n1\n\nUse company 1's lines: 1 → 2 → 3. The fare is 1 yen.\n\nSample Input 2\n\n8 11\n1 3 1\n1 4 2\n2 3 1\n2 5 1\n3 4 3\n3 6 3\n3 7 3\n4 8 4\n5 6 1\n6 7 5\n7 8 5\n\nSample Output 2\n\n2\n\nFirst, use company 1's lines: 1 → 3 → 2 → 5 → 6. Then, use company 5's lines: 6 → 7 → 8. The fare is 2 yen.\n\nSample Input 3\n\n2 0\n\nSample Output 3\n\n-1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2432, "cpu_time_ms": 3164, "memory_kb": 129476}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s095757811", "group_id": "codeNet:p04005", "input_text": "a, b, c = io.read(\"*n\", \"*n\", \"*n\")\nif a % 2 == 0 or b % 2 == 0 or c % 2 == 0 then\n print(0)\nelse\n print(math.min(a * b, b * c, c * a))\nend\n", "language": "Lua", "metadata": {"date": 1594092082, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p04005.html", "problem_id": "p04005", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04005/input.txt", "sample_output_relpath": "derived/input_output/data/p04005/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04005/Lua/s095757811.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s095757811", "user_id": "u120582723"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "a, b, c = io.read(\"*n\", \"*n\", \"*n\")\nif a % 2 == 0 or b % 2 == 0 or c % 2 == 0 then\n print(0)\nelse\n print(math.min(a * b, b * c, c * a))\nend\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a rectangular parallelepiped of size A×B×C, built with blocks of size 1×1×1. Snuke will paint each of the A×B×C blocks either red or blue, so that:\n\nThere is at least one red block and at least one blue block.\n\nThe union of all red blocks forms a rectangular parallelepiped.\n\nThe union of all blue blocks forms a rectangular parallelepiped.\n\nSnuke wants to minimize the difference between the number of red blocks and the number of blue blocks. Find the minimum possible difference.\n\nConstraints\n\n2≤A,B,C≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the minimum possible difference between the number of red blocks and the number of blue blocks.\n\nSample Input 1\n\n3 3 3\n\nSample Output 1\n\n9\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 9 red blocks and 18 blue blocks, thus the difference is 9.\n\nSample Input 2\n\n2 2 4\n\nSample Output 2\n\n0\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 8 red blocks and 8 blue blocks, thus the difference is 0.\n\nSample Input 3\n\n5 3 5\n\nSample Output 3\n\n15\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 45 red blocks and 30 blue blocks, thus the difference is 9.", "sample_input": "3 3 3\n"}, "reference_outputs": ["9\n"], "source_document_id": "p04005", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a rectangular parallelepiped of size A×B×C, built with blocks of size 1×1×1. Snuke will paint each of the A×B×C blocks either red or blue, so that:\n\nThere is at least one red block and at least one blue block.\n\nThe union of all red blocks forms a rectangular parallelepiped.\n\nThe union of all blue blocks forms a rectangular parallelepiped.\n\nSnuke wants to minimize the difference between the number of red blocks and the number of blue blocks. Find the minimum possible difference.\n\nConstraints\n\n2≤A,B,C≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the minimum possible difference between the number of red blocks and the number of blue blocks.\n\nSample Input 1\n\n3 3 3\n\nSample Output 1\n\n9\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 9 red blocks and 18 blue blocks, thus the difference is 9.\n\nSample Input 2\n\n2 2 4\n\nSample Output 2\n\n0\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 8 red blocks and 8 blue blocks, thus the difference is 0.\n\nSample Input 3\n\n5 3 5\n\nSample Output 3\n\n15\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 45 red blocks and 30 blue blocks, thus the difference is 9.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 2764}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s606843093", "group_id": "codeNet:p04005", "input_text": "a=io.read(\"*n\")\nb=io.read(\"*n\")\nc=io.read(\"*n\")\n\nif (a*b*c)%2==0 then\n print(0)\nelse\n print(math.min(a*b,a*c,b*c))\nend", "language": "Lua", "metadata": {"date": 1572607774, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p04005.html", "problem_id": "p04005", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04005/input.txt", "sample_output_relpath": "derived/input_output/data/p04005/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04005/Lua/s606843093.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s606843093", "user_id": "u535423069"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "a=io.read(\"*n\")\nb=io.read(\"*n\")\nc=io.read(\"*n\")\n\nif (a*b*c)%2==0 then\n print(0)\nelse\n print(math.min(a*b,a*c,b*c))\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a rectangular parallelepiped of size A×B×C, built with blocks of size 1×1×1. Snuke will paint each of the A×B×C blocks either red or blue, so that:\n\nThere is at least one red block and at least one blue block.\n\nThe union of all red blocks forms a rectangular parallelepiped.\n\nThe union of all blue blocks forms a rectangular parallelepiped.\n\nSnuke wants to minimize the difference between the number of red blocks and the number of blue blocks. Find the minimum possible difference.\n\nConstraints\n\n2≤A,B,C≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the minimum possible difference between the number of red blocks and the number of blue blocks.\n\nSample Input 1\n\n3 3 3\n\nSample Output 1\n\n9\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 9 red blocks and 18 blue blocks, thus the difference is 9.\n\nSample Input 2\n\n2 2 4\n\nSample Output 2\n\n0\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 8 red blocks and 8 blue blocks, thus the difference is 0.\n\nSample Input 3\n\n5 3 5\n\nSample Output 3\n\n15\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 45 red blocks and 30 blue blocks, thus the difference is 9.", "sample_input": "3 3 3\n"}, "reference_outputs": ["9\n"], "source_document_id": "p04005", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a rectangular parallelepiped of size A×B×C, built with blocks of size 1×1×1. Snuke will paint each of the A×B×C blocks either red or blue, so that:\n\nThere is at least one red block and at least one blue block.\n\nThe union of all red blocks forms a rectangular parallelepiped.\n\nThe union of all blue blocks forms a rectangular parallelepiped.\n\nSnuke wants to minimize the difference between the number of red blocks and the number of blue blocks. Find the minimum possible difference.\n\nConstraints\n\n2≤A,B,C≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the minimum possible difference between the number of red blocks and the number of blue blocks.\n\nSample Input 1\n\n3 3 3\n\nSample Output 1\n\n9\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 9 red blocks and 18 blue blocks, thus the difference is 9.\n\nSample Input 2\n\n2 2 4\n\nSample Output 2\n\n0\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 8 red blocks and 8 blue blocks, thus the difference is 0.\n\nSample Input 3\n\n5 3 5\n\nSample Output 3\n\n15\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 45 red blocks and 30 blue blocks, thus the difference is 9.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 120, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s141302831", "group_id": "codeNet:p04006", "input_text": "local n, x = io.read(\"*n\", \"*n\")\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\nend\nlocal inf = 1000000000\nlocal cost = {}\nfor i = 1, n * n do\n cost[i] = 0\nend\nlocal mmi = math.min\nfor i = 1, n do\n for j = 0, n - 1 do\n local it = i + j\n if n < it then it = it - n end\n cost[j * n + it] = i\n end\nend\nfor i = 1, n do\n for j = 0, n - 2 do\n local idx = j * n + i\n local pre_i = cost[idx]\n local pre_len = i - pre_i\n if pre_len < 0 then pre_len = pre_len + n end\n local pre_cost = a[pre_i]\n local next_idx = idx + n\n local next_cost = a[cost[next_idx]]\n if pre_cost < next_cost then\n cost[next_idx] = pre_i\n end\n end\nend\nlocal ret = 2000 * 1000000000\nfor j = 0, n - 1 do\n local sum = j * x\n for i = 1, n do\n sum = sum + a[cost[i + j * n]]\n end\n ret = mmi(ret, sum)\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1564334662, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p04006.html", "problem_id": "p04006", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04006/input.txt", "sample_output_relpath": "derived/input_output/data/p04006/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04006/Lua/s141302831.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s141302831", "user_id": "u120582723"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "local n, x = io.read(\"*n\", \"*n\")\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\nend\nlocal inf = 1000000000\nlocal cost = {}\nfor i = 1, n * n do\n cost[i] = 0\nend\nlocal mmi = math.min\nfor i = 1, n do\n for j = 0, n - 1 do\n local it = i + j\n if n < it then it = it - n end\n cost[j * n + it] = i\n end\nend\nfor i = 1, n do\n for j = 0, n - 2 do\n local idx = j * n + i\n local pre_i = cost[idx]\n local pre_len = i - pre_i\n if pre_len < 0 then pre_len = pre_len + n end\n local pre_cost = a[pre_i]\n local next_idx = idx + n\n local next_cost = a[cost[next_idx]]\n if pre_cost < next_cost then\n cost[next_idx] = pre_i\n end\n end\nend\nlocal ret = 2000 * 1000000000\nfor j = 0, n - 1 do\n local sum = j * x\n for i = 1, n do\n sum = sum + a[cost[i + j * n]]\n end\n ret = mmi(ret, sum)\nend\nprint(ret)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke lives in another world, where slimes are real creatures and kept by some people.\nSlimes come in N colors. Those colors are conveniently numbered 1 through N.\nSnuke currently has no slime. His objective is to have slimes of all the colors together.\n\nSnuke can perform the following two actions:\n\nSelect a color i (1≤i≤N), such that he does not currently have a slime in color i, and catch a slime in color i. This action takes him a_i seconds.\n\nCast a spell, which changes the color of all the slimes that he currently has. The color of a slime in color i (1≤i≤N-1) will become color i+1, and the color of a slime in color N will become color 1. This action takes him x seconds.\n\nFind the minimum time that Snuke needs to have slimes in all N colors.\n\nConstraints\n\n2≤N≤2,000\n\na_i are integers.\n\n1≤a_i≤10^9\n\nx is an integer.\n\n1≤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\nFind the minimum time that Snuke needs to have slimes in all N colors.\n\nSample Input 1\n\n2 10\n1 100\n\nSample Output 1\n\n12\n\nSnuke can act as follows:\n\nCatch a slime in color 1. This takes 1 second.\n\nCast the spell. The color of the slime changes: 1 → 2. This takes 10 seconds.\n\nCatch a slime in color 1. This takes 1 second.\n\nSample Input 2\n\n3 10\n100 1 100\n\nSample Output 2\n\n23\n\nSnuke can act as follows:\n\nCatch a slime in color 2. This takes 1 second.\n\nCast the spell. The color of the slime changes: 2 → 3. This takes 10 seconds.\n\nCatch a slime in color 2. This takes 1 second.\n\nCast the soell. The color of each slime changes: 3 → 1, 2 → 3. This takes 10 seconds.\n\nCatch a slime in color 2. This takes 1 second.\n\nSample Input 3\n\n4 10\n1 2 3 4\n\nSample Output 3\n\n10\n\nSnuke can act as follows:\n\nCatch a slime in color 1. This takes 1 second.\n\nCatch a slime in color 2. This takes 2 seconds.\n\nCatch a slime in color 3. This takes 3 seconds.\n\nCatch a slime in color 4. This takes 4 seconds.", "sample_input": "2 10\n1 100\n"}, "reference_outputs": ["12\n"], "source_document_id": "p04006", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke lives in another world, where slimes are real creatures and kept by some people.\nSlimes come in N colors. Those colors are conveniently numbered 1 through N.\nSnuke currently has no slime. His objective is to have slimes of all the colors together.\n\nSnuke can perform the following two actions:\n\nSelect a color i (1≤i≤N), such that he does not currently have a slime in color i, and catch a slime in color i. This action takes him a_i seconds.\n\nCast a spell, which changes the color of all the slimes that he currently has. The color of a slime in color i (1≤i≤N-1) will become color i+1, and the color of a slime in color N will become color 1. This action takes him x seconds.\n\nFind the minimum time that Snuke needs to have slimes in all N colors.\n\nConstraints\n\n2≤N≤2,000\n\na_i are integers.\n\n1≤a_i≤10^9\n\nx is an integer.\n\n1≤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\nFind the minimum time that Snuke needs to have slimes in all N colors.\n\nSample Input 1\n\n2 10\n1 100\n\nSample Output 1\n\n12\n\nSnuke can act as follows:\n\nCatch a slime in color 1. This takes 1 second.\n\nCast the spell. The color of the slime changes: 1 → 2. This takes 10 seconds.\n\nCatch a slime in color 1. This takes 1 second.\n\nSample Input 2\n\n3 10\n100 1 100\n\nSample Output 2\n\n23\n\nSnuke can act as follows:\n\nCatch a slime in color 2. This takes 1 second.\n\nCast the spell. The color of the slime changes: 2 → 3. This takes 10 seconds.\n\nCatch a slime in color 2. This takes 1 second.\n\nCast the soell. The color of each slime changes: 3 → 1, 2 → 3. This takes 10 seconds.\n\nCatch a slime in color 2. This takes 1 second.\n\nSample Input 3\n\n4 10\n1 2 3 4\n\nSample Output 3\n\n10\n\nSnuke can act as follows:\n\nCatch a slime in color 1. This takes 1 second.\n\nCatch a slime in color 2. This takes 2 seconds.\n\nCatch a slime in color 3. This takes 3 seconds.\n\nCatch a slime in color 4. This takes 4 seconds.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 833, "cpu_time_ms": 156, "memory_kb": 34812}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s939954589", "group_id": "codeNet:p04011", "input_text": "a=io.read()*1\nb=io.read()*1\nc=io.read()*1\nd=io.read()*1\nprint(math.floor(a>=b and (b*c)+(a-b)*d or a*c))", "language": "Lua", "metadata": {"date": 1551655763, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p04011.html", "problem_id": "p04011", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04011/input.txt", "sample_output_relpath": "derived/input_output/data/p04011/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04011/Lua/s939954589.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s939954589", "user_id": "u837412668"}, "prompt_components": {"gold_output": "48000\n", "input_to_evaluate": "a=io.read()*1\nb=io.read()*1\nc=io.read()*1\nd=io.read()*1\nprint(math.floor(a>=b and (b*c)+(a-b)*d or a*c))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a hotel with the following accommodation fee:\n\nX yen (the currency of Japan) per night, for the first K nights\n\nY yen per night, for the (K+1)-th and subsequent nights\n\nTak is staying at this hotel for N consecutive nights.\nFind his total accommodation fee.\n\nConstraints\n\n1 \\leq N, K \\leq 10000\n\n1 \\leq Y < X \\leq 10000\n\nN,\\,K,\\,X,\\,Y are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nK\nX\nY\n\nOutput\n\nPrint Tak's total accommodation fee.\n\nSample Input 1\n\n5\n3\n10000\n9000\n\nSample Output 1\n\n48000\n\nThe accommodation fee is as follows:\n\n10000 yen for the 1-st night\n\n10000 yen for the 2-nd night\n\n10000 yen for the 3-rd night\n\n9000 yen for the 4-th night\n\n9000 yen for the 5-th night\n\nThus, the total is 48000 yen.\n\nSample Input 2\n\n2\n3\n10000\n9000\n\nSample Output 2\n\n20000", "sample_input": "5\n3\n10000\n9000\n"}, "reference_outputs": ["48000\n"], "source_document_id": "p04011", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a hotel with the following accommodation fee:\n\nX yen (the currency of Japan) per night, for the first K nights\n\nY yen per night, for the (K+1)-th and subsequent nights\n\nTak is staying at this hotel for N consecutive nights.\nFind his total accommodation fee.\n\nConstraints\n\n1 \\leq N, K \\leq 10000\n\n1 \\leq Y < X \\leq 10000\n\nN,\\,K,\\,X,\\,Y are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nK\nX\nY\n\nOutput\n\nPrint Tak's total accommodation fee.\n\nSample Input 1\n\n5\n3\n10000\n9000\n\nSample Output 1\n\n48000\n\nThe accommodation fee is as follows:\n\n10000 yen for the 1-st night\n\n10000 yen for the 2-nd night\n\n10000 yen for the 3-rd night\n\n9000 yen for the 4-th night\n\n9000 yen for the 5-th night\n\nThus, the total is 48000 yen.\n\nSample Input 2\n\n2\n3\n10000\n9000\n\nSample Output 2\n\n20000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 104, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s794486310", "group_id": "codeNet:p04011", "input_text": "a=io.read()*1\nb=io.read()*1\nc=io.read()*1\nd=io.read()*1\nprint(math.floor(a>=b and (b*c)+(a-b)*d or a*c))", "language": "Lua", "metadata": {"date": 1551655746, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p04011.html", "problem_id": "p04011", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04011/input.txt", "sample_output_relpath": "derived/input_output/data/p04011/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04011/Lua/s794486310.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s794486310", "user_id": "u837412668"}, "prompt_components": {"gold_output": "48000\n", "input_to_evaluate": "a=io.read()*1\nb=io.read()*1\nc=io.read()*1\nd=io.read()*1\nprint(math.floor(a>=b and (b*c)+(a-b)*d or a*c))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a hotel with the following accommodation fee:\n\nX yen (the currency of Japan) per night, for the first K nights\n\nY yen per night, for the (K+1)-th and subsequent nights\n\nTak is staying at this hotel for N consecutive nights.\nFind his total accommodation fee.\n\nConstraints\n\n1 \\leq N, K \\leq 10000\n\n1 \\leq Y < X \\leq 10000\n\nN,\\,K,\\,X,\\,Y are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nK\nX\nY\n\nOutput\n\nPrint Tak's total accommodation fee.\n\nSample Input 1\n\n5\n3\n10000\n9000\n\nSample Output 1\n\n48000\n\nThe accommodation fee is as follows:\n\n10000 yen for the 1-st night\n\n10000 yen for the 2-nd night\n\n10000 yen for the 3-rd night\n\n9000 yen for the 4-th night\n\n9000 yen for the 5-th night\n\nThus, the total is 48000 yen.\n\nSample Input 2\n\n2\n3\n10000\n9000\n\nSample Output 2\n\n20000", "sample_input": "5\n3\n10000\n9000\n"}, "reference_outputs": ["48000\n"], "source_document_id": "p04011", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a hotel with the following accommodation fee:\n\nX yen (the currency of Japan) per night, for the first K nights\n\nY yen per night, for the (K+1)-th and subsequent nights\n\nTak is staying at this hotel for N consecutive nights.\nFind his total accommodation fee.\n\nConstraints\n\n1 \\leq N, K \\leq 10000\n\n1 \\leq Y < X \\leq 10000\n\nN,\\,K,\\,X,\\,Y are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nK\nX\nY\n\nOutput\n\nPrint Tak's total accommodation fee.\n\nSample Input 1\n\n5\n3\n10000\n9000\n\nSample Output 1\n\n48000\n\nThe accommodation fee is as follows:\n\n10000 yen for the 1-st night\n\n10000 yen for the 2-nd night\n\n10000 yen for the 3-rd night\n\n9000 yen for the 4-th night\n\n9000 yen for the 5-th night\n\nThus, the total is 48000 yen.\n\nSample Input 2\n\n2\n3\n10000\n9000\n\nSample Output 2\n\n20000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 104, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s823442616", "group_id": "codeNet:p04012", "input_text": "--string.char(97)はa\nlocal t = {}\nlocal str = io.read(\"*l\")\nfor i = 97, 122 do\n t[i] = 0\nend\nfor i = 1, #str do\n local num = string.byte(string.sub(str, i, i))\n t[num] = t[num] + 1\nend\nfor i = 97, 122 do\n if t[i] % 2 == 1 then\n print(\"No\")\n os.exit()\n end\nend\nprint(\"Yes\")", "language": "Lua", "metadata": {"date": 1572923954, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p04012.html", "problem_id": "p04012", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04012/input.txt", "sample_output_relpath": "derived/input_output/data/p04012/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04012/Lua/s823442616.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s823442616", "user_id": "u413686817"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "--string.char(97)はa\nlocal t = {}\nlocal str = io.read(\"*l\")\nfor i = 97, 122 do\n t[i] = 0\nend\nfor i = 1, #str do\n local num = string.byte(string.sub(str, i, i))\n t[num] = t[num] + 1\nend\nfor i = 97, 122 do\n if t[i] % 2 == 1 then\n print(\"No\")\n os.exit()\n end\nend\nprint(\"Yes\")", "problem_context": "Score : 200 points\n\nProblem Statement\n\nLet w be a string consisting of lowercase letters.\nWe will call w beautiful if the following condition is satisfied:\n\nEach lowercase letter of the English alphabet occurs even number of times in w.\n\nYou are given the string w. Determine if w is beautiful.\n\nConstraints\n\n1 \\leq |w| \\leq 100\n\nw consists of lowercase letters (a-z).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nw\n\nOutput\n\nPrint Yes if w is beautiful. Print No otherwise.\n\nSample Input 1\n\nabaccaba\n\nSample Output 1\n\nYes\n\na occurs four times, b occurs twice, c occurs twice and the other letters occur zero times.\n\nSample Input 2\n\nhthth\n\nSample Output 2\n\nNo", "sample_input": "abaccaba\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p04012", "source_text": "Score : 200 points\n\nProblem Statement\n\nLet w be a string consisting of lowercase letters.\nWe will call w beautiful if the following condition is satisfied:\n\nEach lowercase letter of the English alphabet occurs even number of times in w.\n\nYou are given the string w. Determine if w is beautiful.\n\nConstraints\n\n1 \\leq |w| \\leq 100\n\nw consists of lowercase letters (a-z).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nw\n\nOutput\n\nPrint Yes if w is beautiful. Print No otherwise.\n\nSample Input 1\n\nabaccaba\n\nSample Output 1\n\nYes\n\na occurs four times, b occurs twice, c occurs twice and the other letters occur zero times.\n\nSample Input 2\n\nhthth\n\nSample Output 2\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 376}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s315499468", "group_id": "codeNet:p04012", "input_text": "s = io.read()\nt = {}\nfor i = 1, #s do\n z = s:sub(i, i)\n if t[z] then t[z] = nil else t[z] = true end\nend\nprint(next(t) and \"No\" or \"Yes\")\n", "language": "Lua", "metadata": {"date": 1571199516, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p04012.html", "problem_id": "p04012", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04012/input.txt", "sample_output_relpath": "derived/input_output/data/p04012/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04012/Lua/s315499468.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s315499468", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "s = io.read()\nt = {}\nfor i = 1, #s do\n z = s:sub(i, i)\n if t[z] then t[z] = nil else t[z] = true end\nend\nprint(next(t) and \"No\" or \"Yes\")\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nLet w be a string consisting of lowercase letters.\nWe will call w beautiful if the following condition is satisfied:\n\nEach lowercase letter of the English alphabet occurs even number of times in w.\n\nYou are given the string w. Determine if w is beautiful.\n\nConstraints\n\n1 \\leq |w| \\leq 100\n\nw consists of lowercase letters (a-z).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nw\n\nOutput\n\nPrint Yes if w is beautiful. Print No otherwise.\n\nSample Input 1\n\nabaccaba\n\nSample Output 1\n\nYes\n\na occurs four times, b occurs twice, c occurs twice and the other letters occur zero times.\n\nSample Input 2\n\nhthth\n\nSample Output 2\n\nNo", "sample_input": "abaccaba\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p04012", "source_text": "Score : 200 points\n\nProblem Statement\n\nLet w be a string consisting of lowercase letters.\nWe will call w beautiful if the following condition is satisfied:\n\nEach lowercase letter of the English alphabet occurs even number of times in w.\n\nYou are given the string w. Determine if w is beautiful.\n\nConstraints\n\n1 \\leq |w| \\leq 100\n\nw consists of lowercase letters (a-z).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nw\n\nOutput\n\nPrint Yes if w is beautiful. Print No otherwise.\n\nSample Input 1\n\nabaccaba\n\nSample Output 1\n\nYes\n\na occurs four times, b occurs twice, c occurs twice and the other letters occur zero times.\n\nSample Input 2\n\nhthth\n\nSample Output 2\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 23, "memory_kb": 1136}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s081163755", "group_id": "codeNet:p04013", "input_text": "local n, a = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n * 50 * n do\n t[i] = 0\nend\nfor i = 1, n do\n local x = io.read(\"*n\")\n for j = i - 1, 1, -1 do\n for k = n * 50 - x, 1, -1 do\n if 0 < t[n * 50 * (j - 1) + k] then\n t[n * 50 * j + k + x] = t[n * 50 * j + k + x] + t[n * 50 * (j - 1) + k]\n end\n end\n end\n t[x] = t[x] + 1\nend\nlocal cnt = 0\nfor i = 1, n do\n cnt = cnt + t[n * 50 * (i - 1) + a * i]\nend\nprint(cnt)\n", "language": "Lua", "metadata": {"date": 1561296905, "filename_ext": "lua", "original_language": "Lua (5.3.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/Lua/s081163755.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s081163755", "user_id": "u120582723"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local n, a = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n * 50 * n do\n t[i] = 0\nend\nfor i = 1, n do\n local x = io.read(\"*n\")\n for j = i - 1, 1, -1 do\n for k = n * 50 - x, 1, -1 do\n if 0 < t[n * 50 * (j - 1) + k] then\n t[n * 50 * j + k + x] = t[n * 50 * j + k + x] + t[n * 50 * (j - 1) + k]\n end\n end\n end\n t[x] = t[x] + 1\nend\nlocal cnt = 0\nfor i = 1, n do\n cnt = cnt + t[n * 50 * (i - 1) + a * i]\nend\nprint(cnt)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 442, "cpu_time_ms": 218, "memory_kb": 2424}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s710680674", "group_id": "codeNet:p04017", "input_text": "local mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal mma = math.max\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n -- for i = 1, #ary do self.stage[stagenum][i] = ary[i] end\n -- for i = #ary + 1, mul do self.stage[stagenum][i] = emptyvalue end\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mmi(r, mce((l - 1) / sz) * sz)\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)\n l = newr + 1\n end\n if sz <= r + 1 - l then\n ret = self.func(ret, self.stage[stage][mce(l / sz)])\n l = l + sz\n end\n if l <= r then\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n end\n end\n return ret\nend\nSegTree.setValue = function(self, idx, value, silent)\n self.stage[self.stagenum][idx] = value\n if not silent then\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n end\nend\n\nSegTree.left_bound = function(self, val, left, right)\n local ret, retpos = self.emptyvalue, right + 1\n local t1, t2, t3 = {1}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n while r % sz ~= 0 or r + 1 - l < sz do\n stage = stage + 1\n sz = self.size[stage]\n end\n local tmp = self.func(ret, self.stage[stage][mfl(r / sz)])\n if tmp < val then\n ret, retpos = tmp, r - sz + 1\n if l + sz <= r then table.insert(t1, 1) table.insert(t2, l) table.insert(t3, r - sz) end\n else\n if sz ~= 1 then table.insert(t1, stage + 1) table.insert(t2, r - sz + 2) table.insert(t3, r) end\n end\n end\n return retpos - 1\nend\n\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal function comp(a, b)\n return a < b\nend\n\nlocal function upper_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if comp(x, ary[1]) then return 1 end\n if not comp(x, ary[num]) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if not comp(x, ary[mid]) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal n = io.read(\"*n\")\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\nend\nlocal l = io.read(\"*n\")\n\nlocal edge = {}\nlocal asked = {}\nlocal len = {}\nlocal pos = {}\nfor i = 1, n do\n edge[i] = {}\n asked[i] = false\n len[i] = 0\n pos[i] = 0\nend\n\nfor src = 1, n - 1 do\n local dst = upper_bound(a, a[src] + l)\n dst = dst - 1\n table.insert(edge[src], dst)\n table.insert(edge[dst], src)\nend\n\nlocal euler = {}\nlocal tasks = {n}\nwhile 0 < #tasks do\n local src = tasks[#tasks]\n table.remove(tasks)\n asked[src] = true\n table.insert(euler, src)\n if pos[src] == 0 then\n pos[src] = #euler\n end\n while 0 < #edge[src] do\n local dst = edge[src][#edge[src]]\n if not asked[dst] then\n len[dst] = len[src] + 1\n table.insert(tasks, src)\n table.insert(tasks, dst)\n table.remove(edge[src])\n break\n else\n table.remove(edge[src])\n end\n end\nend\nlocal st = SegTree.new(#euler, function(x, y) return mma(x, y) end, 0)\nfor i = 1, #euler do\n st:setValue(i, euler[i], true)\nend\nst:updateAll()\nlocal q = io.read(\"*n\")\nfor i = 1, q do\n local l, r = io.read(\"*n\", \"*n\")\n if r < l then l, r = r, l end\n local st_rpos = st:left_bound(r, 1, pos[l])\n local st_r = st.stage[#st.stage][st_rpos]\n print(len[l] - len[st_r])\nend\n", "language": "Lua", "metadata": {"date": 1570590762, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p04017.html", "problem_id": "p04017", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04017/input.txt", "sample_output_relpath": "derived/input_output/data/p04017/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04017/Lua/s710680674.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s710680674", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n2\n1\n2\n", "input_to_evaluate": "local mfl, mce, mmi = math.floor, math.ceil, math.min\nlocal mma = math.max\nlocal SegTree = {}\nSegTree.updateAll = function(self)\n for i = self.stagenum - 1, 1, -1 do\n for j = 1, self.cnt[i] do\n self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])\n end\n end\nend\nSegTree.create = function(self, n, func, emptyvalue)\n self.func, self.emptyvalue = func, emptyvalue\n local stagenum, mul = 1, 1\n self.cnt, self.stage, self.size = {1}, {{}}, {}\n while mul < n do\n mul, stagenum = mul * 2, stagenum + 1\n self.cnt[stagenum], self.stage[stagenum] = mul, {}\n end\n for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end\n self.stagenum = stagenum\n -- for i = 1, #ary do self.stage[stagenum][i] = ary[i] end\n -- for i = #ary + 1, mul do self.stage[stagenum][i] = emptyvalue end\n for i = 1, mul do self.stage[stagenum][i] = emptyvalue end\n self:updateAll()\nend\nSegTree.getRange = function(self, left, right)\n if left == right then return self.stage[self.stagenum][left] end\n local start_stage = 1\n while right - left + 1 < self.size[start_stage] do\n start_stage = start_stage + 1\n end\n local ret = self.emptyvalue\n local t1, t2, t3 = {start_stage}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n if (l - 1) % sz ~= 0 then\n local newr = mmi(r, mce((l - 1) / sz) * sz)\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)\n l = newr + 1\n end\n if sz <= r + 1 - l then\n ret = self.func(ret, self.stage[stage][mce(l / sz)])\n l = l + sz\n end\n if l <= r then\n table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n end\n end\n return ret\nend\nSegTree.setValue = function(self, idx, value, silent)\n self.stage[self.stagenum][idx] = value\n if not silent then\n for i = self.stagenum - 1, 1, -1 do\n local dst = mce(idx / 2)\n local rem = dst * 4 - 1 - idx\n self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])\n idx = dst\n end\n end\nend\n\nSegTree.left_bound = function(self, val, left, right)\n local ret, retpos = self.emptyvalue, right + 1\n local t1, t2, t3 = {1}, {left}, {right}\n while 0 < #t1 do\n local stage, l, r = t1[#t1], t2[#t1], t3[#t1]\n table.remove(t1) table.remove(t2) table.remove(t3)\n local sz = self.size[stage]\n while r % sz ~= 0 or r + 1 - l < sz do\n stage = stage + 1\n sz = self.size[stage]\n end\n local tmp = self.func(ret, self.stage[stage][mfl(r / sz)])\n if tmp < val then\n ret, retpos = tmp, r - sz + 1\n if l + sz <= r then table.insert(t1, 1) table.insert(t2, l) table.insert(t3, r - sz) end\n else\n if sz ~= 1 then table.insert(t1, stage + 1) table.insert(t2, r - sz + 2) table.insert(t3, r) end\n end\n end\n return retpos - 1\nend\n\nSegTree.new = function(n, func, emptyvalue)\n local obj = {}\n setmetatable(obj, {__index = SegTree})\n obj:create(n, func, emptyvalue)\n return obj\nend\n\nlocal function comp(a, b)\n return a < b\nend\n\nlocal function upper_bound(ary, x)\n local num = #ary\n if num == 0 then return 1 end\n if comp(x, ary[1]) then return 1 end\n if not comp(x, ary[num]) then return num + 1 end\n local min, max = 1, num\n while 1 < max - min do\n local mid = mfl((min + max) / 2)\n if not comp(x, ary[mid]) then\n min = mid\n else\n max = mid\n end\n end\n return max\nend\n\nlocal n = io.read(\"*n\")\nlocal a = {}\nfor i = 1, n do\n a[i] = io.read(\"*n\")\nend\nlocal l = io.read(\"*n\")\n\nlocal edge = {}\nlocal asked = {}\nlocal len = {}\nlocal pos = {}\nfor i = 1, n do\n edge[i] = {}\n asked[i] = false\n len[i] = 0\n pos[i] = 0\nend\n\nfor src = 1, n - 1 do\n local dst = upper_bound(a, a[src] + l)\n dst = dst - 1\n table.insert(edge[src], dst)\n table.insert(edge[dst], src)\nend\n\nlocal euler = {}\nlocal tasks = {n}\nwhile 0 < #tasks do\n local src = tasks[#tasks]\n table.remove(tasks)\n asked[src] = true\n table.insert(euler, src)\n if pos[src] == 0 then\n pos[src] = #euler\n end\n while 0 < #edge[src] do\n local dst = edge[src][#edge[src]]\n if not asked[dst] then\n len[dst] = len[src] + 1\n table.insert(tasks, src)\n table.insert(tasks, dst)\n table.remove(edge[src])\n break\n else\n table.remove(edge[src])\n end\n end\nend\nlocal st = SegTree.new(#euler, function(x, y) return mma(x, y) end, 0)\nfor i = 1, #euler do\n st:setValue(i, euler[i], true)\nend\nst:updateAll()\nlocal q = io.read(\"*n\")\nfor i = 1, q do\n local l, r = io.read(\"*n\", \"*n\")\n if r < l then l, r = r, l end\n local st_rpos = st:left_bound(r, 1, pos[l])\n local st_r = st.stage[#st.stage][st_rpos]\n print(len[l] - len[st_r])\nend\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nN hotels are located on a straight line. The coordinate of the i-th hotel (1 \\leq i \\leq N) is x_i.\n\nTak the traveler has the following two personal principles:\n\nHe never travels a distance of more than L in a single day.\n\nHe never sleeps in the open. That is, he must stay at a hotel at the end of a day.\n\nYou are given Q queries. The j-th (1 \\leq j \\leq Q) query is described by two distinct integers a_j and b_j.\nFor each query, find the minimum number of days that Tak needs to travel from the a_j-th hotel to the b_j-th hotel following his principles.\nIt is guaranteed that he can always travel from the a_j-th hotel to the b_j-th hotel, in any given input.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq L \\leq 10^9\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq x_i < x_2 < ... < x_N \\leq 10^9\n\nx_{i+1} - x_i \\leq L\n\n1 \\leq a_j,b_j \\leq N\n\na_j \\neq b_j\n\nN,\\,L,\\,Q,\\,x_i,\\,a_j,\\,b_j are integers.\n\nPartial Score\n\n200 points will be awarded for passing the test set satisfying N \\leq 10^3 and Q \\leq 10^3.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nx_1 x_2 ... x_N\nL\nQ\na_1 b_1\na_2 b_2\n:\na_Q b_Q\n\nOutput\n\nPrint Q lines.\nThe j-th line (1 \\leq j \\leq Q) should contain the minimum number of days that Tak needs to travel from the a_j-th hotel to the b_j-th hotel.\n\nSample Input 1\n\n9\n1 3 6 13 15 18 19 29 31\n10\n4\n1 8\n7 3\n6 7\n8 5\n\nSample Output 1\n\n4\n2\n1\n2\n\nFor the 1-st query, he can travel from the 1-st hotel to the 8-th hotel in 4 days, as follows:\n\nDay 1: Travel from the 1-st hotel to the 2-nd hotel. The distance traveled is 2.\n\nDay 2: Travel from the 2-nd hotel to the 4-th hotel. The distance traveled is 10.\n\nDay 3: Travel from the 4-th hotel to the 7-th hotel. The distance traveled is 6.\n\nDay 4: Travel from the 7-th hotel to the 8-th hotel. The distance traveled is 10.", "sample_input": "9\n1 3 6 13 15 18 19 29 31\n10\n4\n1 8\n7 3\n6 7\n8 5\n"}, "reference_outputs": ["4\n2\n1\n2\n"], "source_document_id": "p04017", "source_text": "Score : 700 points\n\nProblem Statement\n\nN hotels are located on a straight line. The coordinate of the i-th hotel (1 \\leq i \\leq N) is x_i.\n\nTak the traveler has the following two personal principles:\n\nHe never travels a distance of more than L in a single day.\n\nHe never sleeps in the open. That is, he must stay at a hotel at the end of a day.\n\nYou are given Q queries. The j-th (1 \\leq j \\leq Q) query is described by two distinct integers a_j and b_j.\nFor each query, find the minimum number of days that Tak needs to travel from the a_j-th hotel to the b_j-th hotel following his principles.\nIt is guaranteed that he can always travel from the a_j-th hotel to the b_j-th hotel, in any given input.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq L \\leq 10^9\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq x_i < x_2 < ... < x_N \\leq 10^9\n\nx_{i+1} - x_i \\leq L\n\n1 \\leq a_j,b_j \\leq N\n\na_j \\neq b_j\n\nN,\\,L,\\,Q,\\,x_i,\\,a_j,\\,b_j are integers.\n\nPartial Score\n\n200 points will be awarded for passing the test set satisfying N \\leq 10^3 and Q \\leq 10^3.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nx_1 x_2 ... x_N\nL\nQ\na_1 b_1\na_2 b_2\n:\na_Q b_Q\n\nOutput\n\nPrint Q lines.\nThe j-th line (1 \\leq j \\leq Q) should contain the minimum number of days that Tak needs to travel from the a_j-th hotel to the b_j-th hotel.\n\nSample Input 1\n\n9\n1 3 6 13 15 18 19 29 31\n10\n4\n1 8\n7 3\n6 7\n8 5\n\nSample Output 1\n\n4\n2\n1\n2\n\nFor the 1-st query, he can travel from the 1-st hotel to the 8-th hotel in 4 days, as follows:\n\nDay 1: Travel from the 1-st hotel to the 2-nd hotel. The distance traveled is 2.\n\nDay 2: Travel from the 2-nd hotel to the 4-th hotel. The distance traveled is 10.\n\nDay 3: Travel from the 4-th hotel to the 7-th hotel. The distance traveled is 6.\n\nDay 4: Travel from the 7-th hotel to the 8-th hotel. The distance traveled is 10.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4750, "cpu_time_ms": 594, "memory_kb": 38104}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s987334227", "group_id": "codeNet:p04020", "input_text": "local n=io.read(\"n\")\nlocal total=0\nlocal count=0\nfor i=1,n do\n local a=io.read(\"n\")\n if a==0 then\n count=0\n else\n a=a+count\n total=total+a//2\n count=a%2\n end\nend\nprint(total)", "language": "Lua", "metadata": {"date": 1596331310, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "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/Lua/s987334227.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s987334227", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal total=0\nlocal count=0\nfor i=1,n do\n local a=io.read(\"n\")\n if a==0 then\n count=0\n else\n a=a+count\n total=total+a//2\n count=a%2\n end\nend\nprint(total)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 214, "cpu_time_ms": 39, "memory_kb": 2792}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s397908893", "group_id": "codeNet:p04025", "input_text": "local n=io.read(\"n\")\nlocal a={}\nfor i=1,n do\n a[i]=io.read(\"n\")\nend\n\nlocal mincost=1000000000000000\nfor i=-100,100 do\n local cost=0\n for j=1,n do\n cost=cost+(a[j]-i)*(a[j]-i)\n end\n mincost=math.min(cost,mincost)\nend\nprint(mincost)", "language": "Lua", "metadata": {"date": 1590543793, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p04025.html", "problem_id": "p04025", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04025/input.txt", "sample_output_relpath": "derived/input_output/data/p04025/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04025/Lua/s397908893.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s397908893", "user_id": "u045238009"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal a={}\nfor i=1,n do\n a[i]=io.read(\"n\")\nend\n\nlocal mincost=1000000000000000\nfor i=-100,100 do\n local cost=0\n for j=1,n do\n cost=cost+(a[j]-i)*(a[j]-i)\n end\n mincost=math.min(cost,mincost)\nend\nprint(mincost)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nEvi has N integers a_1,a_2,..,a_N. His objective is to have N equal integers by transforming some of them.\n\nHe may transform each integer at most once. Transforming an integer x into another integer y costs him (x-y)^2 dollars. Even if a_i=a_j (i≠j), he has to pay the cost separately for transforming each of them (See Sample 2).\n\nFind the minimum total cost to achieve his objective.\n\nConstraints\n\n1≦N≦100\n\n-100≦a_i≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum total cost to achieve Evi's objective.\n\nSample Input 1\n\n2\n4 8\n\nSample Output 1\n\n8\n\nTransforming the both into 6s will cost (4-6)^2+(8-6)^2=8 dollars, which is the minimum.\n\nSample Input 2\n\n3\n1 1 3\n\nSample Output 2\n\n3\n\nTransforming the all into 2s will cost (1-2)^2+(1-2)^2+(3-2)^2=3 dollars. Note that Evi has to pay (1-2)^2 dollar separately for transforming each of the two 1s.\n\nSample Input 3\n\n3\n4 2 5\n\nSample Output 3\n\n5\n\nLeaving the 4 as it is and transforming the 2 and the 5 into 4s will achieve the total cost of (2-4)^2+(5-4)^2=5 dollars, which is the minimum.\n\nSample Input 4\n\n4\n-100 -100 -100 -100\n\nSample Output 4\n\n0\n\nWithout transforming anything, Evi's objective is already achieved. Thus, the necessary cost is 0.", "sample_input": "2\n4 8\n"}, "reference_outputs": ["8\n"], "source_document_id": "p04025", "source_text": "Score : 200 points\n\nProblem Statement\n\nEvi has N integers a_1,a_2,..,a_N. His objective is to have N equal integers by transforming some of them.\n\nHe may transform each integer at most once. Transforming an integer x into another integer y costs him (x-y)^2 dollars. Even if a_i=a_j (i≠j), he has to pay the cost separately for transforming each of them (See Sample 2).\n\nFind the minimum total cost to achieve his objective.\n\nConstraints\n\n1≦N≦100\n\n-100≦a_i≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum total cost to achieve Evi's objective.\n\nSample Input 1\n\n2\n4 8\n\nSample Output 1\n\n8\n\nTransforming the both into 6s will cost (4-6)^2+(8-6)^2=8 dollars, which is the minimum.\n\nSample Input 2\n\n3\n1 1 3\n\nSample Output 2\n\n3\n\nTransforming the all into 2s will cost (1-2)^2+(1-2)^2+(3-2)^2=3 dollars. Note that Evi has to pay (1-2)^2 dollar separately for transforming each of the two 1s.\n\nSample Input 3\n\n3\n4 2 5\n\nSample Output 3\n\n5\n\nLeaving the 4 as it is and transforming the 2 and the 5 into 4s will achieve the total cost of (2-4)^2+(5-4)^2=5 dollars, which is the minimum.\n\nSample Input 4\n\n4\n-100 -100 -100 -100\n\nSample Output 4\n\n0\n\nWithout transforming anything, Evi's objective is already achieved. Thus, the necessary cost is 0.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 12, "memory_kb": 884}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s985755761", "group_id": "codeNet:p04030", "input_text": "s=io.read()\ns=s:gsub(\"%dB\",\"\")\nprint(s)", "language": "Lua", "metadata": {"date": 1589261652, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p04030.html", "problem_id": "p04030", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04030/input.txt", "sample_output_relpath": "derived/input_output/data/p04030/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04030/Lua/s985755761.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s985755761", "user_id": "u045238009"}, "prompt_components": {"gold_output": "00\n", "input_to_evaluate": "s=io.read()\ns=s:gsub(\"%dB\",\"\")\nprint(s)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSig has built his own keyboard. Designed for ultimate simplicity, this keyboard only has 3 keys on it: the 0 key, the 1 key and the backspace key.\n\nTo begin with, he is using a plain text editor with this keyboard. This editor always displays one string (possibly empty). Just after the editor is launched, this string is empty. When each key on the keyboard is pressed, the following changes occur to the string:\n\nThe 0 key: a letter 0 will be inserted to the right of the string.\n\nThe 1 key: a letter 1 will be inserted to the right of the string.\n\nThe backspace key: if the string is empty, nothing happens. Otherwise, the rightmost letter of the string is deleted.\n\nSig has launched the editor, and pressed these keys several times. You are given a string s, which is a record of his keystrokes in order. In this string, the letter 0 stands for the 0 key, the letter 1 stands for the 1 key and the letter B stands for the backspace key. What string is displayed in the editor now?\n\nConstraints\n\n1 ≦ |s| ≦ 10 (|s| denotes the length of s)\n\ns consists of the letters 0, 1 and B.\n\nThe correct answer is not an empty string.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string displayed in the editor in the end.\n\nSample Input 1\n\n01B0\n\nSample Output 1\n\n00\n\nEach time the key is pressed, the string in the editor will change as follows: 0, 01, 0, 00.\n\nSample Input 2\n\n0BB1\n\nSample Output 2\n\n1\n\nEach time the key is pressed, the string in the editor will change as follows: 0, (empty), (empty), 1.", "sample_input": "01B0\n"}, "reference_outputs": ["00\n"], "source_document_id": "p04030", "source_text": "Score : 200 points\n\nProblem Statement\n\nSig has built his own keyboard. Designed for ultimate simplicity, this keyboard only has 3 keys on it: the 0 key, the 1 key and the backspace key.\n\nTo begin with, he is using a plain text editor with this keyboard. This editor always displays one string (possibly empty). Just after the editor is launched, this string is empty. When each key on the keyboard is pressed, the following changes occur to the string:\n\nThe 0 key: a letter 0 will be inserted to the right of the string.\n\nThe 1 key: a letter 1 will be inserted to the right of the string.\n\nThe backspace key: if the string is empty, nothing happens. Otherwise, the rightmost letter of the string is deleted.\n\nSig has launched the editor, and pressed these keys several times. You are given a string s, which is a record of his keystrokes in order. In this string, the letter 0 stands for the 0 key, the letter 1 stands for the 1 key and the letter B stands for the backspace key. What string is displayed in the editor now?\n\nConstraints\n\n1 ≦ |s| ≦ 10 (|s| denotes the length of s)\n\ns consists of the letters 0, 1 and B.\n\nThe correct answer is not an empty string.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string displayed in the editor in the end.\n\nSample Input 1\n\n01B0\n\nSample Output 1\n\n00\n\nEach time the key is pressed, the string in the editor will change as follows: 0, 01, 0, 00.\n\nSample Input 2\n\n0BB1\n\nSample Output 2\n\n1\n\nEach time the key is pressed, the string in the editor will change as follows: 0, (empty), (empty), 1.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 39, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s050513546", "group_id": "codeNet:p04030", "input_text": "s=io.read()\neditor=\"\"\nfor i=1,#s do\n input=s:sub(i,i)\n if input==\"B\" then\n editor=editor:sub(1,#editor-1)\n else\n editor=editor..input\n end\nend\nprint(editor)", "language": "Lua", "metadata": {"date": 1589261311, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p04030.html", "problem_id": "p04030", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04030/input.txt", "sample_output_relpath": "derived/input_output/data/p04030/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04030/Lua/s050513546.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s050513546", "user_id": "u045238009"}, "prompt_components": {"gold_output": "00\n", "input_to_evaluate": "s=io.read()\neditor=\"\"\nfor i=1,#s do\n input=s:sub(i,i)\n if input==\"B\" then\n editor=editor:sub(1,#editor-1)\n else\n editor=editor..input\n end\nend\nprint(editor)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSig has built his own keyboard. Designed for ultimate simplicity, this keyboard only has 3 keys on it: the 0 key, the 1 key and the backspace key.\n\nTo begin with, he is using a plain text editor with this keyboard. This editor always displays one string (possibly empty). Just after the editor is launched, this string is empty. When each key on the keyboard is pressed, the following changes occur to the string:\n\nThe 0 key: a letter 0 will be inserted to the right of the string.\n\nThe 1 key: a letter 1 will be inserted to the right of the string.\n\nThe backspace key: if the string is empty, nothing happens. Otherwise, the rightmost letter of the string is deleted.\n\nSig has launched the editor, and pressed these keys several times. You are given a string s, which is a record of his keystrokes in order. In this string, the letter 0 stands for the 0 key, the letter 1 stands for the 1 key and the letter B stands for the backspace key. What string is displayed in the editor now?\n\nConstraints\n\n1 ≦ |s| ≦ 10 (|s| denotes the length of s)\n\ns consists of the letters 0, 1 and B.\n\nThe correct answer is not an empty string.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string displayed in the editor in the end.\n\nSample Input 1\n\n01B0\n\nSample Output 1\n\n00\n\nEach time the key is pressed, the string in the editor will change as follows: 0, 01, 0, 00.\n\nSample Input 2\n\n0BB1\n\nSample Output 2\n\n1\n\nEach time the key is pressed, the string in the editor will change as follows: 0, (empty), (empty), 1.", "sample_input": "01B0\n"}, "reference_outputs": ["00\n"], "source_document_id": "p04030", "source_text": "Score : 200 points\n\nProblem Statement\n\nSig has built his own keyboard. Designed for ultimate simplicity, this keyboard only has 3 keys on it: the 0 key, the 1 key and the backspace key.\n\nTo begin with, he is using a plain text editor with this keyboard. This editor always displays one string (possibly empty). Just after the editor is launched, this string is empty. When each key on the keyboard is pressed, the following changes occur to the string:\n\nThe 0 key: a letter 0 will be inserted to the right of the string.\n\nThe 1 key: a letter 1 will be inserted to the right of the string.\n\nThe backspace key: if the string is empty, nothing happens. Otherwise, the rightmost letter of the string is deleted.\n\nSig has launched the editor, and pressed these keys several times. You are given a string s, which is a record of his keystrokes in order. In this string, the letter 0 stands for the 0 key, the letter 1 stands for the 1 key and the letter B stands for the backspace key. What string is displayed in the editor now?\n\nConstraints\n\n1 ≦ |s| ≦ 10 (|s| denotes the length of s)\n\ns consists of the letters 0, 1 and B.\n\nThe correct answer is not an empty string.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string displayed in the editor in the end.\n\nSample Input 1\n\n01B0\n\nSample Output 1\n\n00\n\nEach time the key is pressed, the string in the editor will change as follows: 0, 01, 0, 00.\n\nSample Input 2\n\n0BB1\n\nSample Output 2\n\n1\n\nEach time the key is pressed, the string in the editor will change as follows: 0, (empty), (empty), 1.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 182, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s674891512", "group_id": "codeNet:p04033", "input_text": "a,b=io.read(\"*n\",\"*n\")\nif a<=0 and 0<=b then\n print(\"Zero\")\nelseif 0